{"as_of":"2026-08-19T18:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6adc75d4e5f281129ef59054e3e5766e49495c63d34793e4f327702a3eaaca49","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:00:35.471668Z","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-04T01:09:19.801142Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.09538","last_updated":"2024-08-18T16:48:14Z","snapshot_observed_at":"2026-08-16T14:51:33.831689Z","submitted_at":"2024-08-18T16:48:14Z","title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","version":1},"cited_work":{"arxiv_id":"2408.09538","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09538","snapshot_observed_at":"2026-07-04T01:09:19.801142Z","title":"Pa- rameter setting heuristics make the quantum approxi- mate optimization algorithm suitable for the early fault- tolerant era","venue":null,"work_id":"1000ece0-73c7-4139-bf02-81fd2bbf790a","year":2024},"citing_paper":{"arxiv_id":"2504.01694","last_updated":"2026-05-04T18:47:49Z","snapshot_observed_at":"2026-08-15T14:00:56.378577Z","submitted_at":"2025-04-02T12:53:21Z","title":"Iterative Interpolation Schedules for Quantum Approximate Optimization Algorithm","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T21:55:17.540073Z"},"links":{"cited_paper":"/paper/2408.09538","citing_paper":"/paper/2504.01694"},"observation_digest":"sha256:8a076c831ae1db1bf2c81ca6c474c9be108187ed864f3e4b5e843c915429806a","observation_id":"8d393efc-a4f8-4f6a-a241-904091eca7cf","resolution":{"observed_at":"2026-05-22T21:57:10.460379Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09538","last_updated":"2024-08-18T16:48:14Z","snapshot_observed_at":"2026-08-16T14:51:33.831689Z","submitted_at":"2024-08-18T16:48:14Z","title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.09538","snapshot_observed_at":"2026-08-16T11:00:35.471668Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.16755","last_updated":"2025-04-23T14:27:31Z","snapshot_observed_at":"2026-08-19T12:40:50.378299Z","submitted_at":"2025-04-23T14:27:31Z","title":"QAOA-PCA: Enhancing Efficiency in the Quantum Approximate Optimization Algorithm via Principal Component Analysis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T11:00:35.471668Z"},"links":{"cited_paper":"/paper/2408.09538","citing_paper":"/paper/2504.16755"},"observation_digest":"sha256:4717ac2f905980f60f36d2dd62770d50f73715765b6bfbeca50df3cd9bd97b32","observation_id":"fbc50a84-bf6a-43e3-8aaf-9e77832c2a9e","resolution":{"observed_at":"2026-08-16T11:00:35.471668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09538","last_updated":"2024-08-18T16:48:14Z","snapshot_observed_at":"2026-08-16T14:51:33.831689Z","submitted_at":"2024-08-18T16:48:14Z","title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","version":1},"cited_work":{"arxiv_id":"2408.09538","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09538","snapshot_observed_at":"2026-07-04T01:09:19.801142Z","title":"Pa- rameter setting heuristics make the quantum approxi- mate optimization algorithm suitable for the early fault- tolerant era","venue":null,"work_id":"1000ece0-73c7-4139-bf02-81fd2bbf790a","year":2024},"citing_paper":{"arxiv_id":"2504.21172","last_updated":"2026-04-29T17:40:25Z","snapshot_observed_at":"2026-07-06T21:16:46.592336Z","submitted_at":"2025-04-29T20:47:20Z","title":"Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-22T17:43:23.965963Z"},"links":{"cited_paper":"/paper/2408.09538","citing_paper":"/paper/2504.21172"},"observation_digest":"sha256:d7db0d591bcd5460bb86fe9441dbc8b8cf8d9249560f333d2c6b9ddb11f15b1c","observation_id":"781a0b4d-9424-4a22-868c-010bc37cb89e","resolution":{"observed_at":"2026-05-22T17:45:00.424017Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09538","last_updated":"2024-08-18T16:48:14Z","snapshot_observed_at":"2026-08-16T14:51:33.831689Z","submitted_at":"2024-08-18T16:48:14Z","title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","version":1},"cited_work":{"arxiv_id":"2408.09538","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09538","snapshot_observed_at":"2026-07-04T01:09:19.801142Z","title":"Pa- rameter setting heuristics make the quantum approxi- mate optimization algorithm suitable for the early fault- tolerant era","venue":null,"work_id":"1000ece0-73c7-4139-bf02-81fd2bbf790a","year":2024},"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":249,"source":"pdf_text","source_observed_at":"2026-05-18T22:19:39.677935Z"},"links":{"cited_paper":"/paper/2408.09538","citing_paper":"/paper/2508.11765"},"observation_digest":"sha256:6f5d06cb2d7f27ecdc818d08f9fa1bdca97aa063cf12e485442cc7a20d8f5d58","observation_id":"90938ca5-e2ad-41d4-ad35-9448640556b4","resolution":{"observed_at":"2026-05-18T22:21:53.042451Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09538","last_updated":"2024-08-18T16:48:14Z","snapshot_observed_at":"2026-08-16T14:51:33.831689Z","submitted_at":"2024-08-18T16:48:14Z","title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","version":1},"cited_work":{"arxiv_id":"2408.09538","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09538","snapshot_observed_at":"2026-07-04T01:09:19.801142Z","title":"Pa- rameter setting heuristics make the quantum approxi- mate optimization algorithm suitable for the early fault- tolerant era","venue":null,"work_id":"1000ece0-73c7-4139-bf02-81fd2bbf790a","year":2024},"citing_paper":{"arxiv_id":"2509.13528","last_updated":"2026-01-24T20:44:39Z","snapshot_observed_at":"2026-08-17T11:46:56.481906Z","submitted_at":"2025-09-16T20:48:53Z","title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-18T15:32:56.280828Z"},"links":{"cited_paper":"/paper/2408.09538","citing_paper":"/paper/2509.13528"},"observation_digest":"sha256:b5bb88ad2b4defd36848921986fada8e24856dc1380dcb21e10f44b8fc4717b3","observation_id":"6c7349d4-838f-483d-b953-95d794cc0e36","resolution":{"observed_at":"2026-05-18T15:36:34.556477Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09538","last_updated":"2024-08-18T16:48:14Z","snapshot_observed_at":"2026-08-16T14:51:33.831689Z","submitted_at":"2024-08-18T16:48:14Z","title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","version":1},"cited_work":{"arxiv_id":"2408.09538","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09538","snapshot_observed_at":"2026-07-04T01:09:19.801142Z","title":"Pa- rameter setting heuristics make the quantum approxi- mate optimization algorithm suitable for the early fault- tolerant era","venue":null,"work_id":"1000ece0-73c7-4139-bf02-81fd2bbf790a","year":2024},"citing_paper":{"arxiv_id":"2606.19502","last_updated":"2026-06-24T20:52:48Z","snapshot_observed_at":"2026-08-15T00:23:59.208617Z","submitted_at":"2026-06-17T18:40:43Z","title":"Entanglement Scaling and Problem Structure in Quantum Approximate and Adiabatic Optimization Algorithms","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-06-26T20:34:07.552110Z"},"links":{"cited_paper":"/paper/2408.09538","citing_paper":"/paper/2606.19502"},"observation_digest":"sha256:4e76be8902d622fd6fcd3e3055a2d61cdf22972dfa74c28cea1d7493758958ce","observation_id":"9af07b97-8909-45f3-8845-bdb65f1e8c49","resolution":{"observed_at":"2026-07-04T01:09:19.802861Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09538","last_updated":"2024-08-18T16:48:14Z","snapshot_observed_at":"2026-08-16T14:51:33.831689Z","submitted_at":"2024-08-18T16:48:14Z","title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","version":1},"cited_work":{"arxiv_id":"2408.09538","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.09538","snapshot_observed_at":"2026-07-04T01:09:19.801142Z","title":"Pa- rameter setting heuristics make the quantum approxi- mate optimization algorithm suitable for the early fault- tolerant era","venue":null,"work_id":"1000ece0-73c7-4139-bf02-81fd2bbf790a","year":2024},"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":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-02T11:54:21.536011Z"},"links":{"cited_paper":"/paper/2408.09538","citing_paper":"/paper/2607.01037"},"observation_digest":"sha256:e2153c167454300561eef690fbadbc2a0d37a10a2621e11bb74f77b0ce8cca7c","observation_id":"81f954e9-56fb-4beb-a147-d13098e1e9b4","resolution":{"observed_at":"2026-07-02T11:56:54.878979Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.09538","last_updated":"2024-08-18T16:48:14Z","snapshot_observed_at":"2026-08-16T14:51:33.831689Z","submitted_at":"2024-08-18T16:48:14Z","title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.09538","snapshot_observed_at":"2026-07-14T16:49:25.319923Z","title":null,"venue":null,"work_id":null,"year":2024},"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":63,"source":"pdf_text","source_observed_at":"2026-07-14T16:49:25.319923Z"},"links":{"cited_paper":"/paper/2408.09538","citing_paper":"/paper/2607.01037"},"observation_digest":"sha256:f64b3c192af9b6fd4cbdab1a1f168a8017b785efc76ccf9f192c193b05314004","observation_id":"8b5b746d-d0cf-4543-9c07-b69b3b33300e","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"}}],"links":{"evidence":"/evidence","html":"/paper/2408.09538/citation-record","integrity":"/paper/2408.09538/integrity","json":"/paper/2408.09538/citation-record.json","paper":"/paper/2408.09538"},"outbound":[],"paper":{"arxiv_id":"2408.09538","last_updated":"2024-08-18T16:48:14Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T14:51:33.831689Z","submitted_at":"2024-08-18T16:48:14Z","title":"Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2408.09538."}