{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ET7RQ6SQOPQKUFKAZ3SGUNBX36","short_pith_number":"pith:ET7RQ6SQ","schema_version":"1.0","canonical_sha256":"24ff187a5073e0aa1540cee46a3437dfa2a0ca3eae1cd9007d6f0a6531ed09b3","source":{"kind":"arxiv","id":"1605.05572","version":2},"attestation_state":"computed","paper":{"title":"A General Characterization of Sync Word for Asynchronous Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Devendra Jalihal, R. M. Sundaram, Venkatesh Ramaiyan","submitted_at":"2016-05-18T13:26:22Z","abstract_excerpt":"We study a problem of sequential frame synchronization for a frame transmitted uniformly in $A$ slots. For a discrete memoryless channel (DMC), Venkat Chandar et al showed that the frame length $N$ must scale with $A$ as $e^{N \\alpha(Q)} > A$ for the frame synchronization error to go to zero (asymptotically with $A$). Here, $Q$ denotes the transition probabilities of the DMC and $\\alpha(Q)$, defined as the synchronization threshold, characterizes the scaling needed of $N$ for asymptotic error free frame synchronization. We show that the asynchronous communication framework permits a natural tr"},"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":"1605.05572","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-18T13:26:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a74318cf47f94930af0a7dcec6a0d4882547f5f929d79ed1331bf3af1017f468","abstract_canon_sha256":"41dc4b0229c539e1fa5734c39adfeb2601a7823084f8a4cbb031852b0bcb64e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:28.552435Z","signature_b64":"BQGdYEoyPZ5BQccHQch5oPcHilr2AK+09/fKk6SpIh570tFjhX1v4Jaw3uRu8tlAqKnkgXKXSWzhAgIfmEOgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24ff187a5073e0aa1540cee46a3437dfa2a0ca3eae1cd9007d6f0a6531ed09b3","last_reissued_at":"2026-05-18T01:14:28.551777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:28.551777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Characterization of Sync Word for Asynchronous Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Devendra Jalihal, R. M. Sundaram, Venkatesh Ramaiyan","submitted_at":"2016-05-18T13:26:22Z","abstract_excerpt":"We study a problem of sequential frame synchronization for a frame transmitted uniformly in $A$ slots. For a discrete memoryless channel (DMC), Venkat Chandar et al showed that the frame length $N$ must scale with $A$ as $e^{N \\alpha(Q)} > A$ for the frame synchronization error to go to zero (asymptotically with $A$). Here, $Q$ denotes the transition probabilities of the DMC and $\\alpha(Q)$, defined as the synchronization threshold, characterizes the scaling needed of $N$ for asymptotic error free frame synchronization. We show that the asynchronous communication framework permits a natural tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05572","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":"1605.05572","created_at":"2026-05-18T01:14:28.551853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05572v2","created_at":"2026-05-18T01:14:28.551853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05572","created_at":"2026-05-18T01:14:28.551853+00:00"},{"alias_kind":"pith_short_12","alias_value":"ET7RQ6SQOPQK","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"ET7RQ6SQOPQKUFKA","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"ET7RQ6SQ","created_at":"2026-05-18T12:30:15.759754+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/ET7RQ6SQOPQKUFKAZ3SGUNBX36","json":"https://pith.science/pith/ET7RQ6SQOPQKUFKAZ3SGUNBX36.json","graph_json":"https://pith.science/api/pith-number/ET7RQ6SQOPQKUFKAZ3SGUNBX36/graph.json","events_json":"https://pith.science/api/pith-number/ET7RQ6SQOPQKUFKAZ3SGUNBX36/events.json","paper":"https://pith.science/paper/ET7RQ6SQ"},"agent_actions":{"view_html":"https://pith.science/pith/ET7RQ6SQOPQKUFKAZ3SGUNBX36","download_json":"https://pith.science/pith/ET7RQ6SQOPQKUFKAZ3SGUNBX36.json","view_paper":"https://pith.science/paper/ET7RQ6SQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05572&json=true","fetch_graph":"https://pith.science/api/pith-number/ET7RQ6SQOPQKUFKAZ3SGUNBX36/graph.json","fetch_events":"https://pith.science/api/pith-number/ET7RQ6SQOPQKUFKAZ3SGUNBX36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ET7RQ6SQOPQKUFKAZ3SGUNBX36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ET7RQ6SQOPQKUFKAZ3SGUNBX36/action/storage_attestation","attest_author":"https://pith.science/pith/ET7RQ6SQOPQKUFKAZ3SGUNBX36/action/author_attestation","sign_citation":"https://pith.science/pith/ET7RQ6SQOPQKUFKAZ3SGUNBX36/action/citation_signature","submit_replication":"https://pith.science/pith/ET7RQ6SQOPQKUFKAZ3SGUNBX36/action/replication_record"}},"created_at":"2026-05-18T01:14:28.551853+00:00","updated_at":"2026-05-18T01:14:28.551853+00:00"}