{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:OFWVEMHBJ4NISMJIFTYCP5B2K3","short_pith_number":"pith:OFWVEMHB","canonical_record":{"source":{"id":"0908.0497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-08-04T17:27:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7a9f2f2cd4cfde1045ca3f67e098b1d7943fba3b18f4afa4e141b9fb345700ff","abstract_canon_sha256":"28663eaaf1628dbe9b1931fdb028e6c4da4d52a5ef51932af65ba98d99ec2d39"},"schema_version":"1.0"},"canonical_sha256":"716d5230e14f1a8931282cf027f43a56fdbb14953b8c1494db348c7eccfd6b44","source":{"kind":"arxiv","id":"0908.0497","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.0497","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0908.0497v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.0497","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"OFWVEMHBJ4NI","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"OFWVEMHBJ4NISMJI","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"OFWVEMHB","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:OFWVEMHBJ4NISMJIFTYCP5B2K3","target":"record","payload":{"canonical_record":{"source":{"id":"0908.0497","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-08-04T17:27:19Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7a9f2f2cd4cfde1045ca3f67e098b1d7943fba3b18f4afa4e141b9fb345700ff","abstract_canon_sha256":"28663eaaf1628dbe9b1931fdb028e6c4da4d52a5ef51932af65ba98d99ec2d39"},"schema_version":"1.0"},"canonical_sha256":"716d5230e14f1a8931282cf027f43a56fdbb14953b8c1494db348c7eccfd6b44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.067677Z","signature_b64":"fmCdR8m/y/SlZqWSaNWahtjFBH6YR4/9gH9bclHKaCIxv5n8xxz5CXQbtO9JeZOKYllF/FeAfEcA86Ub+AzeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"716d5230e14f1a8931282cf027f43a56fdbb14953b8c1494db348c7eccfd6b44","last_reissued_at":"2026-05-18T00:57:58.067253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.067253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.0497","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uSGcJQ0bXiup+RsOydxS8NVOxSx2b7FeQwzxVgQO4+dNHC1AFvMi8CxNG6uLq00nLsv5zoH8SUbywjOmiVBTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:20:05.442497Z"},"content_sha256":"6ac53b0151178e48ede4b87cae7eac6d5b08eced12869bc4d3d4b003e1126a55","schema_version":"1.0","event_id":"sha256:6ac53b0151178e48ede4b87cae7eac6d5b08eced12869bc4d3d4b003e1126a55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:OFWVEMHBJ4NISMJIFTYCP5B2K3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Coding for Multi-Resolution Multicast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Daniel Lucani, Fang Zhao, MinJi Kim, Muriel Medard, Xiaomeng Shi","submitted_at":"2009-08-04T17:27:19Z","abstract_excerpt":"Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distributed, two-stage message passing algorithm to generate network codes for single-source multicast of multi-resolution codes. The goal of this \"pushback algorithm\" is to maximize the total rate achieved by all receivers, while guaranteeing decodability of the base layer at each receiver. By conducting pushback and code generation stages, this algorithm takes advantage of inter-layer as well as intra-layer coding. Numerical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.0497","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mS1KAtsllunoeRML4yOtcTJHIW2woVTWehdF1XKjRG4Nt9fDF5v9zz6ZVsKTA6gvCnXo6uXTC+T8RSZUxXaMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T05:20:05.443211Z"},"content_sha256":"287ef628d5e2058147bf77bc24323f02e5bc8588a46a4aae8c6c30ab8a8b2487","schema_version":"1.0","event_id":"sha256:287ef628d5e2058147bf77bc24323f02e5bc8588a46a4aae8c6c30ab8a8b2487"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFWVEMHBJ4NISMJIFTYCP5B2K3/bundle.json","state_url":"https://pith.science/pith/OFWVEMHBJ4NISMJIFTYCP5B2K3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFWVEMHBJ4NISMJIFTYCP5B2K3/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-25T05:20:05Z","links":{"resolver":"https://pith.science/pith/OFWVEMHBJ4NISMJIFTYCP5B2K3","bundle":"https://pith.science/pith/OFWVEMHBJ4NISMJIFTYCP5B2K3/bundle.json","state":"https://pith.science/pith/OFWVEMHBJ4NISMJIFTYCP5B2K3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFWVEMHBJ4NISMJIFTYCP5B2K3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:OFWVEMHBJ4NISMJIFTYCP5B2K3","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":"28663eaaf1628dbe9b1931fdb028e6c4da4d52a5ef51932af65ba98d99ec2d39","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-08-04T17:27:19Z","title_canon_sha256":"7a9f2f2cd4cfde1045ca3f67e098b1d7943fba3b18f4afa4e141b9fb345700ff"},"schema_version":"1.0","source":{"id":"0908.0497","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.0497","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0908.0497v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.0497","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"OFWVEMHBJ4NI","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"OFWVEMHBJ4NISMJI","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"OFWVEMHB","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:287ef628d5e2058147bf77bc24323f02e5bc8588a46a4aae8c6c30ab8a8b2487","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distributed, two-stage message passing algorithm to generate network codes for single-source multicast of multi-resolution codes. The goal of this \"pushback algorithm\" is to maximize the total rate achieved by all receivers, while guaranteeing decodability of the base layer at each receiver. By conducting pushback and code generation stages, this algorithm takes advantage of inter-layer as well as intra-layer coding. Numerical ","authors_text":"Daniel Lucani, Fang Zhao, MinJi Kim, Muriel Medard, Xiaomeng Shi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-08-04T17:27:19Z","title":"Network Coding for Multi-Resolution Multicast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.0497","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:6ac53b0151178e48ede4b87cae7eac6d5b08eced12869bc4d3d4b003e1126a55","target":"record","created_at":"2026-05-18T00:57:58Z","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":"28663eaaf1628dbe9b1931fdb028e6c4da4d52a5ef51932af65ba98d99ec2d39","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2009-08-04T17:27:19Z","title_canon_sha256":"7a9f2f2cd4cfde1045ca3f67e098b1d7943fba3b18f4afa4e141b9fb345700ff"},"schema_version":"1.0","source":{"id":"0908.0497","kind":"arxiv","version":1}},"canonical_sha256":"716d5230e14f1a8931282cf027f43a56fdbb14953b8c1494db348c7eccfd6b44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"716d5230e14f1a8931282cf027f43a56fdbb14953b8c1494db348c7eccfd6b44","first_computed_at":"2026-05-18T00:57:58.067253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.067253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fmCdR8m/y/SlZqWSaNWahtjFBH6YR4/9gH9bclHKaCIxv5n8xxz5CXQbtO9JeZOKYllF/FeAfEcA86Ub+AzeBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.067677Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.0497","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ac53b0151178e48ede4b87cae7eac6d5b08eced12869bc4d3d4b003e1126a55","sha256:287ef628d5e2058147bf77bc24323f02e5bc8588a46a4aae8c6c30ab8a8b2487"],"state_sha256":"8782a76d78ba24338e4035bded18893eb7ff89bc6e8b55045889c04a6b2fcf2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbb8JlF0siFybu/Yx9Nofsuh16M6fcjwB6pwIVhJGLvI4cC4E2TGRBcYDlUcJjrGKc6bai5Ou13fY2V53If7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T05:20:05.447744Z","bundle_sha256":"d1f8cfca92997955c35766d98c5690b21e974f6bb207951dae34d18eefd0b457"}}