{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7HHLSFFO3K322YWUMKZV36XMKX","short_pith_number":"pith:7HHLSFFO","canonical_record":{"source":{"id":"1011.2078","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-09T13:36:59Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"bf4fb144140ced215c68a77d1cc057bc1c03e1e05ee89c2b9ca5efd7bc516203","abstract_canon_sha256":"78155011b69d09e07d44e157b6244e2e02d67e5d26ac4875ef2998cf36aa5b94"},"schema_version":"1.0"},"canonical_sha256":"f9ceb914aedab7ad62d462b35dfaec55ead38454d111c8446580332f864b2211","source":{"kind":"arxiv","id":"1011.2078","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2078","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2078v2","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2078","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"7HHLSFFO3K32","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HHLSFFO3K322YWU","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HHLSFFO","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7HHLSFFO3K322YWUMKZV36XMKX","target":"record","payload":{"canonical_record":{"source":{"id":"1011.2078","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-09T13:36:59Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"bf4fb144140ced215c68a77d1cc057bc1c03e1e05ee89c2b9ca5efd7bc516203","abstract_canon_sha256":"78155011b69d09e07d44e157b6244e2e02d67e5d26ac4875ef2998cf36aa5b94"},"schema_version":"1.0"},"canonical_sha256":"f9ceb914aedab7ad62d462b35dfaec55ead38454d111c8446580332f864b2211","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:06.259908Z","signature_b64":"tamuLm77r6K2bW8WYECdBNAZng13zYoi65z6fpiTemo0IqAdv/t0JSIOwJic48EMvOrwTRY15CzKSaAtihxEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9ceb914aedab7ad62d462b35dfaec55ead38454d111c8446580332f864b2211","last_reissued_at":"2026-05-18T03:54:06.259345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:06.259345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.2078","source_version":2,"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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6g4VAdYSEPcU1xm3xZIHW71fqcyt9d5FZ6yo/L9hYkirByd8HeR6I0ZY3jmCL9mIIXvGIu84VpzsXUuCZJ6UCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:40:11.634109Z"},"content_sha256":"cf3e60665e2bd2513c32da0cdb982c814d70595ad9d61fa22c9db44923b39bc4","schema_version":"1.0","event_id":"sha256:cf3e60665e2bd2513c32da0cdb982c814d70595ad9d61fa22c9db44923b39bc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7HHLSFFO3K322YWUMKZV36XMKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design and Analysis of LT Codes with Decreasing Ripple Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Jan {\\O}stergaard, Jesper H. S{\\o}rensen, Petar Popovski","submitted_at":"2010-11-09T13:36:59Z","abstract_excerpt":"In this paper we propose a new design of LT codes, which decreases the amount of necessary overhead in comparison to existing designs. The design focuses on a parameter of the LT decoding process called the ripple size. This parameter was also a key element in the design proposed in the original work by Luby. Specifically, Luby argued that an LT code should provide a constant ripple size during decoding. In this work we show that the ripple size should decrease during decoding, in order to reduce the necessary overhead. Initially we motivate this claim by analytical results related to the redu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2078","kind":"arxiv","version":2},"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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2cOg3glcasVlNMeE/wbsWctzPq9q4nuwQPyHmb/qiKZmnUh4/bSXfu5DgAoYiWiMc27k2ptvJuBoKXwV79/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:40:11.634518Z"},"content_sha256":"1cc2238886b3a9ca8ae3912cd6d434536285442631fb1e1740abfd4224e904ab","schema_version":"1.0","event_id":"sha256:1cc2238886b3a9ca8ae3912cd6d434536285442631fb1e1740abfd4224e904ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HHLSFFO3K322YWUMKZV36XMKX/bundle.json","state_url":"https://pith.science/pith/7HHLSFFO3K322YWUMKZV36XMKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HHLSFFO3K322YWUMKZV36XMKX/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-27T05:40:11Z","links":{"resolver":"https://pith.science/pith/7HHLSFFO3K322YWUMKZV36XMKX","bundle":"https://pith.science/pith/7HHLSFFO3K322YWUMKZV36XMKX/bundle.json","state":"https://pith.science/pith/7HHLSFFO3K322YWUMKZV36XMKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HHLSFFO3K322YWUMKZV36XMKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7HHLSFFO3K322YWUMKZV36XMKX","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":"78155011b69d09e07d44e157b6244e2e02d67e5d26ac4875ef2998cf36aa5b94","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-09T13:36:59Z","title_canon_sha256":"bf4fb144140ced215c68a77d1cc057bc1c03e1e05ee89c2b9ca5efd7bc516203"},"schema_version":"1.0","source":{"id":"1011.2078","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.2078","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1011.2078v2","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.2078","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"7HHLSFFO3K32","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HHLSFFO3K322YWU","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HHLSFFO","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:1cc2238886b3a9ca8ae3912cd6d434536285442631fb1e1740abfd4224e904ab","target":"graph","created_at":"2026-05-18T03:54:06Z","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 new design of LT codes, which decreases the amount of necessary overhead in comparison to existing designs. The design focuses on a parameter of the LT decoding process called the ripple size. This parameter was also a key element in the design proposed in the original work by Luby. Specifically, Luby argued that an LT code should provide a constant ripple size during decoding. In this work we show that the ripple size should decrease during decoding, in order to reduce the necessary overhead. Initially we motivate this claim by analytical results related to the redu","authors_text":"Jan {\\O}stergaard, Jesper H. S{\\o}rensen, Petar Popovski","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-09T13:36:59Z","title":"Design and Analysis of LT Codes with Decreasing Ripple Size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.2078","kind":"arxiv","version":2},"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:cf3e60665e2bd2513c32da0cdb982c814d70595ad9d61fa22c9db44923b39bc4","target":"record","created_at":"2026-05-18T03:54:06Z","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":"78155011b69d09e07d44e157b6244e2e02d67e5d26ac4875ef2998cf36aa5b94","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-09T13:36:59Z","title_canon_sha256":"bf4fb144140ced215c68a77d1cc057bc1c03e1e05ee89c2b9ca5efd7bc516203"},"schema_version":"1.0","source":{"id":"1011.2078","kind":"arxiv","version":2}},"canonical_sha256":"f9ceb914aedab7ad62d462b35dfaec55ead38454d111c8446580332f864b2211","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9ceb914aedab7ad62d462b35dfaec55ead38454d111c8446580332f864b2211","first_computed_at":"2026-05-18T03:54:06.259345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:06.259345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tamuLm77r6K2bW8WYECdBNAZng13zYoi65z6fpiTemo0IqAdv/t0JSIOwJic48EMvOrwTRY15CzKSaAtihxEDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:06.259908Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.2078","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf3e60665e2bd2513c32da0cdb982c814d70595ad9d61fa22c9db44923b39bc4","sha256:1cc2238886b3a9ca8ae3912cd6d434536285442631fb1e1740abfd4224e904ab"],"state_sha256":"f80a67488446d9487b36083cb7a06250857217c1ad7a739f9119b70477f0666a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CDG5WpXCUslJuMcFE/ujpZFCZXPXTTeqpJhZCV9d+4LFnQ05rO9oHSPFoIXfgS5sBq8JfI53rQVgh24R0MQMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:40:11.637233Z","bundle_sha256":"9e9f166336aed7d7f124dbc9cafa4b257a0bff8bb0c19271293f768dd325cab6"}}