{"as_of":"2026-08-18T19:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f21b1d263a944ddb0703b75728529e30d5c11e6fb4fe1203002d7183a5124899","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T19:56:05.413625Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2506.14745/citation-record","integrity":"/paper/2506.14745/integrity","json":"/paper/2506.14745/citation-record.json","paper":"/paper/2506.14745"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T19:56:06.094359Z","title":"Algorithms for quantum computation: Discrete logarithms and factoring,","venue":null,"work_id":"9c9fbc6a-7bb2-45a1-81e6-30820c946a6c","year":1994},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.179944Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:ef8677bb1a8987dee94b3bb7bedab74b39943a86c76d83fdc0bac79b192d02a5","observation_id":"de8f0ed8-5a30-4242-b308-90e805b90e7d","resolution":{"observed_at":"2026-08-15T19:56:06.098688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:06.082332Z","title":"A fast quantum mechanical algorithm for database search,","venue":null,"work_id":"191cbcd5-9c6e-4497-ade9-cd9953209279","year":1996},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.186039Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:96feea3b9e791e66d23cea15ef8f284fe6077e236e5dbc9ea2937af75c780bee","observation_id":"cbdf0586-2566-4f2e-93be-2ef4d594b762","resolution":{"observed_at":"2026-08-15T19:56:06.086585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:06.070339Z","title":"Scheme for reducing decoherence in quantum computer memory,","venue":null,"work_id":"60c0be66-74d3-4b5b-9e11-327f16be735f","year":1995},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.190475Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:4a93898f6d4e5b98eac2f90501f994aff4002b4ce918379b049dc4a20b8f8950","observation_id":"c1a11251-ad07-458e-bb0e-2492ee50ce09","resolution":{"observed_at":"2026-08-15T19:56:06.074546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:06.056520Z","title":"Good quantum error-correcting codes exist,","venue":null,"work_id":"e92aecd3-d3cd-41e1-94bb-ffbe2b19f6ec","year":1996},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.194983Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:578d8462d600c92ecff93a58acb8782972b460dc0fd2aa7d61698bae2f8f9296","observation_id":"9a5fc4bc-a5b0-4581-9fd6-1786081249f2","resolution":{"observed_at":"2026-08-15T19:56:06.061886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:06.045207Z","title":"Error correcting codes in quantum theory,","venue":null,"work_id":"273aceca-86dc-4b4b-8d4a-5fbdb8ca9c7c","year":1996},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.199153Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:7d7e0c768b5327c0588be1b17d187a6d93be3c45d2e4aee09d59a8bb06947f5b","observation_id":"8d0c3717-b3f0-4eee-9926-336eec5e7457","resolution":{"observed_at":"2026-08-15T19:56:06.049238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:06.032647Z","title":"Stabilizer codes and quantum error correction,","venue":null,"work_id":"e85c3e70-9aee-46b6-8c11-6a437fbcd655","year":null},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.203808Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:44af9bfd7a3c156b86995354c094bfc12dce6d8eb5345f94d843fa182a15913e","observation_id":"9f251fca-3824-4a87-a244-d25e0ae8957c","resolution":{"observed_at":"2026-08-15T19:56:06.036771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9707021","last_updated":"1997-07-09T18:28:27Z","snapshot_observed_at":"2026-07-07T07:27:02.186468Z","submitted_at":"1997-07-09T18:28:27Z","title":"Fault-tolerant quantum computation by anyons","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9707021","snapshot_observed_at":"2026-08-15T19:56:05.212621Z","title":"Fault-tolerant quantum computation by anyons,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.212621Z"},"links":{"cited_paper":"/paper/quant-ph/9707021","citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:807ff33411821077489b2fb595a00be435c2838167f02f9350c510dd015f1d7e","observation_id":"8fe7c800-cce5-4219-a3cc-4bc5931fe8e4","resolution":{"observed_at":"2026-08-15T19:56:05.212621Z","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-15T19:56:05.217973Z","title":"Quantum codes on a lattice with boundary,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.217973Z"},"links":{"cited_paper":"/paper/quant-ph/9811052","citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:4021b60c5fd1293eb47166ec33879712f135076f13f4c5acfd5eab38da263a5e","observation_id":"2d4e45da-d9dd-45e2-a36e-a3cea748d94e","resolution":{"observed_at":"2026-08-15T19:56:05.217973Z","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-15T19:56:06.019936Z","title":"Optimal resources for topolog- ical two-dimensional stabilizer codes: Comparative study,","venue":null,"work_id":"b3064111-f54d-4db8-932b-9ae9e93afbf8","year":2007},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.222482Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:975229999edc5c1cc418b87d985c29b15f1324027b368aebd7b8fe6d115b3528","observation_id":"818bb9a7-300a-4094-8295-1d77efcbebb1","resolution":{"observed_at":"2026-08-15T19:56:06.023914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:06.007777Z","title":"Surface codes: Towards practical large-scale quantum computation,","venue":null,"work_id":"3c659d0d-dcc4-41ac-8dc7-54f922b8c69d","year":2012},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.226550Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:549d1189d8a95eb2a5aedb37f65b46a0c4e93de00322edd1d672c29c830f6aa3","observation_id":"a98c49bd-0238-443f-a2c2-7140327604bb","resolution":{"observed_at":"2026-08-15T19:56:06.011694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.995095Z","title":"Topological quantum memory,","venue":null,"work_id":"d1bfcc2b-bd33-4802-8438-526f3cc0c74c","year":2002},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.230924Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:0c5448516cde04123e8135e2bec8b6d5a544fab7de4d0d76cbf82112b7000afc","observation_id":"86b8ad8a-f289-4595-a362-e5fb542d01ba","resolution":{"observed_at":"2026-08-15T19:56:05.999268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.980988Z","title":"Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel,","venue":null,"work_id":"c7eac12d-4b0d-49d7-a4e2-364f51d436a2","year":2020},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.235189Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:9f0d46d1cd63f225b24b45a497b9a2ebd5df92680cee9a434427e01d5c8b23c8","observation_id":"4489dade-0b1c-4ac6-ba95-e600013656e6","resolution":{"observed_at":"2026-08-15T19:56:05.985774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.966968Z","title":"Almost-linear time decoding algo- rithm for topological codes,","venue":null,"work_id":"60487f6f-ffcd-4c97-94b9-d6233d3d3300","year":2021},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.239953Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:831adbd439a34f715c70de6ba078cf0835f47ce5875e0f928e7f126726aaed92","observation_id":"81542fa5-a678-4920-bd87-0c65de6e0e8f","resolution":{"observed_at":"2026-08-15T19:56:05.971843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.952362Z","title":"Paths, trees, and flowers,","venue":null,"work_id":"f4dec3df-9708-4bcb-a9c3-70df952edb96","year":1965},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.244295Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:08763a2e093c527b435a9745382f5c1303a6760e2e00429b49a69ae5d8781058","observation_id":"e46e08c4-4888-44ba-836b-5fad7f23efc0","resolution":{"observed_at":"2026-08-15T19:56:05.956934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.938114Z","title":"An interpretation of union-find decoder on weighted graphs,","venue":null,"work_id":"5a8732ee-54e0-4b97-8492-28c24c89b674","year":2022},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.248826Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:8ffb8fa8abfca008f3f8d1f9ea6098bb71b789ef2e23d72d3a036d3fa82ad189","observation_id":"4c5af73c-b9e7-4503-9239-dd7d62ffa6e3","resolution":{"observed_at":"2026-08-15T19:56:05.942727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.253059Z","title":"Worst-case analysis of set union algorithms,","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.253059Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:f6b0abd395333c18f1d7f923cbd8f5b4cef9529e9deebda941bc51a6513b4bf4","observation_id":"0c03c7a0-9069-4e85-9cc8-42465b2b6597","resolution":{"observed_at":"2026-08-15T19:56:05.253059Z","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-15T19:56:05.924487Z","title":"Union-find quantum decoding without union-find,","venue":null,"work_id":"689949f7-e007-4796-8ca0-288b8e07e563","year":2024},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.257435Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:cc15b8ef6758f875c82e9ef8f43eab26055eb347da0182028ce9db2c254e6d1b","observation_id":"9ddf602f-304d-4c49-91a5-1faaa6f99b7f","resolution":{"observed_at":"2026-08-15T19:56:05.929355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.910131Z","title":"Fault-tolerant weighted union-find decoding on the toric code,","venue":null,"work_id":"4402eac3-3110-4080-933d-81365927a186","year":2020},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.261782Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:56bde8716b63ea69b2a49cf375d752cba0609a1dcc1a62c084ce097851b15f8c","observation_id":"d7251de9-f69d-4eb6-81fa-7f323a1a043b","resolution":{"observed_at":"2026-08-15T19:56:05.914981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.896437Z","title":"Scalable neural decoder for topological surface codes,","venue":null,"work_id":"9914e437-a9c2-4326-870e-a61bc43f8aa5","year":null},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.265777Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:3f4ff49e38298761d889db6de355ca9423be591cc80f0d5cacc90e86d860e7b0","observation_id":"eba313af-99d2-464c-9df7-d7521f3a783a","resolution":{"observed_at":"2026-08-15T19:56:05.900814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.881061Z","title":"Fusion blossom: Fast mwpm decoders for qec,","venue":null,"work_id":"80823900-b7e7-4e6f-b109-1bac968bf218","year":2023},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.274541Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:aff0215f1b29335841424640f6c680fdb6cd4af13e349a13b97d73cf3f224268","observation_id":"b6103e46-b640-4cf9-912f-8f31e62b418e","resolution":{"observed_at":"2026-08-15T19:56:05.886396Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.278925Z","title":"Sparse blossom: correcting a million errors per core second with minimum-weight matching,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.278925Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:eb06d147da0cb02c789f7205b16cad09f547c05ef3c99a24395d18dd1d6338cf","observation_id":"aa65b168-b9ac-42d5-b650-5fe908596ffd","resolution":{"observed_at":"2026-08-15T19:56:05.278925Z","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-15T19:56:05.858880Z","title":"Bubble clustering decoder for quantum topological codes,","venue":null,"work_id":"d5b9c5fc-4cb7-4e06-9521-5fb90503420f","year":2025},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.283492Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:703c1a6078373d805246bd5ee6d117fa455a90fd8943843fec0592acbcbd55b1","observation_id":"5b2a872e-5e4d-4c5c-b8d8-bedb06917783","resolution":{"observed_at":"2026-08-15T19:56:05.863956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.845929Z","title":"A decoding algorithm for CSS codes using the X/Z correlations,","venue":null,"work_id":"db32eab8-b534-40f3-be58-bac92d5090d7","year":2014},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.289029Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:c48188803577c7be878264143c9230f5bcc82e307ca1a4b3fce50c5a96e3b808","observation_id":"088fb299-6b9c-4cff-8af1-be48582f265f","resolution":{"observed_at":"2026-08-15T19:56:05.849931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.833677Z","title":"Low-density parity-check codes,","venue":null,"work_id":"e864775e-195a-4899-a7ab-e76c172d4b0f","year":1962},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.294421Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:c60940ec117575163fe36153e26011eaaf7ea9c60eb9ae43f4e6be39d4fcd5c0","observation_id":"ffea7760-b3e8-4d85-8591-592a8acf638d","resolution":{"observed_at":"2026-08-15T19:56:05.837798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.821418Z","title":"Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference","venue":null,"work_id":"9f582511-2642-4a62-bed7-1fca39295c5b","year":1988},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.299167Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:ca72a79b4cb7cbdc69f364d5d92baddc35b70b7005c555f5bdfa474cc3b0d304","observation_id":"afebdbd4-7509-4bce-921e-6e3437a6e56a","resolution":{"observed_at":"2026-08-15T19:56:05.825467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.808730Z","title":"Refined belief propagation decoding of sparse-graph quantum codes,","venue":null,"work_id":"f835bfa4-1743-43bf-a183-d84ecbaab023","year":2020},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.308066Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:e8e8cffd0a35a78202af24e16809165ca122016cff49299eea035faacc7065c6","observation_id":"9f04276a-ce43-405d-9f88-998547d7077a","resolution":{"observed_at":"2026-08-15T19:56:05.813297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.13659","last_updated":"2023-04-02T12:26:25Z","snapshot_observed_at":"2026-08-18T13:26:57.690546Z","submitted_at":"2021-04-28T09:30:04Z","title":"Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.13659","snapshot_observed_at":"2026-08-15T19:56:05.313017Z","title":"Exploiting degeneracy in belief propagation decoding of quantum codes,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.313017Z"},"links":{"cited_paper":"/paper/2104.13659","citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:afb9430e774dbdd9f881d1b171d8bc59108632e6a45c3a699cb777dbab27a1aa","observation_id":"6d57e409-ad83-4a64-b03b-70d2d3dada29","resolution":{"observed_at":"2026-08-15T19:56:05.313017Z","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-15T19:56:05.796805Z","title":"Degenerate quantum LDPC codes with good finite length performance,","venue":null,"work_id":"eb738489-576f-4058-828b-eaeb13f48f26","year":2021},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.318056Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:025942abd026459057d76db083d84cd175c26bceed637b7669a388f700ed5f77","observation_id":"c5eac674-ba93-44d4-bb9f-af05443be471","resolution":{"observed_at":"2026-08-15T19:56:05.800852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.784936Z","title":"Decoding across the quantum low-density parity-check code landscape,","venue":null,"work_id":"10a0f7d9-ad95-4b37-9c54-baf2b0dee8e5","year":2020},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.322789Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:ca8642973666a64b375eca84ee95c9dc4bac8bbe8a62e49e79c828db843901ed","observation_id":"a348e5d8-8531-4e92-ba2c-81587683e972","resolution":{"observed_at":"2026-08-15T19:56:05.789115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.03321","last_updated":"2023-07-15T16:26:17Z","snapshot_observed_at":"2026-08-16T15:35:25.937042Z","submitted_at":"2023-05-05T06:59:19Z","title":"On Belief Propagation Decoding of Quantum Codes with Quaternary Reliability Statistics","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03321","snapshot_observed_at":"2026-08-15T19:56:05.327808Z","title":"On belief propagation decoding of quantum codes with quaternary reliability statistics,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.327808Z"},"links":{"cited_paper":"/paper/2305.03321","citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:d9d6e74e736dcb6aeab96f2c77de5930e4717679af1fec19e06d70e099629563","observation_id":"b87fb984-5f30-4d78-a894-e5fc45be75df","resolution":{"observed_at":"2026-08-15T19:56:05.327808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1310.0863","last_updated":"2013-10-02T23:16:22Z","snapshot_observed_at":"2026-08-16T02:29:08.014964Z","submitted_at":"2013-10-02T23:16:22Z","title":"Optimal complexity correction of correlated errors in the surface code","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1310.0863","snapshot_observed_at":"2026-08-15T19:56:05.332932Z","title":"Optimal complexity correction of correlated errors in the surface code,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.332932Z"},"links":{"cited_paper":"/paper/1310.0863","citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:e554d3b31ca09af8637039854bf58dc2a862b7ae03edbf6aea57ef0e3bfd3f74","observation_id":"237ca54f-e323-4122-9b3f-30d5f9a661ba","resolution":{"observed_at":"2026-08-15T19:56:05.332932Z","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-15T19:56:05.772956Z","title":"Pipelined correlated minimum weight perfect matching of the surface code,","venue":null,"work_id":"d4465078-bef8-464b-b80d-696ea8e75056","year":2023},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.337823Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:610716a558f36016007de13179454d4ef2a7295f7a3ac718cdbff155cb371ea4","observation_id":"00474966-37b1-450f-92ae-0f974138051d","resolution":{"observed_at":"2026-08-15T19:56:05.776932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.11239","last_updated":"2022-05-20T16:09:43Z","snapshot_observed_at":"2026-08-16T17:19:28.827079Z","submitted_at":"2022-02-23T00:04:03Z","title":"A Modified MWPM Decoding Algorithm for Quantum Surface Codes Over Depolarizing Channels","version":2},"cited_work":{"arxiv_id":"2202.11239","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.11239","snapshot_observed_at":"2026-08-15T19:56:05.516665Z","title":"A Modified MWPM Decoding Algorithm for Quantum Surface Codes Over Depolarizing Channels","venue":"quant-ph","work_id":"2350725d-1fd4-4016-9a29-893b5e729387","year":2022},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.342760Z"},"links":{"cited_paper":"/paper/2202.11239","citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:4f240f7bf3cfaed9dbec6812fe3f9dfbbdbe243440322d23c706b4c6e9588029","observation_id":"11c0061a-429b-41c5-bf6d-7ccbc4fa43ad","resolution":{"observed_at":"2026-08-15T19:56:05.523412Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.760834Z","title":"Performance enhancement of surface codes via recursive minimum-weight perfect- match decoding,","venue":null,"work_id":"ba588861-4973-4bc5-815a-21bb9e5f572d","year":2023},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.347480Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:cb1559d16d3c508622ac309d7045d58dc60f079bcd4afa70bad6569a585c1130","observation_id":"ecd14350-117e-48aa-b025-cca123f677d9","resolution":{"observed_at":"2026-08-15T19:56:05.765164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.05558","last_updated":"2024-09-24T10:01:00Z","snapshot_observed_at":"2026-08-16T15:01:41.059946Z","submitted_at":"2023-09-11T15:46:27Z","title":"A real-time, scalable, fast and highly resource efficient decoder for a quantum computer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.05558","snapshot_observed_at":"2026-08-15T19:56:05.352098Z","title":"A real-time, scalable, fast and highly resource efficient decoder for a quantum computer,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.352098Z"},"links":{"cited_paper":"/paper/2309.05558","citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:015a52267e219a818c0ce67a861c498ace90f6bb7c29e81458607e22a56a08da","observation_id":"717ac22d-f714-49d9-8e33-aea229a5cd21","resolution":{"observed_at":"2026-08-15T19:56:05.352098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2001.11427","last_updated":"2020-01-30T16:09:51Z","snapshot_observed_at":"2026-08-09T19:36:35.021093Z","submitted_at":"2020-01-30T16:09:51Z","title":"Hierarchical decoding to reduce hardware requirements for quantum computing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2001.11427","snapshot_observed_at":"2026-08-15T19:56:05.357231Z","title":"Hierarchical decoding to reduce hardware requirements for quantum computing,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.357231Z"},"links":{"cited_paper":"/paper/2001.11427","citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:402f7319d70cf2bb6676875a5d8b624d2c8f7dc0bb50dcf333c78463423db1c4","observation_id":"25b190c8-b23a-45b1-ba02-585a9fc41de3","resolution":{"observed_at":"2026-08-15T19:56:05.357231Z","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-15T19:56:05.747045Z","title":"Scalable quantum error correction for surface codes using fpga,","venue":null,"work_id":"46bc00de-72e9-4e3d-8fba-4f3ab477ca2d","year":2023},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.361989Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:ec711b02687b7873976eddc8ab3bb9ff34929b90bccd5ce25b29618b50120995","observation_id":"a1f3f913-09a7-4452-b024-88a558b759a8","resolution":{"observed_at":"2026-08-15T19:56:05.751011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.366240Z","title":"Actis: A Strictly Local Union–Find Decoder,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.366240Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:d80fe8591c98df31627d36cabae33f7990116a0c8a7027f158fd3652792c2caa","observation_id":"b27062f1-32db-4552-a1e9-dd945bbdbc0a","resolution":{"observed_at":"2026-08-15T19:56:05.366240Z","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-15T19:56:05.734666Z","title":"Threshold error rates for the toric and planar codes,","venue":null,"work_id":"68d3919d-90f3-4350-9adc-9b037ef40196","year":2010},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.370293Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:ff9e24de4e6d44586cd671247d5db164ff59d98a6a383cf4dd1eedbbf2d273a1","observation_id":"701ef658-cd17-40e3-a98f-7d4ccabd2450","resolution":{"observed_at":"2026-08-15T19:56:05.738891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.722760Z","title":"Fault-tolerant quantum computation by anyons,","venue":null,"work_id":"42020f9c-aeb3-4b62-901b-1490174831eb","year":2003},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.374439Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:ab82274dbe1c642e80bacb20ddd0d72f67de0430cd39224093b1464b9fc6c6b4","observation_id":"ae38f245-7a33-4c74-ace1-4d973ad84c60","resolution":{"observed_at":"2026-08-15T19:56:05.726869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.709310Z","title":"Projective plane and planar quantum codes,","venue":null,"work_id":"3856624b-c959-41c2-8b35-d7945bb30749","year":2001},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.378954Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:e969487a7cd1ba922c04d5670eef055d8bdd59f8242e99c06e746e83cdfe2f00","observation_id":"385cdb5f-5704-45c5-819d-3824334d5c25","resolution":{"observed_at":"2026-08-15T19:56:05.713139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.697295Z","title":"Fault-tolerant quantum computation with high threshold in two dimensions,","venue":null,"work_id":"c2be749e-3e4a-46aa-a088-ea88dfb2f307","year":2007},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.384098Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:d3946042f8e80cd5f31491857eb8475e75122c8dcfa81ae3f615d8bb2943e6ad","observation_id":"ea0f27d4-a02d-4151-a1aa-ed9db5dab521","resolution":{"observed_at":"2026-08-15T19:56:05.701365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.685706Z","title":"Codes for the quantum erasure channel,","venue":null,"work_id":"e27ea69a-c7a5-4f24-be20-76e7ff4b775d","year":1997},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.388066Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:459e2a0b1ee3f849c9615e44b6d7c2c5c88cb1fc9ee28d9318d2ddc3cb0f31dc","observation_id":"1130b349-5a88-4ab4-8f3f-1110363b4179","resolution":{"observed_at":"2026-08-15T19:56:05.689916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.673569Z","title":"Efficiency of a good but not linear set union algorithm,","venue":null,"work_id":"adf5e347-61ef-47a0-9db5-429f2fb697e7","year":1975},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.392443Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:3bca3d2e1ae1730cff7c6bc42f38c45d3323c4dba6f14d8b531a9bd1f4d02bcf","observation_id":"981a3b4f-81c8-4563-b465-98f5551806d6","resolution":{"observed_at":"2026-08-15T19:56:05.677738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.661278Z","title":"Quantum data-syndrome codes,","venue":null,"work_id":"e72b0bf7-011f-4edd-a15a-cc4bf6b8f2f0","year":2020},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.397078Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:0985fc5ef96f6bdbacd81b35b8de30d66742ad8bc04238989176851f011c43c7","observation_id":"51ba48d5-897a-4686-88de-abe5a57fdec7","resolution":{"observed_at":"2026-08-15T19:56:05.665135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.648986Z","title":"Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise,","venue":null,"work_id":"56f4abb5-54ff-457b-82d9-eb1bc6e1bdcd","year":2025},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.401061Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:69b5f1708586cc002e2fead76b5f6471f0697ad91ee54ab285201755e3785fde","observation_id":"ccc9a1c6-ddb2-41b2-a47b-0bd25bd8459f","resolution":{"observed_at":"2026-08-15T19:56:05.653067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.636247Z","title":"Entanglement-assisted quantum error- correcting codes with imperfect ebits,","venue":null,"work_id":"58ea8c0a-99c7-4a49-9a33-546230a05108","year":2012},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.405173Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:9fac63482dd48decd25a3b4f791d410f4d6fa482a2cbe3a6f72c71630bc53440","observation_id":"7576c875-5179-4bd0-89be-cc3bc328e131","resolution":{"observed_at":"2026-08-15T19:56:05.640587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.622149Z","title":null,"venue":null,"work_id":"20ce0253-c0d3-4621-9d4a-ba174fba74db","year":1991},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.409486Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:bf8184c8e5b043b3ee89abeab3e3a7f5ef8120e3a2d074250301425109d0503d","observation_id":"58d9ae99-d0b9-4102-919a-787105fe9849","resolution":{"observed_at":"2026-08-15T19:56:05.626945Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.608294Z","title":"Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory,","venue":null,"work_id":"b3b5517c-6503-473a-b6a8-811861dfa855","year":2003},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.413625Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:8b53e22ec19ee75de1b6e0034b1580c406339caae174f7714c0242f86c552073","observation_id":"ef7ce40b-0993-4363-89be-414e1e41456b","resolution":{"observed_at":"2026-08-15T19:56:05.612839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-15T19:56:05.208323Z","title":"Available: https://doi.org/10.7907/rzr7-dt72","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.208323Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:9c10f931aed97cbe25004a5a1366a5d63c5b95c74752e25b13c987b678b727fa","observation_id":"d02338a5-276b-446d-a6d5-3f9afe83753e","resolution":{"observed_at":"2026-08-15T19:56:05.208323Z","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-15T19:56:05.269948Z","title":"Available: https://link.aps.org/doi/10.1103/PhysRevLett","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T19:56:05.269948Z"},"links":{"citing_paper":"/paper/2506.14745"},"observation_digest":"sha256:22cb45dc990605a3c621093e7a9d28bee0c304ca085fdef2e18c82b9fe75ca4a","observation_id":"4db5e464-37cf-4e11-be04-d20a183ad082","resolution":{"observed_at":"2026-08-15T19:56:05.269948Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.14745","last_updated":"2025-06-17T17:30:14Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T17:44:07.970456Z","submitted_at":"2025-06-17T17:30:14Z","title":"Union-Intersection Union-Find for Decoding Depolarizing Errors in Topological Codes"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":1,"verified_fuzzy":37},"total_outbound_references":51},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2506.14745."}