{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XS57CKE4I3P6RCCFRYOAS7UBHC","short_pith_number":"pith:XS57CKE4","canonical_record":{"source":{"id":"1006.1383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-07T21:53:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f4d8283bbbac5f6f32126275f05dc99a27eb7c6c1c6fdb590c9dd7c124aa407","abstract_canon_sha256":"8a1c9bbff7d6ec6b44d5ea3fd736c4b7cd44250574741711c97d8bcae469a07a"},"schema_version":"1.0"},"canonical_sha256":"bcbbf1289c46dfe888458e1c097e8138b7accbaad7d500f8a31ed38d9abfa341","source":{"kind":"arxiv","id":"1006.1383","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1383","created_at":"2026-05-18T04:36:33Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1383v2","created_at":"2026-05-18T04:36:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1383","created_at":"2026-05-18T04:36:33Z"},{"alias_kind":"pith_short_12","alias_value":"XS57CKE4I3P6","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XS57CKE4I3P6RCCF","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XS57CKE4","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XS57CKE4I3P6RCCFRYOAS7UBHC","target":"record","payload":{"canonical_record":{"source":{"id":"1006.1383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-07T21:53:13Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f4d8283bbbac5f6f32126275f05dc99a27eb7c6c1c6fdb590c9dd7c124aa407","abstract_canon_sha256":"8a1c9bbff7d6ec6b44d5ea3fd736c4b7cd44250574741711c97d8bcae469a07a"},"schema_version":"1.0"},"canonical_sha256":"bcbbf1289c46dfe888458e1c097e8138b7accbaad7d500f8a31ed38d9abfa341","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:33.641956Z","signature_b64":"9PGI3qQT2uYsf+w5J1Sp02SPCkge00teQgRmvu4HD/Zk9qpeKhbHxjRzco1SH0gCU79V3UASREbPKlI1C6PNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcbbf1289c46dfe888458e1c097e8138b7accbaad7d500f8a31ed38d9abfa341","last_reissued_at":"2026-05-18T04:36:33.641549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:33.641549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.1383","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-18T04:36:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9eTuKEq12cxltLQw06Bucz3AhUyKuiUuNausn1D43oYf2VEECLXQFrsP6FYdawuGdAyB6tY7fo82ZiOimFF0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:03:44.361773Z"},"content_sha256":"8dc2021b95ff20e4e1ae75445936c5ad673dd319285c2e76ca88dba0934ab31a","schema_version":"1.0","event_id":"sha256:8dc2021b95ff20e4e1ae75445936c5ad673dd319285c2e76ca88dba0934ab31a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XS57CKE4I3P6RCCFRYOAS7UBHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Talari, Behzad Shahrasbi, Nazanin Rahnavard","submitted_at":"2010-06-07T21:53:13Z","abstract_excerpt":"LT codes are modern and efficient rateless forward error correction (FEC) codes with close to channel capacity performance. Nevertheless, in intermediate range where the number of received encoded symbols is less than the number of source symbols, LT codes have very low recovery rates.\n  In this paper, we propose a novel algorithm which significantly increases the intermediate recovery rate of LT codes, while it preserves the codes' close to channel capacity performance. To increase the intermediate recovery rate, our proposed algorithm rearranges the transmission order of the encoded symbols "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1383","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-18T04:36:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y7dvq/r4i24cXy8jz6CnDmml0yjny/m2Lhi4GEHDy1DHPFCUPv7yAsn/8YN1cAjgCS5b3Gn+v57Oh3JbuNbeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:03:44.362667Z"},"content_sha256":"433129dacef72aa6b7b04ecdd2903090f6db4d668173a76ef0974d94b4a22451","schema_version":"1.0","event_id":"sha256:433129dacef72aa6b7b04ecdd2903090f6db4d668173a76ef0974d94b4a22451"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XS57CKE4I3P6RCCFRYOAS7UBHC/bundle.json","state_url":"https://pith.science/pith/XS57CKE4I3P6RCCFRYOAS7UBHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XS57CKE4I3P6RCCFRYOAS7UBHC/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-07T20:03:44Z","links":{"resolver":"https://pith.science/pith/XS57CKE4I3P6RCCFRYOAS7UBHC","bundle":"https://pith.science/pith/XS57CKE4I3P6RCCFRYOAS7UBHC/bundle.json","state":"https://pith.science/pith/XS57CKE4I3P6RCCFRYOAS7UBHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XS57CKE4I3P6RCCFRYOAS7UBHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XS57CKE4I3P6RCCFRYOAS7UBHC","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":"8a1c9bbff7d6ec6b44d5ea3fd736c4b7cd44250574741711c97d8bcae469a07a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-07T21:53:13Z","title_canon_sha256":"7f4d8283bbbac5f6f32126275f05dc99a27eb7c6c1c6fdb590c9dd7c124aa407"},"schema_version":"1.0","source":{"id":"1006.1383","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.1383","created_at":"2026-05-18T04:36:33Z"},{"alias_kind":"arxiv_version","alias_value":"1006.1383v2","created_at":"2026-05-18T04:36:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.1383","created_at":"2026-05-18T04:36:33Z"},{"alias_kind":"pith_short_12","alias_value":"XS57CKE4I3P6","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XS57CKE4I3P6RCCF","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XS57CKE4","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:433129dacef72aa6b7b04ecdd2903090f6db4d668173a76ef0974d94b4a22451","target":"graph","created_at":"2026-05-18T04:36:33Z","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":"LT codes are modern and efficient rateless forward error correction (FEC) codes with close to channel capacity performance. Nevertheless, in intermediate range where the number of received encoded symbols is less than the number of source symbols, LT codes have very low recovery rates.\n  In this paper, we propose a novel algorithm which significantly increases the intermediate recovery rate of LT codes, while it preserves the codes' close to channel capacity performance. To increase the intermediate recovery rate, our proposed algorithm rearranges the transmission order of the encoded symbols ","authors_text":"Ali Talari, Behzad Shahrasbi, Nazanin Rahnavard","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-07T21:53:13Z","title":"Efficient Symbol Sorting for High Intermediate Recovery Rate of LT Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.1383","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:8dc2021b95ff20e4e1ae75445936c5ad673dd319285c2e76ca88dba0934ab31a","target":"record","created_at":"2026-05-18T04:36:33Z","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":"8a1c9bbff7d6ec6b44d5ea3fd736c4b7cd44250574741711c97d8bcae469a07a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-07T21:53:13Z","title_canon_sha256":"7f4d8283bbbac5f6f32126275f05dc99a27eb7c6c1c6fdb590c9dd7c124aa407"},"schema_version":"1.0","source":{"id":"1006.1383","kind":"arxiv","version":2}},"canonical_sha256":"bcbbf1289c46dfe888458e1c097e8138b7accbaad7d500f8a31ed38d9abfa341","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcbbf1289c46dfe888458e1c097e8138b7accbaad7d500f8a31ed38d9abfa341","first_computed_at":"2026-05-18T04:36:33.641549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:33.641549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9PGI3qQT2uYsf+w5J1Sp02SPCkge00teQgRmvu4HD/Zk9qpeKhbHxjRzco1SH0gCU79V3UASREbPKlI1C6PNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:33.641956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.1383","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dc2021b95ff20e4e1ae75445936c5ad673dd319285c2e76ca88dba0934ab31a","sha256:433129dacef72aa6b7b04ecdd2903090f6db4d668173a76ef0974d94b4a22451"],"state_sha256":"6c7484c13f688993ced486cd39880eec0bc4fdc305a8f7ef7639d18d49df1878"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HYv0fAFPC7f1pRv9TI5RLsDizUT4Qrqlfc11BUTdTbIA3Qyi1qGaGFpDwQofviReDRM+WPV9V/HSwHl09cd6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:03:44.366663Z","bundle_sha256":"6e775e56dce1eff62c5aad078a6d2390880fdcbffab29fb5094bc58972a15276"}}