{"as_of":"2026-08-14T08:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:26593aa374e268d7075063747deed71bb5384d93ef7903546b9d3414ced551da","coverage":[{"denominator":71,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":71,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:46:15.789557Z","state":"measured"},{"denominator":71,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":71,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2411.17050/citation-record","integrity":"/paper/2411.17050/integrity","json":"/paper/2411.17050/citation-record.json","paper":"/paper/2411.17050"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:15.489068Z","title":"Aaronson and D","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.489068Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:7bbb0a17bf8e110faa3e5e6e45a6a39fde90a89aea5a8aefcdc42fff9a8c7ef1","observation_id":"8d680e78-f376-425d-95f7-bf37bf834c12","resolution":{"observed_at":"2026-08-12T12:46:15.489068Z","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-12T12:46:15.494009Z","title":"Bombin and M","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.494009Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:c9413ace177eaca7fbce1124bff18d1a51821742027128305dd7c1cefdefec6e","observation_id":"e8100a08-8f1c-4bb8-8010-a33e5bdad00e","resolution":{"observed_at":"2026-08-12T12:46:15.494009Z","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-12T12:46:15.498375Z","title":"Bravyi and M","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.498375Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:5b8e57279d32c69593b44278c8be686227e984d1e75a8d307ebe59ae52188e8d","observation_id":"ceaf9d5e-cf49-4c34-911e-0985fd41402f","resolution":{"observed_at":"2026-08-12T12:46:15.498375Z","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-12T12:46:15.502496Z","title":"Bravyi and A","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.502496Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:e647df4463d937398ab2d95182370afb99833f5927f06ff5ee2cd63e4ead0f20","observation_id":"7a4850ae-de27-48d2-98d4-59a2ac234568","resolution":{"observed_at":"2026-08-12T12:46:15.502496Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9811052","last_updated":"1998-11-20T03:23:13Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"1998-11-20T03:23:13Z","title":"Quantum codes on a lattice with boundary","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9811052","snapshot_observed_at":"2026-08-12T12:46:15.506699Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.506699Z"},"links":{"cited_paper":"/paper/quant-ph/9811052","citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:40ac1fb6f80ac8e346244bec10c7e4f5683b23c76cd105098a0c74d56586731b","observation_id":"e0b066f3-5e02-470e-bb76-71a04a9f4e0a","resolution":{"observed_at":"2026-08-12T12:46:15.506699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.06647","last_updated":"2024-06-10T13:53:11Z","snapshot_observed_at":"2026-08-13T16:41:52.394356Z","submitted_at":"2022-02-14T12:00:35Z","title":"Fold-Transversal Clifford Gates for Quantum Codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.06647","snapshot_observed_at":"2026-08-12T12:46:15.511237Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.511237Z"},"links":{"cited_paper":"/paper/2202.06647","citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:8c0c9eb77fe9539f4aa98dbb502b2d87d9c3c652151ff4dbbab188d9166ee5e8","observation_id":"95b52948-67b1-4343-af21-1dc0975e37f1","resolution":{"observed_at":"2026-08-12T12:46:15.511237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16250","last_updated":"2025-12-27T21:52:26Z","snapshot_observed_at":"2026-08-02T07:46:23.650899Z","submitted_at":"2024-10-21T17:53:17Z","title":"Cups and Gates I: Cohomology invariants and logical quantum operations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.16250","snapshot_observed_at":"2026-08-12T12:46:15.515984Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.515984Z"},"links":{"cited_paper":"/paper/2410.16250","citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:0c99a6bb83d16b0048fe08cecdff5e926fc202ec61ceb20a028f13ac8c91e60c","observation_id":"9bb8667c-0932-4662-b7d1-d763598aeeb1","resolution":{"observed_at":"2026-08-12T12:46:15.515984Z","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-12T12:46:15.520178Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.520178Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:e0036a7bc8d40b9bc222f4f8fbb9f8d975176927ba3277f5ef3908bbb38cce88","observation_id":"9272214e-de84-4b6b-b8db-a28bf688ce88","resolution":{"observed_at":"2026-08-12T12:46:15.520178Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.478952Z","title":null,"venue":null,"work_id":"3d7afc18-1bb2-4ab3-8385-7d4dcf9dbb73","year":1997},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.524542Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:f0c534c2e3c76d304a1955cb84171d4c426c35b3274fc2cef3826f6e5f957376","observation_id":"bd12812c-2a82-4102-b6cb-aa458998d5f8","resolution":{"observed_at":"2026-08-12T12:46:17.482765Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T12:46:15.528571Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.528571Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:b38f67f84cf8935b12417a3782fb005e8913ec98e77905b800b065f2086b1acd","observation_id":"9dc20542-e7c6-4f82-ba32-d836a09b77e5","resolution":{"observed_at":"2026-08-12T12:46:15.528571Z","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-12T12:46:15.532622Z","title":"Chao and B","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.532622Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:3c7d5c941bfaa1f8f7a3e4ec648c8df25a4cdf5a1328be57b371d830300a8023","observation_id":"7b6eba5b-4773-4e2d-b259-c456c2649867","resolution":{"observed_at":"2026-08-12T12:46:15.532622Z","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.48550/arxiv.2404.11953","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:16.255715Z","title":"Chen and N","venue":null,"work_id":"bbc06c29-06ec-4537-930a-0c40f61345a2","year":2024},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.536506Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:96e9bf8db7aaa3c4aed1c09be875755f1ce0fef99e9b879e8e27608a8dd7a215","observation_id":"0f39c8d6-b992-4097-984a-b97dc3b0663d","resolution":{"observed_at":"2026-08-12T12:46:16.259630Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T12:46:15.540448Z","title":"Dehaene and B","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.540448Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:12e61645150eae879931eaa53e04c4171629b4d093022b0671fd5bf9c12e2296","observation_id":"3d7c63f0-ef00-473b-8d27-1daa750f4cff","resolution":{"observed_at":"2026-08-12T12:46:15.540448Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.05943","last_updated":"2023-05-26T00:40:45Z","snapshot_observed_at":"2026-08-13T15:16:32.816041Z","submitted_at":"2023-04-12T16:05:44Z","title":"Spacetime codes of Clifford circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.05943","snapshot_observed_at":"2026-08-12T12:46:15.544892Z","title":"Delfosse and A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.544892Z"},"links":{"cited_paper":"/paper/2304.05943","citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:77f471824b63b28c65ece1dd50f8f9eb9ce7ce10abdaaf24aad7998a59879748","observation_id":"db7ac5a0-b917-428e-a403-e6e233ea6cc4","resolution":{"observed_at":"2026-08-12T12:46:15.544892Z","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-12T12:46:15.549173Z","title":"Dinur, M.-H","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.549173Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:6774161122b6952dc36a7ceb648a8e95016df27c7a3e12003769bf8f4d4df644","observation_id":"c9a52a07-91ff-4323-b1db-0df94ae57373","resolution":{"observed_at":"2026-08-12T12:46:15.549173Z","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-12T12:46:15.553612Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.553612Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:d7dd4e5f17f37ce9fb3c0c9f817246dc2d21d865805eafcd47e3a21e40d2b669","observation_id":"3dd9001d-50ab-4ec2-a0c2-c2f65142cd18","resolution":{"observed_at":"2026-08-12T12:46:15.553612Z","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-12T12:46:15.557464Z","title":"Fawzi, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.557464Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:da8a90c17ef3b35cfd46a4e36e1f665b6332c56898c0dcf235d5dfd207b23688","observation_id":"3e2bc109-7680-4b9a-87be-87280b57f9a0","resolution":{"observed_at":"2026-08-12T12:46:15.557464Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.467375Z","title":null,"venue":null,"work_id":"e216a614-1a24-4c87-a29a-ac536dd3f52e","year":2012},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.561372Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:2edab8a693c5c8cb02bee28c63f13e20462155b2c8321c8838caeb9183aa4bfc","observation_id":"23444407-96e2-4ef6-9397-6abe3fad3b95","resolution":{"observed_at":"2026-08-12T12:46:17.471253Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9705052","last_updated":"1997-05-28T23:51:29Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"1997-05-28T23:51:29Z","title":"Stabilizer Codes and Quantum Error Correction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9705052","snapshot_observed_at":"2026-08-12T12:46:15.565239Z","title":"Gottesman","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.565239Z"},"links":{"cited_paper":"/paper/quant-ph/9705052","citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:b499901a5a847724e4fdfa6daeb97e37833de7944c894b1a831893bd13be9393","observation_id":"88444807-fcf7-446a-baaf-347fa66fbc49","resolution":{"observed_at":"2026-08-12T12:46:15.565239Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.455548Z","title":"Gottesman","venue":null,"work_id":"72f3cbd0-b248-4013-89fa-187dac1e3a78","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.569385Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:f10938801bb5d686d04e5e4e6ca30e8b4fe3a44797a2cf75aff1164a1fd2a9c6","observation_id":"3df98132-4010-4f3c-94a1-2cf7852f2696","resolution":{"observed_at":"2026-08-12T12:46:17.459658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/psapm/068/2762145","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:16.120704Z","title":"Gottesman","venue":null,"work_id":"40515025-e86a-4ee2-beaa-7dbd69108f27","year":2010},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.577049Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:3e05b9a8b2c3197589e7e2a090862f9bdebe3accc816b89af4cadc260d1157f0","observation_id":"f8ce7ac5-49ce-453a-b8ef-c04a6f758e30","resolution":{"observed_at":"2026-08-12T12:46:16.124758Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1310.2984","last_updated":"2014-07-22T19:44:54Z","snapshot_observed_at":"2026-08-10T07:11:14.081580Z","submitted_at":"2013-10-10T23:21:37Z","title":"Fault-Tolerant Quantum Computation with Constant Overhead","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1310.2984","snapshot_observed_at":"2026-08-12T12:46:15.581035Z","title":"Gottesman","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.581035Z"},"links":{"cited_paper":"/paper/1310.2984","citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:30b9502255f5c61eddc9576f7d8ac22244c39a96c428297cd4d3fa466d5d1f92","observation_id":"f4902de5-ffff-4c78-9bb8-8204b94711f4","resolution":{"observed_at":"2026-08-12T12:46:15.581035Z","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-12T12:46:15.584984Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.584984Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:a7352ffd52105621171fd41c8730c4c8a61ee3b13c83a9bbb64c0e3b2f441a98","observation_id":"77402456-5311-44b2-bc05-d6bb4d1e3786","resolution":{"observed_at":"2026-08-12T12:46:15.584984Z","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-12T12:46:15.589010Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.589010Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:bc3696616a1357a2fdf5fc5d820648391c94192f3d9c2f0dc0e5b2151525ea5e","observation_id":"67838b0a-fcdc-42d1-aa5d-7e684ab0359d","resolution":{"observed_at":"2026-08-12T12:46:15.589010Z","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-12T12:46:15.592764Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.592764Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:d1a5dcf75141269e089406599c039c2dfbe5cccf0c3383ff72e440fcf3e0feee","observation_id":"3d008a0b-c069-4a61-bc0d-912a886d5b30","resolution":{"observed_at":"2026-08-12T12:46:15.592764Z","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-12T12:46:15.596854Z","title":"Knill, R","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.596854Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:e025561b2ac1c8dd8bc6ebf563bac071d4e11b1c291cb39e7e8ce5b7e88d0ecd","observation_id":"7cac7866-4890-4e66-9749-32849f763e9e","resolution":{"observed_at":"2026-08-12T12:46:15.596854Z","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-12T12:46:15.600828Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.600828Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:9e0d5abebd244dd0e46055df23d5a7145b849d36d0e9f0a4d6debe7e4e5501a0","observation_id":"9ec54c42-3fb1-4721-8edb-a7cc815e204d","resolution":{"observed_at":"2026-08-12T12:46:15.600828Z","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-12T12:46:15.605664Z","title":"Krishna and D","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.605664Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:31037dc2a1176fce414e6781baa1fc5d00bd92310f88780fb513c971bb4338d9","observation_id":"c48338b3-ce59-4fba-839a-e12f688b8dcb","resolution":{"observed_at":"2026-08-12T12:46:15.605664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.13641","last_updated":"2022-09-16T10:36:37Z","snapshot_observed_at":"2026-08-13T16:33:09.404113Z","submitted_at":"2022-02-28T09:35:31Z","title":"Quantum Tanner codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.13641","snapshot_observed_at":"2026-08-12T12:46:15.609733Z","title":"Leverrier and G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.609733Z"},"links":{"cited_paper":"/paper/2202.13641","citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:378b18cc510109266fa02020398b46782271ff954f00cf08fd32dab6c9eeff76","observation_id":"c86af5b3-21fa-4888-bd3e-1a32b92719d7","resolution":{"observed_at":"2026-08-12T12:46:15.609733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14631","last_updated":"2024-10-18T17:31:19Z","snapshot_observed_at":"2026-08-12T22:19:53.949382Z","submitted_at":"2024-10-18T17:31:19Z","title":"Transversal non-Clifford gates for quantum LDPC codes on sheaves","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14631","snapshot_observed_at":"2026-08-12T12:46:15.614205Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.614205Z"},"links":{"cited_paper":"/paper/2410.14631","citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:0b0ebc625bcc74148640a969d09b968d191f863051f9a9b9decf106365e62508","observation_id":"30c884b0-7ca7-4b87-bb99-2a1a9b94113d","resolution":{"observed_at":"2026-08-12T12:46:15.614205Z","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-12T12:46:15.618449Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.618449Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:1c1211c630da0e7c7f99f8c3cc4e238cae0037182323b761a786c9686df752f3","observation_id":"6c709e4f-59e6-4960-81a5-b4a4c1bcaff8","resolution":{"observed_at":"2026-08-12T12:46:15.618449Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15725","last_updated":"2025-04-22T09:20:25Z","snapshot_observed_at":"2026-08-07T16:00:18.634919Z","submitted_at":"2025-04-22T09:20:25Z","title":"Low-overhead error detection with spacetime codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15725","snapshot_observed_at":"2026-08-12T12:46:15.623209Z","title":"Martiel and A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.623209Z"},"links":{"cited_paper":"/paper/2504.15725","citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:67b8306ee8fe8b919dc9705046fd31f24a4152a668ced7e52d3dd6b071bb5265","observation_id":"f223286f-d3a3-48d6-9ad6-3bb89ffdc8af","resolution":{"observed_at":"2026-08-12T12:46:15.623209Z","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":"2018.28256","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:16.819875Z","title":"Maslov and M","venue":null,"work_id":"3f361969-8cdd-4930-871f-9914297daffe","year":2018},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.627661Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:74d29cbcd31c46417d6d3894c4fa8d2db49b141b306647254076fd08c237e008","observation_id":"ca4f6847-fd52-40bc-b420-0ae263783f5b","resolution":{"observed_at":"2026-08-12T12:46:16.825567Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T12:46:15.631548Z","title":"Panteleev and G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.631548Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:cdb4e61193f68e2a85b6ef8f0bb607594ca165175e20ea23586c8d8b875a0783","observation_id":"2b519980-e2dc-4504-b559-846ecc41936e","resolution":{"observed_at":"2026-08-12T12:46:15.631548Z","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.22331/q-2020-12-11-370","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:15.946267Z","title":"Pllaha, N","venue":null,"work_id":"fafbf294-2b47-4b82-80a8-8019bb1072f2","year":2020},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.635591Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:9d71973d4312f129bdd11b405d94db52c4c75113b60729299ed0ee2b3fe50426","observation_id":"60d861ca-3f5e-408e-adf7-e10e990d01c9","resolution":{"observed_at":"2026-08-12T12:46:15.950011Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T12:46:15.639842Z","title":"Pllaha, K","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.639842Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:6f4ca4a806c1b212d7c32c21c91928bd70ed67784e6fea1e07b64e4b2456b023","observation_id":"b277f9db-07b2-4ab2-bf63-b52ba4c43c9b","resolution":{"observed_at":"2026-08-12T12:46:15.639842Z","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-12T12:46:15.643760Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.643760Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:38e0c19945ab84c739390d4a0505bd99e6c3750655b23f44e3964c2901a0a6d6","observation_id":"739cf302-c7e2-4cd1-9503-2b849cd5dec7","resolution":{"observed_at":"2026-08-12T12:46:15.643760Z","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-12T12:46:15.647563Z","title":"Raussendorf and J","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.647563Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:904e7f192144aed0bc02923d9b94ed0f7e340ddc386299bf52fe1eae865282a6","observation_id":"31880c23-b569-4c2e-9f4b-49b3348d927d","resolution":{"observed_at":"2026-08-12T12:46:15.647563Z","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-12T12:46:15.651319Z","title":"Rengaswamy, R","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.651319Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:be48e59b4eaddd846beb5e6c98bab0706325bc183579f9109c180788cfe08ff4","observation_id":"6fdd8796-7eb8-4876-9e9d-21de43a080b9","resolution":{"observed_at":"2026-08-12T12:46:15.651319Z","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-12T12:46:15.655037Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.655037Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:b4e33524563fb39679ca1f2a888292d4c47e2b99044d567b310543442d8efefe","observation_id":"da33d83c-cbe4-43af-80d6-e2edb8c75609","resolution":{"observed_at":"2026-08-12T12:46:15.655037Z","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/20127","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:15.914508Z","title":null,"venue":null,"work_id":"bcb6125f-15d4-4963-a332-e698a8e584db","year":1999},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.659621Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:8e6f7b36200f543e7695b4c08a8e731d081e9eeb2d88086e8088202ec22e6bd4","observation_id":"3f34f332-59a8-4ca2-ba2d-2d2c28d67f08","resolution":{"observed_at":"2026-08-12T12:46:15.918615Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T12:46:15.666352Z","title":"Tillich and G","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.666352Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:86f4c497f9bd5dd54f2bdf9ba2d296ac877667520b7e3cff5f6a1ccccb6529c4","observation_id":"e0822fd4-299f-485c-8653-c5b598302f54","resolution":{"observed_at":"2026-08-12T12:46:15.666352Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.442255Z","title":null,"venue":null,"work_id":"85f0874e-709d-4a9e-a7d5-1b7bad206892","year":2022},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.670130Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:c294336c3a49cf96001df50f461e13de6b55d511ea1bfb64e4437b78e24a15d5","observation_id":"a5a527a4-7e30-4fd5-b9ca-95e0b6a4e05b","resolution":{"observed_at":"2026-08-12T12:46:17.446394Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.429420Z","title":null,"venue":null,"work_id":"fbc3dd5c-d2b3-4e6e-9874-f82208fa5a48","year":2009},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.674807Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:195f5cc491785300123200ca51c300988b3d867ef668ee5641606ce226e63bd9","observation_id":"48105d82-5fdd-43b8-8033-883bb7973b99","resolution":{"observed_at":"2026-08-12T12:46:17.433430Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T12:46:15.678994Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.678994Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:5dfdb45003913ced1675a2bceab8629fb97ae862dc418f7a5c75f2513240aecd","observation_id":"6b5446da-2f3a-4323-a8b5-c28a2b25e828","resolution":{"observed_at":"2026-08-12T12:46:15.678994Z","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-12T12:46:15.683217Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.683217Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:55ea5b54760a4cb8f952e4ce3982c418aa82f6a4d797fb550c9dc48b6771068d","observation_id":"59c9d29b-cf98-4d9b-b491-c197e163ce8c","resolution":{"observed_at":"2026-08-12T12:46:15.683217Z","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.48550/arxiv.2310.16982","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:15.879769Z","title":null,"venue":null,"work_id":"eb1f1a03-e6a9-44be-8061-b4c4a259d17e","year":2024},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.687256Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:5640126f7ce9c3221e9909aaf41f7906c01556d609c7463aa204a59e45893928","observation_id":"43510770-b689-4007-a588-3cb8949d045b","resolution":{"observed_at":"2026-08-12T12:46:15.884908Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.417579Z","title":null,"venue":null,"work_id":"7ea832fa-6b2d-42be-976c-3c64d2085968","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.696905Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:3fb4e894b78ceea038d13f784bb6cbf05f67002d5e815bf7f8da5ce28b37e37d","observation_id":"7b1f122d-6390-4e27-bd72-00bdad862de1","resolution":{"observed_at":"2026-08-12T12:46:17.421633Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.406218Z","title":null,"venue":null,"work_id":"1e595c67-9739-40cd-9881-52a8414ef63f","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.700983Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:03de0e2706662dbadf2b1992e61c92c5b215d3d2e08c58c559bb88bbcbc2e808","observation_id":"55b11e1f-fe69-4d94-9e85-3860a8fe688d","resolution":{"observed_at":"2026-08-12T12:46:17.410251Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.394240Z","title":null,"venue":null,"work_id":"75516e30-45f5-4ede-b54a-36927f968b58","year":2025},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.705198Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:2c7bb5acf904505dc6ba96ad6ab03db7cf5c1f458e19f6f7ad7b23e6f96e2ba1","observation_id":"4808a919-bbd6-466e-8a42-aa0300c055ec","resolution":{"observed_at":"2026-08-12T12:46:17.398346Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.382665Z","title":"For everyy∈ supp(v)\\{x}, add rowx to rowy and add row (y +n) to row (x +n)","venue":null,"work_id":"3eb671d3-b5d6-4c6d-868a-2728e28551de","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.709379Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:acb97f41d1b106b24792b77a1f45293cd6b606a7936b646510ef08225de536d8","observation_id":"2dcc014f-dcfd-4362-a7d7-09c3183e3bc8","resolution":{"observed_at":"2026-08-12T12:46:17.386606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.371332Z","title":null,"venue":null,"work_id":"86de0df3-b049-43a2-add9-ff428811ab52","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.714077Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:a47d9e7f5a7a6bf912ca97ea30a36a2c51e63fdc54a07a314626e88aaa569d42","observation_id":"ffd67cd1-1dee-4bf3-a805-a706c069490d","resolution":{"observed_at":"2026-08-12T12:46:17.375008Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.359743Z","title":null,"venue":null,"work_id":"75b153c6-9d2c-44fd-b903-dd426c3a367a","year":2025},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.718223Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:67ea5ec98125dfe9812f88a49adadf5f5ec8c0771388ec2edfac1404cb20026f","observation_id":"9d9156f6-9186-45c6-bc56-17f20d9d8fc0","resolution":{"observed_at":"2026-08-12T12:46:17.363477Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.348398Z","title":null,"venue":null,"work_id":"747f342d-65d2-4143-b774-ef99c338c68d","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.722281Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:679b0ae7094e1148784bbe34212c9e44f89ec25e5b13b2a59e56258ed9f5f8ea","observation_id":"7c3d2d03-b04b-4584-84ab-b5922012e9d1","resolution":{"observed_at":"2026-08-12T12:46:17.352175Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.335705Z","title":"To see that these operations on I2n×2n produce the matrix F , let M = v⊺v and note that it can be written as M = ∑ r∈supp(v) ∑ s∈supp(v)\\{r} e⊺ res + ∑ r∈supp(v) e⊺ rer","venue":null,"work_id":"4453e715-b05a-4f5f-9cd0-3ebfa30098fa","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.726413Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:d2fc7495d04af1148cb742778f6a7f4cc4111c86fa874031f7f9b6f94f553017","observation_id":"eb5f90a2-79f1-417d-b538-a92baf61736d","resolution":{"observed_at":"2026-08-12T12:46:17.340761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.323223Z","title":null,"venue":null,"work_id":"cfbb17b0-ff33-4d62-9884-e504f85703d3","year":2025},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.730455Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:d05340a9fbd6e6c033f2c5a06e37673fdf49c53d8b71c31ace518791dd061e75","observation_id":"10faccf7-f408-4afa-b88e-668bb7f2b022","resolution":{"observed_at":"2026-08-12T12:46:17.327389Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.311195Z","title":null,"venue":null,"work_id":"441bb29b-af3e-4d7d-a177-2a34117f5ccd","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.735107Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:bafe65fb3ed9383c8030d6a455746db0deb88afd9c860f3c5ceec66e2a9a4c81","observation_id":"439142f5-74f0-43b2-8ea7-4ada7540cf3b","resolution":{"observed_at":"2026-08-12T12:46:17.314986Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.298570Z","title":null,"venue":null,"work_id":"04c64b64-149a-4045-9d03-402d5d2930f7","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.739185Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:005c2c1bcabaca9dd744ec51680d98c031fe4de51267d42a71ca5684ad056e80","observation_id":"a459ead7-2ccc-4055-9892-5abbfa338061","resolution":{"observed_at":"2026-08-12T12:46:17.302631Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.286881Z","title":null,"venue":null,"work_id":"ea5c9ef5-a1f2-4809-a14c-22bbd103cde0","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.743481Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:e0b970ae1f554712bfebc8b7af270f0900107e70ddf0ffe495e032888a5949fd","observation_id":"739d7531-41fb-4992-9a84-a6643f737d78","resolution":{"observed_at":"2026-08-12T12:46:17.290985Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.149715Z","title":null,"venue":null,"work_id":"5a8e7673-3ce8-4684-ab02-f029cbfdd907","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.747375Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:17a5d489469b13614fc3d8efab2b3c4421d169b1fc03d7e800c262035b57b8d7","observation_id":"28ce10be-c453-4850-b3e9-dd6d0f57c622","resolution":{"observed_at":"2026-08-12T12:46:17.153504Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.137799Z","title":null,"venue":null,"work_id":"43529349-1a53-4217-92eb-23834141ac3a","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.751312Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:374c5c356043160c4a7f1f8cda61892f40fdce222994ee52c1386c34bc2a27a6","observation_id":"89322f30-11d9-4e21-9175-024baf20b25e","resolution":{"observed_at":"2026-08-12T12:46:17.141607Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.124194Z","title":null,"venue":null,"work_id":"ca43a75a-251c-41fb-beea-6d5cf822428b","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.754962Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:21478ff7f52be8bec498618a38764cf7950424ea357de016db45c74bcba372de","observation_id":"09afd091-27f3-436e-9a18-9475c399a7bc","resolution":{"observed_at":"2026-08-12T12:46:17.129903Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.112587Z","title":null,"venue":null,"work_id":"d164a96f-fb79-443d-8fd4-abe1e10a8aa3","year":2025},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.758669Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:fe8830cde0d79f4f501a18ada4f79ef7a6e1488e48c312e855ec1e28708ef020","observation_id":"0f819434-0285-403a-ac1d-6a1375f2e402","resolution":{"observed_at":"2026-08-12T12:46:17.116739Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.100594Z","title":"For all y∈ supp(v)\\{x}, add row x to rowy and add row y +n to rowx +n","venue":null,"work_id":"5b857617-f40e-4a14-8041-318f5d7830d5","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.762299Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:57a516c3803d8f2fad1f8ce62971e499bd45f46c993434a100fc83282348db36","observation_id":"b8f03c75-c402-42f7-9073-38a39693d458","resolution":{"observed_at":"2026-08-12T12:46:17.104650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.087647Z","title":null,"venue":null,"work_id":"d62ee409-8fc1-49e8-9d81-d38de8ff0489","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.766062Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:86b60b642139ad5ac71f06236a1d609a657788bf82bb97ed915a322f2dada10f","observation_id":"2f3c25d9-7ea3-491e-a0d3-203dc087f1ad","resolution":{"observed_at":"2026-08-12T12:46:17.091449Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.075002Z","title":null,"venue":null,"work_id":"d423ed05-3f6d-433f-bade-a8ccba7ab788","year":2025},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.769882Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:f29a161aacf496e45fa65d4e9448d83cf35906108a9148ef9c6c667d3db4d60c","observation_id":"a7a4028c-c09a-4833-8947-c6b54b461c1b","resolution":{"observed_at":"2026-08-12T12:46:17.079188Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.051176Z","title":null,"venue":null,"work_id":"97d7830d-6e70-4497-a7a8-b4579f119dff","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.777997Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:82af6631996a566a4d2f7c0ae82aa608243177e64bfe51a702862d6e368ff979","observation_id":"cb6c7dce-4890-485c-8624-3f4e75b3a997","resolution":{"observed_at":"2026-08-12T12:46:17.055340Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.037374Z","title":null,"venue":null,"work_id":"2ee8b1bd-2aab-4482-94e2-d4c8df770702","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.782079Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:53420a05ea8e813d27f795bcd045936418031ba2343fe0f4f85f0bc6ba87e39c","observation_id":"6007e5d2-2f56-4b31-a5e2-c324ddaa4496","resolution":{"observed_at":"2026-08-12T12:46:17.041935Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.063542Z","title":null,"venue":null,"work_id":"80b00a19-9405-4eaa-a861-769702d179f3","year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.785802Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:7d402648a228856bbe966e07ff9114b30ae6af3f36231c8e93cdfa93a59fd221","observation_id":"37964fb7-bc11-44cd-a6d3-fe4a846b159e","resolution":{"observed_at":"2026-08-12T12:46:17.067247Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:46:17.021490Z","title":null,"venue":null,"work_id":"d7fd5236-8f36-4869-8b15-1903f93d4116","year":2025},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.789557Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:3594da60d1dce6789a7e601e663fe99642d291fa8d21c29ce7b21fd516154d5a","observation_id":"766876d8-40b7-4d7b-8183-2110d6f190bf","resolution":{"observed_at":"2026-08-12T12:46:17.026976Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-12T12:46:15.573113Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes","version":3},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-12T12:46:15.573113Z"},"links":{"citing_paper":"/paper/2411.17050"},"observation_digest":"sha256:8b5796e46148b266f4f200de1ac34017e6578d4c5f87b059cf110153dd9f8701","observation_id":"adcef401-f304-4cb2-8a02-8673dba1ca98","resolution":{"observed_at":"2026-08-12T12:46:15.573113Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.17050","last_updated":"2025-08-29T12:35:39Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-14T01:20:10.550031Z","submitted_at":"2024-11-26T02:32:44Z","title":"Targeted Clifford logical gates for hypergraph product codes"},"reference_resolution":{"displayed":71,"state_counts":{"malformed_identifier":10,"metadata_mismatch":1,"parse_uncertain":2,"unresolved":50,"verified_exact":4,"verified_fuzzy":4},"total_outbound_references":71},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2411.17050."}