{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TSHMSHPXQGGFDY3ENNFPOWYCUX","short_pith_number":"pith:TSHMSHPX","schema_version":"1.0","canonical_sha256":"9c8ec91df7818c51e3646b4af75b02a5fb2ddbe4e6b7fec594cb76e26223b104","source":{"kind":"arxiv","id":"1905.03031","version":2},"attestation_state":"computed","paper":{"title":"New Lower Bounds for Trace Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Zachary Chase","submitted_at":"2019-05-08T12:28:01Z","abstract_excerpt":"We improve the lower bound on worst case trace reconstruction from $\\Omega\\left(\\frac{n^{5/4}}{\\sqrt{\\log n}}\\right)$ to $\\Omega\\left(\\frac{n^{3/2}}{\\log^{7} n}\\right)$. As a consequence, we improve the lower bound on average case trace reconstruction from $\\Omega\\left(\\frac{\\log^{9/4}n}{\\sqrt{\\log\\log n}}\\right)$ to $\\Omega\\left(\\frac{\\log^{5/2}n}{(\\log\\log n)^{7}}\\right)$."},"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":"1905.03031","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-05-08T12:28:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ccaa9405c2280949859b86ab765c1b880f06f48467a73753ee03b7e0ba267246","abstract_canon_sha256":"844254542325ba315562e92e5de5dc2f5cd467b91cefacb2de5361143ab085b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:33.972757Z","signature_b64":"Bva8Q+fzfbDwLpTeiJvoQP6NrdWvN8i8dQGJmPovonl6FnuPU3xZIdwnpLbsffFF+9brpSUnv6Ws4zb3KJOoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c8ec91df7818c51e3646b4af75b02a5fb2ddbe4e6b7fec594cb76e26223b104","last_reissued_at":"2026-07-05T01:21:33.972251Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:33.972251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Lower Bounds for Trace Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Zachary Chase","submitted_at":"2019-05-08T12:28:01Z","abstract_excerpt":"We improve the lower bound on worst case trace reconstruction from $\\Omega\\left(\\frac{n^{5/4}}{\\sqrt{\\log n}}\\right)$ to $\\Omega\\left(\\frac{n^{3/2}}{\\log^{7} n}\\right)$. As a consequence, we improve the lower bound on average case trace reconstruction from $\\Omega\\left(\\frac{\\log^{9/4}n}{\\sqrt{\\log\\log n}}\\right)$ to $\\Omega\\left(\\frac{\\log^{5/2}n}{(\\log\\log n)^{7}}\\right)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03031","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/1905.03031/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":"1905.03031","created_at":"2026-07-05T01:21:33.972309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03031v2","created_at":"2026-07-05T01:21:33.972309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03031","created_at":"2026-07-05T01:21:33.972309+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSHMSHPXQGGF","created_at":"2026-07-05T01:21:33.972309+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSHMSHPXQGGFDY3E","created_at":"2026-07-05T01:21:33.972309+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSHMSHPX","created_at":"2026-07-05T01:21:33.972309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.00674","citing_title":"A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TSHMSHPXQGGFDY3ENNFPOWYCUX","json":"https://pith.science/pith/TSHMSHPXQGGFDY3ENNFPOWYCUX.json","graph_json":"https://pith.science/api/pith-number/TSHMSHPXQGGFDY3ENNFPOWYCUX/graph.json","events_json":"https://pith.science/api/pith-number/TSHMSHPXQGGFDY3ENNFPOWYCUX/events.json","paper":"https://pith.science/paper/TSHMSHPX"},"agent_actions":{"view_html":"https://pith.science/pith/TSHMSHPXQGGFDY3ENNFPOWYCUX","download_json":"https://pith.science/pith/TSHMSHPXQGGFDY3ENNFPOWYCUX.json","view_paper":"https://pith.science/paper/TSHMSHPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03031&json=true","fetch_graph":"https://pith.science/api/pith-number/TSHMSHPXQGGFDY3ENNFPOWYCUX/graph.json","fetch_events":"https://pith.science/api/pith-number/TSHMSHPXQGGFDY3ENNFPOWYCUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSHMSHPXQGGFDY3ENNFPOWYCUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSHMSHPXQGGFDY3ENNFPOWYCUX/action/storage_attestation","attest_author":"https://pith.science/pith/TSHMSHPXQGGFDY3ENNFPOWYCUX/action/author_attestation","sign_citation":"https://pith.science/pith/TSHMSHPXQGGFDY3ENNFPOWYCUX/action/citation_signature","submit_replication":"https://pith.science/pith/TSHMSHPXQGGFDY3ENNFPOWYCUX/action/replication_record"}},"created_at":"2026-07-05T01:21:33.972309+00:00","updated_at":"2026-07-05T01:21:33.972309+00:00"}