{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2BB36V2GA6776RWRWVLNBQ73KA","short_pith_number":"pith:2BB36V2G","canonical_record":{"source":{"id":"1010.1899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-10T07:50:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3bbba3c34fb6ce6bc894362863add2e7bdce57021126195e94d2c151e1a73601","abstract_canon_sha256":"0d6f6a759720b0b13d0b1c39b4604e7786b00dcf19037af24069012ace7493c2"},"schema_version":"1.0"},"canonical_sha256":"d043bf574607bfff46d1b556d0c3fb5028246ef1f258308cac0ca94a2be2116e","source":{"kind":"arxiv","id":"1010.1899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1899","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1899v1","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1899","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"2BB36V2GA677","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2BB36V2GA6776RWR","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2BB36V2G","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2BB36V2GA6776RWRWVLNBQ73KA","target":"record","payload":{"canonical_record":{"source":{"id":"1010.1899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-10T07:50:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3bbba3c34fb6ce6bc894362863add2e7bdce57021126195e94d2c151e1a73601","abstract_canon_sha256":"0d6f6a759720b0b13d0b1c39b4604e7786b00dcf19037af24069012ace7493c2"},"schema_version":"1.0"},"canonical_sha256":"d043bf574607bfff46d1b556d0c3fb5028246ef1f258308cac0ca94a2be2116e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:30.099799Z","signature_b64":"wsXe8gAtGSs13TloOf/aPRsk4ayQ56KFZNl6VO7xw5C8i5QBWYlxUM3BeSsQf/OIhbUoRfDEN3+25gkJ3nsfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d043bf574607bfff46d1b556d0c3fb5028246ef1f258308cac0ca94a2be2116e","last_reissued_at":"2026-05-18T04:39:30.099255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:30.099255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.1899","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-18T04:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5pv34DL2a3NnOWLDKyKG87oAddD5ITRne8BwtfPtuD22SnCoF+r6fMMTDRanyWAuADcvxr7Jr5H6ZRfxA53+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:17:30.896695Z"},"content_sha256":"cdd16642dc693a48e7c4eff7868439e38cb5a12864c7b3f6c6b7f10ebb18d9a0","schema_version":"1.0","event_id":"sha256:cdd16642dc693a48e7c4eff7868439e38cb5a12864c7b3f6c6b7f10ebb18d9a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2BB36V2GA6776RWRWVLNBQ73KA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Failure Probability at Sink Node of Random Linear Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Xuan Guang","submitted_at":"2010-10-10T07:50:07Z","abstract_excerpt":"In practice, since many communication networks are huge in scale or complicated in structure even dynamic, the predesigned network codes based on the network topology is impossible even if the topological structure is known. Therefore, random linear network coding was proposed as an acceptable coding technique. In this paper, we further study the performance of random linear network coding by analyzing the failure probabilities at sink node for different knowledge of network topology and get some tight and asymptotically tight upper bounds of the failure probabilities. In particular, the worst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1899","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-18T04:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ke2IlvqtscdhfF58KfulSnRxhTNEUMWxQIsou9Seb+kVPLqGNWdF0l1zBPbaBErecIStuIzzLmeOLl1wOVbzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:17:30.897400Z"},"content_sha256":"bd0eadf3987f1bd5fbecab7a17974b36b6798ee5b9fe3d3f7050d838645a37dd","schema_version":"1.0","event_id":"sha256:bd0eadf3987f1bd5fbecab7a17974b36b6798ee5b9fe3d3f7050d838645a37dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BB36V2GA6776RWRWVLNBQ73KA/bundle.json","state_url":"https://pith.science/pith/2BB36V2GA6776RWRWVLNBQ73KA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BB36V2GA6776RWRWVLNBQ73KA/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-11T04:17:30Z","links":{"resolver":"https://pith.science/pith/2BB36V2GA6776RWRWVLNBQ73KA","bundle":"https://pith.science/pith/2BB36V2GA6776RWRWVLNBQ73KA/bundle.json","state":"https://pith.science/pith/2BB36V2GA6776RWRWVLNBQ73KA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BB36V2GA6776RWRWVLNBQ73KA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2BB36V2GA6776RWRWVLNBQ73KA","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":"0d6f6a759720b0b13d0b1c39b4604e7786b00dcf19037af24069012ace7493c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-10T07:50:07Z","title_canon_sha256":"3bbba3c34fb6ce6bc894362863add2e7bdce57021126195e94d2c151e1a73601"},"schema_version":"1.0","source":{"id":"1010.1899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1899","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1899v1","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1899","created_at":"2026-05-18T04:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"2BB36V2GA677","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2BB36V2GA6776RWR","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2BB36V2G","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:bd0eadf3987f1bd5fbecab7a17974b36b6798ee5b9fe3d3f7050d838645a37dd","target":"graph","created_at":"2026-05-18T04:39:30Z","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 practice, since many communication networks are huge in scale or complicated in structure even dynamic, the predesigned network codes based on the network topology is impossible even if the topological structure is known. Therefore, random linear network coding was proposed as an acceptable coding technique. In this paper, we further study the performance of random linear network coding by analyzing the failure probabilities at sink node for different knowledge of network topology and get some tight and asymptotically tight upper bounds of the failure probabilities. In particular, the worst","authors_text":"Fang-Wei Fu, Xuan Guang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-10T07:50:07Z","title":"The Failure Probability at Sink Node of Random Linear Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1899","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:cdd16642dc693a48e7c4eff7868439e38cb5a12864c7b3f6c6b7f10ebb18d9a0","target":"record","created_at":"2026-05-18T04:39:30Z","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":"0d6f6a759720b0b13d0b1c39b4604e7786b00dcf19037af24069012ace7493c2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-10T07:50:07Z","title_canon_sha256":"3bbba3c34fb6ce6bc894362863add2e7bdce57021126195e94d2c151e1a73601"},"schema_version":"1.0","source":{"id":"1010.1899","kind":"arxiv","version":1}},"canonical_sha256":"d043bf574607bfff46d1b556d0c3fb5028246ef1f258308cac0ca94a2be2116e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d043bf574607bfff46d1b556d0c3fb5028246ef1f258308cac0ca94a2be2116e","first_computed_at":"2026-05-18T04:39:30.099255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:30.099255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wsXe8gAtGSs13TloOf/aPRsk4ayQ56KFZNl6VO7xw5C8i5QBWYlxUM3BeSsQf/OIhbUoRfDEN3+25gkJ3nsfCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:30.099799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdd16642dc693a48e7c4eff7868439e38cb5a12864c7b3f6c6b7f10ebb18d9a0","sha256:bd0eadf3987f1bd5fbecab7a17974b36b6798ee5b9fe3d3f7050d838645a37dd"],"state_sha256":"60c140f6d108244b7d8a627177323abb71fd3f408c179c6ce589d68ac591c6f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TupubyKcQ0J0ui4bZ8sGXlZNCOa2/9hIZ8j40/yBqDFPVNamuJg1Yp0NWOzTHPrBvJ6wJRWlbZhmaY1/Z50xAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:17:30.901090Z","bundle_sha256":"238fba3ca6c0993ea7bfd4694b8a0f3aead1f43b4a541a102f671b4191abeaa5"}}