{"as_of":"2026-08-10T10:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec2f36264c7afe0680b85561a145c531c8c2bdb57502c51d1f51ce73404c0707","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T23:01:43.326808Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.11931","last_updated":"2024-03-18T16:30:42Z","snapshot_observed_at":"2026-07-06T17:46:25.142387Z","submitted_at":"2024-03-18T16:30:42Z","title":"Graph Algorithms with Neutral Atom Quantum Processors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.11931","snapshot_observed_at":"2026-08-08T23:01:43.326808Z","title":"Graph algorithms with neutral atom quantum processors","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04291","last_updated":"2025-02-06T18:34:59Z","snapshot_observed_at":"2026-08-08T22:50:21.943335Z","submitted_at":"2025-02-06T18:34:59Z","title":"Identifying hard native instances for the maximum independent set problem on neutral atoms quantum processors","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T23:01:43.326808Z"},"links":{"cited_paper":"/paper/2403.11931","citing_paper":"/paper/2502.04291"},"observation_digest":"sha256:b43f55ef4d94848568441c97db8ad16cb479ca1b968f9aa917b91c14bbf082be","observation_id":"0e489ae5-2d2d-4c94-a931-c68b662e33de","resolution":{"observed_at":"2026-08-08T23:01:43.326808Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.11931/citation-record","integrity":"/paper/2403.11931/integrity","json":"/paper/2403.11931/citation-record.json","paper":"/paper/2403.11931"},"outbound":[],"paper":{"arxiv_id":"2403.11931","last_updated":"2024-03-18T16:30:42Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T17:46:25.142387Z","submitted_at":"2024-03-18T16:30:42Z","title":"Graph Algorithms with 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 1 inbound Pith citation observation for arXiv:2403.11931."}