{"as_of":"2026-08-20T00:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9efec5802d8c2118ad04c597e10fdcbe4297d62b13ad3d3d34bb685b2975f06e","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:13:03.933928Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-15T20:57:11.083500Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.00861","last_updated":"2024-05-01T20:49:50Z","snapshot_observed_at":"2026-08-19T18:23:47.026742Z","submitted_at":"2024-05-01T20:49:50Z","title":"Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.00861","snapshot_observed_at":"2026-08-16T11:13:03.933928Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.16350","last_updated":"2025-04-23T02:00:36Z","snapshot_observed_at":"2026-08-19T13:47:19.924662Z","submitted_at":"2025-04-23T02:00:36Z","title":"QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-16T11:13:03.933928Z"},"links":{"cited_paper":"/paper/2405.00861","citing_paper":"/paper/2504.16350"},"observation_digest":"sha256:0950e71c7036b6d0a84c4024bb4839aee8fd8e7fd13a07a03d24c90e177753bc","observation_id":"e3286b1a-13d4-4059-9af4-c0bc0cb034b5","resolution":{"observed_at":"2026-08-16T11:13:03.933928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00861","last_updated":"2024-05-01T20:49:50Z","snapshot_observed_at":"2026-08-19T18:23:47.026742Z","submitted_at":"2024-05-01T20:49:50Z","title":"Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.00861","snapshot_observed_at":"2026-08-16T05:22:45.296820Z","title":"Scaling up the quantum divide and conquer algorithm for combinatorial optimization,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.21135","last_updated":"2025-04-29T19:41:05Z","snapshot_observed_at":"2026-08-18T23:19:17.456531Z","submitted_at":"2025-04-29T19:41:05Z","title":"QAOA Parameter Transferability for Maximum Independent Set using Graph Attention Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T05:22:45.296820Z"},"links":{"cited_paper":"/paper/2405.00861","citing_paper":"/paper/2504.21135"},"observation_digest":"sha256:9082e03250584d36352fc8706c38052a684aa4f92e85f2fb9f0bb0e237667e53","observation_id":"1594432e-aea0-41ff-b38e-4f7cf99f2afe","resolution":{"observed_at":"2026-08-16T05:22:45.296820Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00861","last_updated":"2024-05-01T20:49:50Z","snapshot_observed_at":"2026-08-19T18:23:47.026742Z","submitted_at":"2024-05-01T20:49:50Z","title":"Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization","version":1},"cited_work":{"arxiv_id":"2405.00861","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.00861","snapshot_observed_at":"2026-08-15T20:57:11.083500Z","title":"Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization","venue":"quant-ph","work_id":"013a5e57-e6c7-45fa-9ba1-bf82f140286d","year":2024},"citing_paper":{"arxiv_id":"2505.11464","last_updated":"2025-05-16T17:18:36Z","snapshot_observed_at":"2026-08-18T13:43:21.397338Z","submitted_at":"2025-05-16T17:18:36Z","title":"Solving Large-Scale QUBO with Transferred Parameters from Multilevel QAOA of low depth","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T20:57:10.708447Z"},"links":{"cited_paper":"/paper/2405.00861","citing_paper":"/paper/2505.11464"},"observation_digest":"sha256:73e8c98eff18e93a170cb4eb3bd4b28c314930fced95d150bd8b28d19d23e258","observation_id":"13af9361-19e3-438a-afcd-c389196415d8","resolution":{"observed_at":"2026-08-15T20:57:11.089245Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.00861/citation-record","integrity":"/paper/2405.00861/integrity","json":"/paper/2405.00861/citation-record.json","paper":"/paper/2405.00861"},"outbound":[],"paper":{"arxiv_id":"2405.00861","last_updated":"2024-05-01T20:49:50Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-19T18:23:47.026742Z","submitted_at":"2024-05-01T20:49:50Z","title":"Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2405.00861."}