{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DBK6D33WUS4IM7ZK2WKIFVZJ7Q","short_pith_number":"pith:DBK6D33W","canonical_record":{"source":{"id":"1706.08739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-27T09:12:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aa6cae7217c1e01ba6d24db4f1e0c368084899e644f53dd3c6f337ea4f775ac8","abstract_canon_sha256":"635fee39a750d9cb7b4c3a3daf7c05677075b9c32ca28611cfab63fa44fc4e35"},"schema_version":"1.0"},"canonical_sha256":"1855e1ef76a4b8867f2ad59482d729fc024e0f131d32129d695283cff5ae06e6","source":{"kind":"arxiv","id":"1706.08739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08739","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08739v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08739","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"DBK6D33WUS4I","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DBK6D33WUS4IM7ZK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DBK6D33W","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DBK6D33WUS4IM7ZK2WKIFVZJ7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-27T09:12:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"aa6cae7217c1e01ba6d24db4f1e0c368084899e644f53dd3c6f337ea4f775ac8","abstract_canon_sha256":"635fee39a750d9cb7b4c3a3daf7c05677075b9c32ca28611cfab63fa44fc4e35"},"schema_version":"1.0"},"canonical_sha256":"1855e1ef76a4b8867f2ad59482d729fc024e0f131d32129d695283cff5ae06e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.172737Z","signature_b64":"b/fS/7FnTnxIFE5B5LEP0UjfozcDCoIzU5zPoHDhKXO5QNJG+3/rdgjBYopVyjehcoaMItZ/hSxt/lHf3oztDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1855e1ef76a4b8867f2ad59482d729fc024e0f131d32129d695283cff5ae06e6","last_reissued_at":"2026-05-18T00:41:31.172080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.172080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08739","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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8EBG6EetIVixWXd9DhbwjDcSdl9sfDNKeyybZdNGvpBDhFdA4e2sZICPOjbN+lJKRPFGsL0ILi0Ye2tfRlflCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:25:26.546537Z"},"content_sha256":"fc42e1da1a429be32f263ebce3eecb27e08bf624b2a27662a2d4d84c8e47c625","schema_version":"1.0","event_id":"sha256:fc42e1da1a429be32f263ebce3eecb27e08bf624b2a27662a2d4d84c8e47c625"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DBK6D33WUS4IM7ZK2WKIFVZJ7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fountain Codes under Maximum Likelihood Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Francisco L\\'azaro","submitted_at":"2017-06-27T09:12:38Z","abstract_excerpt":"This dissertation focuses on fountain codes under maximum likelihood (ML) decoding. First LT codes are considered under a practical and widely used ML decoding algorithm known as inactivation decoding. Different analysis techniques are presented to characterize the decoding complexity. Next an upper bound to the probability of decoding failure of Raptor codes under ML decoding is provided. Then, the distance properties of an ensemble of fixed-rate Raptor codes with linear random outer codes are analyzed. Finally, a novel class of fountain codes is presented, which consists of a parallel concat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08739","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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZt+4/FyM/tf1xtb0slwv0VC205I0wOQuf3yQfiS98xcvJi6/W8pioC99VDP6ecOJfRyqRvSkWtUYyxcn/9uBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:25:26.546892Z"},"content_sha256":"67250440468353ad225369d5711eb94746ac7f3656ebed30ab8724738c6a59df","schema_version":"1.0","event_id":"sha256:67250440468353ad225369d5711eb94746ac7f3656ebed30ab8724738c6a59df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBK6D33WUS4IM7ZK2WKIFVZJ7Q/bundle.json","state_url":"https://pith.science/pith/DBK6D33WUS4IM7ZK2WKIFVZJ7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBK6D33WUS4IM7ZK2WKIFVZJ7Q/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-02T08:25:26Z","links":{"resolver":"https://pith.science/pith/DBK6D33WUS4IM7ZK2WKIFVZJ7Q","bundle":"https://pith.science/pith/DBK6D33WUS4IM7ZK2WKIFVZJ7Q/bundle.json","state":"https://pith.science/pith/DBK6D33WUS4IM7ZK2WKIFVZJ7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBK6D33WUS4IM7ZK2WKIFVZJ7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DBK6D33WUS4IM7ZK2WKIFVZJ7Q","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":"635fee39a750d9cb7b4c3a3daf7c05677075b9c32ca28611cfab63fa44fc4e35","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-27T09:12:38Z","title_canon_sha256":"aa6cae7217c1e01ba6d24db4f1e0c368084899e644f53dd3c6f337ea4f775ac8"},"schema_version":"1.0","source":{"id":"1706.08739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08739","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08739v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08739","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"DBK6D33WUS4I","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DBK6D33WUS4IM7ZK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DBK6D33W","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:67250440468353ad225369d5711eb94746ac7f3656ebed30ab8724738c6a59df","target":"graph","created_at":"2026-05-18T00:41:31Z","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 dissertation focuses on fountain codes under maximum likelihood (ML) decoding. First LT codes are considered under a practical and widely used ML decoding algorithm known as inactivation decoding. Different analysis techniques are presented to characterize the decoding complexity. Next an upper bound to the probability of decoding failure of Raptor codes under ML decoding is provided. Then, the distance properties of an ensemble of fixed-rate Raptor codes with linear random outer codes are analyzed. Finally, a novel class of fountain codes is presented, which consists of a parallel concat","authors_text":"Francisco L\\'azaro","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-27T09:12:38Z","title":"Fountain Codes under Maximum Likelihood Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08739","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:fc42e1da1a429be32f263ebce3eecb27e08bf624b2a27662a2d4d84c8e47c625","target":"record","created_at":"2026-05-18T00:41:31Z","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":"635fee39a750d9cb7b4c3a3daf7c05677075b9c32ca28611cfab63fa44fc4e35","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-27T09:12:38Z","title_canon_sha256":"aa6cae7217c1e01ba6d24db4f1e0c368084899e644f53dd3c6f337ea4f775ac8"},"schema_version":"1.0","source":{"id":"1706.08739","kind":"arxiv","version":1}},"canonical_sha256":"1855e1ef76a4b8867f2ad59482d729fc024e0f131d32129d695283cff5ae06e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1855e1ef76a4b8867f2ad59482d729fc024e0f131d32129d695283cff5ae06e6","first_computed_at":"2026-05-18T00:41:31.172080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:31.172080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b/fS/7FnTnxIFE5B5LEP0UjfozcDCoIzU5zPoHDhKXO5QNJG+3/rdgjBYopVyjehcoaMItZ/hSxt/lHf3oztDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:31.172737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc42e1da1a429be32f263ebce3eecb27e08bf624b2a27662a2d4d84c8e47c625","sha256:67250440468353ad225369d5711eb94746ac7f3656ebed30ab8724738c6a59df"],"state_sha256":"20bfcedcae207763ed2086c54b657efcf6e27fb06b8494e406b6df2ed05d5467"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UyjfdeZJ5p3zOVvjRyES8DwWshJ7Fn3wkbG11ONrHQ2yP2tH4F8y0Id3VXC5y0laZxJ4Q6Qy6sM2psM0wfsyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:25:26.548900Z","bundle_sha256":"5b322d98b449fba114d88a7c2d312a48c9dc539f74e50e718e86dfa878b05cee"}}