{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GL6HIABYGIWCURRF735JKHOIF4","short_pith_number":"pith:GL6HIABY","canonical_record":{"source":{"id":"1209.4066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-14T22:26:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f1c4332b43081a7096aa4c7833146620ba0d11871db317ad1ab2c9b6749f21c","abstract_canon_sha256":"86b5f31471880d02300b701712d56c49ca701565f5d30fccad6909942b8f0fe3"},"schema_version":"1.0"},"canonical_sha256":"32fc740038322c2a4625fefa951dc82f226666d97cfe3e2cdcbcaf17421c188e","source":{"kind":"arxiv","id":"1209.4066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4066","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4066v1","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4066","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"GL6HIABYGIWC","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GL6HIABYGIWCURRF","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GL6HIABY","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GL6HIABYGIWCURRF735JKHOIF4","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-14T22:26:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7f1c4332b43081a7096aa4c7833146620ba0d11871db317ad1ab2c9b6749f21c","abstract_canon_sha256":"86b5f31471880d02300b701712d56c49ca701565f5d30fccad6909942b8f0fe3"},"schema_version":"1.0"},"canonical_sha256":"32fc740038322c2a4625fefa951dc82f226666d97cfe3e2cdcbcaf17421c188e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:05.755767Z","signature_b64":"U7mGPzFm56d7ORepbWFYP0i1EVq9qJdgIk8yeRMhAZoZu+FVdK50FTqw+YTNa7sTos8iJnFbRivpRdeUilHKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32fc740038322c2a4625fefa951dc82f226666d97cfe3e2cdcbcaf17421c188e","last_reissued_at":"2026-05-18T02:25:05.755244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:05.755244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4066","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-18T02:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+INFYW3A2req5wqbrgAVF0ucnLKd6V7tXuFvO/YmWN77Edd6RyRAJgjDSstiQcjzhjavIuZQRX52mdxWyxFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:12:14.250709Z"},"content_sha256":"0436e613ab5d2f60385df47f605f7de7375a44573acb1dd81e1963dc277ca87c","schema_version":"1.0","event_id":"sha256:0436e613ab5d2f60385df47f605f7de7375a44573acb1dd81e1963dc277ca87c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GL6HIABYGIWCURRF735JKHOIF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Complexity Differentiating Adaptive Erasure Codes for Multimedia Wireless Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emina Soljanin, Predrag Spasojevic, Silvija Kokalj-Filipovic","submitted_at":"2012-09-14T22:26:03Z","abstract_excerpt":"Based on the erasure channel FEC model as defined in multimedia wireless broadcast standards, we illustrate how doping mechanisms included in the design of erasure coding and decoding may improve the scalability of the packet throughput, decrease overall latency and potentially differentiate among classes of multimedia subscribers regardless of their signal quality. We describe decoding mechanisms that allow for linear complexity and give complexity bounds when feedback is available. We show that elaborate coding schemes which include pre-coding stages are inferior to simple Ideal Soliton base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4066","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-18T02:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"st7MWICPwpHyLR18ZxZMrRaKOuUewPNeU8/1WVcqaYxyZKSpewcRh1Npt9yCrqsVuhTdTXHgFTltX7MpRsH7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:12:14.251067Z"},"content_sha256":"5cc21615e5de389e896e30b40d6a81f6161e531f28aa5331d1cafd06572c782f","schema_version":"1.0","event_id":"sha256:5cc21615e5de389e896e30b40d6a81f6161e531f28aa5331d1cafd06572c782f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GL6HIABYGIWCURRF735JKHOIF4/bundle.json","state_url":"https://pith.science/pith/GL6HIABYGIWCURRF735JKHOIF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GL6HIABYGIWCURRF735JKHOIF4/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-07-03T09:12:14Z","links":{"resolver":"https://pith.science/pith/GL6HIABYGIWCURRF735JKHOIF4","bundle":"https://pith.science/pith/GL6HIABYGIWCURRF735JKHOIF4/bundle.json","state":"https://pith.science/pith/GL6HIABYGIWCURRF735JKHOIF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GL6HIABYGIWCURRF735JKHOIF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GL6HIABYGIWCURRF735JKHOIF4","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":"86b5f31471880d02300b701712d56c49ca701565f5d30fccad6909942b8f0fe3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-14T22:26:03Z","title_canon_sha256":"7f1c4332b43081a7096aa4c7833146620ba0d11871db317ad1ab2c9b6749f21c"},"schema_version":"1.0","source":{"id":"1209.4066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4066","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4066v1","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4066","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"GL6HIABYGIWC","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GL6HIABYGIWCURRF","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GL6HIABY","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:5cc21615e5de389e896e30b40d6a81f6161e531f28aa5331d1cafd06572c782f","target":"graph","created_at":"2026-05-18T02:25:05Z","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":"Based on the erasure channel FEC model as defined in multimedia wireless broadcast standards, we illustrate how doping mechanisms included in the design of erasure coding and decoding may improve the scalability of the packet throughput, decrease overall latency and potentially differentiate among classes of multimedia subscribers regardless of their signal quality. We describe decoding mechanisms that allow for linear complexity and give complexity bounds when feedback is available. We show that elaborate coding schemes which include pre-coding stages are inferior to simple Ideal Soliton base","authors_text":"Emina Soljanin, Predrag Spasojevic, Silvija Kokalj-Filipovic","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-14T22:26:03Z","title":"Low Complexity Differentiating Adaptive Erasure Codes for Multimedia Wireless Broadcast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4066","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:0436e613ab5d2f60385df47f605f7de7375a44573acb1dd81e1963dc277ca87c","target":"record","created_at":"2026-05-18T02:25:05Z","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":"86b5f31471880d02300b701712d56c49ca701565f5d30fccad6909942b8f0fe3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-14T22:26:03Z","title_canon_sha256":"7f1c4332b43081a7096aa4c7833146620ba0d11871db317ad1ab2c9b6749f21c"},"schema_version":"1.0","source":{"id":"1209.4066","kind":"arxiv","version":1}},"canonical_sha256":"32fc740038322c2a4625fefa951dc82f226666d97cfe3e2cdcbcaf17421c188e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32fc740038322c2a4625fefa951dc82f226666d97cfe3e2cdcbcaf17421c188e","first_computed_at":"2026-05-18T02:25:05.755244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:05.755244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U7mGPzFm56d7ORepbWFYP0i1EVq9qJdgIk8yeRMhAZoZu+FVdK50FTqw+YTNa7sTos8iJnFbRivpRdeUilHKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:05.755767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0436e613ab5d2f60385df47f605f7de7375a44573acb1dd81e1963dc277ca87c","sha256:5cc21615e5de389e896e30b40d6a81f6161e531f28aa5331d1cafd06572c782f"],"state_sha256":"bfe9b852d890ef015a8b5e8cb728b32ae0247e435c4913a5916488a93420932d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5t0zQ3QjOWNKZFxIwbdyUOjCWnTruc9dhT7NhkIveAu50rS2zh47N8cJgNWvKuCqXBuIIgSNmddBIwqGQShDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:12:14.253365Z","bundle_sha256":"60d3a4a71934280a05bb4d5e4a51521027bb0610b2925bfe15849a07f550aaf7"}}