{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GHCRMU7GVB6YOWTHUC4RXQI4RH","short_pith_number":"pith:GHCRMU7G","schema_version":"1.0","canonical_sha256":"31c51653e6a87d875a67a0b91bc11c89da255d6046c602c999c4fbb23dd53093","source":{"kind":"arxiv","id":"1710.02252","version":1},"attestation_state":"computed","paper":{"title":"Improved Upper Bound on the Network Function Computing Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Congduan Li, Raymond W. Yeung, Shenghao Yang, Xuan Guang","submitted_at":"2017-10-06T01:31:19Z","abstract_excerpt":"The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a {\\em target function}, of which the inputs are generated at multiple source nodes. The edges in the network are assumed to be error-free and have limited capacity. The nodes in the network are assumed to have unbounded computing capability and be able to perform network coding. The {\\em computing rate} of a network code that can compute the target function over the network is the average number of times that the target fu"},"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":"1710.02252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-06T01:31:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4ad6b5644ad47f45c99728c24727dba7234738d15cf9deec752f4ba3290de77d","abstract_canon_sha256":"99039ae5a2e73a4f665fcd9a5f9d0d1604b4c0ecc9be1aaba79951dcffab98e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:34.011739Z","signature_b64":"2Gtu0xmkgfEJjhHmPZplfobE7GW6YIrA8iU5HNy4ZCVYCGm+DXa4bbaZA9kI5x+7QOs8wfrJDc/0JwXAcLATAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31c51653e6a87d875a67a0b91bc11c89da255d6046c602c999c4fbb23dd53093","last_reissued_at":"2026-05-18T00:33:34.011041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:34.011041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Upper Bound on the Network Function Computing Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Congduan Li, Raymond W. Yeung, Shenghao Yang, Xuan Guang","submitted_at":"2017-10-06T01:31:19Z","abstract_excerpt":"The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a {\\em target function}, of which the inputs are generated at multiple source nodes. The edges in the network are assumed to be error-free and have limited capacity. The nodes in the network are assumed to have unbounded computing capability and be able to perform network coding. The {\\em computing rate} of a network code that can compute the target function over the network is the average number of times that the target fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02252","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":"1710.02252","created_at":"2026-05-18T00:33:34.011162+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02252v1","created_at":"2026-05-18T00:33:34.011162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02252","created_at":"2026-05-18T00:33:34.011162+00:00"},{"alias_kind":"pith_short_12","alias_value":"GHCRMU7GVB6Y","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GHCRMU7GVB6YOWTH","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GHCRMU7G","created_at":"2026-05-18T12:31:18.294218+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/GHCRMU7GVB6YOWTHUC4RXQI4RH","json":"https://pith.science/pith/GHCRMU7GVB6YOWTHUC4RXQI4RH.json","graph_json":"https://pith.science/api/pith-number/GHCRMU7GVB6YOWTHUC4RXQI4RH/graph.json","events_json":"https://pith.science/api/pith-number/GHCRMU7GVB6YOWTHUC4RXQI4RH/events.json","paper":"https://pith.science/paper/GHCRMU7G"},"agent_actions":{"view_html":"https://pith.science/pith/GHCRMU7GVB6YOWTHUC4RXQI4RH","download_json":"https://pith.science/pith/GHCRMU7GVB6YOWTHUC4RXQI4RH.json","view_paper":"https://pith.science/paper/GHCRMU7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02252&json=true","fetch_graph":"https://pith.science/api/pith-number/GHCRMU7GVB6YOWTHUC4RXQI4RH/graph.json","fetch_events":"https://pith.science/api/pith-number/GHCRMU7GVB6YOWTHUC4RXQI4RH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GHCRMU7GVB6YOWTHUC4RXQI4RH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GHCRMU7GVB6YOWTHUC4RXQI4RH/action/storage_attestation","attest_author":"https://pith.science/pith/GHCRMU7GVB6YOWTHUC4RXQI4RH/action/author_attestation","sign_citation":"https://pith.science/pith/GHCRMU7GVB6YOWTHUC4RXQI4RH/action/citation_signature","submit_replication":"https://pith.science/pith/GHCRMU7GVB6YOWTHUC4RXQI4RH/action/replication_record"}},"created_at":"2026-05-18T00:33:34.011162+00:00","updated_at":"2026-05-18T00:33:34.011162+00:00"}