{"as_of":"2026-08-18T08:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2538c522688ad9252774f0336475dce6a15f4853db195e8c40dfd0b72433edb4","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:44:06.207678Z","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-07-03T10:58:03.156687Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.13110","last_updated":"2023-11-03T20:53:51Z","snapshot_observed_at":"2026-08-17T21:35:23.222278Z","submitted_at":"2023-09-22T18:00:03Z","title":"Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.13110","snapshot_observed_at":"2026-08-12T20:30:26.298816Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09745","last_updated":"2024-11-14T19:00:09Z","snapshot_observed_at":"2026-08-16T01:43:47.394578Z","submitted_at":"2024-11-14T19:00:09Z","title":"Analytical Expressions for the Quantum Approximate Optimization Algorithm and its Variants","version":1},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-08-12T20:30:26.298816Z"},"links":{"cited_paper":"/paper/2309.13110","citing_paper":"/paper/2411.09745"},"observation_digest":"sha256:edfd5f566f6e95bd8a5bef7e1ef9e0c28aa27af02dff4fcf55f0caef85558acd","observation_id":"c1dc0a2f-3a40-4f09-a1ca-22986b6340aa","resolution":{"observed_at":"2026-08-12T20:30:26.298816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.13110","last_updated":"2023-11-03T20:53:51Z","snapshot_observed_at":"2026-08-17T21:35:23.222278Z","submitted_at":"2023-09-22T18:00:03Z","title":"Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms","version":2},"cited_work":{"arxiv_id":"2309.13110","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.13110","snapshot_observed_at":"2026-07-03T10:58:03.156687Z","title":null,"venue":null,"work_id":"c45a8307-9743-4d3d-821a-72669604776b","year":2023},"citing_paper":{"arxiv_id":"2411.10406","last_updated":"2026-03-13T03:26:12Z","snapshot_observed_at":"2026-08-14T00:03:54.115153Z","submitted_at":"2024-11-15T18:22:46Z","title":"How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits","version":3},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-05-18T22:41:36.363536Z"},"links":{"cited_paper":"/paper/2309.13110","citing_paper":"/paper/2411.10406"},"observation_digest":"sha256:e5055ae47af9f8b43485b426b2a662277c956f675b4be16a73f1c10a8a88e535","observation_id":"b15aa7b6-65e3-4847-a4dc-818dc1aced19","resolution":{"observed_at":"2026-05-18T22:41:36.630846Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.13110","last_updated":"2023-11-03T20:53:51Z","snapshot_observed_at":"2026-08-17T21:35:23.222278Z","submitted_at":"2023-09-22T18:00:03Z","title":"Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms","version":2},"cited_work":{"arxiv_id":"2309.13110","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.13110","snapshot_observed_at":"2026-07-03T10:58:03.156687Z","title":null,"venue":null,"work_id":"c45a8307-9743-4d3d-821a-72669604776b","year":2023},"citing_paper":{"arxiv_id":"2508.11765","last_updated":"2026-01-27T20:25:46Z","snapshot_observed_at":"2026-08-02T18:46:25.302981Z","submitted_at":"2025-08-15T18:31:37Z","title":"The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute","version":2},"reference_index":264,"source":"pdf_text","source_observed_at":"2026-05-18T22:19:39.677935Z"},"links":{"cited_paper":"/paper/2309.13110","citing_paper":"/paper/2508.11765"},"observation_digest":"sha256:1c1db946bdb6b9900ee603b816a3a8f8578d70e9cdf914555a6fdd6ecf9856b8","observation_id":"6d7a1a69-996c-4146-be55-702e417301aa","resolution":{"observed_at":"2026-05-18T22:21:52.932062Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.13110","last_updated":"2023-11-03T20:53:51Z","snapshot_observed_at":"2026-08-17T21:35:23.222278Z","submitted_at":"2023-09-22T18:00:03Z","title":"Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.13110","snapshot_observed_at":"2026-08-15T16:44:06.207678Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.02689","last_updated":"2025-09-02T18:00:05Z","snapshot_observed_at":"2026-08-15T16:33:36.422413Z","submitted_at":"2025-09-02T18:00:05Z","title":"Quantum DPLL and Generalized Constraints in Iterative Quantum Algorithms","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T16:44:06.207678Z"},"links":{"cited_paper":"/paper/2309.13110","citing_paper":"/paper/2509.02689"},"observation_digest":"sha256:117e8a0c8b73fad64dc1847cc25d419f67ce4de89a69f103e9813d57fb76be05","observation_id":"5a388d85-7186-4ebf-936c-64837116cc43","resolution":{"observed_at":"2026-08-15T16:44:06.207678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.13110","last_updated":"2023-11-03T20:53:51Z","snapshot_observed_at":"2026-08-17T21:35:23.222278Z","submitted_at":"2023-09-22T18:00:03Z","title":"Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms","version":2},"cited_work":{"arxiv_id":"2309.13110","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.13110","snapshot_observed_at":"2026-07-03T10:58:03.156687Z","title":null,"venue":null,"work_id":"c45a8307-9743-4d3d-821a-72669604776b","year":2023},"citing_paper":{"arxiv_id":"2606.12310","last_updated":"2026-06-10T16:44:33Z","snapshot_observed_at":"2026-08-08T02:34:43.625993Z","submitted_at":"2026-06-10T16:44:33Z","title":"Partitioned Iterative Quantum Scheduling of Satellites for Urgent Disaster Response: Case study of Wildfire","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T09:45:06.232340Z"},"links":{"cited_paper":"/paper/2309.13110","citing_paper":"/paper/2606.12310"},"observation_digest":"sha256:c79e826cfc4aae16a3582eb71e91b58c8fcb0560f0499dff1771359b56acb24d","observation_id":"2d69bf71-14dd-46ad-8b94-a33b4eff0e5e","resolution":{"observed_at":"2026-07-03T10:58:03.158001Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.13110","last_updated":"2023-11-03T20:53:51Z","snapshot_observed_at":"2026-08-17T21:35:23.222278Z","submitted_at":"2023-09-22T18:00:03Z","title":"Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.13110","snapshot_observed_at":"2026-07-14T16:49:25.319923Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.01037","last_updated":"2026-07-13T14:37:21Z","snapshot_observed_at":"2026-07-16T23:19:39.340781Z","submitted_at":"2026-07-01T15:04:48Z","title":"Quantum-Informed Portfolio Selection: An End-to-End Pipeline Validated on Trapped-Ion Hardware with Real Market Data","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-14T16:49:25.319923Z"},"links":{"cited_paper":"/paper/2309.13110","citing_paper":"/paper/2607.01037"},"observation_digest":"sha256:e27f6d6a36aa9d9e4be67c4e2d66b2a303b5ac6aea1819611158851732d22ef1","observation_id":"20d4bc4e-f428-4d0a-a230-e3e11bc3c2df","resolution":{"observed_at":"2026-07-14T16:49:25.319923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.13110","last_updated":"2023-11-03T20:53:51Z","snapshot_observed_at":"2026-08-17T21:35:23.222278Z","submitted_at":"2023-09-22T18:00:03Z","title":"Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.13110","snapshot_observed_at":"2026-08-08T00:10:34.646729Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.04252","last_updated":"2026-08-04T22:15:35Z","snapshot_observed_at":"2026-08-16T13:49:01.898501Z","submitted_at":"2026-08-04T22:15:35Z","title":"Dynamical Lie Algebras Cannot Describe Shallow QAOA: Cragged Terrains, Barren Plateaus, and Empirical Hardness Models","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T00:10:34.646729Z"},"links":{"cited_paper":"/paper/2309.13110","citing_paper":"/paper/2608.04252"},"observation_digest":"sha256:f215e982968831d238e66aff69ec75fed7d15525a626dc1342425e0ebd73b612","observation_id":"150761c1-e980-4a83-b19e-cdb0f1ebfec6","resolution":{"observed_at":"2026-08-08T00:10:34.646729Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2309.13110/citation-record","integrity":"/paper/2309.13110/integrity","json":"/paper/2309.13110/citation-record.json","paper":"/paper/2309.13110"},"outbound":[],"paper":{"arxiv_id":"2309.13110","last_updated":"2023-11-03T20:53:51Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T21:35:23.222278Z","submitted_at":"2023-09-22T18:00:03Z","title":"Iterative Quantum Algorithms for Maximum Independent Set: A Tale of Low-Depth Quantum Algorithms"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2309.13110."}