{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:KJABCMO43YSIWI2KV7EWFE6DXP","short_pith_number":"pith:KJABCMO4","canonical_record":{"source":{"id":"1008.0045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-31T02:23:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6abd15d8da3ac415f68df673acc369700e042a07de002cec6f5620c5447b465b","abstract_canon_sha256":"283fd013b433feb3a092ff44041be8e1ccc0788e60018be1929a2b1cce735b8d"},"schema_version":"1.0"},"canonical_sha256":"52401131dcde248b234aafc96293c3bbce061863708f1ea1e8ad97138ab7b5bc","source":{"kind":"arxiv","id":"1008.0045","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0045","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0045v2","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0045","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"KJABCMO43YSI","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KJABCMO43YSIWI2K","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KJABCMO4","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:KJABCMO43YSIWI2KV7EWFE6DXP","target":"record","payload":{"canonical_record":{"source":{"id":"1008.0045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-31T02:23:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6abd15d8da3ac415f68df673acc369700e042a07de002cec6f5620c5447b465b","abstract_canon_sha256":"283fd013b433feb3a092ff44041be8e1ccc0788e60018be1929a2b1cce735b8d"},"schema_version":"1.0"},"canonical_sha256":"52401131dcde248b234aafc96293c3bbce061863708f1ea1e8ad97138ab7b5bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:43.077470Z","signature_b64":"fAw+XKOfdZdt2rzAovini3CZsZ6ohYgoe4uSUC5GSNCWMiCnHzSiBpxotPhdLSTkUxpRSvjr57Y3a40ziPdtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52401131dcde248b234aafc96293c3bbce061863708f1ea1e8ad97138ab7b5bc","last_reissued_at":"2026-05-18T04:42:43.077081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:43.077081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.0045","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-18T04:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1B2xc6tIpW9AjsdodtGAq+ONL3CtDIqu7zaQ4XzFrADNKEctMS3GJNl01WPMNy+lhSQ03n1KK/ZjNicfu2X5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:15:35.804135Z"},"content_sha256":"a60310c82474e89ea9a23fff7c6e9dccb08b9fd01f134e79a1f77e87b3fc6f57","schema_version":"1.0","event_id":"sha256:a60310c82474e89ea9a23fff7c6e9dccb08b9fd01f134e79a1f77e87b3fc6f57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:KJABCMO43YSIWI2KV7EWFE6DXP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal and Robust Distributed Network Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lingxiao Xia, Sidharth Jaggi, Svitlana Vyetrenko, Tracey Ho","submitted_at":"2010-07-31T02:23:50Z","abstract_excerpt":"Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented over finite fields whose size depends on some global network parameters (size of the network, the number of sinks) that may not be known prior to code design. Also, if new nodes join the entire network code may have to be redesigned.\n  In this work, we present the first universal and robust distributed linear network coding schemes. Our schemes are universal since they are independent of all network parameters. They are robust "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0045","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-18T04:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuotsk8HjpGu1Mno6XZP2HC2L/KY9b+0fs6H5T56cVy7OXv3mYp1dId7dXpbHUJCARJHwQqrOIiEzPquppxFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:15:35.804510Z"},"content_sha256":"8c927a0b8290be735bd52794c57baf5ab25c4c985764b7d6dec5446fd5aa86c0","schema_version":"1.0","event_id":"sha256:8c927a0b8290be735bd52794c57baf5ab25c4c985764b7d6dec5446fd5aa86c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KJABCMO43YSIWI2KV7EWFE6DXP/bundle.json","state_url":"https://pith.science/pith/KJABCMO43YSIWI2KV7EWFE6DXP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KJABCMO43YSIWI2KV7EWFE6DXP/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-28T02:15:35Z","links":{"resolver":"https://pith.science/pith/KJABCMO43YSIWI2KV7EWFE6DXP","bundle":"https://pith.science/pith/KJABCMO43YSIWI2KV7EWFE6DXP/bundle.json","state":"https://pith.science/pith/KJABCMO43YSIWI2KV7EWFE6DXP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KJABCMO43YSIWI2KV7EWFE6DXP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:KJABCMO43YSIWI2KV7EWFE6DXP","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":"283fd013b433feb3a092ff44041be8e1ccc0788e60018be1929a2b1cce735b8d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-31T02:23:50Z","title_canon_sha256":"6abd15d8da3ac415f68df673acc369700e042a07de002cec6f5620c5447b465b"},"schema_version":"1.0","source":{"id":"1008.0045","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.0045","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1008.0045v2","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.0045","created_at":"2026-05-18T04:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"KJABCMO43YSI","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"KJABCMO43YSIWI2K","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"KJABCMO4","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:8c927a0b8290be735bd52794c57baf5ab25c4c985764b7d6dec5446fd5aa86c0","target":"graph","created_at":"2026-05-18T04:42:43Z","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":"Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented over finite fields whose size depends on some global network parameters (size of the network, the number of sinks) that may not be known prior to code design. Also, if new nodes join the entire network code may have to be redesigned.\n  In this work, we present the first universal and robust distributed linear network coding schemes. Our schemes are universal since they are independent of all network parameters. They are robust ","authors_text":"Lingxiao Xia, Sidharth Jaggi, Svitlana Vyetrenko, Tracey Ho","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-31T02:23:50Z","title":"Universal and Robust Distributed Network Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.0045","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:a60310c82474e89ea9a23fff7c6e9dccb08b9fd01f134e79a1f77e87b3fc6f57","target":"record","created_at":"2026-05-18T04:42:43Z","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":"283fd013b433feb3a092ff44041be8e1ccc0788e60018be1929a2b1cce735b8d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-31T02:23:50Z","title_canon_sha256":"6abd15d8da3ac415f68df673acc369700e042a07de002cec6f5620c5447b465b"},"schema_version":"1.0","source":{"id":"1008.0045","kind":"arxiv","version":2}},"canonical_sha256":"52401131dcde248b234aafc96293c3bbce061863708f1ea1e8ad97138ab7b5bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52401131dcde248b234aafc96293c3bbce061863708f1ea1e8ad97138ab7b5bc","first_computed_at":"2026-05-18T04:42:43.077081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:43.077081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fAw+XKOfdZdt2rzAovini3CZsZ6ohYgoe4uSUC5GSNCWMiCnHzSiBpxotPhdLSTkUxpRSvjr57Y3a40ziPdtAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:43.077470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.0045","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a60310c82474e89ea9a23fff7c6e9dccb08b9fd01f134e79a1f77e87b3fc6f57","sha256:8c927a0b8290be735bd52794c57baf5ab25c4c985764b7d6dec5446fd5aa86c0"],"state_sha256":"ef7198f441d972956003d3689e0991d17873aefea3713fb81d2c964bb0b5636e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ySNm1cWfjsfsuMsV5l8bnmRTBa9FEl/9nB58E7rLbFhGoPZz3gSKtpt4HRGxBrctM3c2MT9jNFfQslsdFj3yDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:15:35.806574Z","bundle_sha256":"d6c7cc7e2349893929a177d14d10892b3fe4bb60131eab2fa4fda53738295577"}}