{"as_of":"2026-08-21T16:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3f2b073ff10d80fc2c7430448ca89c8551312fd93fe21b0655d40e6c912afc6c","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:31:55.067215Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":3,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.06334","last_updated":"2024-11-01T16:45:48Z","snapshot_observed_at":"2026-08-16T13:36:01.094864Z","submitted_at":"2024-07-08T18:56:00Z","title":"Double-Ended Synthesis Planning with Goal-Constrained Bidirectional Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.06334","snapshot_observed_at":"2026-08-11T22:30:30.985154Z","title":"Double-ended synthesis planning with goal-constrained bidirectional search","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.03424","last_updated":"2024-12-04T16:14:02Z","snapshot_observed_at":"2026-08-14T03:16:44.209155Z","submitted_at":"2024-12-04T16:14:02Z","title":"Tango*: Constrained synthesis planning using chemically informed value functions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T22:30:30.985154Z"},"links":{"cited_paper":"/paper/2407.06334","citing_paper":"/paper/2412.03424"},"observation_digest":"sha256:06e672fad66bbefdeea5c1ace6503db42f97b04b851a00468aa0becfa6c9aca8","observation_id":"0aacc111-3f46-43cd-b92f-8cc9fa0e7d41","resolution":{"observed_at":"2026-08-11T22:30:30.985154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06334","last_updated":"2024-11-01T16:45:48Z","snapshot_observed_at":"2026-08-16T13:36:01.094864Z","submitted_at":"2024-07-08T18:56:00Z","title":"Double-Ended Synthesis Planning with Goal-Constrained Bidirectional Search","version":2},"cited_work":{"arxiv_id":"2407.06334","doi":"10.48550/arxiv.2407.06334","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.06334","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"keywords =","venue":"arXiv (Cornell University)","work_id":"0be930cc-a6db-49c0-a124-0e19e5957dcb","year":2024},"citing_paper":{"arxiv_id":"2604.05075","last_updated":"2026-04-06T18:21:29Z","snapshot_observed_at":"2026-08-12T22:31:20.876823Z","submitted_at":"2026-04-06T18:21:29Z","title":"MMORF: A Multi-agent Framework for Designing Multi-objective Retrosynthesis Planning Systems","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-05-10T19:47:50.320812Z"},"links":{"cited_paper":"/paper/2407.06334","citing_paper":"/paper/2604.05075"},"observation_digest":"sha256:f2d9486bf18f09b2ee2f8ffea8f53456cbfcbd6cc5e5bdd47272832745cb2d80","observation_id":"8a2283f1-e180-41c5-bdc8-b8b0f1f9c1cf","resolution":{"observed_at":"2026-05-10T22:30:51.378170Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06334","last_updated":"2024-11-01T16:45:48Z","snapshot_observed_at":"2026-08-16T13:36:01.094864Z","submitted_at":"2024-07-08T18:56:00Z","title":"Double-Ended Synthesis Planning with Goal-Constrained Bidirectional Search","version":2},"cited_work":{"arxiv_id":"2407.06334","doi":"10.48550/arxiv.2407.06334","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.06334","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"keywords =","venue":"arXiv (Cornell University)","work_id":"0be930cc-a6db-49c0-a124-0e19e5957dcb","year":2024},"citing_paper":{"arxiv_id":"2605.13101","last_updated":"2026-05-13T07:12:53Z","snapshot_observed_at":"2026-08-12T19:05:59.909775Z","submitted_at":"2026-05-13T07:12:53Z","title":"Margin-calibrated Classifier Guidance for Property-driven Synthesis Planning","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-05-14T19:43:24.678418Z"},"links":{"cited_paper":"/paper/2407.06334","citing_paper":"/paper/2605.13101"},"observation_digest":"sha256:83101023b6c894e2f4e6ee1842ff9bd3b606bd9c8422be4c25e22a5e5cfa289e","observation_id":"b6f7c517-690f-489a-a844-5abbcee5ce5e","resolution":{"observed_at":"2026-05-14T19:47:52.675334Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06334","last_updated":"2024-11-01T16:45:48Z","snapshot_observed_at":"2026-08-16T13:36:01.094864Z","submitted_at":"2024-07-08T18:56:00Z","title":"Double-Ended Synthesis Planning with Goal-Constrained Bidirectional Search","version":2},"cited_work":{"arxiv_id":"2407.06334","doi":"10.48550/arxiv.2407.06334","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.06334","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"keywords =","venue":"arXiv (Cornell University)","work_id":"0be930cc-a6db-49c0-a124-0e19e5957dcb","year":2024},"citing_paper":{"arxiv_id":"2605.13101","last_updated":"2026-05-13T07:12:53Z","snapshot_observed_at":"2026-08-12T19:05:59.909775Z","submitted_at":"2026-05-13T07:12:53Z","title":"Margin-calibrated Classifier Guidance for Property-driven Synthesis Planning","version":1},"reference_index":126,"source":"arxiv_source","source_observed_at":"2026-05-14T19:43:24.678418Z"},"links":{"cited_paper":"/paper/2407.06334","citing_paper":"/paper/2605.13101"},"observation_digest":"sha256:16ae6ce4276fc87051b4147c47db3104d49e41642220245de896ad07297a6b2e","observation_id":"b970b369-2624-4ed3-b3a5-39a773326691","resolution":{"observed_at":"2026-05-14T19:47:53.890784Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06334","last_updated":"2024-11-01T16:45:48Z","snapshot_observed_at":"2026-08-16T13:36:01.094864Z","submitted_at":"2024-07-08T18:56:00Z","title":"Double-Ended Synthesis Planning with Goal-Constrained Bidirectional Search","version":2},"cited_work":{"arxiv_id":"2407.06334","doi":"10.48550/arxiv.2407.06334","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.06334","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"keywords =","venue":"arXiv (Cornell University)","work_id":"0be930cc-a6db-49c0-a124-0e19e5957dcb","year":2024},"citing_paper":{"arxiv_id":"2607.01061","last_updated":"2026-07-13T08:49:10Z","snapshot_observed_at":"2026-08-13T08:08:54.343508Z","submitted_at":"2026-07-01T15:24:06Z","title":"Agentic generation of verifiable rules for deterministic, self-expanding reaction classification","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-07-02T12:19:23.229663Z"},"links":{"cited_paper":"/paper/2407.06334","citing_paper":"/paper/2607.01061"},"observation_digest":"sha256:82df0ea17af553afd4049e8d36aa7154d4d1a6a26d70215aa4324f194987e62f","observation_id":"32ab4b35-75a6-4010-8a8e-8fb3ce2342f8","resolution":{"observed_at":"2026-07-02T12:26:56.205179Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.06334","last_updated":"2024-11-01T16:45:48Z","snapshot_observed_at":"2026-08-16T13:36:01.094864Z","submitted_at":"2024-07-08T18:56:00Z","title":"Double-Ended Synthesis Planning with Goal-Constrained Bidirectional Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.06334","snapshot_observed_at":"2026-08-15T14:31:55.067215Z","title":"arXiv preprint arXiv:2407.06334 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.07454","last_updated":"2026-08-07T17:47:39Z","snapshot_observed_at":"2026-08-17T17:26:34.711502Z","submitted_at":"2026-08-07T17:47:39Z","title":"Strategy-first synthesis planning for complex natural products","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T14:31:55.067215Z"},"links":{"cited_paper":"/paper/2407.06334","citing_paper":"/paper/2608.07454"},"observation_digest":"sha256:fe47608c1db891aed35bdb1b03136f61cc4caa6e55e5e585c0ce46f318dcecda","observation_id":"6d5dc2fa-ae22-465c-a79f-fbe9b0fca465","resolution":{"observed_at":"2026-08-15T14:31:55.067215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.06334/citation-record","integrity":"/paper/2407.06334/integrity","json":"/paper/2407.06334/citation-record.json","paper":"/paper/2407.06334"},"outbound":[],"paper":{"arxiv_id":"2407.06334","last_updated":"2024-11-01T16:45:48Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T13:36:01.094864Z","submitted_at":"2024-07-08T18:56:00Z","title":"Double-Ended Synthesis Planning with Goal-Constrained Bidirectional Search"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2407.06334."}