{"as_of":"2026-08-10T09:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0f97d0a3db903fde1a0ec949ab434e68674c62b89212ad9ff03c8a8f16a2bb2","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:23:45.666129Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"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-05T11:55:26.692548Z","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-08-05T11:55:26.793514Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"cited_work":{"arxiv_id":"2509.10070","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.10070","snapshot_observed_at":"2026-08-05T11:55:26.793514Z","title":"Toward Minimum Graphic Parity Networks","venue":"quant-ph","work_id":"3361efad-79ee-4365-aec9-a203077c8757","year":2025},"citing_paper":{"arxiv_id":"2608.03825","last_updated":"2026-08-04T15:34:26Z","snapshot_observed_at":"2026-08-09T17:14:50.560915Z","submitted_at":"2026-08-04T15:34:26Z","title":"CNOT-Distance is NP-complete under all-to-all connectivity","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T11:55:26.692548Z"},"links":{"cited_paper":"/paper/2509.10070","citing_paper":"/paper/2608.03825"},"observation_digest":"sha256:7a9834a27af72a4969d9f60925c784f131d1762d190e12e0351e55a01fbe64f2","observation_id":"4c0e4471-969b-4b22-99b9-ad501704e58e","resolution":{"observed_at":"2026-08-05T11:55:26.797730Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2509.10070/citation-record","integrity":"/paper/2509.10070/integrity","json":"/paper/2509.10070/citation-record.json","paper":"/paper/2509.10070"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:40.203809Z","title":"On the controlled-NOT com- plexity of controlled-NOT–phase circuits.Quantum Science and Technology, 4(1):015002, September 2018.doi:10.1088/2058-9565/aad8ca","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:40.203809Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:8ae9c1077da97d6fa2f1034c6b1796a58306c44f94bfcc347786454e282c0e56","observation_id":"542cd733-636c-484d-af27-b29f2136ada2","resolution":{"observed_at":"2026-08-04T18:23:40.203809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2023.5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Concentration Bounds for Quantum States and Limitations on the QAOA from Polynomial Approximations","venue":"arXiv (Cornell University)","work_id":"d9f411b5-9034-4843-88a1-8ff02e9a2a49","year":2023},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:40.264608Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:0d43a945cd1f13d38c61af9a05011d10ab8664560b124204dbaca8c0b45d5234","observation_id":"570ced5f-5c25-4c6d-8282-96736f454c5f","resolution":{"observed_at":"2026-08-04T18:28:49.705340Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:40.387828Z","title":"The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:40.387828Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:db0b221a4668d5a5662c4f6c12bc184e3fbaf5cee7909524c615c8eb7d4d9d42","observation_id":"0954f7c6-3fae-4d6a-bf13-1891703b3ab3","resolution":{"observed_at":"2026-08-04T18:23:40.387828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:40.471893Z","title":"Performance and limitations of the QAOA at constant levels on large sparse hypergraphs and spin glass models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:40.471893Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:059b03054346f5a5b15066f5671966bed986f22b5b31f526a34f6898ba530dcb","observation_id":"3c79413a-449c-4284-a280-68fbcad9b429","resolution":{"observed_at":"2026-08-04T18:23:40.471893Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:40.545464Z","title":"Cross, Jay M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:40.545464Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:b2ac0b6857c23db7f2b461ae6d0dacbd0cae3f64571b8113fabaf99d14f2b983","observation_id":"e23d6311-8c0b-440d-a3bf-22ff17dff871","resolution":{"observed_at":"2026-08-04T18:23:40.545464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:40.629036Z","title":"Fixed-parameter tractability of graph modification problems for heredi- tary properties.Information Processing Letters, 58(4):171–176, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:40.629036Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:cd40673e9c2f49996d3bdd87597f4318a18fda1ac6ac521624ab344401b96f5f","observation_id":"d7b6ab62-7058-4df3-9b24-3c27b96405c7","resolution":{"observed_at":"2026-08-04T18:23:40.629036Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:40.726399Z","title":"Generation of genuine entanglement up to 51 superconducting qubits.Nature, 619(7971):738–742, July 2023.doi:10.1038/s41586-023-06195-1","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:40.726399Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:c0f49fd3a58d50bf667af33dc4ec4ce7d623bc459ca061819405c7093fb1427c","observation_id":"3d266d33-133b-4134-ae97-311338ad4575","resolution":{"observed_at":"2026-08-04T18:23:40.726399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:40.897162Z","title":"Mémoire sur les nombres premiers.Journal de mathématiques pures et appliquées, Série 1:366–390, 1852","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:40.897162Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:6d9e0a2be241f1b21c50a8faa34baac4a2b2e6e3256e2e1dac5171e42afb3a33","observation_id":"2a9b594e-4269-452c-9b8e-033b93aebcf5","resolution":{"observed_at":"2026-08-04T18:23:40.897162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.03280","last_updated":"2024-04-04T08:07:22Z","snapshot_observed_at":"2026-08-08T17:43:00.200467Z","submitted_at":"2024-04-04T08:07:22Z","title":"Faster and shorter synthesis of Hamiltonian simulation circuits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03280","snapshot_observed_at":"2026-08-04T18:23:41.023414Z","title":"Faster and shorter synthesis of Hamil- tonian simulation circuits, April 2024.arXiv:2404.03280","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:41.023414Z"},"links":{"cited_paper":"/paper/2404.03280","citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:709f7a59e2fb5c637ea0f16dc015e7ea2106ade3c0bb8cd777d9758bc8de954d","observation_id":"2934d131-9229-42b2-bcfa-52a2c1bb5c00","resolution":{"observed_at":"2026-08-04T18:23:41.023414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-04T18:23:41.090006Z","title":"A Quantum Approximate Optimization Algorithm.arXiv:1411.4028 [quant-ph], November 2014.arXiv:1411.4028","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:41.090006Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:a9d017da38599d03fd0fb22c168478c9f53a32d978040889d35bc42fd03dd16c","observation_id":"11d43e35-dc89-4714-92ae-a224e3ca21ee","resolution":{"observed_at":"2026-08-04T18:23:41.090006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0001106","last_updated":"2000-01-28T22:12:03Z","snapshot_observed_at":"2026-07-07T07:02:58.841967Z","submitted_at":"2000-01-28T22:12:03Z","title":"Quantum Computation by Adiabatic Evolution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0001106","snapshot_observed_at":"2026-08-04T18:23:41.139276Z","title":"Quantum Computation by Adiabatic Evolution, January 2000.arXiv:quant-ph/0001106","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:41.139276Z"},"links":{"cited_paper":"/paper/quant-ph/0001106","citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:3e7470c78e08049dfb3af70735decd367b4eb7efc5b1aa80d4b0a12f3b245edd","observation_id":"b23f7d2e-e2ef-43b8-83a7-c34962d7438d","resolution":{"observed_at":"2026-08-04T18:23:41.139276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:41.288913Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:41.288913Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:5d3f9ff104b5c6ab84ac82f271311dae584f64a424c7627d79eb39c3a9a8f456","observation_id":"e79041f2-2882-4f3a-a873-11c059f16098","resolution":{"observed_at":"2026-08-04T18:23:41.288913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3700884","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Shallower cnot circuits on realistic quantum hardware.ACM Transactions on Quantum Computing, November 2024","venue":"ACM Transactions on Quantum Computing","work_id":"4656676e-b26f-4208-9903-8eac884e2780","year":2024},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:41.360348Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:a69a15d990ea6b9d5814c00def153a703313eac6b417e40b031511d4d16554b6","observation_id":"3584ad27-6872-4e32-b78d-2940ff3cc870","resolution":{"observed_at":"2026-08-04T18:28:49.571422Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:41.477005Z","title":"Harrigan, Kevin J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:41.477005Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:b407c74a82d0b7fff5aa59555d6cb657c8d9e1aa723632e02a079cd11f9af439","observation_id":"f01e947e-df40-4673-873a-1a4adc30c3b9","resolution":{"observed_at":"2026-08-04T18:23:41.477005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:41.642314Z","title":"Optimal space-depth trade-off of cnot circuits in quantum logic synthesis","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:41.642314Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:914868bfe0129e094e23b667352cca65b02b29de2f05644df539e0f0c59a822f","observation_id":"a9f9b8dd-982a-42e2-ad81-5a4136b2205e","resolution":{"observed_at":"2026-08-04T18:23:41.642314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:41.755218Z","title":"Algorithm 447: Efficient algorithms for graph manipula- tion.Communications of the ACM, June 1973.doi:10.1145/362248.362272","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:41.755218Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:a936d585e0560e3aaedef567e797250a1e696a3f2b1574b6a29ef2e2bcceddea","observation_id":"2103af0f-97d7-49a1-a812-51eee1540c84","resolution":{"observed_at":"2026-08-04T18:23:41.755218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:41.867610Z","title":"Exponential Quantum Space Ad- vantage for Approximating Maximum Directed Cut in the Streaming Model","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:41.867610Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:a941bb9f8e3c81e54fe7815738dcf3cd66472a381b55f909b8d4a81d057b4ec5","observation_id":"b12cb121-2cba-409f-ba9d-d36993a5640d","resolution":{"observed_at":"2026-08-04T18:23:41.867610Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539796303044","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tractability of parameterized com- pletion problems on chordal, strongly chordal, and proper interval graphs.SIAM Journal on Computing, 28(5):1906–1922, 1999","venue":"SIAM Journal on Computing","work_id":"5984b47d-71fc-41e0-a34c-816e37c7e42d","year":1906},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:42.013290Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:2cf8d98987dec4a7ca010fa2cd29fab107f2437b242564b8a7a4f68b0712fce6","observation_id":"189b80b6-cf37-422e-a373-392b06664e02","resolution":{"observed_at":"2026-08-04T18:28:49.418766Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:42.136078Z","title":"North-Holland Publishing Company, 1976","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:42.136078Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:39373712786546cbe0a40d5477f2c6b7fef0be7969a128e2da59eaae3987860d","observation_id":"73b338dd-1793-4f19-9d43-2e812ba52663","resolution":{"observed_at":"2026-08-04T18:23:42.136078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41534-023-00781-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Error per single-qubit gate below 10−4 in a superconducting qubit.npj Quantum Information, 9(1):111, 2023.doi:10.1038/s41534-023-00781-x","venue":"npj Quantum Information","work_id":"43b2638b-7379-47f0-94ed-c7260cefcee3","year":2023},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:42.272129Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:c1b93f1b9b109218f043e4a4270c39ef9d0b09c526f39b5d6178bbc26d8bf5b3","observation_id":"35ee9d92-e954-475c-96e6-39f2f8c5b5a0","resolution":{"observed_at":"2026-08-04T18:28:49.332901Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:42.446805Z","title":"Ising formulations of many NP problems.Frontiers in Physics, 2,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:42.446805Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:6984aa5d547eaefae533681a384f2ebd73681672bc3719040a88e2136d233d19","observation_id":"9dacbd2e-3d34-458a-9d1d-8899daac5403","resolution":{"observed_at":"2026-08-04T18:23:42.446805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:42.673258Z","title":"Depth optimization of cz, cnot, and clifford circuits.IEEE Transactions on Quantum Engineering, 3:1–8, 2022.doi:10.1109/TQE.2022.3180900","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:42.673258Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:783cd221f5a2caf67340f9693cbeca573669d09fc2a81d6a866d96fe72eca47c","observation_id":"4bc161c7-acd4-451d-9285-9a174026b8fe","resolution":{"observed_at":"2026-08-04T18:23:42.673258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:42.779668Z","title":"Quan- tum Circuits for General Multiqubit Gates.Physical Review Letters, 93(13):130502, sep 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:42.779668Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:989eaecf2c19bc83526097f580fb6b993646f7dfb7996cf46c5cd0de33f0dbaf","observation_id":"7883ae43-fd76-4dd5-8f87-7f5e6677514b","resolution":{"observed_at":"2026-08-04T18:23:42.779668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:42.939186Z","title":"Ross, Yuan Su, Andrew M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:42.939186Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:d5014443e715e8883329fc9c304cc2fd3f7834253c9ce57575d8e3e30e18aefb","observation_id":"b8550b75-a290-42ed-b04b-d1d15c0c91c8","resolution":{"observed_at":"2026-08-04T18:23:42.939186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41586-023-05784-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Beating the break-even point with a discrete-variable-encoded logical qubit.Nature, 616(7955):56–60, April 2023.doi:10.1038/s41586-023-05784-4","venue":"Nature","work_id":"aa328bcd-0fd3-43d8-b897-e1d7fb1e8eb8","year":2023},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:43.074838Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:d4893048653abf53ba6d087f93f39e509f8fcdb68657014fb48c133f4cf67dd0","observation_id":"4d6a4ea0-ad47-497e-b0fb-ccad446747bf","resolution":{"observed_at":"2026-08-04T18:28:49.234004Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0208008","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Total Ordering Problem.SIAM Journal on Computing, 8(1):111–114, 1979.doi:10.1137/0208008","venue":"SIAM Journal on Computing","work_id":"496a9feb-4bc6-432f-b5dd-d10cad246f3a","year":1979},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:43.259193Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:149333ed72a0491f88803ed6b5719596f2d92a72cf8ad4ea2c31d4930fc3b864","observation_id":"036f6f18-c91e-4e8e-becb-bad86b55833e","resolution":{"observed_at":"2026-08-04T18:28:49.168320Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:43.396881Z","title":"Collins, Arinjoy De, Paul W","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:43.396881Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:085a6e1dd41b9f3afef8729c4d9e10c095c507a333ed5de5414c993f46f0ddc5","observation_id":"4e891e8b-d6ab-4586-be6c-abb18ca9eb90","resolution":{"observed_at":"2026-08-04T18:23:43.396881Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:43.488577Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:43.488577Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:920a731a36400acb1dda0a22c5b6cddec1e4de906d0492a60210f439798475ef","observation_id":"9351b1a3-144c-4ca7-a803-9e238a1ceef0","resolution":{"observed_at":"2026-08-04T18:23:43.488577Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0022-247x(70","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:28:48.945843Z","title":"Triangulated graphs and the elimination process.Journal of Mathematical Analysis and Applications, 32(3):597–609, December 1970","venue":null,"work_id":"b5f4330d-b21e-4ef9-80d9-84a6e6f60c08","year":1970},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:43.592294Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:1f00f68a8df85f82322b7d1bc63b2da6006ad972a62549735080feaee4f42b31","observation_id":"84af82c0-ba48-40e8-aeb1-6179573321ee","resolution":{"observed_at":"2026-08-04T18:28:49.021153Z","resolver_source":"doi","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:43.673714Z","title":"Dreiling, John P","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:43.673714Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:5c8782dc9e5e32eb1d180a9c2057a77aa9aa8f6eccf0fc6c62ee43e2064cbd04","observation_id":"52638bcb-8444-4651-a0e7-c670d1801cd7","resolution":{"observed_at":"2026-08-04T18:23:43.673714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:43.784017Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:43.784017Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:81084843684b13a94e1eb6fd5e90bbee8ee0d2122a0aadbfe2e7968336b5bd6a","observation_id":"0ffeaaf0-da1f-48c8-8a22-a7a2bc030f7a","resolution":{"observed_at":"2026-08-04T18:23:43.784017Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:43.920924Z","title":"Efficient Decomposition of Quantum Gates.Physical Review Letters, 92(17):177902, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:43.920924Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:10789fd24b2fdfa22c665d17547542300781e3e5fe7602d087d936c4c8281cba","observation_id":"fd496f59-d497-4245-800b-9c3dc2e9dc2d","resolution":{"observed_at":"2026-08-04T18:23:43.920924Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:44.043114Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:44.043114Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:c63b6c09a4d76169b60d95420b87fb36ee18f5caa5d5d8160285f71fb4c6f4cb","observation_id":"0149caf9-c786-46a1-934a-18d2e9f8f609","resolution":{"observed_at":"2026-08-04T18:23:44.043114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:44.175376Z","title":"Optimization of CNOT circuits on limited-connectivity architecture.Physical Review Re- search, 5(1):13065, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:44.175376Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:b796f92c2875c9b871080d64d8f29e4d49f813babf6ab98088097472ab9b113b","observation_id":"95e0d1c2-4c2f-4a65-b1fe-cc3ebe72b41a","resolution":{"observed_at":"2026-08-04T18:23:44.175376Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:44.265066Z","title":"MaxCut quantum approximate optimization algorithm performance guarantees for p > 1.Physical Review A, 103(4):042612, April 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:44.265066Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:921f74f80a6463b95bb3ead0a4a574aa9bbc94a8b00b4ff873d08bdd6f560c4d","observation_id":"409da1dd-f527-41ca-9e7d-489cf923b95d","resolution":{"observed_at":"2026-08-04T18:23:44.265066Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:44.398787Z","title":"Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs.Physical Review A, 104(5):052419, November 2021.doi:10.1103/PhysRevA.104.052419","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:44.398787Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:776a17d795bf4be6be444f99cc714066360f0c8991bc3a9d24535cec14b85d95","observation_id":"4b99b5c3-31ad-4dc6-adfb-7f68c0e71f5f","resolution":{"observed_at":"2026-08-04T18:23:44.398787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:44.586696Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:44.586696Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:0a2de0b474897006df23681d2a02df24eaa0a503592638e7e6d4941b2b4f9b4c","observation_id":"ce9ea5af-ca9a-4ce5-9b08-35b47a68b11b","resolution":{"observed_at":"2026-08-04T18:23:44.586696Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:44.728817Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:44.728817Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:f0f0d49729d72dcb23fcc85411f9f317630a9783a1ab4250871de0cb84204482","observation_id":"09b73a22-1212-4a7d-b586-07a741f02050","resolution":{"observed_at":"2026-08-04T18:23:44.728817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:44.876280Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:44.876280Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:4a331e218f451dfebe7780cf90dc2f581c3aad88c6113c6a05eeec80af93e6e0","observation_id":"181aca5e-e296-46b2-9a70-030816ad3437","resolution":{"observed_at":"2026-08-04T18:23:44.876280Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:45.016157Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:45.016157Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:6a2825b5f3086b4963aa7319813602a5687633324b0d93db477c1a8339d508f4","observation_id":"1a571fd2-725d-4930-b904-0b719cc8f2cc","resolution":{"observed_at":"2026-08-04T18:23:45.016157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:45.137637Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:45.137637Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:c3695a98594cb6dc4ec2e455071791657174082c60717c8b7e391a7b496d8fdc","observation_id":"3a50e5c5-636f-4552-b6d3-f5500da2ad15","resolution":{"observed_at":"2026-08-04T18:23:45.137637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:45.263951Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:45.263951Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:ccf9d4ebb7e0167a3e28874978790c14b5996f1c57f465cb30a5bcdea2f2f31c","observation_id":"bbda5096-7aa3-44f8-9641-65962f767856","resolution":{"observed_at":"2026-08-04T18:23:45.263951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:45.394223Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:45.394223Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:4f1b3cc1160d7926b0ec7e0e9c8d603118501a85dd3195014950de0f1eeaa682","observation_id":"ca70153f-aae0-4126-ba4f-acdcaeebc016","resolution":{"observed_at":"2026-08-04T18:23:45.394223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:45.565726Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:45.565726Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:b50617c2e00964568153870d3428e4f897bd94b69ce1b99a0c42effda28397b0","observation_id":"365fe046-afb2-47a2-bbd8-42f3a385d144","resolution":{"observed_at":"2026-08-04T18:23:45.565726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:45.666129Z","title":"In our algorithm, when working from the leaves to the root, we will keep track of all canonical representations of σ|N+σ (v) for v∈X t","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:45.666129Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:bb44e86cd6d17ad2d8abbe12318f7a04777e437700707b706ce3b1b0ba8094f1","observation_id":"d7706534-38a2-44fb-b0ec-e7eb76fea21c","resolution":{"observed_at":"2026-08-04T18:23:45.666129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:23:42.555026Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-04T18:23:42.555026Z"},"links":{"citing_paper":"/paper/2509.10070"},"observation_digest":"sha256:01ce38ae009babcd155ff7acaa9997817468c0744fcbb401ef14c144df487ded","observation_id":"6e3ce060-5c34-4c9b-88f2-f87e06432fca","resolution":{"observed_at":"2026-08-04T18:23:42.555026Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.10070","last_updated":"2025-09-12T09:00:38Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T15:52:37.591938Z","submitted_at":"2025-09-12T09:00:38Z","title":"Toward Minimum Graphic Parity Networks"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":35,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":46},"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 46 of 46 outbound references and 1 inbound Pith citation observation for arXiv:2509.10070."}