{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BHOCQTQRHWBIY54NFNU2TY7SBE","short_pith_number":"pith:BHOCQTQR","schema_version":"1.0","canonical_sha256":"09dc284e113d828c778d2b69a9e3f2093707b4b0b9e9fab44ba653183a4d6ec2","source":{"kind":"arxiv","id":"1506.04643","version":3},"attestation_state":"computed","paper":{"title":"Asynchronous Communication over a Fading Channel and Additive Noise","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":"2015-06-15T15:56:46Z","abstract_excerpt":"In \\cite{Chandar2008}, Chandar et al studied a problem of sequential frame synchronization for a frame transmitted randomly and uniformly among $A$ slots. For a discrete memory-less channel (DMC), they showed that the frame length $N$ must scale as $e^{\\alpha(Q)N}>A$ for the frame detection error to go to zero asymptotically with $A$. $\\alpha(Q)$ is the synchronization threshold and $Q$ is channel transition probability. We study the sequential frame synchronisation problem for a fading channel and additive noise and seek to characterise the effect of fading. For a discrete ON-OFF fading chann"},"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":"1506.04643","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-15T15:56:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"765f3d311ee934c599cfd993644f991786e305a91fb0fcfba3ff50f9e0fc91c2","abstract_canon_sha256":"d612c4dc68452c17d6879f377fc90c6a78dcc5a1700aad8823d8bc641d6443b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:57.906383Z","signature_b64":"f53Np+8Y6BjgdehtNpd75/+XzzPuHrNCEzpX2T35YqhDYDWe0lmPKtSv/D2u8SPfDKu5AT37IsQH9r+XPe7oBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09dc284e113d828c778d2b69a9e3f2093707b4b0b9e9fab44ba653183a4d6ec2","last_reissued_at":"2026-05-18T01:40:57.905580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:57.905580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Communication over a Fading Channel and Additive Noise","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":"2015-06-15T15:56:46Z","abstract_excerpt":"In \\cite{Chandar2008}, Chandar et al studied a problem of sequential frame synchronization for a frame transmitted randomly and uniformly among $A$ slots. For a discrete memory-less channel (DMC), they showed that the frame length $N$ must scale as $e^{\\alpha(Q)N}>A$ for the frame detection error to go to zero asymptotically with $A$. $\\alpha(Q)$ is the synchronization threshold and $Q$ is channel transition probability. We study the sequential frame synchronisation problem for a fading channel and additive noise and seek to characterise the effect of fading. For a discrete ON-OFF fading chann"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04643","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":""},"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":"1506.04643","created_at":"2026-05-18T01:40:57.905715+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04643v3","created_at":"2026-05-18T01:40:57.905715+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04643","created_at":"2026-05-18T01:40:57.905715+00:00"},{"alias_kind":"pith_short_12","alias_value":"BHOCQTQRHWBI","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BHOCQTQRHWBIY54N","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BHOCQTQR","created_at":"2026-05-18T12:29:14.074870+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/BHOCQTQRHWBIY54NFNU2TY7SBE","json":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE.json","graph_json":"https://pith.science/api/pith-number/BHOCQTQRHWBIY54NFNU2TY7SBE/graph.json","events_json":"https://pith.science/api/pith-number/BHOCQTQRHWBIY54NFNU2TY7SBE/events.json","paper":"https://pith.science/paper/BHOCQTQR"},"agent_actions":{"view_html":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE","download_json":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE.json","view_paper":"https://pith.science/paper/BHOCQTQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04643&json=true","fetch_graph":"https://pith.science/api/pith-number/BHOCQTQRHWBIY54NFNU2TY7SBE/graph.json","fetch_events":"https://pith.science/api/pith-number/BHOCQTQRHWBIY54NFNU2TY7SBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/action/storage_attestation","attest_author":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/action/author_attestation","sign_citation":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/action/citation_signature","submit_replication":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/action/replication_record"}},"created_at":"2026-05-18T01:40:57.905715+00:00","updated_at":"2026-05-18T01:40:57.905715+00:00"}