{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2KJHNXLSOTOQZH2LLEGIMPWWVF","short_pith_number":"pith:2KJHNXLS","schema_version":"1.0","canonical_sha256":"d29276dd7274dd0c9f4b590c863ed6a9502e53ff68583fd85456faaca0cd20cb","source":{"kind":"arxiv","id":"1504.05618","version":1},"attestation_state":"computed","paper":{"title":"Capacity of Sum-networks for Different Message Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Ardhendu Tripathy","submitted_at":"2015-04-21T21:46:18Z","abstract_excerpt":"A sum-network is a directed acyclic network in which all terminal nodes demand the `sum' of the independent information observed at the source nodes. Many characteristics of the well-studied multiple-unicast network communication problem also hold for sum-networks due to a known reduction between instances of these two problems. Our main result is that unlike a multiple unicast network, the coding capacity of a sum-network is dependent on the message alphabet. We demonstrate this using a construction procedure and show that the choice of a message alphabet can reduce the coding capacity of a s"},"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":"1504.05618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T21:46:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"41f672ee00271282c6215822b10d2dff1b4696078ac80ddb7986de6482cfb246","abstract_canon_sha256":"b1c3bab455de21cdb41a5cc76087f375cc31004d31720f0f78fd4465cf75edfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:13.142299Z","signature_b64":"GRz0Cck72xWZt5YcpTascxQ5kyF+WhAJaUkLcJAHwfimDpRG25u3nMFn3EioXVWpKvxQKvBT2Dp4cHu7qDIlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d29276dd7274dd0c9f4b590c863ed6a9502e53ff68583fd85456faaca0cd20cb","last_reissued_at":"2026-05-18T02:18:13.141820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:13.141820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of Sum-networks for Different Message Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Ramamoorthy, Ardhendu Tripathy","submitted_at":"2015-04-21T21:46:18Z","abstract_excerpt":"A sum-network is a directed acyclic network in which all terminal nodes demand the `sum' of the independent information observed at the source nodes. Many characteristics of the well-studied multiple-unicast network communication problem also hold for sum-networks due to a known reduction between instances of these two problems. Our main result is that unlike a multiple unicast network, the coding capacity of a sum-network is dependent on the message alphabet. We demonstrate this using a construction procedure and show that the choice of a message alphabet can reduce the coding capacity of a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05618","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":"1504.05618","created_at":"2026-05-18T02:18:13.141902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05618v1","created_at":"2026-05-18T02:18:13.141902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05618","created_at":"2026-05-18T02:18:13.141902+00:00"},{"alias_kind":"pith_short_12","alias_value":"2KJHNXLSOTOQ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2KJHNXLSOTOQZH2L","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2KJHNXLS","created_at":"2026-05-18T12:28:59.999130+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/2KJHNXLSOTOQZH2LLEGIMPWWVF","json":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF.json","graph_json":"https://pith.science/api/pith-number/2KJHNXLSOTOQZH2LLEGIMPWWVF/graph.json","events_json":"https://pith.science/api/pith-number/2KJHNXLSOTOQZH2LLEGIMPWWVF/events.json","paper":"https://pith.science/paper/2KJHNXLS"},"agent_actions":{"view_html":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF","download_json":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF.json","view_paper":"https://pith.science/paper/2KJHNXLS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05618&json=true","fetch_graph":"https://pith.science/api/pith-number/2KJHNXLSOTOQZH2LLEGIMPWWVF/graph.json","fetch_events":"https://pith.science/api/pith-number/2KJHNXLSOTOQZH2LLEGIMPWWVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/action/storage_attestation","attest_author":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/action/author_attestation","sign_citation":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/action/citation_signature","submit_replication":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/action/replication_record"}},"created_at":"2026-05-18T02:18:13.141902+00:00","updated_at":"2026-05-18T02:18:13.141902+00:00"}