{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VEP5KCFO72JDBAQS3SXGHH3LEQ","short_pith_number":"pith:VEP5KCFO","canonical_record":{"source":{"id":"1211.0951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-05T17:56:19Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"9d217b271ed9b81d904637f80034b97c1159a5d358e6f457e595440242b71b05","abstract_canon_sha256":"c43206aa79267c3a18dca8a504d706622cb7e6c2652585238caee7ffb8aeb4c3"},"schema_version":"1.0"},"canonical_sha256":"a91fd508aefe92308212dcae639f6b240b30dd3b47d1166e9b86df697a3a33f6","source":{"kind":"arxiv","id":"1211.0951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0951","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0951v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0951","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"VEP5KCFO72JD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VEP5KCFO72JDBAQS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VEP5KCFO","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VEP5KCFO72JDBAQS3SXGHH3LEQ","target":"record","payload":{"canonical_record":{"source":{"id":"1211.0951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-05T17:56:19Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"9d217b271ed9b81d904637f80034b97c1159a5d358e6f457e595440242b71b05","abstract_canon_sha256":"c43206aa79267c3a18dca8a504d706622cb7e6c2652585238caee7ffb8aeb4c3"},"schema_version":"1.0"},"canonical_sha256":"a91fd508aefe92308212dcae639f6b240b30dd3b47d1166e9b86df697a3a33f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.972633Z","signature_b64":"KkfVDg5snSUpruPhxoRxnopEuTgNpoNoiSd9fYrYbxSovLMPs1thfVO2vRMowibsdFumbfMahNMo1U+5R0fxCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a91fd508aefe92308212dcae639f6b240b30dd3b47d1166e9b86df697a3a33f6","last_reissued_at":"2026-05-18T00:58:17.971812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.971812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.0951","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:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D4BbUiECyv3ptveFoZSa6e5vR1OAs7dZajIeqM8tH3t3miuIcPPI8IpNgRIoh+oRaU8EbBHbiWIpxiq5wEFhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:10:07.847190Z"},"content_sha256":"6c6648f3493140854497f103119bcb52090d02fb8207ab77fcdad35b5157b011","schema_version":"1.0","event_id":"sha256:6c6648f3493140854497f103119bcb52090d02fb8207ab77fcdad35b5157b011"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VEP5KCFO72JDBAQS3SXGHH3LEQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding Delay Minimization in Inter-Session Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Eirina Bourtsoulatze, Nikolaos Thomos, Pascal Frossard","submitted_at":"2012-11-05T17:56:19Z","abstract_excerpt":"Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources transmit data to sets of clients and study the benefits of inter-session network coding, when network nodes have the opportunity to combine packets from different sources. In particular, we propose a novel framework for optimal rate allocation in inter-session network coding systems. We formulate the problem as the minimization of the average d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0951","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:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJ2fPQrvmG/qdZF5iBk3SbcbZeX/UWrYJt5MRIZkKbCqPJdZMOcTIiK14s9mmvA856f7V4Kicd9xTOLjk5aFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:10:07.847542Z"},"content_sha256":"0624cff35faa77182ea94cb5f12498a3a7f0425bd2d4ab22426efdc8c440e55c","schema_version":"1.0","event_id":"sha256:0624cff35faa77182ea94cb5f12498a3a7f0425bd2d4ab22426efdc8c440e55c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEP5KCFO72JDBAQS3SXGHH3LEQ/bundle.json","state_url":"https://pith.science/pith/VEP5KCFO72JDBAQS3SXGHH3LEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEP5KCFO72JDBAQS3SXGHH3LEQ/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-06T23:10:07Z","links":{"resolver":"https://pith.science/pith/VEP5KCFO72JDBAQS3SXGHH3LEQ","bundle":"https://pith.science/pith/VEP5KCFO72JDBAQS3SXGHH3LEQ/bundle.json","state":"https://pith.science/pith/VEP5KCFO72JDBAQS3SXGHH3LEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEP5KCFO72JDBAQS3SXGHH3LEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VEP5KCFO72JDBAQS3SXGHH3LEQ","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":"c43206aa79267c3a18dca8a504d706622cb7e6c2652585238caee7ffb8aeb4c3","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-05T17:56:19Z","title_canon_sha256":"9d217b271ed9b81d904637f80034b97c1159a5d358e6f457e595440242b71b05"},"schema_version":"1.0","source":{"id":"1211.0951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0951","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0951v1","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0951","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"VEP5KCFO72JD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VEP5KCFO72JDBAQS","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VEP5KCFO","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:0624cff35faa77182ea94cb5f12498a3a7f0425bd2d4ab22426efdc8c440e55c","target":"graph","created_at":"2026-05-18T00:58:17Z","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":"Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources transmit data to sets of clients and study the benefits of inter-session network coding, when network nodes have the opportunity to combine packets from different sources. In particular, we propose a novel framework for optimal rate allocation in inter-session network coding systems. We formulate the problem as the minimization of the average d","authors_text":"Eirina Bourtsoulatze, Nikolaos Thomos, Pascal Frossard","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-05T17:56:19Z","title":"Decoding Delay Minimization in Inter-Session Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0951","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:6c6648f3493140854497f103119bcb52090d02fb8207ab77fcdad35b5157b011","target":"record","created_at":"2026-05-18T00:58:17Z","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":"c43206aa79267c3a18dca8a504d706622cb7e6c2652585238caee7ffb8aeb4c3","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-05T17:56:19Z","title_canon_sha256":"9d217b271ed9b81d904637f80034b97c1159a5d358e6f457e595440242b71b05"},"schema_version":"1.0","source":{"id":"1211.0951","kind":"arxiv","version":1}},"canonical_sha256":"a91fd508aefe92308212dcae639f6b240b30dd3b47d1166e9b86df697a3a33f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a91fd508aefe92308212dcae639f6b240b30dd3b47d1166e9b86df697a3a33f6","first_computed_at":"2026-05-18T00:58:17.971812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.971812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KkfVDg5snSUpruPhxoRxnopEuTgNpoNoiSd9fYrYbxSovLMPs1thfVO2vRMowibsdFumbfMahNMo1U+5R0fxCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.972633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c6648f3493140854497f103119bcb52090d02fb8207ab77fcdad35b5157b011","sha256:0624cff35faa77182ea94cb5f12498a3a7f0425bd2d4ab22426efdc8c440e55c"],"state_sha256":"f3c4f1f2ecbb7d2ae0460d6c33f272879789fde0da801f78d44688f0f00c6537"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYvRVSF/M+59UbG1/JLuSKnlFZrEZRFtVjGcqmacbIYpDy/6W+cruIy6bOA06e/FEU03PP74YLhIjuahXcboAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:10:07.849410Z","bundle_sha256":"ed324ca39198ceb636c413e87ce80020f4f01d9197b86d88d471319f9cb11de1"}}