{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IF3G2FREPBFJIBI6NP2U4OG7CV","short_pith_number":"pith:IF3G2FRE","schema_version":"1.0","canonical_sha256":"41766d1624784a94051e6bf54e38df1553a00aadab17921ec68d6e460dd9ee6e","source":{"kind":"arxiv","id":"1805.03730","version":1},"attestation_state":"computed","paper":{"title":"Zero-error Function Computation on a Directed Acyclic Network","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":"2018-05-09T21:00:27Z","abstract_excerpt":"We study the rate region of variable-length source-network codes that are used to compute a function of messages observed over a network. The particular network considered here is the simplest instance of a directed acyclic graph (DAG) that is not a tree. Existing work on zero-error function computation in DAG networks provides bounds on the \\textit{computation capacity}, which is a measure of the amount of communication required per edge in the worst case. This work focuses on the average case: an achievable rate tuple describes the expected amount of communication required on each edge, wher"},"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":"1805.03730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-09T21:00:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"165f7c4cd902d75d3ed4fe71c3e9210a5d2f7250216ec6338e1fc752d58f6f36","abstract_canon_sha256":"587db5a403f08575f628ca3250ce8b997bdf839802f41a661e5f65d0d0ff5ea0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:18.898737Z","signature_b64":"lYxV1i8DJu7abtaN/hJ/95UKBpqopuMA5UfWfVqtsJc7BostaTJcobw1n7T9eq6RVE6NeSG7niJwgS6S5e1AAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41766d1624784a94051e6bf54e38df1553a00aadab17921ec68d6e460dd9ee6e","last_reissued_at":"2026-05-18T00:16:18.898010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:18.898010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero-error Function Computation on a Directed Acyclic Network","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":"2018-05-09T21:00:27Z","abstract_excerpt":"We study the rate region of variable-length source-network codes that are used to compute a function of messages observed over a network. The particular network considered here is the simplest instance of a directed acyclic graph (DAG) that is not a tree. Existing work on zero-error function computation in DAG networks provides bounds on the \\textit{computation capacity}, which is a measure of the amount of communication required per edge in the worst case. This work focuses on the average case: an achievable rate tuple describes the expected amount of communication required on each edge, wher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03730","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":"1805.03730","created_at":"2026-05-18T00:16:18.898117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03730v1","created_at":"2026-05-18T00:16:18.898117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03730","created_at":"2026-05-18T00:16:18.898117+00:00"},{"alias_kind":"pith_short_12","alias_value":"IF3G2FREPBFJ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IF3G2FREPBFJIBI6","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IF3G2FRE","created_at":"2026-05-18T12:32:28.185984+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/IF3G2FREPBFJIBI6NP2U4OG7CV","json":"https://pith.science/pith/IF3G2FREPBFJIBI6NP2U4OG7CV.json","graph_json":"https://pith.science/api/pith-number/IF3G2FREPBFJIBI6NP2U4OG7CV/graph.json","events_json":"https://pith.science/api/pith-number/IF3G2FREPBFJIBI6NP2U4OG7CV/events.json","paper":"https://pith.science/paper/IF3G2FRE"},"agent_actions":{"view_html":"https://pith.science/pith/IF3G2FREPBFJIBI6NP2U4OG7CV","download_json":"https://pith.science/pith/IF3G2FREPBFJIBI6NP2U4OG7CV.json","view_paper":"https://pith.science/paper/IF3G2FRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03730&json=true","fetch_graph":"https://pith.science/api/pith-number/IF3G2FREPBFJIBI6NP2U4OG7CV/graph.json","fetch_events":"https://pith.science/api/pith-number/IF3G2FREPBFJIBI6NP2U4OG7CV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IF3G2FREPBFJIBI6NP2U4OG7CV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IF3G2FREPBFJIBI6NP2U4OG7CV/action/storage_attestation","attest_author":"https://pith.science/pith/IF3G2FREPBFJIBI6NP2U4OG7CV/action/author_attestation","sign_citation":"https://pith.science/pith/IF3G2FREPBFJIBI6NP2U4OG7CV/action/citation_signature","submit_replication":"https://pith.science/pith/IF3G2FREPBFJIBI6NP2U4OG7CV/action/replication_record"}},"created_at":"2026-05-18T00:16:18.898117+00:00","updated_at":"2026-05-18T00:16:18.898117+00:00"}