{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FIV2QNZO3F22JN46D2ZVITLNQX","short_pith_number":"pith:FIV2QNZO","canonical_record":{"source":{"id":"1204.4686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-20T17:38:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e1f9aab598d1d985fd017be7677b1a09ae785f8b8bbd1321ce0280784bb91af0","abstract_canon_sha256":"4167a5f858b64d5742649400ebae92048b0472411fdf673735b77eca1ae4d179"},"schema_version":"1.0"},"canonical_sha256":"2a2ba8372ed975a4b79e1eb3544d6d85f828032937ed7a661b81dbf4624f8db5","source":{"kind":"arxiv","id":"1204.4686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4686","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4686v1","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4686","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"FIV2QNZO3F22","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FIV2QNZO3F22JN46","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FIV2QNZO","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FIV2QNZO3F22JN46D2ZVITLNQX","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-20T17:38:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e1f9aab598d1d985fd017be7677b1a09ae785f8b8bbd1321ce0280784bb91af0","abstract_canon_sha256":"4167a5f858b64d5742649400ebae92048b0472411fdf673735b77eca1ae4d179"},"schema_version":"1.0"},"canonical_sha256":"2a2ba8372ed975a4b79e1eb3544d6d85f828032937ed7a661b81dbf4624f8db5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:25.695838Z","signature_b64":"0KFoQqFq+Udh1cxi/1N46Y7pRCMRGgLMBZmwiICPPtKTznU/ebf/CK/hmN2rygUpZLkFrN7u0NwIKpdfK+faDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a2ba8372ed975a4b79e1eb3544d6d85f828032937ed7a661b81dbf4624f8db5","last_reissued_at":"2026-05-18T03:57:25.694865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:25.694865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4686","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:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AowKmOsd70rMM9t7q0EBAFqEMEPCXyw2wl/TO9lM5N8WOM1IgRsve8N+uL/3vmDseugCWEBI32Mc8U7JFWXbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:55:04.627060Z"},"content_sha256":"f6ff0fd42fc30616099d5fd5801ad30c8c23a1c0a7feae1bfcaab994a33ba6db","schema_version":"1.0","event_id":"sha256:f6ff0fd42fc30616099d5fd5801ad30c8c23a1c0a7feae1bfcaab994a33ba6db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FIV2QNZO3F22JN46D2ZVITLNQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of LT Codes with Unequal Recovery Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jan {\\O}stergaard, Jesper H. S{\\o}rensen, Petar Popovski","submitted_at":"2012-04-20T17:38:23Z","abstract_excerpt":"In this paper we analyze a specific class of rateless codes, called LT codes with unequal recovery time. These codes provide the option of prioritizing different segments of the transmitted data over other. The result is that segments are decoded in stages during the rateless transmission, where higher prioritized segments are decoded at lower overhead. Our analysis focuses on quantifying the expected amount of received symbols, which are redundant already upon arrival, i.e. all input symbols contained in the received symbols have already been decoded. This analysis gives novel insights into t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4686","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:57:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jv34IcUOHX8pyXqUN4yyx1+McB0UW0J3cNEqpy/vM9I1OtwSe4TdZVF27GvIjrM5GiAXTxXvWf3SoMJnx1wdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:55:04.627756Z"},"content_sha256":"a0d330053d33e11f5fa4059a9e904ba6fd2845ca2534b1bd98b184561dfd74fc","schema_version":"1.0","event_id":"sha256:a0d330053d33e11f5fa4059a9e904ba6fd2845ca2534b1bd98b184561dfd74fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIV2QNZO3F22JN46D2ZVITLNQX/bundle.json","state_url":"https://pith.science/pith/FIV2QNZO3F22JN46D2ZVITLNQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIV2QNZO3F22JN46D2ZVITLNQX/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-27T03:55:04Z","links":{"resolver":"https://pith.science/pith/FIV2QNZO3F22JN46D2ZVITLNQX","bundle":"https://pith.science/pith/FIV2QNZO3F22JN46D2ZVITLNQX/bundle.json","state":"https://pith.science/pith/FIV2QNZO3F22JN46D2ZVITLNQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIV2QNZO3F22JN46D2ZVITLNQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FIV2QNZO3F22JN46D2ZVITLNQX","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":"4167a5f858b64d5742649400ebae92048b0472411fdf673735b77eca1ae4d179","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-20T17:38:23Z","title_canon_sha256":"e1f9aab598d1d985fd017be7677b1a09ae785f8b8bbd1321ce0280784bb91af0"},"schema_version":"1.0","source":{"id":"1204.4686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4686","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4686v1","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4686","created_at":"2026-05-18T03:57:25Z"},{"alias_kind":"pith_short_12","alias_value":"FIV2QNZO3F22","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FIV2QNZO3F22JN46","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FIV2QNZO","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:a0d330053d33e11f5fa4059a9e904ba6fd2845ca2534b1bd98b184561dfd74fc","target":"graph","created_at":"2026-05-18T03:57:25Z","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 analyze a specific class of rateless codes, called LT codes with unequal recovery time. These codes provide the option of prioritizing different segments of the transmitted data over other. The result is that segments are decoded in stages during the rateless transmission, where higher prioritized segments are decoded at lower overhead. Our analysis focuses on quantifying the expected amount of received symbols, which are redundant already upon arrival, i.e. all input symbols contained in the received symbols have already been decoded. This analysis gives novel insights into t","authors_text":"Jan {\\O}stergaard, Jesper H. S{\\o}rensen, Petar Popovski","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-20T17:38:23Z","title":"Analysis of LT Codes with Unequal Recovery Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4686","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:f6ff0fd42fc30616099d5fd5801ad30c8c23a1c0a7feae1bfcaab994a33ba6db","target":"record","created_at":"2026-05-18T03:57:25Z","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":"4167a5f858b64d5742649400ebae92048b0472411fdf673735b77eca1ae4d179","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-20T17:38:23Z","title_canon_sha256":"e1f9aab598d1d985fd017be7677b1a09ae785f8b8bbd1321ce0280784bb91af0"},"schema_version":"1.0","source":{"id":"1204.4686","kind":"arxiv","version":1}},"canonical_sha256":"2a2ba8372ed975a4b79e1eb3544d6d85f828032937ed7a661b81dbf4624f8db5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a2ba8372ed975a4b79e1eb3544d6d85f828032937ed7a661b81dbf4624f8db5","first_computed_at":"2026-05-18T03:57:25.694865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:25.694865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0KFoQqFq+Udh1cxi/1N46Y7pRCMRGgLMBZmwiICPPtKTznU/ebf/CK/hmN2rygUpZLkFrN7u0NwIKpdfK+faDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:25.695838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6ff0fd42fc30616099d5fd5801ad30c8c23a1c0a7feae1bfcaab994a33ba6db","sha256:a0d330053d33e11f5fa4059a9e904ba6fd2845ca2534b1bd98b184561dfd74fc"],"state_sha256":"cf5a021afddcc985739867f31bfc4a252d4226fa814d90a2f979d749ce286655"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tksylku8e3swq20pQoKggsz65I6Fl/ZvCT+DC3Hl3rh0Pm/aof2DkSqVaCYJLvRRLlo/0tZbQK0C+peoDShHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:55:04.631516Z","bundle_sha256":"c175577c58f7c7dd1e3b8e9b480b28e451c6b9797c6e1cc897652f531f0f56cb"}}