{"as_of":"2026-08-10T05:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d3f2814300cf52b271c0543a3a78c8119d0db6b0bfc0aba577832fab25646773","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-09T06:31:02.800959+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-09T04:38:34.603818Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-10T05:30:23.456663Z","state":"measured"}],"external_citation_measurements":[{"count":10,"observed_at":"2026-08-10T05:30:23.456663Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.07532","last_updated":"2023-10-12T16:41:35Z","snapshot_observed_at":"2026-08-10T03:54:31.869506Z","submitted_at":"2021-07-15T18:00:32Z","title":"Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.07532","snapshot_observed_at":"2026-08-09T04:38:34.603818Z","title":"Divide and con- quer for combinatorial optimization and distributed quantum computation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03542","last_updated":"2025-02-05T19:01:04Z","snapshot_observed_at":"2026-08-09T04:31:03.597484Z","submitted_at":"2025-02-05T19:01:04Z","title":"Distributed Quantum Dynamics on Near-Term Quantum Processors","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T04:38:34.603818Z"},"links":{"cited_paper":"/paper/2107.07532","citing_paper":"/paper/2502.03542"},"observation_digest":"sha256:0dca8cdcf7244698d005ea95482a2cea721b061ad72ade26a042ff3c1efaf85c","observation_id":"4d90b564-6b5a-4f54-8895-4e1eeffa8f78","resolution":{"observed_at":"2026-08-09T04:38:34.603818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.07532","last_updated":"2023-10-12T16:41:35Z","snapshot_observed_at":"2026-08-10T03:54:31.869506Z","submitted_at":"2021-07-15T18:00:32Z","title":"Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation","version":3},"cited_work":{"arxiv_id":"2107.07532","doi":"10.48550/arxiv.2107.07532","metadata_source":"pith","pith_arxiv_id":"2107.07532","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation","venue":"quant-ph","work_id":"465fd810-719c-4b32-b297-47129d924221","year":2021},"citing_paper":{"arxiv_id":"2505.23074","last_updated":"2025-05-29T04:29:18Z","snapshot_observed_at":"2026-08-09T07:37:45.895338Z","submitted_at":"2025-05-29T04:29:18Z","title":"Networked Quantum Services","version":1},"reference_index":198,"source":"pdf_text","source_observed_at":"2026-08-07T12:56:25.998340Z"},"links":{"cited_paper":"/paper/2107.07532","citing_paper":"/paper/2505.23074"},"observation_digest":"sha256:6fef6c5d62cab9bad62fc7c0253c78b23fd79f9cdab4080909dae0717cd2accd","observation_id":"d5498596-c66f-4048-8aee-2a0efebd180c","resolution":{"observed_at":"2026-08-07T12:56:32.432283Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2107.07532/citation-record","integrity":"/paper/2107.07532/integrity","json":"/paper/2107.07532/citation-record.json","paper":"/paper/2107.07532"},"outbound":[],"paper":{"arxiv_id":"2107.07532","last_updated":"2023-10-12T16:41:35Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-10T03:54:31.869506Z","submitted_at":"2021-07-15T18:00:32Z","title":"Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2107.07532."}