{"as_of":"2026-08-21T08:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d4543f070bb1f29a0fac5cee400c44f2f15fcec9ba902fae8f37f0bc0158b2a9","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:57:45.939661Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T04:49:36.080248Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1405.4883","last_updated":"2014-05-19T20:33:08Z","snapshot_observed_at":"2026-08-14T23:33:27.882649Z","submitted_at":"2014-05-19T20:33:08Z","title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code","version":1},"cited_work":{"arxiv_id":"1405.4883","doi":null,"metadata_source":"pith","pith_arxiv_id":"1405.4883","snapshot_observed_at":"2026-07-04T04:49:36.080248Z","title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code","venue":"quant-ph","work_id":"86f7b502-edf3-45e6-81b5-6f4de05a59bb","year":2014},"citing_paper":{"arxiv_id":"2304.04743","last_updated":"2023-04-10T17:56:10Z","snapshot_observed_at":"2026-08-19T18:01:42.395016Z","submitted_at":"2023-04-10T17:56:10Z","title":"Improved Logical Error Rate via List Decoding of Quantum Polar Codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-24T08:58:35.396048Z"},"links":{"cited_paper":"/paper/1405.4883","citing_paper":"/paper/2304.04743"},"observation_digest":"sha256:da69959857ba9c67dfcd58b31d1d8214ac7542fa54d66080f5ac31d5bdd24f28","observation_id":"5cbab9ef-52a1-4650-a87a-479dda52ddfb","resolution":{"observed_at":"2026-05-24T08:59:14.845443Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1405.4883","last_updated":"2014-05-19T20:33:08Z","snapshot_observed_at":"2026-08-14T23:33:27.882649Z","submitted_at":"2014-05-19T20:33:08Z","title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.4883","snapshot_observed_at":"2026-08-11T12:57:45.939661Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.13739","last_updated":"2024-12-18T11:17:09Z","snapshot_observed_at":"2026-08-16T00:48:40.365339Z","submitted_at":"2024-12-18T11:17:09Z","title":"Tensor-network decoders for process tensor descriptions of non-Markovian noise","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T12:57:45.939661Z"},"links":{"cited_paper":"/paper/1405.4883","citing_paper":"/paper/2412.13739"},"observation_digest":"sha256:4bc77866c066e084f9cc93e20dc5d70f353c26660a787e2d3e732ffc0013fddd","observation_id":"4960f3d3-6ed8-4aef-9828-2231300eaa8f","resolution":{"observed_at":"2026-08-11T12:57:45.939661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1405.4883","last_updated":"2014-05-19T20:33:08Z","snapshot_observed_at":"2026-08-14T23:33:27.882649Z","submitted_at":"2014-05-19T20:33:08Z","title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.4883","snapshot_observed_at":"2026-08-07T15:21:30.851469Z","title":"Bravyi, M","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.15758","last_updated":"2026-07-19T17:42:03Z","snapshot_observed_at":"2026-08-17T22:46:55.112709Z","submitted_at":"2025-05-21T17:03:15Z","title":"A partition function framework for estimating logical error curves in stabilizer codes","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:21:30.851469Z"},"links":{"cited_paper":"/paper/1405.4883","citing_paper":"/paper/2505.15758"},"observation_digest":"sha256:b128124dbafdbcae2ae06cb6ba3c32a00526b81055d8934848c5d1adea99184c","observation_id":"5ac8906f-6187-4e6d-a19d-2cfb2211f61d","resolution":{"observed_at":"2026-08-07T15:21:30.851469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1405.4883","last_updated":"2014-05-19T20:33:08Z","snapshot_observed_at":"2026-08-14T23:33:27.882649Z","submitted_at":"2014-05-19T20:33:08Z","title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code","version":1},"cited_work":{"arxiv_id":"1405.4883","doi":null,"metadata_source":"pith","pith_arxiv_id":"1405.4883","snapshot_observed_at":"2026-07-04T04:49:36.080248Z","title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code","venue":"quant-ph","work_id":"86f7b502-edf3-45e6-81b5-6f4de05a59bb","year":2014},"citing_paper":{"arxiv_id":"2606.20513","last_updated":"2026-06-18T17:34:11Z","snapshot_observed_at":"2026-08-20T13:57:26.742674Z","submitted_at":"2026-06-18T17:34:11Z","title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T16:42:17.891781Z"},"links":{"cited_paper":"/paper/1405.4883","citing_paper":"/paper/2606.20513"},"observation_digest":"sha256:ce6e251d9b0296986d639d9b5980fd5cd583e3cdebdeace273e3e44f0abdc62a","observation_id":"b1ecf7df-dbee-444a-aa64-96f83ddf940c","resolution":{"observed_at":"2026-07-04T04:49:36.081978Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1405.4883","last_updated":"2014-05-19T20:33:08Z","snapshot_observed_at":"2026-08-14T23:33:27.882649Z","submitted_at":"2014-05-19T20:33:08Z","title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.4883","snapshot_observed_at":"2026-07-13T05:52:48.575522Z","title":"Bravyi, M","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.08911","last_updated":"2026-07-09T20:10:13Z","snapshot_observed_at":"2026-08-15T01:01:19.258207Z","submitted_at":"2026-07-09T20:10:13Z","title":"A diagrammatic field theory of quantum error correction","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T05:52:48.575522Z"},"links":{"cited_paper":"/paper/1405.4883","citing_paper":"/paper/2607.08911"},"observation_digest":"sha256:ed66b9b67b0f65335b4568ce3239a8a5f52357ec6c25447262c1808a59e25f8e","observation_id":"9499538f-4e0b-4255-aacd-b53e46719d00","resolution":{"observed_at":"2026-07-13T05:52:48.575522Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1405.4883/citation-record","integrity":"/paper/1405.4883/integrity","json":"/paper/1405.4883/citation-record.json","paper":"/paper/1405.4883"},"outbound":[],"paper":{"arxiv_id":"1405.4883","last_updated":"2014-05-19T20:33:08Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-14T23:33:27.882649Z","submitted_at":"2014-05-19T20:33:08Z","title":"Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1405.4883."}