{"as_of":"2026-08-13T05:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b3a642ce1b9ec427b5125339ba9f3abda4cd9726e2e4e1c9ff091fa2f7ee4a90","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-12T06:34:41.77262+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-13T02:33:43.019119Z","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:3a5f3261d4f095f5d6c427eaac49f02e98e9ddfb94e4750586d0472ac3bf0227","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-13T02:33:43.019119Z","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:b7aa58f205fb17f0a315c38031bae76c9694a711efff7d6ee0f3c86c9541e756","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-13T02:33:43.019119Z","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:d03a4d34fd2ba6a9965cc52b69e28530ac89144d0c9819434ade7fc50b0926d0","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-13T02:33:43.019119Z","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:8d349c52b922a8fcdc9fdf5a95489dacf3e4a805f606f33ae173a478bacada26","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-13T02:33:43.019119Z","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:77416fc60b06547beb885c304ab4a2e7764c8fb345677f6026fca77903e4f809","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-05T12:23:01.337080Z","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-13T02:33:43.019119Z","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:00558a41ea6d79a9017b4ad79909952a5a03cd235daac4cdbd99a7f5dcfa54da","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-13T02:33:43.019119Z","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:b4d1299f37df94a8c61055168735e0b751cc6155fc267bdb00898992fc844068","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-13T02:33:43.019119Z","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:9b549f558be0919770d43b976c719422b7b2d55a7bc77ba6ea0882f7ff2aeab4","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-13T02:33:43.019119Z","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:8ebc1708b1ae48958392dab4bf729cc7d99262586ae1a1dedcc13c5e08a7df88","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:48d5dd42c0f02d41a6e8a18b6cab13f263746e2ab91570659915a5c3db43d031","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-13T02:33:43.019119Z","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:1a646b9df156132b229fce55c9583c294989b142efefe5de1225cd21fa099361","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-13T02:33:43.019119Z","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:e8593c3327ebfba7a064300596a9030ea3a8bece53d8f8fbf2d3c9517d6517cd","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:a5848caf528e5ef3b8ed3c5718a4bbaf8b153c3bffea4b3e707cf47871a727bd","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-07-06T15:14:55.628493Z","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-13T02:33:43.019119Z","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:4cdfeeed42c569d5bf734c7bcc7f90cabb8390ec39846f28428e7ff13ac2919d","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-13T02:33:43.019119Z","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:e7372a40130da25801e05ba50fc5df61111d322a68de3681035df8a7f8af39c8","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-13T02:33:43.019119Z","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:b103d9cfc26149ab7d61757a0c4e3e140ff3c15c186f4df66ceb214eb35c8ca6","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-13T02:33:43.019119Z","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:ba71ded86f5ff499394df62081b91f441d8c27ffa33b5ea16c922755ace66d7d","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-13T02:33:43.019119Z","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:084a982a696000adad67db6b2d7c38745d927e665faf09e1e3c48653ece987ce","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:5d56124eaec72af5b69e1f5b5c394f853d7eca921bb2cd2bad27f381eb404de3","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-13T02:33:43.019119Z","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:7aaf7931592189a03db2ac64dcea37148b7be860c33bdc7592e0b9a9d85a3d06","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:947576ca3a557f00e92474d4b1ca9ea78d2df85892632f3d5ebb817ebe92d520","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:a6e9b02ab0e86638aec5a37e96f12bf28ecc5dcb8f7363915d1d8dd84bf4721e","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-13T02:33:43.019119Z","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:3e9a8a5c57f57bc756e6bde7b9e329763a37f8bb8a30e9f0b4de2439d8d3282b","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-13T02:33:43.019119Z","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:641aca7f59d5b113e918b65cdf6ca5281c1810ac9c59574f8ed60313083de2bf","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-13T02:33:43.019119Z","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:8f7f793cf5a211b8d7614d59d5e8c0e2320f607402ad1f1dc172d0a69a009c24","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-13T02:33:43.019119Z","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:60200d7d02a0bc4cd4d5a94a69c532639c7fb8a00d19e0a458a9408111854431","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-13T02:33:43.019119Z","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:ec9778c73608c77d4031f804cef8194c968f3b373882d3fe5f81b4e79c9bfe0a","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-13T02:33:43.019119Z","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:4fa07059646746f37ac8be9900b0ec488ce90ca66e030c7f577ce9ed9c7fab22","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-08T19:43:37.777292Z","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-13T02:33:43.019119Z","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:65ac9b63235b66348222e3e51b95729fd2829132c2ca52aa7851ee17f5d2d4f1","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-13T02:33:43.019119Z","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:4b454677b9d50fb1ceba8d5b6f4f4e153295ba49adfbe008af59fa48510899f5","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-13T02:33:43.019119Z","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:c4f80a1ebf9f4891d8cc679a60872756806a25fa8ef236b8f922f99229797a18","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-13T02:33:43.019119Z","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:b4374667cf4b32461d7c0a24364ed5c57a6c404dcb9cf23feccd3dd000a8247e","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-13T02:33:43.019119Z","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:8cc703ffcbd357b0de206035832f8183e9dc17bf284354096a96e5044744bc58","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:71660ed27aad2a193ec994a4a614a92c1cb523eb998c596277611e0e46470e67","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-13T02:33:43.019119Z","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:e1bdb016ff01c0c52df40563a740d73f8b7d5d18f4801352cdcfff9afb4d3bb2","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:b8c3751912f899f0aef9aefc47e5d54558de5b7072f4075816283d04b7352371","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-13T02:33:43.019119Z","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:f7f652a6ebb944dba646990778bb18da700a9a512b8bfacbf670fd32dbc4b83f","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-13T02:33:43.019119Z","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:53043fe4ec4089fb5a9373d56b1229fe1aa43e39016b09f283d8a10525be4ee2","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-13T02:33:43.019119Z","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:291fd4e0c4a90606e1c7e23e79b515f530fd0e5b7fe35813ebf9871af3a8dbcc","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-13T02:33:43.019119Z","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:a46cff11404ea18357d191053c04548e59e5088d83e4a060faa5596d1e40df8a","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-13T02:33:43.019119Z","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:fdcec1e0e41f962eb00e52128e1f61b9ebd6bf544baf2f6ff49214f3362a9621","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:2495eeafa289be05da1ae7a0224d63646ee11b52cee34a14064e769038029f8f","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-13T02:33:43.019119Z","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:d08d2e21e839ced818d5d7a6103fea42571b1c05e7ddc2eaaf1bc8c2068b7cf3","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:66b70facb7b3899b088505f63afdd96e299edffd3b1dc4130038f02b7658b01f","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:cb790f7c4e09afccbbf19b35756de2ecfbcd52d35a7b09fe3bb1c02075c8dec3","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-13T02:33:43.019119Z","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:433e0b8a54e102c19a74df2b391af681616f7e0dc612dc9e9e346a4f8437a642","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-13T02:33:43.019119Z","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:5e5698b5f72d8e10e9132497e40c4af12c62ea1702d2344811b18df4e68ed29a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:a0ef7aa98bb62ef85c15462400d3d525834a28c207cfb7307f78cbfa27b2acde","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:cb9bd876e67a87069673c0fa27a7aac8a206946e570200f3eca9cc3b7c10b997","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:bcd74e5438f9ac80b14a8f9c351ef96096f1f7b10dd9c58abf6a9e49d618ba41","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:7dd6973648ab76705a5cec09fac9f304d9322a22ec68d43b5e3f509e172e55da","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:7020b195c75ffecba7ace18b4c54c20008d51b70f06802a9546e3897e50bdb7a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:7fcb5c6e5539c70a151441329d91bcc1afd830072b940ef9f189ec166ff00afe","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:3af81aed703fb6583a32ef213a96fd6a8e682075920b6af217467bd63f4a02c5","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:c1ba32ac2b32175ba691b8e6880c1c830e6ca01c4ddfba43878c626b5c881324","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:8d3ada5c59c9f1c1a889b3318a11cb305bdaf82db70961e585e200fb0cd3616a","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:394fe2593c12ecf03cf6b6dce61d084c0b74e7cd37ed2fd24de2be007cdbbad6","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:bb08236dd71af72d337b11c22052b13ede3398e19c66ef5f53d994f2661f6a49","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:b736cb84ba2420c0eef85b3d58114295fc9bb6ec5d8a2c7bce4bcbf24aa534bf","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:21d0128937d6d1a15965bf04dab098ace7fbac2f067ad8d91a275ef5dcc632fa","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:a2135168d1ba2158af6415874774e0ee2b5e71ed04adbf7f2f8b52e888f56c00","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:5ac3fd60f54d7a457448f8fdf7b4dff8e4c2cdd1f8aa12e96adf1385af6a5668","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:be01d2e3e652dda38aa471cf2afc8ab28cf0c59a7da536c0aa62a65a839aa03c","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:9d7becf41a0cd55453ad966cb40d988d9314028f2624fc95eee6196051f591f5","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:73d8a67b60a51b6232059bcaf7a1fc150c9001a6632f230a4b78d3a4708e1956","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:dfbf358499a3255f234dc8edd8ef481f51a7fa81b4f8b9d2cacdfc041edcae9e","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:a2568291eba0e698b55139330a352bc93c0dbda3abe84d9c664d47c9693b59d1","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:01274bf04ab89acd02c7d6090e43430cbac3a68777349a35165f4a54726f49fe","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:08cba08c90e9fcdb9402434ecb5d6793f039965388d46431d94847b22b8647fb","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:e4f520f547858d3f4dbf05ab556e6b88b2459d65058fa42132b483b13b04e117","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-13T02:33:43.019119Z","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:828b5e0e9eb78482040e230acd7a8f76079797a32133b5ba22c8ba15fd734f60","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-13T02:33:43.019119Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 71 of 71 outbound references and 0 inbound Pith citation observations for arXiv:2411.17050."}