{"as_of":"2026-08-10T17:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:387fe7b78f457196286fee8de10b313d4d5a63c2e7001ca5967d86031a3041f1","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-10T06:31:04.303077+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-05T16:14:35.130326Z","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-06-30T06:24:19.207467Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.13030","last_updated":"2022-08-02T09:51:39Z","snapshot_observed_at":"2026-07-06T13:35:35.736085Z","submitted_at":"2022-07-26T16:40:14Z","title":"Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.13030","snapshot_observed_at":"2026-08-05T16:14:35.130326Z","title":"Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.18887","last_updated":"2025-08-26T10:03:56Z","snapshot_observed_at":"2026-08-09T11:13:58.107578Z","submitted_at":"2025-08-26T10:03:56Z","title":"Hybrid Quantum-Classical Branch-and-Price Method for the Vertex Coloring Problem","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-05T16:14:35.130326Z"},"links":{"cited_paper":"/paper/2207.13030","citing_paper":"/paper/2508.18887"},"observation_digest":"sha256:19cd8bc01f862bf2a22d30ebfda92f9cad919a708d896bbc9fc4fc3cffba9d9e","observation_id":"40dbf28a-a224-4bc0-8e46-279193ca7ef4","resolution":{"observed_at":"2026-08-05T16:14:35.130326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.13030","last_updated":"2022-08-02T09:51:39Z","snapshot_observed_at":"2026-07-06T13:35:35.736085Z","submitted_at":"2022-07-26T16:40:14Z","title":"Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors","version":2},"cited_work":{"arxiv_id":"2207.13030","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.13030","snapshot_observed_at":"2026-06-30T06:24:19.207467Z","title":"://arxiv.org/abs/2207.13030","venue":null,"work_id":"f997c188-4a4a-4f79-a082-1b6c49335f8d","year":2022},"citing_paper":{"arxiv_id":"2606.30415","last_updated":"2026-06-29T15:01:18Z","snapshot_observed_at":"2026-08-01T15:56:02.188610Z","submitted_at":"2026-06-29T15:01:18Z","title":"Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-06-30T06:20:32.505136Z"},"links":{"cited_paper":"/paper/2207.13030","citing_paper":"/paper/2606.30415"},"observation_digest":"sha256:01d356d2d7239e4865038d2e9d425a14b12a22cd828325afa64de774acca1e96","observation_id":"2cf05e85-bbe0-45ee-bd28-b16ea1f0619e","resolution":{"observed_at":"2026-06-30T06:24:19.209160Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2207.13030/citation-record","integrity":"/paper/2207.13030/integrity","json":"/paper/2207.13030/citation-record.json","paper":"/paper/2207.13030"},"outbound":[],"paper":{"arxiv_id":"2207.13030","last_updated":"2022-08-02T09:51:39Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T13:35:35.736085Z","submitted_at":"2022-07-26T16:40:14Z","title":"Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:2207.13030."}