{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GIWDASIJOWVWLMVOUAP5HLUUUX","short_pith_number":"pith:GIWDASIJ","canonical_record":{"source":{"id":"1210.1915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-06T06:26:06Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"620c77f437d35513514227f6ed0d1943a9cfa899c774e39817c6dc651fcacbf1","abstract_canon_sha256":"ad4fd45fd5cad3899b3f9bc79dbe3627e0deabab9751165b11f6d4e63119db2e"},"schema_version":"1.0"},"canonical_sha256":"322c30490975ab65b2aea01fd3ae94a5d786a7874c9f27fb084af5b97c39b3b0","source":{"kind":"arxiv","id":"1210.1915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1915","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1915v1","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1915","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"pith_short_12","alias_value":"GIWDASIJOWVW","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GIWDASIJOWVWLMVO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GIWDASIJ","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GIWDASIJOWVWLMVOUAP5HLUUUX","target":"record","payload":{"canonical_record":{"source":{"id":"1210.1915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-06T06:26:06Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"620c77f437d35513514227f6ed0d1943a9cfa899c774e39817c6dc651fcacbf1","abstract_canon_sha256":"ad4fd45fd5cad3899b3f9bc79dbe3627e0deabab9751165b11f6d4e63119db2e"},"schema_version":"1.0"},"canonical_sha256":"322c30490975ab65b2aea01fd3ae94a5d786a7874c9f27fb084af5b97c39b3b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:51.615204Z","signature_b64":"MLq/iiWFF92hf+wjniCjVR253c6+6+3REMDgIc1wsicpLOy/M8sQ5bUWHqqJQE2DpVLXyybRRTjsod7hi6xVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"322c30490975ab65b2aea01fd3ae94a5d786a7874c9f27fb084af5b97c39b3b0","last_reissued_at":"2026-05-18T03:43:51.614437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:51.614437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.1915","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-18T03:43:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OS4VlDzJOryqgmk6bqgCVnSr+uzk3BHNNLWvRmMBu4EMzsw8K7ZRcs2t1/Q8xxB66qfdgvV88x6NDUbAA0OHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:17:09.569566Z"},"content_sha256":"3e005ddf800f8f8c825f74950a8f24e12b97fdab2e0b95d8559c9426318a3d63","schema_version":"1.0","event_id":"sha256:3e005ddf800f8f8c825f74950a8f24e12b97fdab2e0b95d8559c9426318a3d63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GIWDASIJOWVWLMVOUAP5HLUUUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Limitation of Random Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Yuan Li","submitted_at":"2012-10-06T06:26:06Z","abstract_excerpt":"It is already known that in multicast (single source, multiple sinks) network, random linear network coding can achieve the maximum flow upper bound. In this paper, we investigate how random linear network coding behaves in general multi-source multi-sink case, where each sink has different demands, and characterize all achievable rate of random linear network coding by a simple maximum flow condition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1915","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-18T03:43:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGQ2GBKNFY7KWve+7IwxTrpGBNQLZbvKmWf5wfon28dlc1vee9tCzj9F70OKWu97OgkX75JgXJMlR2hLDq+OAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:17:09.569924Z"},"content_sha256":"b3cd665f2261fb90df15fc33bace60483d2d65a0a3cbbd8b47cb6b21144916ab","schema_version":"1.0","event_id":"sha256:b3cd665f2261fb90df15fc33bace60483d2d65a0a3cbbd8b47cb6b21144916ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIWDASIJOWVWLMVOUAP5HLUUUX/bundle.json","state_url":"https://pith.science/pith/GIWDASIJOWVWLMVOUAP5HLUUUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIWDASIJOWVWLMVOUAP5HLUUUX/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-31T04:17:09Z","links":{"resolver":"https://pith.science/pith/GIWDASIJOWVWLMVOUAP5HLUUUX","bundle":"https://pith.science/pith/GIWDASIJOWVWLMVOUAP5HLUUUX/bundle.json","state":"https://pith.science/pith/GIWDASIJOWVWLMVOUAP5HLUUUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIWDASIJOWVWLMVOUAP5HLUUUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GIWDASIJOWVWLMVOUAP5HLUUUX","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":"ad4fd45fd5cad3899b3f9bc79dbe3627e0deabab9751165b11f6d4e63119db2e","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-06T06:26:06Z","title_canon_sha256":"620c77f437d35513514227f6ed0d1943a9cfa899c774e39817c6dc651fcacbf1"},"schema_version":"1.0","source":{"id":"1210.1915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.1915","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"arxiv_version","alias_value":"1210.1915v1","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.1915","created_at":"2026-05-18T03:43:51Z"},{"alias_kind":"pith_short_12","alias_value":"GIWDASIJOWVW","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GIWDASIJOWVWLMVO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GIWDASIJ","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:b3cd665f2261fb90df15fc33bace60483d2d65a0a3cbbd8b47cb6b21144916ab","target":"graph","created_at":"2026-05-18T03:43:51Z","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":"It is already known that in multicast (single source, multiple sinks) network, random linear network coding can achieve the maximum flow upper bound. In this paper, we investigate how random linear network coding behaves in general multi-source multi-sink case, where each sink has different demands, and characterize all achievable rate of random linear network coding by a simple maximum flow condition.","authors_text":"Yuan Li","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-06T06:26:06Z","title":"The Limitation of Random Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.1915","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:3e005ddf800f8f8c825f74950a8f24e12b97fdab2e0b95d8559c9426318a3d63","target":"record","created_at":"2026-05-18T03:43:51Z","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":"ad4fd45fd5cad3899b3f9bc79dbe3627e0deabab9751165b11f6d4e63119db2e","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-06T06:26:06Z","title_canon_sha256":"620c77f437d35513514227f6ed0d1943a9cfa899c774e39817c6dc651fcacbf1"},"schema_version":"1.0","source":{"id":"1210.1915","kind":"arxiv","version":1}},"canonical_sha256":"322c30490975ab65b2aea01fd3ae94a5d786a7874c9f27fb084af5b97c39b3b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"322c30490975ab65b2aea01fd3ae94a5d786a7874c9f27fb084af5b97c39b3b0","first_computed_at":"2026-05-18T03:43:51.614437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:51.614437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MLq/iiWFF92hf+wjniCjVR253c6+6+3REMDgIc1wsicpLOy/M8sQ5bUWHqqJQE2DpVLXyybRRTjsod7hi6xVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:51.615204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.1915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e005ddf800f8f8c825f74950a8f24e12b97fdab2e0b95d8559c9426318a3d63","sha256:b3cd665f2261fb90df15fc33bace60483d2d65a0a3cbbd8b47cb6b21144916ab"],"state_sha256":"0f1228ccdc2fcf2b94b4a43521f6c0f44d7e248cb57ecdf3a4ed40a760c37ad0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxSVOwnTPEXdWhLhXAn3sh+9zaugV1loxjrrL0loh9JM4uvzg1tWgDHoTi0SMXnZPa97wyf+CJrFEPHB1sS1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:17:09.572138Z","bundle_sha256":"88a15ed4e40bfaedc048e9a4c7c4fc7b0ff130179b9112807378feb1b58c2b69"}}