{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2KJHNXLSOTOQZH2LLEGIMPWWVF","short_pith_number":"pith:2KJHNXLS","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"},"canonical_sha256":"d29276dd7274dd0c9f4b590c863ed6a9502e53ff68583fd85456faaca0cd20cb","source":{"kind":"arxiv","id":"1504.05618","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05618","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05618v1","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05618","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"2KJHNXLSOTOQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2KJHNXLSOTOQZH2L","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2KJHNXLS","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2KJHNXLSOTOQZH2LLEGIMPWWVF","target":"record","payload":{"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"},"canonical_sha256":"d29276dd7274dd0c9f4b590c863ed6a9502e53ff68583fd85456faaca0cd20cb","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"},"source_kind":"arxiv","source_id":"1504.05618","source_version":1,"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-18T02:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5A4CxAYlwZWR/+MHcXdScl8bSYvdWcbBZrYUlNWqTTIhGnOOHy5iGTENHiusxPm5clUAYKxgXsLfH2xSQ/clDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:07:15.118282Z"},"content_sha256":"d5590507ac931035a7eb03402cec0565d33e7b31d144481eb60fa2783f5fa326","schema_version":"1.0","event_id":"sha256:d5590507ac931035a7eb03402cec0565d33e7b31d144481eb60fa2783f5fa326"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2KJHNXLSOTOQZH2LLEGIMPWWVF","target":"graph","payload":{"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"},"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-18T02:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+LLckXqRByVdB3AV+/apwU6IxpzvMRspH5LHmc/j47xuU6s5Z5UAgAa6udWMkD+6kv5Eo64ASTuUWbhl5sXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:07:15.118850Z"},"content_sha256":"b7da0ca39d7e6f12b291f628d0cd18f21391709a787dfaeaa5ef2117cb4dde0e","schema_version":"1.0","event_id":"sha256:b7da0ca39d7e6f12b291f628d0cd18f21391709a787dfaeaa5ef2117cb4dde0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/bundle.json","state_url":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/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-05-30T13:07:15Z","links":{"resolver":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF","bundle":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/bundle.json","state":"https://pith.science/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KJHNXLSOTOQZH2LLEGIMPWWVF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2KJHNXLSOTOQZH2LLEGIMPWWVF","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":"b1c3bab455de21cdb41a5cc76087f375cc31004d31720f0f78fd4465cf75edfe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T21:46:18Z","title_canon_sha256":"41f672ee00271282c6215822b10d2dff1b4696078ac80ddb7986de6482cfb246"},"schema_version":"1.0","source":{"id":"1504.05618","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05618","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05618v1","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05618","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"2KJHNXLSOTOQ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2KJHNXLSOTOQZH2L","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2KJHNXLS","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:b7da0ca39d7e6f12b291f628d0cd18f21391709a787dfaeaa5ef2117cb4dde0e","target":"graph","created_at":"2026-05-18T02:18:13Z","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 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","authors_text":"Aditya Ramamoorthy, Ardhendu Tripathy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T21:46:18Z","title":"Capacity of Sum-networks for Different Message Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05618","kind":"arxiv","version":1},"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:d5590507ac931035a7eb03402cec0565d33e7b31d144481eb60fa2783f5fa326","target":"record","created_at":"2026-05-18T02:18:13Z","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":"b1c3bab455de21cdb41a5cc76087f375cc31004d31720f0f78fd4465cf75edfe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-21T21:46:18Z","title_canon_sha256":"41f672ee00271282c6215822b10d2dff1b4696078ac80ddb7986de6482cfb246"},"schema_version":"1.0","source":{"id":"1504.05618","kind":"arxiv","version":1}},"canonical_sha256":"d29276dd7274dd0c9f4b590c863ed6a9502e53ff68583fd85456faaca0cd20cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d29276dd7274dd0c9f4b590c863ed6a9502e53ff68583fd85456faaca0cd20cb","first_computed_at":"2026-05-18T02:18:13.141820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:13.141820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GRz0Cck72xWZt5YcpTascxQ5kyF+WhAJaUkLcJAHwfimDpRG25u3nMFn3EioXVWpKvxQKvBT2Dp4cHu7qDIlAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:13.142299Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05618","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5590507ac931035a7eb03402cec0565d33e7b31d144481eb60fa2783f5fa326","sha256:b7da0ca39d7e6f12b291f628d0cd18f21391709a787dfaeaa5ef2117cb4dde0e"],"state_sha256":"215719265bea94ef1227e721fa78e3b681323ac241fac4df7c2417c1f44de5bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wptKnIwXW72JhsdetUdkEHLxqdsluEqDmspF/KI88nHU/0u18ta7btU85YnjH+IOgkVycqqLzLGUzCi+0Nn7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:07:15.121623Z","bundle_sha256":"4eb34c6d2788d80aabe9a3deb6c16a2daadf101c9c96ee311de321d9f0544d13"}}