{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XDVBSFNIWVMPO6CPPP4YF4FZOQ","short_pith_number":"pith:XDVBSFNI","canonical_record":{"source":{"id":"2406.08491","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-20T13:36:59Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8e337aa5834c99bca22913388b95d528a0b5af34fc84609c7d72b692cdce7b52","abstract_canon_sha256":"ed387ce2477297950746777b436c8f213bad00787e20cdef3dc5c370c286b3be"},"schema_version":"1.0"},"canonical_sha256":"b8ea1915a8b558f7784f7bf982f0b97400cdaa4bdb205b190549049d2c2f3184","source":{"kind":"arxiv","id":"2406.08491","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.08491","created_at":"2026-07-05T09:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"2406.08491v2","created_at":"2026-07-05T09:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.08491","created_at":"2026-07-05T09:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"XDVBSFNIWVMP","created_at":"2026-07-05T09:14:34Z"},{"alias_kind":"pith_short_16","alias_value":"XDVBSFNIWVMPO6CP","created_at":"2026-07-05T09:14:34Z"},{"alias_kind":"pith_short_8","alias_value":"XDVBSFNI","created_at":"2026-07-05T09:14:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XDVBSFNIWVMPO6CPPP4YF4FZOQ","target":"record","payload":{"canonical_record":{"source":{"id":"2406.08491","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-20T13:36:59Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8e337aa5834c99bca22913388b95d528a0b5af34fc84609c7d72b692cdce7b52","abstract_canon_sha256":"ed387ce2477297950746777b436c8f213bad00787e20cdef3dc5c370c286b3be"},"schema_version":"1.0"},"canonical_sha256":"b8ea1915a8b558f7784f7bf982f0b97400cdaa4bdb205b190549049d2c2f3184","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:34.217611Z","signature_b64":"HUjtvsSKu4rYE77Ga7DEHJV6BMIneUxVJvwFkB0mZ7n2oYskER6+F6ZLSRO35J0wQGKBZYF8x7uTu+2PnmZoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8ea1915a8b558f7784f7bf982f0b97400cdaa4bdb205b190549049d2c2f3184","last_reissued_at":"2026-07-05T09:14:34.217118Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:34.217118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.08491","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-05T09:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elj09v18j7LFCGio4A1MQ8e7ExZuwaFLl2Aor3PBQYGzq5fPD7h/SRvG8g1Bc3WpdfRJsvxlJ2OmRcsmjq6rCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:55:49.616200Z"},"content_sha256":"7ef2d05acfc91a8c45d7d644aa800aea0532884a30b1aea4b49ad4bf7153564c","schema_version":"1.0","event_id":"sha256:7ef2d05acfc91a8c45d7d644aa800aea0532884a30b1aea4b49ad4bf7153564c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XDVBSFNIWVMPO6CPPP4YF4FZOQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FPGA-based Distributed Union-Find Decoder for Surface Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Lin Zhong, Namitha Liyanage, Siona Tagare, Yue Wu","submitted_at":"2024-03-20T13:36:59Z","abstract_excerpt":"A fault-tolerant quantum computer must decode and correct errors faster than they appear to prevent exponential slowdown due to error correction. 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 time per measurement round de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.08491","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/2406.08491/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-05T09:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r71C8lsHMisixGvu7BuVZx1yixT4mkBOINA/nb3T0g195qrP/9LDGKHTngVyfKIvAYHTzWBS1JTzQLP36PLqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:55:49.616701Z"},"content_sha256":"ea0359548bf0012201e3572d7d0be4ace9c52aee6bf94f1f89c60c74693572f3","schema_version":"1.0","event_id":"sha256:ea0359548bf0012201e3572d7d0be4ace9c52aee6bf94f1f89c60c74693572f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDVBSFNIWVMPO6CPPP4YF4FZOQ/bundle.json","state_url":"https://pith.science/pith/XDVBSFNIWVMPO6CPPP4YF4FZOQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDVBSFNIWVMPO6CPPP4YF4FZOQ/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-08T20:55:49Z","links":{"resolver":"https://pith.science/pith/XDVBSFNIWVMPO6CPPP4YF4FZOQ","bundle":"https://pith.science/pith/XDVBSFNIWVMPO6CPPP4YF4FZOQ/bundle.json","state":"https://pith.science/pith/XDVBSFNIWVMPO6CPPP4YF4FZOQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDVBSFNIWVMPO6CPPP4YF4FZOQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XDVBSFNIWVMPO6CPPP4YF4FZOQ","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":"ed387ce2477297950746777b436c8f213bad00787e20cdef3dc5c370c286b3be","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-20T13:36:59Z","title_canon_sha256":"8e337aa5834c99bca22913388b95d528a0b5af34fc84609c7d72b692cdce7b52"},"schema_version":"1.0","source":{"id":"2406.08491","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.08491","created_at":"2026-07-05T09:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"2406.08491v2","created_at":"2026-07-05T09:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.08491","created_at":"2026-07-05T09:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"XDVBSFNIWVMP","created_at":"2026-07-05T09:14:34Z"},{"alias_kind":"pith_short_16","alias_value":"XDVBSFNIWVMPO6CP","created_at":"2026-07-05T09:14:34Z"},{"alias_kind":"pith_short_8","alias_value":"XDVBSFNI","created_at":"2026-07-05T09:14:34Z"}],"graph_snapshots":[{"event_id":"sha256:ea0359548bf0012201e3572d7d0be4ace9c52aee6bf94f1f89c60c74693572f3","target":"graph","created_at":"2026-07-05T09:14:34Z","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/2406.08491/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 to prevent exponential slowdown due to error correction. 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 time per measurement round de","authors_text":"Lin Zhong, Namitha Liyanage, Siona Tagare, Yue Wu","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-20T13:36:59Z","title":"FPGA-based Distributed Union-Find Decoder for Surface Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.08491","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:7ef2d05acfc91a8c45d7d644aa800aea0532884a30b1aea4b49ad4bf7153564c","target":"record","created_at":"2026-07-05T09:14:34Z","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":"ed387ce2477297950746777b436c8f213bad00787e20cdef3dc5c370c286b3be","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-20T13:36:59Z","title_canon_sha256":"8e337aa5834c99bca22913388b95d528a0b5af34fc84609c7d72b692cdce7b52"},"schema_version":"1.0","source":{"id":"2406.08491","kind":"arxiv","version":2}},"canonical_sha256":"b8ea1915a8b558f7784f7bf982f0b97400cdaa4bdb205b190549049d2c2f3184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8ea1915a8b558f7784f7bf982f0b97400cdaa4bdb205b190549049d2c2f3184","first_computed_at":"2026-07-05T09:14:34.217118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:14:34.217118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HUjtvsSKu4rYE77Ga7DEHJV6BMIneUxVJvwFkB0mZ7n2oYskER6+F6ZLSRO35J0wQGKBZYF8x7uTu+2PnmZoCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:14:34.217611Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.08491","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ef2d05acfc91a8c45d7d644aa800aea0532884a30b1aea4b49ad4bf7153564c","sha256:ea0359548bf0012201e3572d7d0be4ace9c52aee6bf94f1f89c60c74693572f3"],"state_sha256":"b3f047f30038c7c4f2ae759a45283d670d98569784f2405a8da697f56ee2666e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"glOQzyp6tELiEtmEV5QuAN7AzPhi1u8qdcJ5sp8QjzqnK+nllYrH33KWA4grtAgLdoUdp+/IcjmBvlYXU/SfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:55:49.621423Z","bundle_sha256":"394476e233b103a2b18d35576264f54b408eb496a6b1f0fd4c9e3534572859e6"}}