{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L6VNZFUC4H22GMXBC5UTTLCWDX","short_pith_number":"pith:L6VNZFUC","schema_version":"1.0","canonical_sha256":"5faadc9682e1f5a332e1176939ac561dd405b7305e97122ce6180ec93a9dd57b","source":{"kind":"arxiv","id":"2607.04073","version":1},"attestation_state":"computed","paper":{"title":"Quasipolynomial Trace Reconstruction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Arnav Burudgunte, Hongao Wang, Paul Valiant","submitted_at":"2026-07-05T01:33:16Z","abstract_excerpt":"We show that trace reconstruction on n-bit strings is possible using a quasipolynomial number of traces, for any retention probability p that is at least inverse polylogarithmic in n."},"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":"2607.04073","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-05T01:33:16Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"d89556f4ef83e274fdcd836f1e827f1c2c0251a31e4dfabc49fd67a6eaac0d3b","abstract_canon_sha256":"4694c1aa6cd5fc1be5086292b305e18f1100856badb3ac3da19be2816c65b487"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:18:56.080080Z","signature_b64":"iLNi2uShWQyLJ3/X9beUN1zLD2ky56lTA08uRzHpIlxyfr5+B+h2rnpoAGpn5ABnyU9u5xAk0KnhR2u2711sBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5faadc9682e1f5a332e1176939ac561dd405b7305e97122ce6180ec93a9dd57b","last_reissued_at":"2026-07-07T02:18:56.079354Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:18:56.079354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasipolynomial Trace Reconstruction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Arnav Burudgunte, Hongao Wang, Paul Valiant","submitted_at":"2026-07-05T01:33:16Z","abstract_excerpt":"We show that trace reconstruction on n-bit strings is possible using a quasipolynomial number of traces, for any retention probability p that is at least inverse polylogarithmic in n."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04073","kind":"arxiv","version":1},"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/2607.04073/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":"2607.04073","created_at":"2026-07-07T02:18:56.079472+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04073v1","created_at":"2026-07-07T02:18:56.079472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04073","created_at":"2026-07-07T02:18:56.079472+00:00"},{"alias_kind":"pith_short_12","alias_value":"L6VNZFUC4H22","created_at":"2026-07-07T02:18:56.079472+00:00"},{"alias_kind":"pith_short_16","alias_value":"L6VNZFUC4H22GMXB","created_at":"2026-07-07T02:18:56.079472+00:00"},{"alias_kind":"pith_short_8","alias_value":"L6VNZFUC","created_at":"2026-07-07T02:18:56.079472+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L6VNZFUC4H22GMXBC5UTTLCWDX","json":"https://pith.science/pith/L6VNZFUC4H22GMXBC5UTTLCWDX.json","graph_json":"https://pith.science/api/pith-number/L6VNZFUC4H22GMXBC5UTTLCWDX/graph.json","events_json":"https://pith.science/api/pith-number/L6VNZFUC4H22GMXBC5UTTLCWDX/events.json","paper":"https://pith.science/paper/L6VNZFUC"},"agent_actions":{"view_html":"https://pith.science/pith/L6VNZFUC4H22GMXBC5UTTLCWDX","download_json":"https://pith.science/pith/L6VNZFUC4H22GMXBC5UTTLCWDX.json","view_paper":"https://pith.science/paper/L6VNZFUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04073&json=true","fetch_graph":"https://pith.science/api/pith-number/L6VNZFUC4H22GMXBC5UTTLCWDX/graph.json","fetch_events":"https://pith.science/api/pith-number/L6VNZFUC4H22GMXBC5UTTLCWDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L6VNZFUC4H22GMXBC5UTTLCWDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L6VNZFUC4H22GMXBC5UTTLCWDX/action/storage_attestation","attest_author":"https://pith.science/pith/L6VNZFUC4H22GMXBC5UTTLCWDX/action/author_attestation","sign_citation":"https://pith.science/pith/L6VNZFUC4H22GMXBC5UTTLCWDX/action/citation_signature","submit_replication":"https://pith.science/pith/L6VNZFUC4H22GMXBC5UTTLCWDX/action/replication_record"}},"created_at":"2026-07-07T02:18:56.079472+00:00","updated_at":"2026-07-07T02:18:56.079472+00:00"}