{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ETEJBABG7NJZ3EI4NYT2JDBSH4","short_pith_number":"pith:ETEJBABG","schema_version":"1.0","canonical_sha256":"24c8908026fb539d911c6e27a48c323f2ff3005338a2246ff4bf689232324267","source":{"kind":"arxiv","id":"0906.0695","version":4},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0906.0695","created_at":"2026-05-18T00:57:58.172140+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.0695v4","created_at":"2026-05-18T00:57:58.172140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.0695","created_at":"2026-05-18T00:57:58.172140+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETEJBABG7NJZ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETEJBABG7NJZ3EI4","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETEJBABG","created_at":"2026-05-18T12:25:59.703012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4","json":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4.json","graph_json":"https://pith.science/api/pith-number/ETEJBABG7NJZ3EI4NYT2JDBSH4/graph.json","events_json":"https://pith.science/api/pith-number/ETEJBABG7NJZ3EI4NYT2JDBSH4/events.json","paper":"https://pith.science/paper/ETEJBABG"},"agent_actions":{"view_html":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4","download_json":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4.json","view_paper":"https://pith.science/paper/ETEJBABG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.0695&json=true","fetch_graph":"https://pith.science/api/pith-number/ETEJBABG7NJZ3EI4NYT2JDBSH4/graph.json","fetch_events":"https://pith.science/api/pith-number/ETEJBABG7NJZ3EI4NYT2JDBSH4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/action/storage_attestation","attest_author":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/action/author_attestation","sign_citation":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/action/citation_signature","submit_replication":"https://pith.science/pith/ETEJBABG7NJZ3EI4NYT2JDBSH4/action/replication_record"}},"created_at":"2026-05-18T00:57:58.172140+00:00","updated_at":"2026-05-18T00:57:58.172140+00:00"}