{"as_of":"2026-08-07T22:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:affe1762c9da402078696387664c91839b35f1c1a9dc61b0b6013bde14f71293","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T23:50:30.099803Z","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-18T05:20:54.507287Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.03683","last_updated":"2024-12-05T17:49:53Z","snapshot_observed_at":"2026-07-06T19:45:57.808548Z","submitted_at":"2024-11-06T06:06:36Z","title":"Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03683","snapshot_observed_at":"2026-08-05T23:50:18.442551Z","title":"Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes","venue":null,"work_id":null,"year":2024},"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":84,"source":"arxiv_source","source_observed_at":"2026-08-05T23:50:18.442551Z"},"links":{"cited_paper":"/paper/2411.03683","citing_paper":"/paper/2508.04794"},"observation_digest":"sha256:0773ecd62c909ad208f4aed0f5cbbd6ad6dc8c62384cd1ec2be1699f9969bdcc","observation_id":"ec91c455-5708-4eeb-8c98-b459e113767d","resolution":{"observed_at":"2026-08-05T23:50:18.442551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03683","last_updated":"2024-12-05T17:49:53Z","snapshot_observed_at":"2026-07-06T19:45:57.808548Z","submitted_at":"2024-11-06T06:06:36Z","title":"Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03683","snapshot_observed_at":"2026-08-05T23:50:30.099803Z","title":"Polylog-time- and constant-space- overhead fault-tolerant quantum computation with quantum low-density parity-check codes","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":1996,"source":"pdf_text","source_observed_at":"2026-08-05T23:50:30.099803Z"},"links":{"cited_paper":"/paper/2411.03683","citing_paper":"/paper/2508.04796"},"observation_digest":"sha256:77b3a06def9a4d096c10b15ea42e519aeb14de668c468f0af5da9053ef30b347","observation_id":"0e76ccd8-7e4f-4894-8be6-aa0f46db0743","resolution":{"observed_at":"2026-08-05T23:50:30.099803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03683","last_updated":"2024-12-05T17:49:53Z","snapshot_observed_at":"2026-07-06T19:45:57.808548Z","submitted_at":"2024-11-06T06:06:36Z","title":"Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03683","snapshot_observed_at":"2026-08-04T10:47:12.096051Z","title":"Tamiya, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.08695","last_updated":"2026-07-08T05:33:05Z","snapshot_observed_at":"2026-08-06T13:54:37.204027Z","submitted_at":"2025-10-09T18:01:30Z","title":"Degeneracy Cutting: A Local and Efficient Post-Processing for Belief Propagation Decoding of Quantum Low-Density Parity-Check Codes","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T10:47:12.096051Z"},"links":{"cited_paper":"/paper/2411.03683","citing_paper":"/paper/2510.08695"},"observation_digest":"sha256:5945753524e6a5df43152c31432123f2ccbb7966d7e26b5573ea0447c2a50fd9","observation_id":"389608c3-9b99-45c5-b8ec-72ef468b93bc","resolution":{"observed_at":"2026-08-04T10:47:12.096051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03683","last_updated":"2024-12-05T17:49:53Z","snapshot_observed_at":"2026-07-06T19:45:57.808548Z","submitted_at":"2024-11-06T06:06:36Z","title":"Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes","version":2},"cited_work":{"arxiv_id":"2411.03683","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.03683","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tamiya, M","venue":null,"work_id":"678fe282-3da1-4250-9766-e0eeec60204b","year":2024},"citing_paper":{"arxiv_id":"2510.19442","last_updated":"2026-04-11T13:17:53Z","snapshot_observed_at":"2026-08-06T04:30:00.059042Z","submitted_at":"2025-10-22T10:15:40Z","title":"Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-18T05:16:35.002960Z"},"links":{"cited_paper":"/paper/2411.03683","citing_paper":"/paper/2510.19442"},"observation_digest":"sha256:93f4fcd8930287c5751000af10edcdee6529a20dfcc6d11affca849c7ee3512b","observation_id":"e942205c-60bf-48d0-9956-6fc5857ee3cf","resolution":{"observed_at":"2026-05-18T05:20:54.509736Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03683","last_updated":"2024-12-05T17:49:53Z","snapshot_observed_at":"2026-07-06T19:45:57.808548Z","submitted_at":"2024-11-06T06:06:36Z","title":"Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes","version":2},"cited_work":{"arxiv_id":"2411.03683","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2411.03683","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tamiya, M","venue":null,"work_id":"678fe282-3da1-4250-9766-e0eeec60204b","year":2024},"citing_paper":{"arxiv_id":"2602.20238","last_updated":"2026-05-06T08:48:40Z","snapshot_observed_at":"2026-08-04T02:28:24.830535Z","submitted_at":"2026-02-23T19:00:00Z","title":"Proof of a finite threshold for the union-find decoder","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-15T20:12:10.149451Z"},"links":{"cited_paper":"/paper/2411.03683","citing_paper":"/paper/2602.20238"},"observation_digest":"sha256:7dbb88369328f76a92b3538472664f408110123ae363062769b1d23f2435e662","observation_id":"47c24c09-87ed-46b1-ae9c-0ce2e749ab18","resolution":{"observed_at":"2026-05-15T20:16:34.800423Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03683","last_updated":"2024-12-05T17:49:53Z","snapshot_observed_at":"2026-07-06T19:45:57.808548Z","submitted_at":"2024-11-06T06:06:36Z","title":"Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03683","snapshot_observed_at":"2026-08-02T21:27:59.589101Z","title":"Available: https://arxiv.org/abs/2411.03683","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.20546","last_updated":"2026-06-02T15:13:30Z","snapshot_observed_at":"2026-08-02T21:27:53.468174Z","submitted_at":"2026-02-24T04:57:42Z","title":"Distilling Magic States in the Bicycle Architecture","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T21:27:59.589101Z"},"links":{"cited_paper":"/paper/2411.03683","citing_paper":"/paper/2602.20546"},"observation_digest":"sha256:c125cd457b1bb569558cfa2e0bd06d21975018f8b3f2fc0e5dfdb9aad29e3303","observation_id":"d521c796-5f5e-4fc8-bf8e-4845d68a3df2","resolution":{"observed_at":"2026-08-02T21:27:59.589101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.03683/citation-record","integrity":"/paper/2411.03683/integrity","json":"/paper/2411.03683/citation-record.json","paper":"/paper/2411.03683"},"outbound":[],"paper":{"arxiv_id":"2411.03683","last_updated":"2024-12-05T17:49:53Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-06T19:45:57.808548Z","submitted_at":"2024-11-06T06:06:36Z","title":"Polylog-time- and constant-space-overhead fault-tolerant quantum computation with quantum low-density parity-check codes"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2411.03683."}