{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RPAONS777O75KPERWLSTEKXTVY","short_pith_number":"pith:RPAONS77","canonical_record":{"source":{"id":"2301.08419","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-20T04:23:00Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"13116032a218c561e5310d24381c876588143c819565858ccda4a93afc71fdda","abstract_canon_sha256":"02e1ed73457386dd668412e489c1463f259e9c6e778f1cfa3bfacb3f4504541c"},"schema_version":"1.0"},"canonical_sha256":"8bc0e6cbfffbbfd53c91b2e5322af3ae15174f955ddaf684866af53330f59b30","source":{"kind":"arxiv","id":"2301.08419","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.08419","created_at":"2026-07-05T06:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"2301.08419v2","created_at":"2026-07-05T06:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08419","created_at":"2026-07-05T06:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"RPAONS777O75","created_at":"2026-07-05T06:09:47Z"},{"alias_kind":"pith_short_16","alias_value":"RPAONS777O75KPER","created_at":"2026-07-05T06:09:47Z"},{"alias_kind":"pith_short_8","alias_value":"RPAONS77","created_at":"2026-07-05T06:09:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RPAONS777O75KPERWLSTEKXTVY","target":"record","payload":{"canonical_record":{"source":{"id":"2301.08419","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-20T04:23:00Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"13116032a218c561e5310d24381c876588143c819565858ccda4a93afc71fdda","abstract_canon_sha256":"02e1ed73457386dd668412e489c1463f259e9c6e778f1cfa3bfacb3f4504541c"},"schema_version":"1.0"},"canonical_sha256":"8bc0e6cbfffbbfd53c91b2e5322af3ae15174f955ddaf684866af53330f59b30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:47.802623Z","signature_b64":"O3WPInKAoSLVL/r0rIJrWJZ6r4hDrOaB+EChjEBsGSoynAAPCWWybfvt3uCjSHQwhQC8LRq0bLjsmzaJW03PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc0e6cbfffbbfd53c91b2e5322af3ae15174f955ddaf684866af53330f59b30","last_reissued_at":"2026-07-05T06:09:47.802184Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:47.802184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.08419","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EWZDEC6diySzGdUfNbdzsw1bH4fdgXHETED+qYIyUwXfp/lPCpJColCAWBbtHvIZwc7USbfmy9sNz2IQnCbzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:32:24.561004Z"},"content_sha256":"207eed174e45314c95a1df6338eea3f78439d2217336e216f6e5f3def5c075b3","schema_version":"1.0","event_id":"sha256:207eed174e45314c95a1df6338eea3f78439d2217336e216f6e5f3def5c075b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RPAONS777O75KPERWLSTEKXTVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Quantum Error Correction for Surface Codes using FPGA","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"quant-ph","authors_text":"Alexander Deters, Lin Zhong, Namitha Liyanage, Yue Wu","submitted_at":"2023-01-20T04:23:00Z","abstract_excerpt":"A fault-tolerant quantum computer must decode and correct errors faster than they appear. The faster errors can be corrected, the more time the computer can do useful work. The Union-Find (UF) decoder is promising with an average time complexity slightly higher than $O(d^3)$. We report a distributed version of the UF decoder that exploits parallel computing resources for further speedup. Using an FPGA-based implementation, we empirically show that this distributed UF decoder has a sublinear average time complexity with regard to $d$, given $O(d^3)$ parallel computing resources. The decoding ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08419","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.08419/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:09:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRPGcdRFX55EOVCN8OqcbESNtHThPVgHnbxRPeOC74S8/7aFZ6jLk54QDpRHt64NFe1pQ9XKYuSGTdokFrUYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T19:32:24.561929Z"},"content_sha256":"026aca61dc29002c30d66583223d0ee03ab619f7e0550f6860490b0aebce75f2","schema_version":"1.0","event_id":"sha256:026aca61dc29002c30d66583223d0ee03ab619f7e0550f6860490b0aebce75f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY/bundle.json","state_url":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RPAONS777O75KPERWLSTEKXTVY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T19:32:24Z","links":{"resolver":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY","bundle":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY/bundle.json","state":"https://pith.science/pith/RPAONS777O75KPERWLSTEKXTVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RPAONS777O75KPERWLSTEKXTVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RPAONS777O75KPERWLSTEKXTVY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"02e1ed73457386dd668412e489c1463f259e9c6e778f1cfa3bfacb3f4504541c","cross_cats_sorted":["cs.AR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-20T04:23:00Z","title_canon_sha256":"13116032a218c561e5310d24381c876588143c819565858ccda4a93afc71fdda"},"schema_version":"1.0","source":{"id":"2301.08419","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.08419","created_at":"2026-07-05T06:09:47Z"},{"alias_kind":"arxiv_version","alias_value":"2301.08419v2","created_at":"2026-07-05T06:09:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.08419","created_at":"2026-07-05T06:09:47Z"},{"alias_kind":"pith_short_12","alias_value":"RPAONS777O75","created_at":"2026-07-05T06:09:47Z"},{"alias_kind":"pith_short_16","alias_value":"RPAONS777O75KPER","created_at":"2026-07-05T06:09:47Z"},{"alias_kind":"pith_short_8","alias_value":"RPAONS77","created_at":"2026-07-05T06:09:47Z"}],"graph_snapshots":[{"event_id":"sha256:026aca61dc29002c30d66583223d0ee03ab619f7e0550f6860490b0aebce75f2","target":"graph","created_at":"2026-07-05T06:09:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.08419/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A fault-tolerant quantum computer must decode and correct errors faster than they appear. The faster errors can be corrected, the more time the computer can do useful work. The Union-Find (UF) decoder is promising with an average time complexity slightly higher than $O(d^3)$. We report a distributed version of the UF decoder that exploits parallel computing resources for further speedup. Using an FPGA-based implementation, we empirically show that this distributed UF decoder has a sublinear average time complexity with regard to $d$, given $O(d^3)$ parallel computing resources. The decoding ti","authors_text":"Alexander Deters, Lin Zhong, Namitha Liyanage, Yue Wu","cross_cats":["cs.AR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-20T04:23:00Z","title":"Scalable Quantum Error Correction for Surface Codes using FPGA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.08419","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:207eed174e45314c95a1df6338eea3f78439d2217336e216f6e5f3def5c075b3","target":"record","created_at":"2026-07-05T06:09:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"02e1ed73457386dd668412e489c1463f259e9c6e778f1cfa3bfacb3f4504541c","cross_cats_sorted":["cs.AR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-01-20T04:23:00Z","title_canon_sha256":"13116032a218c561e5310d24381c876588143c819565858ccda4a93afc71fdda"},"schema_version":"1.0","source":{"id":"2301.08419","kind":"arxiv","version":2}},"canonical_sha256":"8bc0e6cbfffbbfd53c91b2e5322af3ae15174f955ddaf684866af53330f59b30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bc0e6cbfffbbfd53c91b2e5322af3ae15174f955ddaf684866af53330f59b30","first_computed_at":"2026-07-05T06:09:47.802184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:09:47.802184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O3WPInKAoSLVL/r0rIJrWJZ6r4hDrOaB+EChjEBsGSoynAAPCWWybfvt3uCjSHQwhQC8LRq0bLjsmzaJW03PAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:09:47.802623Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.08419","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:207eed174e45314c95a1df6338eea3f78439d2217336e216f6e5f3def5c075b3","sha256:026aca61dc29002c30d66583223d0ee03ab619f7e0550f6860490b0aebce75f2"],"state_sha256":"067e9ae2e8e86e2cbfa60d757476c14f7cdee6d771b9f8df3a8af8140e1b8e2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bzdxr5Ci7v2XiAc71jmHxoLgfYMlD9/HtZwh/bc1DL1PkZwTQ7LE60uJiWhy7COnMw0/mE3sw8co+nXDVFH4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T19:32:24.567719Z","bundle_sha256":"22a1244cfd22615c2e80deddac071e225243f4eb09de5cf27f70d97037c4de18"}}