{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC","short_pith_number":"pith:D5ZZ4XWF","canonical_record":{"source":{"id":"1206.0418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-03T03:25:18Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"8f0eae9c9338fa54ff9fb3c9f91175a1313c4a09577f526ff59401c4614e10a1","abstract_canon_sha256":"108705a542a96c7ad9a941f4b007980fd719938b1eb6ecba542750b4baff5363"},"schema_version":"1.0"},"canonical_sha256":"1f739e5ec5ec19c317aeb3bb90c3d258a9b86a3d0910f3e43559ebabdbf2d356","source":{"kind":"arxiv","id":"1206.0418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0418","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0418v1","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0418","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"pith_short_12","alias_value":"D5ZZ4XWF5QM4","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"D5ZZ4XWF5QM4GF5O","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"D5ZZ4XWF","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC","target":"record","payload":{"canonical_record":{"source":{"id":"1206.0418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-03T03:25:18Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"8f0eae9c9338fa54ff9fb3c9f91175a1313c4a09577f526ff59401c4614e10a1","abstract_canon_sha256":"108705a542a96c7ad9a941f4b007980fd719938b1eb6ecba542750b4baff5363"},"schema_version":"1.0"},"canonical_sha256":"1f739e5ec5ec19c317aeb3bb90c3d258a9b86a3d0910f3e43559ebabdbf2d356","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:17.730806Z","signature_b64":"LOIf1Kupx+HGaKACWlT1gI8LVVdWVcObVAk3qOZ4WaUw2kaAUlGIQYNcyyL3X/OhS8kBeaZlxWsjbyYQyxOPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f739e5ec5ec19c317aeb3bb90c3d258a9b86a3d0910f3e43559ebabdbf2d356","last_reissued_at":"2026-05-18T03:54:17.729587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:17.729587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.0418","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-18T03:54:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQR+Lek5OkDX8/Gzs6DwumlG1D5KbyjIvwnPHFhz1hfnCEHdAdMUAFxc7Sw5FFPQoOFa/z9pWuzBQJj8gPphCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:39:41.183436Z"},"content_sha256":"5e991b38e134a6db0c6341ac8e780e0df8e941d461b316d4799a6b2b2b088d2c","schema_version":"1.0","event_id":"sha256:5e991b38e134a6db0c6341ac8e780e0df8e941d461b316d4799a6b2b2b088d2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Devavrat Shah, Hari Balakrishnan, Jonathan Perry, Peter Iannucci","submitted_at":"2012-06-03T03:25:18Z","abstract_excerpt":"This paper presents an analysis of spinal codes, a class of rateless codes proposed recently. We prove that spinal codes achieve Shannon capacity for the binary symmetric channel (BSC) and the additive white Gaussian noise (AWGN) channel with an efficient polynomial-time encoder and decoder. They are the first rateless codes with proofs of these properties for BSC and AWGN. The key idea in the spinal code is the sequential application of a hash function over the message bits. The sequential structure of the code turns out to be crucial for efficient decoding. Moreover, counter to the wisdom of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0418","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-18T03:54:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pv5R0PKT3fSakyHqZ2nqg8h0Zd3A83LEamh9EE9j5dJYc1fKwJB3/oxs7/tAM7flnCYg8vPnCJTUHZVOri2MAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:39:41.183780Z"},"content_sha256":"dad3200e029104e5ad358df12ac6ad3494208f0eefb6d3a036d3fc1206f5fbc7","schema_version":"1.0","event_id":"sha256:dad3200e029104e5ad358df12ac6ad3494208f0eefb6d3a036d3fc1206f5fbc7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC/bundle.json","state_url":"https://pith.science/pith/D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC/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-03T01:39:41Z","links":{"resolver":"https://pith.science/pith/D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC","bundle":"https://pith.science/pith/D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC/bundle.json","state":"https://pith.science/pith/D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:D5ZZ4XWF5QM4GF5OWO5ZBQ6SLC","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":"108705a542a96c7ad9a941f4b007980fd719938b1eb6ecba542750b4baff5363","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-03T03:25:18Z","title_canon_sha256":"8f0eae9c9338fa54ff9fb3c9f91175a1313c4a09577f526ff59401c4614e10a1"},"schema_version":"1.0","source":{"id":"1206.0418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0418","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0418v1","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0418","created_at":"2026-05-18T03:54:17Z"},{"alias_kind":"pith_short_12","alias_value":"D5ZZ4XWF5QM4","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"D5ZZ4XWF5QM4GF5O","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"D5ZZ4XWF","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:dad3200e029104e5ad358df12ac6ad3494208f0eefb6d3a036d3fc1206f5fbc7","target":"graph","created_at":"2026-05-18T03:54:17Z","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":"This paper presents an analysis of spinal codes, a class of rateless codes proposed recently. We prove that spinal codes achieve Shannon capacity for the binary symmetric channel (BSC) and the additive white Gaussian noise (AWGN) channel with an efficient polynomial-time encoder and decoder. They are the first rateless codes with proofs of these properties for BSC and AWGN. The key idea in the spinal code is the sequential application of a hash function over the message bits. The sequential structure of the code turns out to be crucial for efficient decoding. Moreover, counter to the wisdom of","authors_text":"Devavrat Shah, Hari Balakrishnan, Jonathan Perry, Peter Iannucci","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-03T03:25:18Z","title":"De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0418","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:5e991b38e134a6db0c6341ac8e780e0df8e941d461b316d4799a6b2b2b088d2c","target":"record","created_at":"2026-05-18T03:54:17Z","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":"108705a542a96c7ad9a941f4b007980fd719938b1eb6ecba542750b4baff5363","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-03T03:25:18Z","title_canon_sha256":"8f0eae9c9338fa54ff9fb3c9f91175a1313c4a09577f526ff59401c4614e10a1"},"schema_version":"1.0","source":{"id":"1206.0418","kind":"arxiv","version":1}},"canonical_sha256":"1f739e5ec5ec19c317aeb3bb90c3d258a9b86a3d0910f3e43559ebabdbf2d356","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f739e5ec5ec19c317aeb3bb90c3d258a9b86a3d0910f3e43559ebabdbf2d356","first_computed_at":"2026-05-18T03:54:17.729587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:17.729587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LOIf1Kupx+HGaKACWlT1gI8LVVdWVcObVAk3qOZ4WaUw2kaAUlGIQYNcyyL3X/OhS8kBeaZlxWsjbyYQyxOPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:17.730806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.0418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e991b38e134a6db0c6341ac8e780e0df8e941d461b316d4799a6b2b2b088d2c","sha256:dad3200e029104e5ad358df12ac6ad3494208f0eefb6d3a036d3fc1206f5fbc7"],"state_sha256":"0bee9ae5a1b018feaaaf5a7efc9ea88adb01b09b022887d233be807e6742402b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DKRdK4S2pxNYgj3Fc/cUJCwkIf88okefItj0bvkvmUaoAICqQpC3plhMaSE3Msvis6ttENgJ9CaItSR7/CI/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:39:41.185641Z","bundle_sha256":"1ac6d55a686045c6652fec5cd87636af3648b71f1e4110f2d572651108a99fc7"}}