{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DDBXRGSCEFV52T4VE7MSDNBQDV","short_pith_number":"pith:DDBXRGSC","canonical_record":{"source":{"id":"1310.0557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-02T03:28:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"554b10f367b78fd378997fc5a9f4d03dc4fd29b1498523f45bf1d3708758352b","abstract_canon_sha256":"9cfd4edf992a33afdedcf0c2c28809f10fc2050d1fed29968e098757aa3b2d96"},"schema_version":"1.0"},"canonical_sha256":"18c3789a42216bdd4f9527d921b4301d5af726c9c03240a8ce815f729d2be468","source":{"kind":"arxiv","id":"1310.0557","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0557","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0557v1","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0557","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"DDBXRGSCEFV5","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DDBXRGSCEFV52T4V","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DDBXRGSC","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DDBXRGSCEFV52T4VE7MSDNBQDV","target":"record","payload":{"canonical_record":{"source":{"id":"1310.0557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-02T03:28:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"554b10f367b78fd378997fc5a9f4d03dc4fd29b1498523f45bf1d3708758352b","abstract_canon_sha256":"9cfd4edf992a33afdedcf0c2c28809f10fc2050d1fed29968e098757aa3b2d96"},"schema_version":"1.0"},"canonical_sha256":"18c3789a42216bdd4f9527d921b4301d5af726c9c03240a8ce815f729d2be468","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:03.718439Z","signature_b64":"tVVwDgURRMGZxfXLUuveDEn2It46OWOWz2BtXMDOzXR+8PZIuvrTFeGnIS62SKvyT1NpG/e4iMqVVhK0M0rMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18c3789a42216bdd4f9527d921b4301d5af726c9c03240a8ce815f729d2be468","last_reissued_at":"2026-05-18T00:59:03.717719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:03.717719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.0557","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:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ovxadavG/ypOGmNFqhUlCDaryJyE4VQnPO1JOqOaegTIDhG4adkfVDhv9JijFpglqI663TlbJGVFHFKQCBG/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:21:29.724568Z"},"content_sha256":"7f6a94584b24073fb61f2d2f38c0170e76b117db53e3b987a7ebfc78a93449fb","schema_version":"1.0","event_id":"sha256:7f6a94584b24073fb61f2d2f38c0170e76b117db53e3b987a7ebfc78a93449fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DDBXRGSCEFV52T4VE7MSDNBQDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Capacity Adaptive Analog Fountain Codes for Wireless Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Branka Vucetic, Mahyar Shirvanimoghaddam, Yonghui Li","submitted_at":"2013-10-02T03:28:51Z","abstract_excerpt":"In this paper, we propose a capacity-approaching analog fountain code (AFC) for wireless channels. In AFC, the number of generated coded symbols is potentially limitless. In contrast to the conventional binary rateless codes, each coded symbol in AFC is a real-valued symbol, generated as a weighted sum of $d$ randomly selected information bits, where $d$ and the weight coefficients are randomly selected from predefined probability mass functions. The coded symbols are then directly transmitted through wireless channels. We analyze the error probability of AFC and design the weight set to minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0557","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:59:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JsWX7KeDbF4M/iIbo2neEk+FR1Vz/KyFJi1RkB+gS100ani4/TbY8GUu/DGCupgx8y69JpdLDdUhZPhjhrXXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:21:29.725007Z"},"content_sha256":"808546779738c4f7619023fcf30eaf7d5e284df03bc534eaeea45be9b7b8044e","schema_version":"1.0","event_id":"sha256:808546779738c4f7619023fcf30eaf7d5e284df03bc534eaeea45be9b7b8044e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDBXRGSCEFV52T4VE7MSDNBQDV/bundle.json","state_url":"https://pith.science/pith/DDBXRGSCEFV52T4VE7MSDNBQDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDBXRGSCEFV52T4VE7MSDNBQDV/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-25T12:21:29Z","links":{"resolver":"https://pith.science/pith/DDBXRGSCEFV52T4VE7MSDNBQDV","bundle":"https://pith.science/pith/DDBXRGSCEFV52T4VE7MSDNBQDV/bundle.json","state":"https://pith.science/pith/DDBXRGSCEFV52T4VE7MSDNBQDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDBXRGSCEFV52T4VE7MSDNBQDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DDBXRGSCEFV52T4VE7MSDNBQDV","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":"9cfd4edf992a33afdedcf0c2c28809f10fc2050d1fed29968e098757aa3b2d96","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-02T03:28:51Z","title_canon_sha256":"554b10f367b78fd378997fc5a9f4d03dc4fd29b1498523f45bf1d3708758352b"},"schema_version":"1.0","source":{"id":"1310.0557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0557","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0557v1","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0557","created_at":"2026-05-18T00:59:03Z"},{"alias_kind":"pith_short_12","alias_value":"DDBXRGSCEFV5","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DDBXRGSCEFV52T4V","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DDBXRGSC","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:808546779738c4f7619023fcf30eaf7d5e284df03bc534eaeea45be9b7b8044e","target":"graph","created_at":"2026-05-18T00:59:03Z","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 this paper, we propose a capacity-approaching analog fountain code (AFC) for wireless channels. In AFC, the number of generated coded symbols is potentially limitless. In contrast to the conventional binary rateless codes, each coded symbol in AFC is a real-valued symbol, generated as a weighted sum of $d$ randomly selected information bits, where $d$ and the weight coefficients are randomly selected from predefined probability mass functions. The coded symbols are then directly transmitted through wireless channels. We analyze the error probability of AFC and design the weight set to minim","authors_text":"Branka Vucetic, Mahyar Shirvanimoghaddam, Yonghui Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-02T03:28:51Z","title":"Near-Capacity Adaptive Analog Fountain Codes for Wireless Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0557","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:7f6a94584b24073fb61f2d2f38c0170e76b117db53e3b987a7ebfc78a93449fb","target":"record","created_at":"2026-05-18T00:59:03Z","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":"9cfd4edf992a33afdedcf0c2c28809f10fc2050d1fed29968e098757aa3b2d96","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-02T03:28:51Z","title_canon_sha256":"554b10f367b78fd378997fc5a9f4d03dc4fd29b1498523f45bf1d3708758352b"},"schema_version":"1.0","source":{"id":"1310.0557","kind":"arxiv","version":1}},"canonical_sha256":"18c3789a42216bdd4f9527d921b4301d5af726c9c03240a8ce815f729d2be468","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18c3789a42216bdd4f9527d921b4301d5af726c9c03240a8ce815f729d2be468","first_computed_at":"2026-05-18T00:59:03.717719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:03.717719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tVVwDgURRMGZxfXLUuveDEn2It46OWOWz2BtXMDOzXR+8PZIuvrTFeGnIS62SKvyT1NpG/e4iMqVVhK0M0rMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:03.718439Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f6a94584b24073fb61f2d2f38c0170e76b117db53e3b987a7ebfc78a93449fb","sha256:808546779738c4f7619023fcf30eaf7d5e284df03bc534eaeea45be9b7b8044e"],"state_sha256":"4e559cd00d8b56d15e3bdfdf8ad889b51ce16873233dd40f75a547827ebf770d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+JQrGR4OeTaTjrPFjAlMAhOH32pZ4ROXn442ay+XwLiCQURsYyelNPIODR+yYGKsK1TkkVu5qxbLFivWHE4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:21:29.727238Z","bundle_sha256":"210993254ad7f1cdc13a0fb37c85657216316873bc746a242dad5bd47aae35c7"}}