{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:GXBJGJISJAEZPYQBILVSJE7WKR","short_pith_number":"pith:GXBJGJIS","schema_version":"1.0","canonical_sha256":"35c2932512480997e20142eb2493f6546d4d7880ec2bcc22977206c2f0f1ce33","source":{"kind":"arxiv","id":"1001.4137","version":3},"attestation_state":"computed","paper":{"title":"On the solvability of 3-source 3-terminal 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, Sagar Shenvi","submitted_at":"2010-01-23T07:59:53Z","abstract_excerpt":"We consider a directed acyclic network with three sources and three terminals such that each source independently generates one symbol from a given field $F$ and each terminal wants to receive the sum (over $F$) of the source symbols. Each link in the network is considered to be error-free and delay-free and can carry one symbol from the field in each use. We call such a network a 3-source 3-terminal {\\it $(3s/3t)$ sum-network}. In this paper, we give a necessary and sufficient condition for a $3s/3t$ sum-network to allow all the terminals to receive the sum of the source symbols over \\textit{"},"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":"1001.4137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-23T07:59:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5bbcbec7bebb02e69c589b9ae8613ed995c40189b9292fe1ae234ccb2c50903b","abstract_canon_sha256":"2a2b3ac8f0a5003cf8ff83d688ef8092f24872904f9a61d7c85e8e21126c7958"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:39.517311Z","signature_b64":"a52Gxwqa+vUgCHz5cdiWKY0X2oABesGoIM81PDLQUbN8u8821zRd+2DRjuRHNm2pzcDXvnCqPWqrX0dryYH1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35c2932512480997e20142eb2493f6546d4d7880ec2bcc22977206c2f0f1ce33","last_reissued_at":"2026-05-18T02:24:39.516819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:39.516819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the solvability of 3-source 3-terminal 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, Sagar Shenvi","submitted_at":"2010-01-23T07:59:53Z","abstract_excerpt":"We consider a directed acyclic network with three sources and three terminals such that each source independently generates one symbol from a given field $F$ and each terminal wants to receive the sum (over $F$) of the source symbols. Each link in the network is considered to be error-free and delay-free and can carry one symbol from the field in each use. We call such a network a 3-source 3-terminal {\\it $(3s/3t)$ sum-network}. In this paper, we give a necessary and sufficient condition for a $3s/3t$ sum-network to allow all the terminals to receive the sum of the source symbols over \\textit{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4137","kind":"arxiv","version":3},"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":"1001.4137","created_at":"2026-05-18T02:24:39.516888+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.4137v3","created_at":"2026-05-18T02:24:39.516888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4137","created_at":"2026-05-18T02:24:39.516888+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXBJGJISJAEZ","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXBJGJISJAEZPYQB","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXBJGJIS","created_at":"2026-05-18T12:26:07.630475+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/GXBJGJISJAEZPYQBILVSJE7WKR","json":"https://pith.science/pith/GXBJGJISJAEZPYQBILVSJE7WKR.json","graph_json":"https://pith.science/api/pith-number/GXBJGJISJAEZPYQBILVSJE7WKR/graph.json","events_json":"https://pith.science/api/pith-number/GXBJGJISJAEZPYQBILVSJE7WKR/events.json","paper":"https://pith.science/paper/GXBJGJIS"},"agent_actions":{"view_html":"https://pith.science/pith/GXBJGJISJAEZPYQBILVSJE7WKR","download_json":"https://pith.science/pith/GXBJGJISJAEZPYQBILVSJE7WKR.json","view_paper":"https://pith.science/paper/GXBJGJIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.4137&json=true","fetch_graph":"https://pith.science/api/pith-number/GXBJGJISJAEZPYQBILVSJE7WKR/graph.json","fetch_events":"https://pith.science/api/pith-number/GXBJGJISJAEZPYQBILVSJE7WKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXBJGJISJAEZPYQBILVSJE7WKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXBJGJISJAEZPYQBILVSJE7WKR/action/storage_attestation","attest_author":"https://pith.science/pith/GXBJGJISJAEZPYQBILVSJE7WKR/action/author_attestation","sign_citation":"https://pith.science/pith/GXBJGJISJAEZPYQBILVSJE7WKR/action/citation_signature","submit_replication":"https://pith.science/pith/GXBJGJISJAEZPYQBILVSJE7WKR/action/replication_record"}},"created_at":"2026-05-18T02:24:39.516888+00:00","updated_at":"2026-05-18T02:24:39.516888+00:00"}