{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G3Z42YSFKNKQUGSM7AMIFRHOAF","short_pith_number":"pith:G3Z42YSF","schema_version":"1.0","canonical_sha256":"36f3cd624553550a1a4cf81882c4ee015b81905bb6deae2e0a949ed83b5e9c94","source":{"kind":"arxiv","id":"2503.13601","version":3},"attestation_state":"computed","paper":{"title":"Doubly-polylog-time-overhead fault-tolerant quantum computation by a polylog-time parallel minimum-weight perfect matching decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hayata Yamasaki, Yugo Takada","submitted_at":"2025-03-17T18:00:04Z","abstract_excerpt":"Reducing space and time overheads of fault-tolerant quantum computation (FTQC) has been receiving increasing attention as it is crucial for the development of quantum computers and also plays a fundamental role in understanding the feasibility and limitations of realizing quantum advantages. Shorter time overheads are particularly essential for demonstrating quantum computational speedups without compromising runtime advantages. However, surpassing the conventional polylogarithmic (polylog) scaling of time overheads has remained a significant challenge, since it requires addressing all potenti"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2503.13601","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-03-17T18:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"bed83cb3e0bf43109267b3901e679415d339dcf2a159c8fd33244b9b02150bae","abstract_canon_sha256":"def0ac8fbf066d186b75bc9f562b296346074e42220152e851051801f737c0d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:00.328653Z","signature_b64":"TutU4swRMi7N8hXp9sNydbisi6cQOFgt2/vvprzHQngk2bbgeckNUTIhEOskRieaZZJMpO6OSWQvklPOtQgMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36f3cd624553550a1a4cf81882c4ee015b81905bb6deae2e0a949ed83b5e9c94","last_reissued_at":"2026-07-05T11:53:00.328120Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:00.328120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly-polylog-time-overhead fault-tolerant quantum computation by a polylog-time parallel minimum-weight perfect matching decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Hayata Yamasaki, Yugo Takada","submitted_at":"2025-03-17T18:00:04Z","abstract_excerpt":"Reducing space and time overheads of fault-tolerant quantum computation (FTQC) has been receiving increasing attention as it is crucial for the development of quantum computers and also plays a fundamental role in understanding the feasibility and limitations of realizing quantum advantages. Shorter time overheads are particularly essential for demonstrating quantum computational speedups without compromising runtime advantages. However, surpassing the conventional polylogarithmic (polylog) scaling of time overheads has remained a significant challenge, since it requires addressing all potenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.13601","kind":"arxiv","version":3},"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/2503.13601/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2503.13601","created_at":"2026-07-05T11:53:00.328185+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.13601v3","created_at":"2026-07-05T11:53:00.328185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.13601","created_at":"2026-07-05T11:53:00.328185+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3Z42YSFKNKQ","created_at":"2026-07-05T11:53:00.328185+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3Z42YSFKNKQUGSM","created_at":"2026-07-05T11:53:00.328185+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3Z42YSF","created_at":"2026-07-05T11:53:00.328185+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.20238","citing_title":"Proof of a finite threshold for the union-find decoder","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G3Z42YSFKNKQUGSM7AMIFRHOAF","json":"https://pith.science/pith/G3Z42YSFKNKQUGSM7AMIFRHOAF.json","graph_json":"https://pith.science/api/pith-number/G3Z42YSFKNKQUGSM7AMIFRHOAF/graph.json","events_json":"https://pith.science/api/pith-number/G3Z42YSFKNKQUGSM7AMIFRHOAF/events.json","paper":"https://pith.science/paper/G3Z42YSF"},"agent_actions":{"view_html":"https://pith.science/pith/G3Z42YSFKNKQUGSM7AMIFRHOAF","download_json":"https://pith.science/pith/G3Z42YSFKNKQUGSM7AMIFRHOAF.json","view_paper":"https://pith.science/paper/G3Z42YSF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.13601&json=true","fetch_graph":"https://pith.science/api/pith-number/G3Z42YSFKNKQUGSM7AMIFRHOAF/graph.json","fetch_events":"https://pith.science/api/pith-number/G3Z42YSFKNKQUGSM7AMIFRHOAF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3Z42YSFKNKQUGSM7AMIFRHOAF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3Z42YSFKNKQUGSM7AMIFRHOAF/action/storage_attestation","attest_author":"https://pith.science/pith/G3Z42YSFKNKQUGSM7AMIFRHOAF/action/author_attestation","sign_citation":"https://pith.science/pith/G3Z42YSFKNKQUGSM7AMIFRHOAF/action/citation_signature","submit_replication":"https://pith.science/pith/G3Z42YSFKNKQUGSM7AMIFRHOAF/action/replication_record"}},"created_at":"2026-07-05T11:53:00.328185+00:00","updated_at":"2026-07-05T11:53:00.328185+00:00"}