{"as_of":"2026-08-14T09:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:751fda5c8d5682974cf65935ea30345f9dbcc6ad62dcff29c4849d946df78f26","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-14T06:32:32.682623+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-06T05:35:49.515960Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-19T01:46:58.046646Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.16644","last_updated":"2023-06-13T04:10:53Z","snapshot_observed_at":"2026-08-13T11:32:47.433828Z","submitted_at":"2023-05-26T05:31:25Z","title":"Quantum Speedup for the Maximum Cut Problem","version":2},"cited_work":{"arxiv_id":"2305.16644","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.16644","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Chang, R","venue":null,"work_id":"43682f5a-5d18-4c3f-bd68-b42799525074","year":2023},"citing_paper":{"arxiv_id":"2508.00468","last_updated":"2026-04-17T09:10:23Z","snapshot_observed_at":"2026-07-06T22:06:15.521940Z","submitted_at":"2025-08-01T09:43:12Z","title":"Inference of maximum parsimony phylogenetic trees with model-based classical and quantum methods","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-19T01:43:34.425962Z"},"links":{"cited_paper":"/paper/2305.16644","citing_paper":"/paper/2508.00468"},"observation_digest":"sha256:1349b0bbd35221ec464500dbe212307daf64aa20b3b7d6fc14fda295a026af59","observation_id":"c1c0b2d0-ad5f-4f92-87b4-b75e2bccc251","resolution":{"observed_at":"2026-05-19T01:46:58.049592Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16644","last_updated":"2023-06-13T04:10:53Z","snapshot_observed_at":"2026-08-13T11:32:47.433828Z","submitted_at":"2023-05-26T05:31:25Z","title":"Quantum Speedup for the Maximum Cut Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.16644","snapshot_observed_at":"2026-08-06T05:35:49.515960Z","title":"Chang, R","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.05093","last_updated":"2026-08-05T17:31:01Z","snapshot_observed_at":"2026-08-08T23:13:59.408397Z","submitted_at":"2026-08-05T17:31:01Z","title":"Imaginarity as a necessary resource for trainability in QAOA","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T05:35:49.515960Z"},"links":{"cited_paper":"/paper/2305.16644","citing_paper":"/paper/2608.05093"},"observation_digest":"sha256:7091af840de4ba75d7a6aa7bcfb489c7c611909aecc06ef19ecda4b93eb2b90b","observation_id":"730222c6-2209-4520-8c61-9d27341f9709","resolution":{"observed_at":"2026-08-06T05:35:49.515960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.16644/citation-record","integrity":"/paper/2305.16644/integrity","json":"/paper/2305.16644/citation-record.json","paper":"/paper/2305.16644"},"outbound":[],"paper":{"arxiv_id":"2305.16644","last_updated":"2023-06-13T04:10:53Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T11:32:47.433828Z","submitted_at":"2023-05-26T05:31:25Z","title":"Quantum Speedup for the Maximum Cut Problem"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2305.16644."}