{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3TFYPFEXWTHV4VLJGUBVRFWCAA","short_pith_number":"pith:3TFYPFEX","schema_version":"1.0","canonical_sha256":"dccb879497b4cf5e556935035896c200382531776e9c835c4b3c86cba7b9472f","source":{"kind":"arxiv","id":"1502.00762","version":1},"attestation_state":"computed","paper":{"title":"On the Solvability of 3s/nt Sum-Network---A Region Decomposition and Weak Decentralized Code Method","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Kai Cai, Rongquan Feng, Wentu Song","submitted_at":"2015-02-03T07:27:34Z","abstract_excerpt":"We study the network coding problem of sum-networks with 3 sources and n terminals (3s/nt sum-network), for an arbitrary positive integer n, and derive a sufficient and necessary condition for the solvability of a family of so-called terminal-separable sum-network. Both the condition of terminal-separable and the solvability of a terminal-separable sum-network can be decided in polynomial time. Consequently, we give another necessary and sufficient condition, which yields a faster (O(|E|) time) algorithm than that of Shenvi and Dey ([18], (O(|E|^3) time), to determine the solvability of the 3s"},"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":"1502.00762","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2015-02-03T07:27:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b2513400e74216f53ade13530f3b96c7a0c02c9d4d379713fe036f2865d3d8d0","abstract_canon_sha256":"14214c6a0ff3d2dfdb84e369832a10372d66a7c55e96ccf122874e13d805d134"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:04.376488Z","signature_b64":"AahkehuBUWhNVmjPO+WaMGsFKdXHZT9DhB+RtEGVEXv0FFURX/rNJOiMGNzE0+8CjesMdCvfDCX66uwH/RoxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dccb879497b4cf5e556935035896c200382531776e9c835c4b3c86cba7b9472f","last_reissued_at":"2026-05-18T02:28:04.376087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:04.376087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Solvability of 3s/nt Sum-Network---A Region Decomposition and Weak Decentralized Code Method","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Kai Cai, Rongquan Feng, Wentu Song","submitted_at":"2015-02-03T07:27:34Z","abstract_excerpt":"We study the network coding problem of sum-networks with 3 sources and n terminals (3s/nt sum-network), for an arbitrary positive integer n, and derive a sufficient and necessary condition for the solvability of a family of so-called terminal-separable sum-network. Both the condition of terminal-separable and the solvability of a terminal-separable sum-network can be decided in polynomial time. Consequently, we give another necessary and sufficient condition, which yields a faster (O(|E|) time) algorithm than that of Shenvi and Dey ([18], (O(|E|^3) time), to determine the solvability of the 3s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00762","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.00762","created_at":"2026-05-18T02:28:04.376154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00762v1","created_at":"2026-05-18T02:28:04.376154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00762","created_at":"2026-05-18T02:28:04.376154+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TFYPFEXWTHV","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TFYPFEXWTHV4VLJ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TFYPFEX","created_at":"2026-05-18T12:29:02.477457+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/3TFYPFEXWTHV4VLJGUBVRFWCAA","json":"https://pith.science/pith/3TFYPFEXWTHV4VLJGUBVRFWCAA.json","graph_json":"https://pith.science/api/pith-number/3TFYPFEXWTHV4VLJGUBVRFWCAA/graph.json","events_json":"https://pith.science/api/pith-number/3TFYPFEXWTHV4VLJGUBVRFWCAA/events.json","paper":"https://pith.science/paper/3TFYPFEX"},"agent_actions":{"view_html":"https://pith.science/pith/3TFYPFEXWTHV4VLJGUBVRFWCAA","download_json":"https://pith.science/pith/3TFYPFEXWTHV4VLJGUBVRFWCAA.json","view_paper":"https://pith.science/paper/3TFYPFEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00762&json=true","fetch_graph":"https://pith.science/api/pith-number/3TFYPFEXWTHV4VLJGUBVRFWCAA/graph.json","fetch_events":"https://pith.science/api/pith-number/3TFYPFEXWTHV4VLJGUBVRFWCAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TFYPFEXWTHV4VLJGUBVRFWCAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TFYPFEXWTHV4VLJGUBVRFWCAA/action/storage_attestation","attest_author":"https://pith.science/pith/3TFYPFEXWTHV4VLJGUBVRFWCAA/action/author_attestation","sign_citation":"https://pith.science/pith/3TFYPFEXWTHV4VLJGUBVRFWCAA/action/citation_signature","submit_replication":"https://pith.science/pith/3TFYPFEXWTHV4VLJGUBVRFWCAA/action/replication_record"}},"created_at":"2026-05-18T02:28:04.376154+00:00","updated_at":"2026-05-18T02:28:04.376154+00:00"}