{"as_of":"2026-08-09T06:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1a036efbfa47b12183d0f0ecd9a94c00b30f600c93f5380ed141e61c9b2380ea","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:05:52.247668Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T18:43:19.013800Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":"2409.18175","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2409.18175 (2024)","venue":null,"work_id":"05dd1117-9d92-4f10-b3a0-d632ea7006ec","year":2024},"citing_paper":{"arxiv_id":"2410.11942","last_updated":"2026-05-11T04:48:38Z","snapshot_observed_at":"2026-07-06T19:34:05.643989Z","submitted_at":"2024-10-15T18:00:00Z","title":"Operator algebra and algorithmic construction of boundaries and defects in (2+1)D topological Pauli stabilizer codes","version":5},"reference_index":123,"source":"pdf_text","source_observed_at":"2026-05-23T18:41:14.926900Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2410.11942"},"observation_digest":"sha256:c1d137b10c7363d36b0919fe741b6de7a46a5bb101f53d05a944e3dc1d208a9c","observation_id":"42133065-d569-470c-9faa-bea6a54c085b","resolution":{"observed_at":"2026-05-23T18:43:19.015685Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":"2409.18175","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2409.18175 (2024)","venue":null,"work_id":"05dd1117-9d92-4f10-b3a0-d632ea7006ec","year":2024},"citing_paper":{"arxiv_id":"2503.05003","last_updated":"2026-01-22T18:18:17Z","snapshot_observed_at":"2026-07-06T20:48:13.849680Z","submitted_at":"2025-03-06T22:05:52Z","title":"Parallel Logical Measurements via Quantum Code Surgery","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-23T00:29:29.522530Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2503.05003"},"observation_digest":"sha256:d876ba1bcd85f03207048f67a40cf5c360a95a885a5b08bef2928acd13fea658","observation_id":"1d6ebaab-3261-483b-a01a-d654dce22dfb","resolution":{"observed_at":"2026-05-23T00:32:18.431499Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-08-07T14:05:52.247668Z","title":"Sayginel, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20261","last_updated":"2025-05-26T17:40:52Z","snapshot_observed_at":"2026-08-09T03:26:21.160200Z","submitted_at":"2025-05-26T17:40:52Z","title":"Hardware-tailored logical Clifford circuits for stabilizer codes","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:05:52.247668Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2505.20261"},"observation_digest":"sha256:4b699f6025f18af86998683e14ed85f0ea06b10e6edf38b48219d6921a55cef8","observation_id":"2988dad4-2a1e-4aa4-82de-3fe09d04f1b5","resolution":{"observed_at":"2026-08-07T14:05:52.247668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-08-05T23:50:18.434083Z","title":"Fault-tolerant logical clifford gates from code automorphisms","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.04794","last_updated":"2025-08-06T18:10:37Z","snapshot_observed_at":"2026-08-06T07:25:20.927061Z","submitted_at":"2025-08-06T18:10:37Z","title":"Automorphism gadgets in homological product codes","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-05T23:50:18.434083Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2508.04794"},"observation_digest":"sha256:969167bd6d8bce2bfa38dffccf2e4c8de5a41d05746a7c46b263de4119d21a16","observation_id":"5c21eeda-67ef-42a5-b7f0-97f5954a2e95","resolution":{"observed_at":"2026-08-05T23:50:18.434083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-08-05T23:50:30.051890Z","title":"Fault-tolerant logical clifford gates from code automorphisms","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.04796","last_updated":"2026-07-02T23:06:55Z","snapshot_observed_at":"2026-08-06T12:35:36.047653Z","submitted_at":"2025-08-06T18:14:43Z","title":"Parity-Aware Byte-Pair Encoding: Improving Cross-lingual Fairness in Tokenization","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T23:50:30.051890Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2508.04796"},"observation_digest":"sha256:0e8d573c1906759647e31adc4e9128926884455126ad373b1f3e838473720b55","observation_id":"80ede785-582a-4b24-bb44-32168a064170","resolution":{"observed_at":"2026-08-05T23:50:30.051890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-08-05T21:18:48.276699Z","title":"Fault-tolerant logical clifford gates from code automorphisms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09082","last_updated":"2025-08-12T17:03:59Z","snapshot_observed_at":"2026-08-09T00:24:03.298508Z","submitted_at":"2025-08-12T17:03:59Z","title":"Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T21:18:48.276699Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2508.09082"},"observation_digest":"sha256:95ae8b4f6647b1ff975e258ad9bd11df582332dd7920fcf81e771dbec4dab527","observation_id":"b8e2c53d-8d52-4056-a451-d95b371d46ca","resolution":{"observed_at":"2026-08-05T21:18:48.276699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":"2409.18175","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2409.18175 (2024)","venue":null,"work_id":"05dd1117-9d92-4f10-b3a0-d632ea7006ec","year":2024},"citing_paper":{"arxiv_id":"2511.04430","last_updated":"2026-05-06T23:02:15Z","snapshot_observed_at":"2026-07-06T22:35:02.737645Z","submitted_at":"2025-11-06T15:05:17Z","title":"Symmetry-enriched topological order and quasifractonic behavior in $\\mathbb{Z}_N$ stabilizer codes","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-18T01:01:08.043585Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2511.04430"},"observation_digest":"sha256:fe817d376428375d1945a50b2844362bbb972d7a2e417d0a91a5563be20b9af2","observation_id":"bb6731dc-f45b-411d-85f4-cedbe015032c","resolution":{"observed_at":"2026-05-18T01:02:15.387195Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-08-03T21:53:43.762246Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.13560","last_updated":"2026-08-06T13:04:59Z","snapshot_observed_at":"2026-08-09T06:12:35.138064Z","submitted_at":"2025-11-17T16:26:15Z","title":"Sequences of Bivariate Bicycle Codes from Covering Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T21:53:43.762246Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2511.13560"},"observation_digest":"sha256:7fd60d43e379d2f895addc3b1dc50be2a48d8e910bd1daf952688aa75ff659e8","observation_id":"b5f43dd1-f0cd-4490-9bbd-a5c3c7c1554b","resolution":{"observed_at":"2026-08-03T21:53:43.762246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-08-03T08:00:03.548239Z","title":"Sayginel, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.18879","last_updated":"2026-05-24T01:40:16Z","snapshot_observed_at":"2026-08-03T11:12:49.778747Z","submitted_at":"2026-01-26T19:00:03Z","title":"Multivariate Multicycle Codes for Complete Single-Shot Decoding","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T08:00:03.548239Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2601.18879"},"observation_digest":"sha256:b4c33f31f3200dfc679f15aaacf8a35f7780556ce0ee3c999229fbc4b3d7808d","observation_id":"0ad7c0fa-1f82-4f66-a06f-0b5f86137dc4","resolution":{"observed_at":"2026-08-03T08:00:03.548239Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-08-02T23:50:43.682668Z","title":"Sayginel, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.13395","last_updated":"2026-07-12T21:35:59Z","snapshot_observed_at":"2026-08-05T20:57:21.779908Z","submitted_at":"2026-02-13T19:00:44Z","title":"No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T23:50:43.682668Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2602.13395"},"observation_digest":"sha256:56bfdf32488052b3f574cd43c0ef30a8b337e74eec04a115b7606b0e4be4c8fd","observation_id":"e483cbc1-051e-4a74-a70f-225aac0e9408","resolution":{"observed_at":"2026-08-02T23:50:43.682668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":"2409.18175","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2409.18175 (2024)","venue":null,"work_id":"05dd1117-9d92-4f10-b3a0-d632ea7006ec","year":2024},"citing_paper":{"arxiv_id":"2604.24739","last_updated":"2026-04-28T14:34:00Z","snapshot_observed_at":"2026-08-05T21:18:05.310044Z","submitted_at":"2026-04-27T17:44:08Z","title":"CAbLECAR: efficiently scheduling QLDPC codes on a tileable spin qubit chip with shuttling","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-08T04:04:28.994266Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2604.24739"},"observation_digest":"sha256:58e9f8a458031f6ed4012c6fac43ad1a482b9f558994a8a9b998604f50fa0c5b","observation_id":"4a07e5fa-9037-4862-a198-8683fd401e35","resolution":{"observed_at":"2026-05-11T21:51:28.291357Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-08-01T15:11:09.063964Z","title":"Fault-tolerant logical clifford gates from code au- tomorphisms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26477","last_updated":"2026-07-29T05:09:15Z","snapshot_observed_at":"2026-08-05T14:13:31.414027Z","submitted_at":"2026-07-29T05:09:15Z","title":"Finding diagonal logical gates in CSS codes and circuits","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T15:11:09.063964Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2607.26477"},"observation_digest":"sha256:12f3a0114a4d258a48ebb2d4a8d32a79a4ac0475f1215379f9084cec7c6de5ea","observation_id":"3f6ba2e6-b1aa-4368-8720-a4cfff498c3d","resolution":{"observed_at":"2026-08-01T15:11:09.063964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.18175","snapshot_observed_at":"2026-07-31T02:25:48.729960Z","title":"Sayginel, S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28605","last_updated":"2026-07-30T17:55:34Z","snapshot_observed_at":"2026-08-07T03:20:21.577604Z","submitted_at":"2026-07-30T17:55:34Z","title":"Logical computation with canonical lifted product codes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-31T02:25:48.729960Z"},"links":{"cited_paper":"/paper/2409.18175","citing_paper":"/paper/2607.28605"},"observation_digest":"sha256:458d3830cd51709bea264c8bb6832d25572456bd8653ed552945e97a816df815","observation_id":"7f357152-10cd-44c1-ac6c-e0215afed89f","resolution":{"observed_at":"2026-07-31T02:25:48.729960Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2409.18175/citation-record","integrity":"/paper/2409.18175/integrity","json":"/paper/2409.18175/citation-record.json","paper":"/paper/2409.18175"},"outbound":[],"paper":{"arxiv_id":"2409.18175","last_updated":"2025-05-09T17:26:07Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-04T00:46:10.255246Z","submitted_at":"2024-09-26T18:00:00Z","title":"Fault-Tolerant Logical Clifford Gates from Code Automorphisms"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2409.18175."}