{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VDEOZYSFH34TH5LZ45WPPX22EY","short_pith_number":"pith:VDEOZYSF","canonical_record":{"source":{"id":"1410.0213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-01T13:28:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27942651e191feeaa2ed1601ca51cd21fd324b785e3accf1ebcae00616764f6c","abstract_canon_sha256":"3558ca100dd7fb4f5ce45d94aade919458fab5ba38b60027af245280014c7bfd"},"schema_version":"1.0"},"canonical_sha256":"a8c8ece2453ef933f579e76cf7df5a263b92bd58da5a941214c4bc953cf86307","source":{"kind":"arxiv","id":"1410.0213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0213","created_at":"2026-05-18T00:58:40Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0213v1","created_at":"2026-05-18T00:58:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0213","created_at":"2026-05-18T00:58:40Z"},{"alias_kind":"pith_short_12","alias_value":"VDEOZYSFH34T","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VDEOZYSFH34TH5LZ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VDEOZYSF","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VDEOZYSFH34TH5LZ45WPPX22EY","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-01T13:28:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"27942651e191feeaa2ed1601ca51cd21fd324b785e3accf1ebcae00616764f6c","abstract_canon_sha256":"3558ca100dd7fb4f5ce45d94aade919458fab5ba38b60027af245280014c7bfd"},"schema_version":"1.0"},"canonical_sha256":"a8c8ece2453ef933f579e76cf7df5a263b92bd58da5a941214c4bc953cf86307","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:40.961736Z","signature_b64":"jrGsK9PWnCXYRCa+q6t8oWnI78sdVTYLbHHyGaTpeM4IPY4oRPpy0QPUyUvDLXPBzZRC/u1l0nE/fHQUK9/+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8c8ece2453ef933f579e76cf7df5a263b92bd58da5a941214c4bc953cf86307","last_reissued_at":"2026-05-18T00:58:40.961046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:40.961046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0213","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:58:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XRGeDNkJbmY8nP6XRJ58dYCKRKSrKxkUqMCzpSZK5dy8XapkPfLyBfF8OlK5gNJIasGwl5M7zQQis2klX7PBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:16:14.873211Z"},"content_sha256":"4006e37503245ca78d02d6afc8ed19e3d749b9e96738574c454f157a994e381a","schema_version":"1.0","event_id":"sha256:4006e37503245ca78d02d6afc8ed19e3d749b9e96738574c454f157a994e381a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VDEOZYSFH34TH5LZ45WPPX22EY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Buffer-Based Distributed LT Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Iqbal Hussain, Lars K. Rasmussen, Ming Xiao","submitted_at":"2014-10-01T13:28:44Z","abstract_excerpt":"We focus on the design of distributed Luby transform (DLT) codes for erasure networks with multiple sources and multiple relays, communicating to a single destination. The erasure-floor performance of DLT codes improves with the maximum degree of the relay-degree distribution. However, for conventional DLT codes, the maximum degree is upper-bounded by the number of sources. An additional constraint is that the sources are required to have the same information block length. We introduce a $D$-bit buffer for each source-relay link, which allows the relay to select multiple encoded bits from the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0213","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:58:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ad795CHuEfY3h2LQlO/fooeTqjacqui2ZFL6wYow+15NQu2qM7KnANkqT71f1gi2HkLUTA5WsZVjsg5djXrqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:16:14.873925Z"},"content_sha256":"07d9877b683ab6a81d04d969f0024457a0ef9fde84013bed892aea850b9b25fc","schema_version":"1.0","event_id":"sha256:07d9877b683ab6a81d04d969f0024457a0ef9fde84013bed892aea850b9b25fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDEOZYSFH34TH5LZ45WPPX22EY/bundle.json","state_url":"https://pith.science/pith/VDEOZYSFH34TH5LZ45WPPX22EY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDEOZYSFH34TH5LZ45WPPX22EY/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-25T22:16:14Z","links":{"resolver":"https://pith.science/pith/VDEOZYSFH34TH5LZ45WPPX22EY","bundle":"https://pith.science/pith/VDEOZYSFH34TH5LZ45WPPX22EY/bundle.json","state":"https://pith.science/pith/VDEOZYSFH34TH5LZ45WPPX22EY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDEOZYSFH34TH5LZ45WPPX22EY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VDEOZYSFH34TH5LZ45WPPX22EY","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":"3558ca100dd7fb4f5ce45d94aade919458fab5ba38b60027af245280014c7bfd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-01T13:28:44Z","title_canon_sha256":"27942651e191feeaa2ed1601ca51cd21fd324b785e3accf1ebcae00616764f6c"},"schema_version":"1.0","source":{"id":"1410.0213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0213","created_at":"2026-05-18T00:58:40Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0213v1","created_at":"2026-05-18T00:58:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0213","created_at":"2026-05-18T00:58:40Z"},{"alias_kind":"pith_short_12","alias_value":"VDEOZYSFH34T","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"VDEOZYSFH34TH5LZ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"VDEOZYSF","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:07d9877b683ab6a81d04d969f0024457a0ef9fde84013bed892aea850b9b25fc","target":"graph","created_at":"2026-05-18T00:58:40Z","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":"We focus on the design of distributed Luby transform (DLT) codes for erasure networks with multiple sources and multiple relays, communicating to a single destination. The erasure-floor performance of DLT codes improves with the maximum degree of the relay-degree distribution. However, for conventional DLT codes, the maximum degree is upper-bounded by the number of sources. An additional constraint is that the sources are required to have the same information block length. We introduce a $D$-bit buffer for each source-relay link, which allows the relay to select multiple encoded bits from the ","authors_text":"Iqbal Hussain, Lars K. Rasmussen, Ming Xiao","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-01T13:28:44Z","title":"Buffer-Based Distributed LT Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0213","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:4006e37503245ca78d02d6afc8ed19e3d749b9e96738574c454f157a994e381a","target":"record","created_at":"2026-05-18T00:58:40Z","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":"3558ca100dd7fb4f5ce45d94aade919458fab5ba38b60027af245280014c7bfd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-01T13:28:44Z","title_canon_sha256":"27942651e191feeaa2ed1601ca51cd21fd324b785e3accf1ebcae00616764f6c"},"schema_version":"1.0","source":{"id":"1410.0213","kind":"arxiv","version":1}},"canonical_sha256":"a8c8ece2453ef933f579e76cf7df5a263b92bd58da5a941214c4bc953cf86307","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8c8ece2453ef933f579e76cf7df5a263b92bd58da5a941214c4bc953cf86307","first_computed_at":"2026-05-18T00:58:40.961046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:40.961046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jrGsK9PWnCXYRCa+q6t8oWnI78sdVTYLbHHyGaTpeM4IPY4oRPpy0QPUyUvDLXPBzZRC/u1l0nE/fHQUK9/+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:40.961736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4006e37503245ca78d02d6afc8ed19e3d749b9e96738574c454f157a994e381a","sha256:07d9877b683ab6a81d04d969f0024457a0ef9fde84013bed892aea850b9b25fc"],"state_sha256":"d2615b8ef3b0b497eef18c6c88d2fc4dfaf1ba157d11dc149dff287b1f2825b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k68ub8W03hKuxC5E8roWQOHeo6O62bkeTxz/LbdkEXrRNRFI16NitqAEaepLf+PM5TSg49Hyf3x6cSvo6TgkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:16:14.878110Z","bundle_sha256":"b56228ea24f33304628339a30f7827c3a494de41df6c15648888e959fe45734c"}}