{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ILSY22PM7WIALS52NT2E2EFWER","short_pith_number":"pith:ILSY22PM","canonical_record":{"source":{"id":"1212.5032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-12-20T13:46:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"15d674cc1e355c8f501db24872008b1f3a837608db9e0561d82d1f48ec7e0273","abstract_canon_sha256":"2b58a54d947f086b2880a1ac448ff2553381e25352af6b501ffa0dfbdc244d98"},"schema_version":"1.0"},"canonical_sha256":"42e58d69ecfd9005cbba6cf44d10b6247101691fc437f192a7868c68e8dd8d0c","source":{"kind":"arxiv","id":"1212.5032","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5032","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5032v2","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5032","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"ILSY22PM7WIA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"ILSY22PM7WIALS52","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"ILSY22PM","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ILSY22PM7WIALS52NT2E2EFWER","target":"record","payload":{"canonical_record":{"source":{"id":"1212.5032","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-12-20T13:46:04Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"15d674cc1e355c8f501db24872008b1f3a837608db9e0561d82d1f48ec7e0273","abstract_canon_sha256":"2b58a54d947f086b2880a1ac448ff2553381e25352af6b501ffa0dfbdc244d98"},"schema_version":"1.0"},"canonical_sha256":"42e58d69ecfd9005cbba6cf44d10b6247101691fc437f192a7868c68e8dd8d0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.833144Z","signature_b64":"SKU8e4tOCIhfpO0QoyGfjRjeh+bzJb2ETyxLsVHxQbsyzFYD/8IzLm/a9ljPqqb/00hqc9pr+StPisthE5L1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42e58d69ecfd9005cbba6cf44d10b6247101691fc437f192a7868c68e8dd8d0c","last_reissued_at":"2026-05-18T00:58:17.832339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.832339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.5032","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: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":"1EAp9t/RPqW/dAZT+8TFHFpFJv/QzlmHnCbQDCOq1QCk0dQTjH0P0AeExB1m4RFAGiCKhc7xyqoi7BGROuRuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:38:42.887867Z"},"content_sha256":"0e390f35b9f969cf4404633f08a1bcd4967ce1ac7200cbee6550db7e1eb527a0","schema_version":"1.0","event_id":"sha256:0e390f35b9f969cf4404633f08a1bcd4967ce1ac7200cbee6550db7e1eb527a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ILSY22PM7WIALS52NT2E2EFWER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Rate Allocation in Inter-Session Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Eirina Bourtsoulatze, Nikolaos Thomos, Pascal Frossard","submitted_at":"2012-12-20T13:46:04Z","abstract_excerpt":"In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user requests the content of one of the available sources. We propose a novel distributed algorithm where network users determine the coding operations and the packet rates to be requested from the parent nodes, such that the decoding delay is minimized for all the clients. A rate allocation problem is solved by every user, which seeks the rates t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5032","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: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":"B1/26iHhGXDZKplPiBKJn4pDZyiVKC6IZQ868hMks20sy8k7dB7/KT07dy3BBCu0R7sM6CLiTG1NxsMcB5XlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:38:42.888208Z"},"content_sha256":"c2f1b5bb1100883c27f97bc54ff7a92921a1a7b1b7956eac46417c742cecf62d","schema_version":"1.0","event_id":"sha256:c2f1b5bb1100883c27f97bc54ff7a92921a1a7b1b7956eac46417c742cecf62d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILSY22PM7WIALS52NT2E2EFWER/bundle.json","state_url":"https://pith.science/pith/ILSY22PM7WIALS52NT2E2EFWER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILSY22PM7WIALS52NT2E2EFWER/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-07T13:38:42Z","links":{"resolver":"https://pith.science/pith/ILSY22PM7WIALS52NT2E2EFWER","bundle":"https://pith.science/pith/ILSY22PM7WIALS52NT2E2EFWER/bundle.json","state":"https://pith.science/pith/ILSY22PM7WIALS52NT2E2EFWER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILSY22PM7WIALS52NT2E2EFWER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ILSY22PM7WIALS52NT2E2EFWER","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":"2b58a54d947f086b2880a1ac448ff2553381e25352af6b501ffa0dfbdc244d98","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-12-20T13:46:04Z","title_canon_sha256":"15d674cc1e355c8f501db24872008b1f3a837608db9e0561d82d1f48ec7e0273"},"schema_version":"1.0","source":{"id":"1212.5032","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.5032","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1212.5032v2","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5032","created_at":"2026-05-18T00:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"ILSY22PM7WIA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"ILSY22PM7WIALS52","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"ILSY22PM","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:c2f1b5bb1100883c27f97bc54ff7a92921a1a7b1b7956eac46417c742cecf62d","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":"In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user requests the content of one of the available sources. We propose a novel distributed algorithm where network users determine the coding operations and the packet rates to be requested from the parent nodes, such that the decoding delay is minimized for all the clients. A rate allocation problem is solved by every user, which seeks the rates t","authors_text":"Eirina Bourtsoulatze, Nikolaos Thomos, Pascal Frossard","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-12-20T13:46:04Z","title":"Distributed Rate Allocation in Inter-Session Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5032","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:0e390f35b9f969cf4404633f08a1bcd4967ce1ac7200cbee6550db7e1eb527a0","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":"2b58a54d947f086b2880a1ac448ff2553381e25352af6b501ffa0dfbdc244d98","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-12-20T13:46:04Z","title_canon_sha256":"15d674cc1e355c8f501db24872008b1f3a837608db9e0561d82d1f48ec7e0273"},"schema_version":"1.0","source":{"id":"1212.5032","kind":"arxiv","version":2}},"canonical_sha256":"42e58d69ecfd9005cbba6cf44d10b6247101691fc437f192a7868c68e8dd8d0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42e58d69ecfd9005cbba6cf44d10b6247101691fc437f192a7868c68e8dd8d0c","first_computed_at":"2026-05-18T00:58:17.832339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:17.832339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SKU8e4tOCIhfpO0QoyGfjRjeh+bzJb2ETyxLsVHxQbsyzFYD/8IzLm/a9ljPqqb/00hqc9pr+StPisthE5L1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:17.833144Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.5032","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e390f35b9f969cf4404633f08a1bcd4967ce1ac7200cbee6550db7e1eb527a0","sha256:c2f1b5bb1100883c27f97bc54ff7a92921a1a7b1b7956eac46417c742cecf62d"],"state_sha256":"5abffcc7c0f21f7b35022db610ffa88ffb9a819d542a880fc55229031fb9e254"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+49H+Q03Fh8w10aRzJ/D7+uqxKc010A4i5Kyf2gebWaZocaeqIoW9XPv9elh3lB2q+heS/K/ahwApdWETHvmBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:38:42.890170Z","bundle_sha256":"e07420347a8adf7bf9aa50c5059a02f5d7b2d1dc5f12ef7a5b7959a809e8e7ce"}}