{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RS3ZBAVLCPZLXNBGVQ6WUAS6IA","short_pith_number":"pith:RS3ZBAVL","canonical_record":{"source":{"id":"1204.3391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-16T07:52:00Z","cross_cats_sorted":["cs.MM","math.IT"],"title_canon_sha256":"4b5e7dea5b535b327f261f81f10ed81c1bd9b63d6a0c2098986e758b9cad951a","abstract_canon_sha256":"883fb7ebdb3c7b40c117e59b73400fd6d15615d0018919a0eb3f1fcaaef9a148"},"schema_version":"1.0"},"canonical_sha256":"8cb79082ab13f2bbb426ac3d6a025e4025deb5cd991fe4e0932b52566b958590","source":{"kind":"arxiv","id":"1204.3391","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3391","created_at":"2026-05-18T00:38:06Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3391v2","created_at":"2026-05-18T00:38:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3391","created_at":"2026-05-18T00:38:06Z"},{"alias_kind":"pith_short_12","alias_value":"RS3ZBAVLCPZL","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RS3ZBAVLCPZLXNBG","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RS3ZBAVL","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RS3ZBAVLCPZLXNBGVQ6WUAS6IA","target":"record","payload":{"canonical_record":{"source":{"id":"1204.3391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-16T07:52:00Z","cross_cats_sorted":["cs.MM","math.IT"],"title_canon_sha256":"4b5e7dea5b535b327f261f81f10ed81c1bd9b63d6a0c2098986e758b9cad951a","abstract_canon_sha256":"883fb7ebdb3c7b40c117e59b73400fd6d15615d0018919a0eb3f1fcaaef9a148"},"schema_version":"1.0"},"canonical_sha256":"8cb79082ab13f2bbb426ac3d6a025e4025deb5cd991fe4e0932b52566b958590","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:06.716400Z","signature_b64":"My6nSZ3IF7ndxEJoUb5ORriG2OKJgTDdEulVegqk0YIc2K+gbfKWTabKzVXDkNYYg99VBdWsmEFUxroLdCASCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cb79082ab13f2bbb426ac3d6a025e4025deb5cd991fe4e0932b52566b958590","last_reissued_at":"2026-05-18T00:38:06.715909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:06.715909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.3391","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-18T00:38:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gEnCSVhWvVzFvOorwDLT11/2cXntq1qbMu1zsZkCtlympmfm8UvdEGLf90dyxTPvZN29o72Ofgfg0dxb3i0KDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:00:54.331463Z"},"content_sha256":"77dc404990a21e05e59f4f359f83e738f1ecbe3e6fbf11d1c30de228d4b1497a","schema_version":"1.0","event_id":"sha256:77dc404990a21e05e59f4f359f83e738f1ecbe3e6fbf11d1c30de228d4b1497a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RS3ZBAVLCPZLXNBGVQ6WUAS6IA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rateless Codes with Progressive Recovery for Layered Multimedia Delivery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM","math.IT"],"primary_cat":"cs.IT","authors_text":"Jianhua Lu, Liuguo Yin, Mai Xu, Zhao Chen","submitted_at":"2012-04-16T07:52:00Z","abstract_excerpt":"This paper proposes a novel approach, based on unequal error protection, to enhance rateless codes with progressive recovery for layered multimedia delivery. With a parallel encoding structure, the proposed Progressive Rateless codes (PRC) assign unequal redundancy to each layer in accordance with their importance. Each output symbol contains information from all layers, and thus the stream layers can be recovered progressively at the expected received ratios of output symbols. Furthermore, the dependency between layers is naturally considered. The performance of the PRC is evaluated and compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3391","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-18T00:38:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o38lHhXo53SqMWFi+9lBTC/T32v8ZHxHBxvnDXMcLhf6StqpmSgKCJBUPgifE7xRv3c2J1rjtpBL9U2IC9C7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:00:54.331812Z"},"content_sha256":"eaf6b33929f982dcf9315764b7aa0fffa6e4a5a07ad84ec9e03b2837ee5a6c00","schema_version":"1.0","event_id":"sha256:eaf6b33929f982dcf9315764b7aa0fffa6e4a5a07ad84ec9e03b2837ee5a6c00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RS3ZBAVLCPZLXNBGVQ6WUAS6IA/bundle.json","state_url":"https://pith.science/pith/RS3ZBAVLCPZLXNBGVQ6WUAS6IA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RS3ZBAVLCPZLXNBGVQ6WUAS6IA/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-23T03:00:54Z","links":{"resolver":"https://pith.science/pith/RS3ZBAVLCPZLXNBGVQ6WUAS6IA","bundle":"https://pith.science/pith/RS3ZBAVLCPZLXNBGVQ6WUAS6IA/bundle.json","state":"https://pith.science/pith/RS3ZBAVLCPZLXNBGVQ6WUAS6IA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RS3ZBAVLCPZLXNBGVQ6WUAS6IA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RS3ZBAVLCPZLXNBGVQ6WUAS6IA","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":"883fb7ebdb3c7b40c117e59b73400fd6d15615d0018919a0eb3f1fcaaef9a148","cross_cats_sorted":["cs.MM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-16T07:52:00Z","title_canon_sha256":"4b5e7dea5b535b327f261f81f10ed81c1bd9b63d6a0c2098986e758b9cad951a"},"schema_version":"1.0","source":{"id":"1204.3391","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3391","created_at":"2026-05-18T00:38:06Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3391v2","created_at":"2026-05-18T00:38:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3391","created_at":"2026-05-18T00:38:06Z"},{"alias_kind":"pith_short_12","alias_value":"RS3ZBAVLCPZL","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RS3ZBAVLCPZLXNBG","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RS3ZBAVL","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:eaf6b33929f982dcf9315764b7aa0fffa6e4a5a07ad84ec9e03b2837ee5a6c00","target":"graph","created_at":"2026-05-18T00:38: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":"This paper proposes a novel approach, based on unequal error protection, to enhance rateless codes with progressive recovery for layered multimedia delivery. With a parallel encoding structure, the proposed Progressive Rateless codes (PRC) assign unequal redundancy to each layer in accordance with their importance. Each output symbol contains information from all layers, and thus the stream layers can be recovered progressively at the expected received ratios of output symbols. Furthermore, the dependency between layers is naturally considered. The performance of the PRC is evaluated and compa","authors_text":"Jianhua Lu, Liuguo Yin, Mai Xu, Zhao Chen","cross_cats":["cs.MM","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-16T07:52:00Z","title":"Rateless Codes with Progressive Recovery for Layered Multimedia Delivery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3391","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:77dc404990a21e05e59f4f359f83e738f1ecbe3e6fbf11d1c30de228d4b1497a","target":"record","created_at":"2026-05-18T00:38: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":"883fb7ebdb3c7b40c117e59b73400fd6d15615d0018919a0eb3f1fcaaef9a148","cross_cats_sorted":["cs.MM","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-16T07:52:00Z","title_canon_sha256":"4b5e7dea5b535b327f261f81f10ed81c1bd9b63d6a0c2098986e758b9cad951a"},"schema_version":"1.0","source":{"id":"1204.3391","kind":"arxiv","version":2}},"canonical_sha256":"8cb79082ab13f2bbb426ac3d6a025e4025deb5cd991fe4e0932b52566b958590","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cb79082ab13f2bbb426ac3d6a025e4025deb5cd991fe4e0932b52566b958590","first_computed_at":"2026-05-18T00:38:06.715909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:06.715909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"My6nSZ3IF7ndxEJoUb5ORriG2OKJgTDdEulVegqk0YIc2K+gbfKWTabKzVXDkNYYg99VBdWsmEFUxroLdCASCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:06.716400Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3391","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77dc404990a21e05e59f4f359f83e738f1ecbe3e6fbf11d1c30de228d4b1497a","sha256:eaf6b33929f982dcf9315764b7aa0fffa6e4a5a07ad84ec9e03b2837ee5a6c00"],"state_sha256":"44da3424aefa49ac031160a8f0eb2a3a1c456712d1421cd8530b1c3e09138692"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xYZz7EJJgUD46ED9GmTljIOLRbz2FqRS7y9gwI+Bp0WBYCRlKzxWLUNBe8pYEUFkdBSf31rxx1b7FoERrVHiBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T03:00:54.333781Z","bundle_sha256":"ab038ef4ab96d39cc759c497ef80294167b6ef12f433b9269d68a3696a2a61f1"}}