{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IUVZVSNVEB5YJ476TYESIMT7PZ","short_pith_number":"pith:IUVZVSNV","canonical_record":{"source":{"id":"1712.06435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-18T14:53:51Z","cross_cats_sorted":[],"title_canon_sha256":"898cc402ca1ec71d16f96195a1465da9a24ece11cbe2c67e799e53baca855eb6","abstract_canon_sha256":"175a865fdb8368e79d779f4bb9a3a66b1768f64cfe81477530f65b02793639d6"},"schema_version":"1.0"},"canonical_sha256":"452b9ac9b5207b84f3fe9e0924327f7e75d5d3ce5ee4abbb0c7cd1f9b0af4a0c","source":{"kind":"arxiv","id":"1712.06435","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06435","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06435v1","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06435","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"IUVZVSNVEB5Y","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IUVZVSNVEB5YJ476","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IUVZVSNV","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IUVZVSNVEB5YJ476TYESIMT7PZ","target":"record","payload":{"canonical_record":{"source":{"id":"1712.06435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-18T14:53:51Z","cross_cats_sorted":[],"title_canon_sha256":"898cc402ca1ec71d16f96195a1465da9a24ece11cbe2c67e799e53baca855eb6","abstract_canon_sha256":"175a865fdb8368e79d779f4bb9a3a66b1768f64cfe81477530f65b02793639d6"},"schema_version":"1.0"},"canonical_sha256":"452b9ac9b5207b84f3fe9e0924327f7e75d5d3ce5ee4abbb0c7cd1f9b0af4a0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:47.882590Z","signature_b64":"6zchtV+9i9/ZhPQtnFzwexGQfQLXaRe4iLPwZ1Q39/W9snxhvW7qtWGm5Cn7kAlTRT6byZdLBrcsiBw1EGYQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"452b9ac9b5207b84f3fe9e0924327f7e75d5d3ce5ee4abbb0c7cd1f9b0af4a0c","last_reissued_at":"2026-05-18T00:27:47.882083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:47.882083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.06435","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:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QeWDqmHOR28OSEKkgcFQogcOQbp9xkgqCOF9LsJu3VHiOcW+YgchPBY0cEb7xDH/zat1DhnCA2mp3R/0GsbFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:49:10.595064Z"},"content_sha256":"085873c422d09b0b296b6cf9a05e91c5a43b7f7c1a06ddcf39608455d676129d","schema_version":"1.0","event_id":"sha256:085873c422d09b0b296b6cf9a05e91c5a43b7f7c1a06ddcf39608455d676129d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IUVZVSNVEB5YJ476TYESIMT7PZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Coding Algorithms for Multi-Layered Video Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Erika R. B\\'erczi-Kov\\'acs, Zolt\\'an Kir\\'aly","submitted_at":"2017-12-18T14:53:51Z","abstract_excerpt":"In this paper we give network coding algorithms for multi-layered video streaming. The problem is motivated by video broadcasting in a communication network to users with varying demands. We give a polynomial time algorithm for deciding feasibility for the case of two layers, and show that the problem becomes NP-hard if the task is to maximize the number of satisfied demands. For the case of three layers we also show NP-hardness of the problem. Finally, we propose a heuristic for three layers and give experimental comparison with previous approaches."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06435","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:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E417gQ00yB9jTC5jnOEZuCEgwmaAGuBMkxpd8qewY9PMrc9JBJ95gXGt+moO+qF/FICb6ipwp4bN25F2DicFCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:49:10.595737Z"},"content_sha256":"115c2e264d33e7d7101b50331603b6947557c14ee7ba16c6ff2576b47614f0ce","schema_version":"1.0","event_id":"sha256:115c2e264d33e7d7101b50331603b6947557c14ee7ba16c6ff2576b47614f0ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUVZVSNVEB5YJ476TYESIMT7PZ/bundle.json","state_url":"https://pith.science/pith/IUVZVSNVEB5YJ476TYESIMT7PZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUVZVSNVEB5YJ476TYESIMT7PZ/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-11T23:49:10Z","links":{"resolver":"https://pith.science/pith/IUVZVSNVEB5YJ476TYESIMT7PZ","bundle":"https://pith.science/pith/IUVZVSNVEB5YJ476TYESIMT7PZ/bundle.json","state":"https://pith.science/pith/IUVZVSNVEB5YJ476TYESIMT7PZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUVZVSNVEB5YJ476TYESIMT7PZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IUVZVSNVEB5YJ476TYESIMT7PZ","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":"175a865fdb8368e79d779f4bb9a3a66b1768f64cfe81477530f65b02793639d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-18T14:53:51Z","title_canon_sha256":"898cc402ca1ec71d16f96195a1465da9a24ece11cbe2c67e799e53baca855eb6"},"schema_version":"1.0","source":{"id":"1712.06435","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06435","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06435v1","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06435","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"IUVZVSNVEB5Y","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IUVZVSNVEB5YJ476","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IUVZVSNV","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:115c2e264d33e7d7101b50331603b6947557c14ee7ba16c6ff2576b47614f0ce","target":"graph","created_at":"2026-05-18T00:27:47Z","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 give network coding algorithms for multi-layered video streaming. The problem is motivated by video broadcasting in a communication network to users with varying demands. We give a polynomial time algorithm for deciding feasibility for the case of two layers, and show that the problem becomes NP-hard if the task is to maximize the number of satisfied demands. For the case of three layers we also show NP-hardness of the problem. Finally, we propose a heuristic for three layers and give experimental comparison with previous approaches.","authors_text":"Erika R. B\\'erczi-Kov\\'acs, Zolt\\'an Kir\\'aly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-18T14:53:51Z","title":"Network Coding Algorithms for Multi-Layered Video Broadcast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06435","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:085873c422d09b0b296b6cf9a05e91c5a43b7f7c1a06ddcf39608455d676129d","target":"record","created_at":"2026-05-18T00:27:47Z","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":"175a865fdb8368e79d779f4bb9a3a66b1768f64cfe81477530f65b02793639d6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-18T14:53:51Z","title_canon_sha256":"898cc402ca1ec71d16f96195a1465da9a24ece11cbe2c67e799e53baca855eb6"},"schema_version":"1.0","source":{"id":"1712.06435","kind":"arxiv","version":1}},"canonical_sha256":"452b9ac9b5207b84f3fe9e0924327f7e75d5d3ce5ee4abbb0c7cd1f9b0af4a0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"452b9ac9b5207b84f3fe9e0924327f7e75d5d3ce5ee4abbb0c7cd1f9b0af4a0c","first_computed_at":"2026-05-18T00:27:47.882083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:47.882083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6zchtV+9i9/ZhPQtnFzwexGQfQLXaRe4iLPwZ1Q39/W9snxhvW7qtWGm5Cn7kAlTRT6byZdLBrcsiBw1EGYQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:47.882590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06435","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:085873c422d09b0b296b6cf9a05e91c5a43b7f7c1a06ddcf39608455d676129d","sha256:115c2e264d33e7d7101b50331603b6947557c14ee7ba16c6ff2576b47614f0ce"],"state_sha256":"e2f66d8c78e22526be76ab064e790f68ad37437fa35c637f84a1cb6b7588c2fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZOk2b00gtHL+cNAfqKpf4sfi6jQMxApDLhuJzGz2LoD5DklFtE6Lyx/xMJGYfgKjrhVxsgE6CT+XO64FP0EHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:49:10.599529Z","bundle_sha256":"89a7afaf2b4d6b018b83fc9969e7e0730359242aa29f6f1bbbe2ad35617022a8"}}