{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BHOCQTQRHWBIY54NFNU2TY7SBE","short_pith_number":"pith:BHOCQTQR","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"},"canonical_sha256":"09dc284e113d828c778d2b69a9e3f2093707b4b0b9e9fab44ba653183a4d6ec2","source":{"kind":"arxiv","id":"1506.04643","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04643","created_at":"2026-05-18T01:40:57Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04643v3","created_at":"2026-05-18T01:40:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04643","created_at":"2026-05-18T01:40:57Z"},{"alias_kind":"pith_short_12","alias_value":"BHOCQTQRHWBI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BHOCQTQRHWBIY54N","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BHOCQTQR","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BHOCQTQRHWBIY54NFNU2TY7SBE","target":"record","payload":{"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"},"canonical_sha256":"09dc284e113d828c778d2b69a9e3f2093707b4b0b9e9fab44ba653183a4d6ec2","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"},"source_kind":"arxiv","source_id":"1506.04643","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:40:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1nDI/kuKaqyFkw8tl5dey90qFAMvhLvvwRhuk70m883ja6DhlvFJOqJhuuuOA889S+NPuG0Ggbw/r7SjuMP0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:32:52.801121Z"},"content_sha256":"ca39e612b979d1494219acf5ddb0943979bd56acf1013a6913aa8f8e008b71f5","schema_version":"1.0","event_id":"sha256:ca39e612b979d1494219acf5ddb0943979bd56acf1013a6913aa8f8e008b71f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BHOCQTQRHWBIY54NFNU2TY7SBE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:40:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUdUK/+NSAXrWAEkMUyTsO9X2C5i+9G8EWfJ0a88T1bICktQOZ9uiIUeVjM4Jn7rkQSN+v1j9bc3DHj+8JUFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:32:52.801609Z"},"content_sha256":"8ab3b60d2bd1f58a76388f8db61a72793b2683ac287e41e0391e8b85c13688da","schema_version":"1.0","event_id":"sha256:8ab3b60d2bd1f58a76388f8db61a72793b2683ac287e41e0391e8b85c13688da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/bundle.json","state_url":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T21:32:52Z","links":{"resolver":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE","bundle":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/bundle.json","state":"https://pith.science/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHOCQTQRHWBIY54NFNU2TY7SBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BHOCQTQRHWBIY54NFNU2TY7SBE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d612c4dc68452c17d6879f377fc90c6a78dcc5a1700aad8823d8bc641d6443b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-15T15:56:46Z","title_canon_sha256":"765f3d311ee934c599cfd993644f991786e305a91fb0fcfba3ff50f9e0fc91c2"},"schema_version":"1.0","source":{"id":"1506.04643","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04643","created_at":"2026-05-18T01:40:57Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04643v3","created_at":"2026-05-18T01:40:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04643","created_at":"2026-05-18T01:40:57Z"},{"alias_kind":"pith_short_12","alias_value":"BHOCQTQRHWBI","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BHOCQTQRHWBIY54N","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BHOCQTQR","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:8ab3b60d2bd1f58a76388f8db61a72793b2683ac287e41e0391e8b85c13688da","target":"graph","created_at":"2026-05-18T01:40:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Devendra Jalihal, R. M. Sundaram, Venkatesh Ramaiyan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-15T15:56:46Z","title":"Asynchronous Communication over a Fading Channel and Additive Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04643","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ca39e612b979d1494219acf5ddb0943979bd56acf1013a6913aa8f8e008b71f5","target":"record","created_at":"2026-05-18T01:40:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d612c4dc68452c17d6879f377fc90c6a78dcc5a1700aad8823d8bc641d6443b0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-15T15:56:46Z","title_canon_sha256":"765f3d311ee934c599cfd993644f991786e305a91fb0fcfba3ff50f9e0fc91c2"},"schema_version":"1.0","source":{"id":"1506.04643","kind":"arxiv","version":3}},"canonical_sha256":"09dc284e113d828c778d2b69a9e3f2093707b4b0b9e9fab44ba653183a4d6ec2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09dc284e113d828c778d2b69a9e3f2093707b4b0b9e9fab44ba653183a4d6ec2","first_computed_at":"2026-05-18T01:40:57.905580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:40:57.905580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f53Np+8Y6BjgdehtNpd75/+XzzPuHrNCEzpX2T35YqhDYDWe0lmPKtSv/D2u8SPfDKu5AT37IsQH9r+XPe7oBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:40:57.906383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04643","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca39e612b979d1494219acf5ddb0943979bd56acf1013a6913aa8f8e008b71f5","sha256:8ab3b60d2bd1f58a76388f8db61a72793b2683ac287e41e0391e8b85c13688da"],"state_sha256":"6b3f21b7d308b1ab9fe1d5bd0fd70d6fc46c2503aa4b55d9f89effd8efd030a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XmURL+7zdqbqbDiTWKOxZt1fobMpipkASYBuxHyYIYdYnZwIOYd6O8y7G3RgtHncK8O2lfig06cBx2B1TDX+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T21:32:52.804364Z","bundle_sha256":"e572f1ed7e0d1d08ac723b696a2041b821d7e193cd54c8c1a7e33d4e524affd5"}}