{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:NMUHM6FSQNP6JIN3NV3R3UNMKP","short_pith_number":"pith:NMUHM6FS","canonical_record":{"source":{"id":"0805.1088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2008-05-08T02:20:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"11a52849b18e75fdd91bd742397a53381504cdd393d550fe2efebbd425b1edb3","abstract_canon_sha256":"b75189d110eae7ccccc48dd2bdb8379020d4b98ccf6a9e964dbcd403eb7043e8"},"schema_version":"1.0"},"canonical_sha256":"6b287678b2835fe4a1bb6d771dd1ac53c546c6803affc018bc453b905ed67822","source":{"kind":"arxiv","id":"0805.1088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.1088","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0805.1088v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.1088","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"NMUHM6FSQNP6","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"NMUHM6FSQNP6JIN3","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"NMUHM6FS","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:NMUHM6FSQNP6JIN3NV3R3UNMKP","target":"record","payload":{"canonical_record":{"source":{"id":"0805.1088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2008-05-08T02:20:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"11a52849b18e75fdd91bd742397a53381504cdd393d550fe2efebbd425b1edb3","abstract_canon_sha256":"b75189d110eae7ccccc48dd2bdb8379020d4b98ccf6a9e964dbcd403eb7043e8"},"schema_version":"1.0"},"canonical_sha256":"6b287678b2835fe4a1bb6d771dd1ac53c546c6803affc018bc453b905ed67822","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:11.791268Z","signature_b64":"MrLqsEM3B5iT2JPsDBUpEEkUcwtRs/UBrUON90wKGc8WSkVgOKJHfDzV2W0nqeMqx05KmhCpz5ARQbVaFLlxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b287678b2835fe4a1bb6d771dd1ac53c546c6803affc018bc453b905ed67822","last_reissued_at":"2026-05-18T00:59:11.790628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:11.790628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0805.1088","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODYHEc2or+h2EBQ6bBJqiEoVv1RSrCsOnqYqSOSbOSXRqtdeGtOASY6ALbQUYQrash7Rlt5J3pCb7iRy7p79CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:37:02.252002Z"},"content_sha256":"f0aabef16bce27bd21946738c86aa25700b4185a842092c7690185700cc02635","schema_version":"1.0","event_id":"sha256:f0aabef16bce27bd21946738c86aa25700b4185a842092c7690185700cc02635"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:NMUHM6FSQNP6JIN3NV3R3UNMKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network Coding for Speedup in Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Jay Kumar Sundararajan, MinJi Kim, Muriel Medard","submitted_at":"2008-05-08T02:20:15Z","abstract_excerpt":"We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e. network coding, which is usually implemented using software, can in many cases substitute speedup, which is often achieved by adding extra switch fabrics. This bound is based on an approach to network coding problems called the \"enhanced conflict graph\". We show that the \"imperfection ratio\" of the enhanced conflict graph gives an upper bound on speedup. In p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.1088","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:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKBXi7E94ht9TK3UX3HBAr76hvx4BBGiq47kCxo1sgBbFg29M1O1STFS2FlsDFzFaVTzkXBTo79laRorMdvKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:37:02.252677Z"},"content_sha256":"762306a3abb289e9a5b6176f5eccc481df3ade12bf5d890a65dc74cae5124d58","schema_version":"1.0","event_id":"sha256:762306a3abb289e9a5b6176f5eccc481df3ade12bf5d890a65dc74cae5124d58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NMUHM6FSQNP6JIN3NV3R3UNMKP/bundle.json","state_url":"https://pith.science/pith/NMUHM6FSQNP6JIN3NV3R3UNMKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NMUHM6FSQNP6JIN3NV3R3UNMKP/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-25T07:37:02Z","links":{"resolver":"https://pith.science/pith/NMUHM6FSQNP6JIN3NV3R3UNMKP","bundle":"https://pith.science/pith/NMUHM6FSQNP6JIN3NV3R3UNMKP/bundle.json","state":"https://pith.science/pith/NMUHM6FSQNP6JIN3NV3R3UNMKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NMUHM6FSQNP6JIN3NV3R3UNMKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:NMUHM6FSQNP6JIN3NV3R3UNMKP","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":"b75189d110eae7ccccc48dd2bdb8379020d4b98ccf6a9e964dbcd403eb7043e8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2008-05-08T02:20:15Z","title_canon_sha256":"11a52849b18e75fdd91bd742397a53381504cdd393d550fe2efebbd425b1edb3"},"schema_version":"1.0","source":{"id":"0805.1088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0805.1088","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"0805.1088v1","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.1088","created_at":"2026-05-18T00:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"NMUHM6FSQNP6","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"NMUHM6FSQNP6JIN3","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"NMUHM6FS","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:762306a3abb289e9a5b6176f5eccc481df3ade12bf5d890a65dc74cae5124d58","target":"graph","created_at":"2026-05-18T00:59:11Z","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":"We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e. network coding, which is usually implemented using software, can in many cases substitute speedup, which is often achieved by adding extra switch fabrics. This bound is based on an approach to network coding problems called the \"enhanced conflict graph\". We show that the \"imperfection ratio\" of the enhanced conflict graph gives an upper bound on speedup. In p","authors_text":"Jay Kumar Sundararajan, MinJi Kim, Muriel Medard","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2008-05-08T02:20:15Z","title":"Network Coding for Speedup in Switches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.1088","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:f0aabef16bce27bd21946738c86aa25700b4185a842092c7690185700cc02635","target":"record","created_at":"2026-05-18T00:59:11Z","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":"b75189d110eae7ccccc48dd2bdb8379020d4b98ccf6a9e964dbcd403eb7043e8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2008-05-08T02:20:15Z","title_canon_sha256":"11a52849b18e75fdd91bd742397a53381504cdd393d550fe2efebbd425b1edb3"},"schema_version":"1.0","source":{"id":"0805.1088","kind":"arxiv","version":1}},"canonical_sha256":"6b287678b2835fe4a1bb6d771dd1ac53c546c6803affc018bc453b905ed67822","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b287678b2835fe4a1bb6d771dd1ac53c546c6803affc018bc453b905ed67822","first_computed_at":"2026-05-18T00:59:11.790628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:11.790628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrLqsEM3B5iT2JPsDBUpEEkUcwtRs/UBrUON90wKGc8WSkVgOKJHfDzV2W0nqeMqx05KmhCpz5ARQbVaFLlxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:11.791268Z","signed_message":"canonical_sha256_bytes"},"source_id":"0805.1088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0aabef16bce27bd21946738c86aa25700b4185a842092c7690185700cc02635","sha256:762306a3abb289e9a5b6176f5eccc481df3ade12bf5d890a65dc74cae5124d58"],"state_sha256":"ba68a45db65fa1f22b92c541ecd88482806ca9e50fc7316d4c06ff22ae15d2e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCH0MMfUiF8KvnapqDbkqUCehQb3TTSI3CWwPcN7DppjpYFHvjn/nF8vWa62gGtsAxSRNK8t0W8OXaHHmC58Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:37:02.256398Z","bundle_sha256":"a7d9070a4fdb2eaaeb1942eeff44de368e3a4df5f6be4c31b9ba332580796468"}}