{"as_of":"2026-08-11T21:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:91f229394fecc2a84eaba79c02bf3ac03153a29bd0434db7af2ff5a477d562f0","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":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:58:22.080317Z","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-07-04T04:49:36.069277Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-08-10T22:58:22.080317Z","title":"Almost-linear time decoding algo- rithm for topological codes,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.00331","last_updated":"2024-12-31T08:04:58Z","snapshot_observed_at":"2026-08-11T18:45:35.924345Z","submitted_at":"2024-12-31T08:04:58Z","title":"Q3DE: A fault-tolerant quantum computer architecture for multi-bit burst errors by cosmic rays","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:58:22.080317Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2501.00331"},"observation_digest":"sha256:0fdccdd2184d41863606589b0e7caba90f914db15ce47d228968fab563d2263f","observation_id":"0d7e4822-41b3-4eef-b53e-fca1fdcfdaef","resolution":{"observed_at":"2026-08-10T22:58:22.080317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-08-07T11:39:53.163734Z","title":"Delfosse and N","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.01779","last_updated":"2025-08-22T12:35:33Z","snapshot_observed_at":"2026-08-07T11:31:27.391798Z","submitted_at":"2025-06-02T15:23:00Z","title":"Improved belief propagation is sufficient for real-time decoding of quantum memory","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:39:53.163734Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2506.01779"},"observation_digest":"sha256:e1e03f951f410af7e1534d3df1504f52aae55cc03b98a9d8b565434b9252a6ec","observation_id":"2f74dc02-65e9-4001-90e3-472021cb472c","resolution":{"observed_at":"2026-08-07T11:39:53.163734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":"1709.06218","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-07-04T04:49:36.069277Z","title":"Delfosse and N","venue":null,"work_id":"e270fd2c-526c-4dc9-b3af-aceef5e94563","year":2021},"citing_paper":{"arxiv_id":"2602.20238","last_updated":"2026-05-06T08:48:40Z","snapshot_observed_at":"2026-08-11T12:47:46.459709Z","submitted_at":"2026-02-23T19:00:00Z","title":"Proof of a finite threshold for the union-find decoder","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-15T20:12:10.149451Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2602.20238"},"observation_digest":"sha256:2095c016b3e46e28bb3398237e077c58fe8780c1ad8223684d75de572cb2e0cb","observation_id":"3b075d76-bdb4-477f-8424-21fdc9f60b1a","resolution":{"observed_at":"2026-05-15T20:16:34.881155Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-07-15T14:12:14.615355Z","title":"Delfosse and N","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.06730","last_updated":"2026-06-04T08:23:00Z","snapshot_observed_at":"2026-08-09T04:35:55.930718Z","submitted_at":"2026-03-06T03:33:00Z","title":"Decoder Dependence in Surface-Code Threshold Estimation under Digitized Hybrid Continuous-Variable and Discrete Noise","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-15T14:12:14.615355Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2603.06730"},"observation_digest":"sha256:16ba96d875e76874995d57d7c705ef14dd9f24af3953b3332950a1c2b84413be","observation_id":"5446b6d0-ea2d-46f6-9fd4-271233e73ec6","resolution":{"observed_at":"2026-07-15T14:12:14.615355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":"1709.06218","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-07-04T04:49:36.069277Z","title":"Delfosse and N","venue":null,"work_id":"e270fd2c-526c-4dc9-b3af-aceef5e94563","year":2021},"citing_paper":{"arxiv_id":"2604.15389","last_updated":"2026-04-16T06:03:06Z","snapshot_observed_at":"2026-07-06T23:02:58.361418Z","submitted_at":"2026-04-16T06:03:06Z","title":"A Unified Hardware-to-Decoder Architecture for Hybrid Continuous-Variable and Discrete-Variable Quantum Error Correction in LiDMaS+","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T11:48:51.513086Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2604.15389"},"observation_digest":"sha256:4ff370282df4fd5a7f52ce3adfad485a1ab7369ff3dee9cc5ccd85db0f766780","observation_id":"55be5567-d78f-4431-9f9b-b64d4600a798","resolution":{"observed_at":"2026-05-10T11:50:20.177607Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":"1709.06218","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-07-04T04:49:36.069277Z","title":"Delfosse and N","venue":null,"work_id":"e270fd2c-526c-4dc9-b3af-aceef5e94563","year":2021},"citing_paper":{"arxiv_id":"2605.00038","last_updated":"2026-08-02T00:38:58Z","snapshot_observed_at":"2026-08-06T23:24:31.603274Z","submitted_at":"2026-04-28T15:41:05Z","title":"Lottery BP: Unlocking Quantum Error Decoding at Scale","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-09T20:46:40.373076Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2605.00038"},"observation_digest":"sha256:73bd67de4a29f3fc8e6d07601eb876aac9feab655b24422dc03bc3f55c7d972b","observation_id":"2aab7d33-47a1-476e-9778-c8ae700698f8","resolution":{"observed_at":"2026-05-11T15:01:05.476343Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-08-04T05:25:16.484301Z","title":"Delfosse and N","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.00038","last_updated":"2026-08-02T00:38:58Z","snapshot_observed_at":"2026-08-06T23:24:31.603274Z","submitted_at":"2026-04-28T15:41:05Z","title":"Lottery BP: Unlocking Quantum Error Decoding at Scale","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T05:25:16.484301Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2605.00038"},"observation_digest":"sha256:399a58b6fbf27682917f0f928004e1131d9f9c424cce38f9ec1ac417068f05b8","observation_id":"7b431766-73e7-47f7-8059-94d1407444c5","resolution":{"observed_at":"2026-08-04T05:25:16.484301Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":"1709.06218","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-07-04T04:49:36.069277Z","title":"Delfosse and N","venue":null,"work_id":"e270fd2c-526c-4dc9-b3af-aceef5e94563","year":2021},"citing_paper":{"arxiv_id":"2606.10399","last_updated":"2026-06-09T04:18:13Z","snapshot_observed_at":"2026-08-06T08:39:56.496638Z","submitted_at":"2026-06-09T04:18:13Z","title":"Average-Case and Smoothed Near-Optimality for Color-Code Decoding","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T11:42:59.897208Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2606.10399"},"observation_digest":"sha256:9715a60b60628c5cfc132f8dc9e99a94d47b76bfbc51bab5217daf64c747fdef","observation_id":"8fee9085-e48c-4d4c-ac53-65d96041bf64","resolution":{"observed_at":"2026-07-03T07:57:44.264062Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":"1709.06218","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-07-04T04:49:36.069277Z","title":"Delfosse and N","venue":null,"work_id":"e270fd2c-526c-4dc9-b3af-aceef5e94563","year":2021},"citing_paper":{"arxiv_id":"2606.20513","last_updated":"2026-06-18T17:34:11Z","snapshot_observed_at":"2026-08-05T04:29:45.109124Z","submitted_at":"2026-06-18T17:34:11Z","title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T16:42:17.891781Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2606.20513"},"observation_digest":"sha256:978ba50f7ddc6b4cfb3ed10618f6c82793b033a539953b6db9a87af015668983","observation_id":"5053de43-c0a8-4587-a1b0-f5c57de18e8d","resolution":{"observed_at":"2026-07-04T04:49:36.071297Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-08-02T08:17:16.700628Z","title":"Nickerson","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.13062","last_updated":"2026-07-24T17:28:33Z","snapshot_observed_at":"2026-08-10T04:18:37.795875Z","submitted_at":"2026-07-07T20:07:18Z","title":"The verifier side of speculative window decoding: a predictability bracket, a machine-checked blast-radius bound, and a decoder-agnostic recover loop","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T08:17:16.700628Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2607.13062"},"observation_digest":"sha256:f48e0376caf92730e77081b912b907b340f7c2df1339f9b0152f44d068073182","observation_id":"da550235-0d4f-4aa5-bd03-a7422f3b0a78","resolution":{"observed_at":"2026-08-02T08:17:16.700628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-08-01T19:29:14.680904Z","title":"Almost-linear time decoding algorithm for topo- logical codes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.16968","last_updated":"2026-07-18T21:04:23Z","snapshot_observed_at":"2026-08-08T12:28:18.993520Z","submitted_at":"2026-07-18T21:04:23Z","title":"A conditional no-go for resource-free magic-axis measurement on a static surface code","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T19:29:14.680904Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2607.16968"},"observation_digest":"sha256:cd735d4f831ee408ac3a97219d1bedf94dbf638c3e835a843442601847e0eedc","observation_id":"f74ea79e-422d-43fe-8317-051d48570685","resolution":{"observed_at":"2026-08-01T19:29:14.680904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1709.06218","snapshot_observed_at":"2026-08-01T13:40:56.277400Z","title":"Delfosse and N","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.19447","last_updated":"2026-07-21T12:21:58Z","snapshot_observed_at":"2026-08-01T13:40:51.683480Z","submitted_at":"2026-07-21T12:21:58Z","title":"Hardware-in-the-Loop Syndrome-to-Decoder Validation for Repetition, Surface, CSS-LDPC, and Digitized-GKP Codes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T13:40:56.277400Z"},"links":{"cited_paper":"/paper/1709.06218","citing_paper":"/paper/2607.19447"},"observation_digest":"sha256:763528aaca7477537a69316df95853fc9a950dd5a97a6ff11bd6e5e3b75a212f","observation_id":"17cc05ba-6be2-4cbf-a873-2c6d646dea95","resolution":{"observed_at":"2026-08-01T13:40:56.277400Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1709.06218/citation-record","integrity":"/paper/1709.06218/integrity","json":"/paper/1709.06218/citation-record.json","paper":"/paper/1709.06218"},"outbound":[],"paper":{"arxiv_id":"1709.06218","last_updated":"2021-11-24T20:33:14Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T15:04:47.179958Z","submitted_at":"2017-09-19T01:35:11Z","title":"Almost-linear time decoding algorithm for topological 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 12 inbound Pith citation observations for arXiv:1709.06218."}