{"as_of":"2026-08-19T05:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:886ec31b657f5fdb27135abc20e0c018055f0ab838f1c59f6dab6cc69bede08a","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T12:54:09.664898Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.08031","last_updated":"2022-03-15T16:14:30Z","snapshot_observed_at":"2026-08-16T17:14:22.876026Z","submitted_at":"2022-03-15T16:14:30Z","title":"Data-Efficient Graph Grammar Learning for Molecular Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.08031","snapshot_observed_at":"2026-08-04T12:54:09.664898Z","title":"Data-efficient graph grammar learning for molecular generation, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.01902","last_updated":"2026-06-02T22:25:04Z","snapshot_observed_at":"2026-08-17T13:37:31.470333Z","submitted_at":"2025-10-02T11:17:26Z","title":"Constrained Adaptive Rejection Sampling","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T12:54:09.664898Z"},"links":{"cited_paper":"/paper/2203.08031","citing_paper":"/paper/2510.01902"},"observation_digest":"sha256:5a17fbbe16d7b60c29edaabf13a440adc26ff2a98e0aa5551c888ec428bedb59","observation_id":"e2230bac-c71e-4acb-8563-19057b786095","resolution":{"observed_at":"2026-08-04T12:54:09.664898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.08031","last_updated":"2022-03-15T16:14:30Z","snapshot_observed_at":"2026-08-16T17:14:22.876026Z","submitted_at":"2022-03-15T16:14:30Z","title":"Data-Efficient Graph Grammar Learning for Molecular Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.08031","snapshot_observed_at":"2026-08-04T07:59:22.767251Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.23379","last_updated":"2026-05-30T06:33:05Z","snapshot_observed_at":"2026-08-07T14:32:31.636565Z","submitted_at":"2025-10-27T14:29:22Z","title":"Symbolic Neural Generation with Applications to Lead Discovery in Drug Design","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T07:59:22.767251Z"},"links":{"cited_paper":"/paper/2203.08031","citing_paper":"/paper/2510.23379"},"observation_digest":"sha256:bcf6178f809014d6f7cf5e88d749c87e6c7d05c508deb47f06827a7e8dcd630f","observation_id":"3e08ca13-86cd-47cb-b6e6-7b141de31b54","resolution":{"observed_at":"2026-08-04T07:59:22.767251Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2203.08031/citation-record","integrity":"/paper/2203.08031/integrity","json":"/paper/2203.08031/citation-record.json","paper":"/paper/2203.08031"},"outbound":[],"paper":{"arxiv_id":"2203.08031","last_updated":"2022-03-15T16:14:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T17:14:22.876026Z","submitted_at":"2022-03-15T16:14:30Z","title":"Data-Efficient Graph Grammar Learning for Molecular Generation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2203.08031."}