{"as_of":"2026-08-16T21:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92c22c71a674930d10050eadad2e1c26caa2338ee96e77f2d0098a2c93ec2ca4","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-16T06:30:59.297886+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-14T04:35:51.742386Z","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-21T04:23:57.516956Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.08042","last_updated":"2023-11-14T10:07:14Z","snapshot_observed_at":"2026-08-16T15:06:20.808056Z","submitted_at":"2023-11-14T10:07:14Z","title":"Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems","version":1},"cited_work":{"arxiv_id":"2311.08042","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.08042","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Quantum algorithms for graph coloring and other partitioning, covering, and packing problems","venue":null,"work_id":"e2151485-b435-4e34-a308-2f116f1612a7","year":2023},"citing_paper":{"arxiv_id":"2605.21380","last_updated":"2026-05-20T16:41:18Z","snapshot_observed_at":"2026-08-15T05:08:47.470035Z","submitted_at":"2026-05-20T16:41:18Z","title":"Modeling and Resource Optimization for Quantum Oracles","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-21T04:21:44.228594Z"},"links":{"cited_paper":"/paper/2311.08042","citing_paper":"/paper/2605.21380"},"observation_digest":"sha256:44aaf76ee8c7bec154fecd4410186259af61e5f59b31d07bb82c26f79bed9112","observation_id":"4d110324-13f2-4e4c-a62f-d04069a6f73c","resolution":{"observed_at":"2026-05-21T04:23:57.518715Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08042","last_updated":"2023-11-14T10:07:14Z","snapshot_observed_at":"2026-08-16T15:06:20.808056Z","submitted_at":"2023-11-14T10:07:14Z","title":"Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08042","snapshot_observed_at":"2026-08-14T04:35:51.742386Z","title":"Quantum algorithms for graph coloring and other partitioning, covering, and packing problems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.08694","last_updated":"2026-08-09T13:15:12Z","snapshot_observed_at":"2026-08-16T20:43:15.809337Z","submitted_at":"2026-08-09T13:15:12Z","title":"A Resource-Efficient Quantum Framework for Graph Coloring and Chromatic Number Estimation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T04:35:51.742386Z"},"links":{"cited_paper":"/paper/2311.08042","citing_paper":"/paper/2608.08694"},"observation_digest":"sha256:6d352a4bd3287d444956bff96c674ee0e531e47393938590f7876a838f82c198","observation_id":"87559eb1-80e1-4342-bdfa-90fa4069a152","resolution":{"observed_at":"2026-08-14T04:35:51.742386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2311.08042/citation-record","integrity":"/paper/2311.08042/integrity","json":"/paper/2311.08042/citation-record.json","paper":"/paper/2311.08042"},"outbound":[],"paper":{"arxiv_id":"2311.08042","last_updated":"2023-11-14T10:07:14Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T15:06:20.808056Z","submitted_at":"2023-11-14T10:07:14Z","title":"Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2311.08042."}