{"as_of":"2026-08-10T21:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:462b960ab8f129cb1137d200fcb3e8f880661e767395942f7c2522dc7b3d37a1","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:14:24.826007Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T12:17:03.931249Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":"2005.08747","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-07-10T12:17:03.931249Z","title":"Farhi, D","venue":"quant-ph","work_id":"924ec57f-04dc-41c4-b648-82ca6cfd7f8e","year":2020},"citing_paper":{"arxiv_id":"2412.15572","last_updated":"2025-07-12T03:22:28Z","snapshot_observed_at":"2026-08-08T15:52:22.249970Z","submitted_at":"2024-12-20T05:09:30Z","title":"Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-23T07:27:03.544032Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2412.15572"},"observation_digest":"sha256:8ff8c8256edefe0059bcc5972ce8563be0b3c192c4059b7353ef9fd14af0102d","observation_id":"b4a7b704-7ea4-4497-bafe-f69a1ff412d6","resolution":{"observed_at":"2026-05-23T07:27:42.600543Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-08-10T16:14:24.826007Z","title":"Farhi, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13469","last_updated":"2025-01-23T08:33:26Z","snapshot_observed_at":"2026-08-10T15:52:37.710622Z","submitted_at":"2025-01-23T08:33:26Z","title":"Improving Quantum Optimization to Achieve Quadratic Time Complexity","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-10T16:14:24.826007Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2501.13469"},"observation_digest":"sha256:2cf04a23494b0fc05c3be2425b278d12a0dfc14204d4dbf10b2a36a755ec2ceb","observation_id":"15f44085-c82d-4701-a1a6-f86b67855ae8","resolution":{"observed_at":"2026-08-10T16:14:24.826007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-08-10T13:40:44.015469Z","title":"Farhi, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.16419","last_updated":"2026-07-03T05:10:24Z","snapshot_observed_at":"2026-08-10T13:25:54.823505Z","submitted_at":"2025-01-27T19:00:00Z","title":"Near-Optimal Parameter Tuning of Level-1 QAOA for Ising Models","version":4},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-10T13:40:44.015469Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2501.16419"},"observation_digest":"sha256:aeb6a44f7246a25627d5b3b0a305f66f112c3fdafe8a0113920163c40f9d669d","observation_id":"018c87b6-06a5-493c-a5bd-4b14c85e5057","resolution":{"observed_at":"2026-08-10T13:40:44.015469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-08-07T12:56:19.677342Z","title":"Farhi, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.23074","last_updated":"2025-05-29T04:29:18Z","snapshot_observed_at":"2026-08-09T07:37:45.895338Z","submitted_at":"2025-05-29T04:29:18Z","title":"Networked Quantum Services","version":1},"reference_index":137,"source":"pdf_text","source_observed_at":"2026-08-07T12:56:19.677342Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2505.23074"},"observation_digest":"sha256:a232a28d6e2a416cff469c8318cac338572738b21340f67715546c92decea27d","observation_id":"cc234950-0c84-4f1b-ad27-60f94a18d921","resolution":{"observed_at":"2026-08-07T12:56:19.677342Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-08-06T18:45:53.416223Z","title":"Farhi, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.07457","last_updated":"2025-07-10T06:18:58Z","snapshot_observed_at":"2026-08-09T08:58:25.576352Z","submitted_at":"2025-07-10T06:18:58Z","title":"Enhanced Quantum behavior on frustrated Ising model: Quantum Approximate Optimization Algorithm study","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T18:45:53.416223Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2507.07457"},"observation_digest":"sha256:ac23f8d9c11e8e515b4da099575f621089f3241bcff87d5d027681cc4b545d87","observation_id":"b09b34d3-39ee-453d-82d6-3fe2275368b4","resolution":{"observed_at":"2026-08-06T18:45:53.416223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":"2005.08747","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-07-10T12:17:03.931249Z","title":"Farhi, D","venue":"quant-ph","work_id":"924ec57f-04dc-41c4-b648-82ca6cfd7f8e","year":2020},"citing_paper":{"arxiv_id":"2507.10908","last_updated":"2026-04-09T05:35:15Z","snapshot_observed_at":"2026-07-06T21:57:16.855518Z","submitted_at":"2025-07-15T01:54:11Z","title":"Optimisation-Free Recursive QAOA for the Binary Paint Shop Problem","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-19T04:23:44.246089Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2507.10908"},"observation_digest":"sha256:950e66c7f7916b67bec1aa75010c2a6cc48c897eef81c0dce2f604e868cd3367","observation_id":"1e7d489b-27fc-400b-b4d5-1e16c0980112","resolution":{"observed_at":"2026-05-19T04:27:03.778987Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":"2005.08747","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-07-10T12:17:03.931249Z","title":"Farhi, D","venue":"quant-ph","work_id":"924ec57f-04dc-41c4-b648-82ca6cfd7f8e","year":2020},"citing_paper":{"arxiv_id":"2509.13528","last_updated":"2026-01-24T20:44:39Z","snapshot_observed_at":"2026-08-04T21:26:50.547443Z","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":5,"source":"pdf_text","source_observed_at":"2026-05-18T15:32:56.280828Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2509.13528"},"observation_digest":"sha256:83b36f966facd46be65995174d53e9d8c4d77955bf9b00dab6ef4f4e5f4d87b5","observation_id":"45fbade5-051b-40b6-a12b-3b2adbfc1537","resolution":{"observed_at":"2026-05-18T15:36:34.727127Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":"2005.08747","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-07-10T12:17:03.931249Z","title":"Farhi, D","venue":"quant-ph","work_id":"924ec57f-04dc-41c4-b648-82ca6cfd7f8e","year":2020},"citing_paper":{"arxiv_id":"2510.19544","last_updated":"2026-04-19T17:25:37Z","snapshot_observed_at":"2026-07-06T22:33:48.680749Z","submitted_at":"2025-10-22T12:50:27Z","title":"Demonstrating Real Advantage of Machine-Learning-Enhanced Monte Carlo for Combinatorial Optimization","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-18T04:53:10.425398Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2510.19544"},"observation_digest":"sha256:36fb7b133bb9b36cf89cfa7d5dbf7c3cc7978a72e2409a590f6a296230102635","observation_id":"badcaaea-93ec-4ce8-b5b6-d8184a022c01","resolution":{"observed_at":"2026-05-18T04:55:54.413801Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-07-12T03:11:29.824055Z","title":"https://arxiv.org/abs/2005.08747 Measurements Number Scaling in QAOA: A Statistical Analysis53","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.03340","last_updated":"2026-07-03T13:57:15Z","snapshot_observed_at":"2026-08-07T20:00:06.487636Z","submitted_at":"2026-07-03T13:57:15Z","title":"Measurements Number Scaling in the Quantum Approximate Optimization Algorithm for MaxCut: A Statistical Analysis","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-12T03:11:29.824055Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2607.03340"},"observation_digest":"sha256:8185a3c8dca2a696901b31862b09bb01055b92df40cf28a453f58e0f3436cee4","observation_id":"0f8fd340-1f8d-4df9-85c1-8d8b59a55a21","resolution":{"observed_at":"2026-07-12T03:11:29.824055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":"2005.08747","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-07-10T12:17:03.931249Z","title":"Farhi, D","venue":"quant-ph","work_id":"924ec57f-04dc-41c4-b648-82ca6cfd7f8e","year":2020},"citing_paper":{"arxiv_id":"2607.08160","last_updated":"2026-07-09T06:53:44Z","snapshot_observed_at":"2026-08-02T06:10:19.149804Z","submitted_at":"2026-07-09T06:53:44Z","title":"Weak Poincar\\'e Inequalities via Approximate Stochastic Localization: Application to Sampling the Sherrington-Kirkpatrick Model","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-10T12:07:13.584708Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2607.08160"},"observation_digest":"sha256:1ac0ebcf527a314a93fc6efd2c44d42dfa70c27996f06e9120b89598b639ba40","observation_id":"a842a2b5-5333-4b83-82dc-9cc9014f2a57","resolution":{"observed_at":"2026-07-10T12:17:03.932926Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-08-02T04:48:21.653809Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.13630","last_updated":"2026-08-06T09:45:51Z","snapshot_observed_at":"2026-08-09T23:09:53.975787Z","submitted_at":"2026-07-15T09:25:26Z","title":"Separating Geometry From Interference in Constrained Quantum Optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T04:48:21.653809Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2607.13630"},"observation_digest":"sha256:4148ac02b271041f7da6dd574c866299e77c710a624de638f253845a180c0ff4","observation_id":"6192ea74-299c-4097-a94b-c7f6b24ea2aa","resolution":{"observed_at":"2026-08-02T04:48:21.653809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.08747","snapshot_observed_at":"2026-08-01T05:02:01.236038Z","title":"Farhi, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22372","last_updated":"2026-07-24T14:58:57Z","snapshot_observed_at":"2026-08-08T06:39:19.664846Z","submitted_at":"2026-07-24T14:58:57Z","title":"Quantum-informed surrogate sampling for combinatorial optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T05:02:01.236038Z"},"links":{"cited_paper":"/paper/2005.08747","citing_paper":"/paper/2607.22372"},"observation_digest":"sha256:6c6cf016ed6d0403e4068ceb9e9338ccc034e98b44f99de6c220c6d72252c719","observation_id":"d546cfc3-9d92-4f3b-a5f7-407992a06c1d","resolution":{"observed_at":"2026-08-01T05:02:01.236038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2005.08747/citation-record","integrity":"/paper/2005.08747/integrity","json":"/paper/2005.08747/citation-record.json","paper":"/paper/2005.08747"},"outbound":[],"paper":{"arxiv_id":"2005.08747","last_updated":"2020-05-18T14:23:09Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T15:31:58.276701Z","submitted_at":"2020-05-18T14:23:09Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples"},"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 12 inbound Pith citation observations for arXiv:2005.08747."}