{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:ETEJBABG7NJZ3EI4NYT2JDBSH4","short_pith_number":"pith:ETEJBABG","canonical_record":{"source":{"id":"0906.0695","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-03T12:22:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"36e6762c5ed1d507d84fcb2d63552bf4be157e8c6ad3d131b10ec8aa4db35596","abstract_canon_sha256":"db6227d744bbd29cad2a27668e267fa594c19b66ec4baadb4078c0182395b659"},"schema_version":"1.0"},"canonical_sha256":"24c8908026fb539d911c6e27a48c323f2ff3005338a2246ff4bf689232324267","source":{"kind":"arxiv","id":"0906.0695","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.0695","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0906.0695v4","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0695","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"ETEJBABG7NJZ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"ETEJBABG7NJZ3EI4","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"ETEJBABG","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:ETEJBABG7NJZ3EI4NYT2JDBSH4","target":"record","payload":{"canonical_record":{"source":{"id":"0906.0695","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-03T12:22:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"36e6762c5ed1d507d84fcb2d63552bf4be157e8c6ad3d131b10ec8aa4db35596","abstract_canon_sha256":"db6227d744bbd29cad2a27668e267fa594c19b66ec4baadb4078c0182395b659"},"schema_version":"1.0"},"canonical_sha256":"24c8908026fb539d911c6e27a48c323f2ff3005338a2246ff4bf689232324267","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.172735Z","signature_b64":"TTWjTr6YnYyxvhzBxPfXd98LkWdnz7RIETpe4bhNGdFydc0K93ZDxpZxt+1z4hWi/QWfdJ4gNNeCRX0H/UB8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24c8908026fb539d911c6e27a48c323f2ff3005338a2246ff4bf689232324267","last_reissued_at":"2026-05-18T00:57:58.172039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.172039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.0695","source_version":4,"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:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LuRTAB8MHoXX1luiaKoaia5+wyuHav5/DbSvYzwK8XZEe/15o1pzcR/oNNstUHUKtanBoq2dqT1ajarZoz5TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:12:52.451450Z"},"content_sha256":"19822f92f74f6d8aeba08daef684347f3702a10a3b6c1eaa3650fe5631fecb75","schema_version":"1.0","event_id":"sha256:19822f92f74f6d8aeba08daef684347f3702a10a3b6c1eaa3650fe5631fecb75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:ETEJBABG7NJZ3EI4NYT2JDBSH4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On network coding for sum-networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bikash Kumar Dey, Brijesh Kumar Rai","submitted_at":"2009-06-03T12:22:52Z","abstract_excerpt":"A directed acyclic network is considered where all the terminals need to recover the sum of the symbols generated at all the sources. We call such a network a sum-network. It is shown that there exists a solvably (and linear solvably) equivalent sum-network for any multiple-unicast network, and thus for any directed acyclic communication network. It is also shown that there exists a linear solvably equivalent multiple-unicast network for every sum-network. It is shown that for any set of polynomials having integer coefficients, there exists a sum-network which is scalar linear solvable over a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0695","kind":"arxiv","version":4},"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:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STMvY8WdgBi8qlTyvW2BN9uuTRgxozHJ4eGeDBCZbIdaBXGfC1tJ2KJSDX6TUSUWtlBW+XZbgWZosvQb8jSDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T03:12:52.451842Z"},"content_sha256":"9415614660276171fbcad938c9af51ce2fa89e04e8635df841664965d545274e","schema_version":"1.0","event_id":"sha256:9415614660276171fbcad938c9af51ce2fa89e04e8635df841664965d545274e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/bundle.json","state_url":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/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-08T03:12:52Z","links":{"resolver":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4","bundle":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/bundle.json","state":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ETEJBABG7NJZ3EI4NYT2JDBSH4","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":"db6227d744bbd29cad2a27668e267fa594c19b66ec4baadb4078c0182395b659","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-03T12:22:52Z","title_canon_sha256":"36e6762c5ed1d507d84fcb2d63552bf4be157e8c6ad3d131b10ec8aa4db35596"},"schema_version":"1.0","source":{"id":"0906.0695","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.0695","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0906.0695v4","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0695","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"ETEJBABG7NJZ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"ETEJBABG7NJZ3EI4","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"ETEJBABG","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:9415614660276171fbcad938c9af51ce2fa89e04e8635df841664965d545274e","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"A directed acyclic network is considered where all the terminals need to recover the sum of the symbols generated at all the sources. We call such a network a sum-network. It is shown that there exists a solvably (and linear solvably) equivalent sum-network for any multiple-unicast network, and thus for any directed acyclic communication network. It is also shown that there exists a linear solvably equivalent multiple-unicast network for every sum-network. It is shown that for any set of polynomials having integer coefficients, there exists a sum-network which is scalar linear solvable over a ","authors_text":"Bikash Kumar Dey, Brijesh Kumar Rai","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-03T12:22:52Z","title":"On network coding for sum-networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.0695","kind":"arxiv","version":4},"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:19822f92f74f6d8aeba08daef684347f3702a10a3b6c1eaa3650fe5631fecb75","target":"record","created_at":"2026-05-18T00:57:58Z","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":"db6227d744bbd29cad2a27668e267fa594c19b66ec4baadb4078c0182395b659","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-03T12:22:52Z","title_canon_sha256":"36e6762c5ed1d507d84fcb2d63552bf4be157e8c6ad3d131b10ec8aa4db35596"},"schema_version":"1.0","source":{"id":"0906.0695","kind":"arxiv","version":4}},"canonical_sha256":"24c8908026fb539d911c6e27a48c323f2ff3005338a2246ff4bf689232324267","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24c8908026fb539d911c6e27a48c323f2ff3005338a2246ff4bf689232324267","first_computed_at":"2026-05-18T00:57:58.172039Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.172039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TTWjTr6YnYyxvhzBxPfXd98LkWdnz7RIETpe4bhNGdFydc0K93ZDxpZxt+1z4hWi/QWfdJ4gNNeCRX0H/UB8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.172735Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.0695","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19822f92f74f6d8aeba08daef684347f3702a10a3b6c1eaa3650fe5631fecb75","sha256:9415614660276171fbcad938c9af51ce2fa89e04e8635df841664965d545274e"],"state_sha256":"3169010736ee630a6b293740580100248db5947a0c98c23e01ddc7ccee8e59f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SL1mHHorH946tiuSeq7YxXR3CuXK6nM95e2/pMYiakLxiCTEaIEmF0SByemJgdV46o2bxQk8hEoGtESxt4JxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T03:12:52.453896Z","bundle_sha256":"b69c638c21e48d0b7b89011dab5086bac6a7b7ab8a6cb0586fa761cb8a30b111"}}