{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HJAFVAVBKE6RBEH24H47TUP3MM","short_pith_number":"pith:HJAFVAVB","canonical_record":{"source":{"id":"1702.00160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-01T08:36:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a4994845bb38330a10fb30efb75cbd8717f1336c0e43699e090efa0955caf7b5","abstract_canon_sha256":"4f79b110ba358422508637c0935c56cf511333e3881a2f487dd41581a37e8fc5"},"schema_version":"1.0"},"canonical_sha256":"3a405a82a1513d1090fae1f9f9d1fb630d6d4f65d87128cbfc971485c13da679","source":{"kind":"arxiv","id":"1702.00160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00160","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00160v1","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00160","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"HJAFVAVBKE6R","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HJAFVAVBKE6RBEH2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HJAFVAVB","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HJAFVAVBKE6RBEH24H47TUP3MM","target":"record","payload":{"canonical_record":{"source":{"id":"1702.00160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-01T08:36:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a4994845bb38330a10fb30efb75cbd8717f1336c0e43699e090efa0955caf7b5","abstract_canon_sha256":"4f79b110ba358422508637c0935c56cf511333e3881a2f487dd41581a37e8fc5"},"schema_version":"1.0"},"canonical_sha256":"3a405a82a1513d1090fae1f9f9d1fb630d6d4f65d87128cbfc971485c13da679","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:35.058685Z","signature_b64":"tmZHpVl3rRqS0K+gkaa9Ivdu3dJpMfwNWXqEKFOYmWM0k8tUSV3p+bMRt/UgvISmEV+FkMEWrHKkqwzPO+HIDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a405a82a1513d1090fae1f9f9d1fb630d6d4f65d87128cbfc971485c13da679","last_reissued_at":"2026-05-18T00:51:35.058297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:35.058297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.00160","source_version":1,"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-18T00:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXgKKqejpTwmtb/hi8Rr8+QcZGnuoTqcLffzQFA/rLr6QT++TWPdEIpXgvGJZFlDObvFcQ/3YAyBgOV+hYkqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:16:08.584757Z"},"content_sha256":"2c021697cd3396bfb14bd03a503a868e56c6a94b727279800432c09b50ea1a35","schema_version":"1.0","event_id":"sha256:2c021697cd3396bfb14bd03a503a868e56c6a94b727279800432c09b50ea1a35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HJAFVAVBKE6RBEH24H47TUP3MM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Short-Message Communication and FIR System Identification using Huffman Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, Peter Jung, Philipp Walk","submitted_at":"2017-02-01T08:36:20Z","abstract_excerpt":"Providing short-message communication and simultaneous channel estimation for sporadic and fast fading scenarios is a challenge for future wireless networks. In this work we propose a novel blind communication and deconvolution scheme by using Huffman sequences, which allows to solve three important tasks in one step: (i) determination of the transmit power (ii) identification of the discrete-time FIR channel by providing a maximum delay of less than $L/2$ and (iii) simultaneously communicating $L-1$ bits of information. Our signal reconstruction uses a recent semi-definite program that can re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00160","kind":"arxiv","version":1},"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-18T00:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aANoUgQ/LxRPp18zF5Y3Wtfv134k153tL9pHdT5F6cFE9tY/ityK3wooJXOx4B9DsYNy3YX24823Bz9aTeZgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:16:08.585122Z"},"content_sha256":"931990cb7898ca4891226b5540f13f361c291e462e089afed52ebaf887fa5b7e","schema_version":"1.0","event_id":"sha256:931990cb7898ca4891226b5540f13f361c291e462e089afed52ebaf887fa5b7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJAFVAVBKE6RBEH24H47TUP3MM/bundle.json","state_url":"https://pith.science/pith/HJAFVAVBKE6RBEH24H47TUP3MM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJAFVAVBKE6RBEH24H47TUP3MM/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-05-30T21:16:08Z","links":{"resolver":"https://pith.science/pith/HJAFVAVBKE6RBEH24H47TUP3MM","bundle":"https://pith.science/pith/HJAFVAVBKE6RBEH24H47TUP3MM/bundle.json","state":"https://pith.science/pith/HJAFVAVBKE6RBEH24H47TUP3MM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJAFVAVBKE6RBEH24H47TUP3MM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HJAFVAVBKE6RBEH24H47TUP3MM","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":"4f79b110ba358422508637c0935c56cf511333e3881a2f487dd41581a37e8fc5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-01T08:36:20Z","title_canon_sha256":"a4994845bb38330a10fb30efb75cbd8717f1336c0e43699e090efa0955caf7b5"},"schema_version":"1.0","source":{"id":"1702.00160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00160","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00160v1","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00160","created_at":"2026-05-18T00:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"HJAFVAVBKE6R","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HJAFVAVBKE6RBEH2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HJAFVAVB","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:931990cb7898ca4891226b5540f13f361c291e462e089afed52ebaf887fa5b7e","target":"graph","created_at":"2026-05-18T00:51:35Z","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":"Providing short-message communication and simultaneous channel estimation for sporadic and fast fading scenarios is a challenge for future wireless networks. In this work we propose a novel blind communication and deconvolution scheme by using Huffman sequences, which allows to solve three important tasks in one step: (i) determination of the transmit power (ii) identification of the discrete-time FIR channel by providing a maximum delay of less than $L/2$ and (iii) simultaneously communicating $L-1$ bits of information. Our signal reconstruction uses a recent semi-definite program that can re","authors_text":"Babak Hassibi, Peter Jung, Philipp Walk","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-01T08:36:20Z","title":"Short-Message Communication and FIR System Identification using Huffman Sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00160","kind":"arxiv","version":1},"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:2c021697cd3396bfb14bd03a503a868e56c6a94b727279800432c09b50ea1a35","target":"record","created_at":"2026-05-18T00:51:35Z","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":"4f79b110ba358422508637c0935c56cf511333e3881a2f487dd41581a37e8fc5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-01T08:36:20Z","title_canon_sha256":"a4994845bb38330a10fb30efb75cbd8717f1336c0e43699e090efa0955caf7b5"},"schema_version":"1.0","source":{"id":"1702.00160","kind":"arxiv","version":1}},"canonical_sha256":"3a405a82a1513d1090fae1f9f9d1fb630d6d4f65d87128cbfc971485c13da679","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a405a82a1513d1090fae1f9f9d1fb630d6d4f65d87128cbfc971485c13da679","first_computed_at":"2026-05-18T00:51:35.058297Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:35.058297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tmZHpVl3rRqS0K+gkaa9Ivdu3dJpMfwNWXqEKFOYmWM0k8tUSV3p+bMRt/UgvISmEV+FkMEWrHKkqwzPO+HIDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:35.058685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c021697cd3396bfb14bd03a503a868e56c6a94b727279800432c09b50ea1a35","sha256:931990cb7898ca4891226b5540f13f361c291e462e089afed52ebaf887fa5b7e"],"state_sha256":"36e5da9b5814076ad26c485af0a985c38685becd5bf0a9518b1326ecf3bb214f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lRVgUfXVzQG4Q+5OUGARXY8ELYMLs0vopsJpMdFUHAoWAvFLupo5kmYuyqKGrRSKDskVdZqLMU+WaUxE97z/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:16:08.587166Z","bundle_sha256":"419626a389c0d4f700ef9a394fcb27bfa54b5c8e4cd9fae13299b1fa4df72e70"}}