{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:72VTN77UFA22XSXISDKWDOGTY6","short_pith_number":"pith:72VTN77U","schema_version":"1.0","canonical_sha256":"feab36fff42835abcae890d561b8d3c784c4db890046be5af15654173bc1c544","source":{"kind":"arxiv","id":"1710.09795","version":2},"attestation_state":"computed","paper":{"title":"Synchronization Strings: Explicit Constructions, Local Decoding, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Amirbehshad Shahrasbi, Bernhard Haeupler","submitted_at":"2017-10-26T16:31:56Z","abstract_excerpt":"This paper gives new results for synchronization strings, a powerful combinatorial object that allows to efficiently deal with insertions and deletions in various communication settings:\n  $\\bullet$ We give a deterministic, linear time synchronization string construction, improving over an $O(n^5)$ time randomized construction. Independently of this work, a deterministic $O(n\\log^2\\log n)$ time construction was just put on arXiv by Cheng, Li, and Wu. We also give a deterministic linear time construction of an infinite synchronization string, which was not known to be computable before. Both co"},"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":"1710.09795","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-26T16:31:56Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"a354ee8aa777811e41dfd825c0966940a64d8b40669619c832c0e49d6ca0ea64","abstract_canon_sha256":"8fdd90755ec7fe3fb97af48286390591a5f98ee1c0dda20bb37b8b198e1b347a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:54.465305Z","signature_b64":"LYJGkeaIh//l4ULsowTXHpef7xR6zddzuIUiuVmlHaoSHTH/k9Fy6FrcWvDEZZqqD0BfAI18iL6xAbYAINh3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feab36fff42835abcae890d561b8d3c784c4db890046be5af15654173bc1c544","last_reissued_at":"2026-05-18T00:30:54.464729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:54.464729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synchronization Strings: Explicit Constructions, Local Decoding, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Amirbehshad Shahrasbi, Bernhard Haeupler","submitted_at":"2017-10-26T16:31:56Z","abstract_excerpt":"This paper gives new results for synchronization strings, a powerful combinatorial object that allows to efficiently deal with insertions and deletions in various communication settings:\n  $\\bullet$ We give a deterministic, linear time synchronization string construction, improving over an $O(n^5)$ time randomized construction. Independently of this work, a deterministic $O(n\\log^2\\log n)$ time construction was just put on arXiv by Cheng, Li, and Wu. We also give a deterministic linear time construction of an infinite synchronization string, which was not known to be computable before. Both co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09795","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":""},"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":"1710.09795","created_at":"2026-05-18T00:30:54.464814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09795v2","created_at":"2026-05-18T00:30:54.464814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09795","created_at":"2026-05-18T00:30:54.464814+00:00"},{"alias_kind":"pith_short_12","alias_value":"72VTN77UFA22","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"72VTN77UFA22XSXI","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"72VTN77U","created_at":"2026-05-18T12:31:03.183658+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/72VTN77UFA22XSXISDKWDOGTY6","json":"https://pith.science/pith/72VTN77UFA22XSXISDKWDOGTY6.json","graph_json":"https://pith.science/api/pith-number/72VTN77UFA22XSXISDKWDOGTY6/graph.json","events_json":"https://pith.science/api/pith-number/72VTN77UFA22XSXISDKWDOGTY6/events.json","paper":"https://pith.science/paper/72VTN77U"},"agent_actions":{"view_html":"https://pith.science/pith/72VTN77UFA22XSXISDKWDOGTY6","download_json":"https://pith.science/pith/72VTN77UFA22XSXISDKWDOGTY6.json","view_paper":"https://pith.science/paper/72VTN77U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09795&json=true","fetch_graph":"https://pith.science/api/pith-number/72VTN77UFA22XSXISDKWDOGTY6/graph.json","fetch_events":"https://pith.science/api/pith-number/72VTN77UFA22XSXISDKWDOGTY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72VTN77UFA22XSXISDKWDOGTY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72VTN77UFA22XSXISDKWDOGTY6/action/storage_attestation","attest_author":"https://pith.science/pith/72VTN77UFA22XSXISDKWDOGTY6/action/author_attestation","sign_citation":"https://pith.science/pith/72VTN77UFA22XSXISDKWDOGTY6/action/citation_signature","submit_replication":"https://pith.science/pith/72VTN77UFA22XSXISDKWDOGTY6/action/replication_record"}},"created_at":"2026-05-18T00:30:54.464814+00:00","updated_at":"2026-05-18T00:30:54.464814+00:00"}