{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CD34IO5NJSNHR3VHLWAA6JWYVA","short_pith_number":"pith:CD34IO5N","schema_version":"1.0","canonical_sha256":"10f7c43bad4c9a78eea75d800f26d8a833e89d6fcba76a6a0a8e113082f4b119","source":{"kind":"arxiv","id":"1501.01084","version":3},"attestation_state":"computed","paper":{"title":"Comments on Cut-Set Bounds on Network Function Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cupjin Huang, Shenghao Yang, Xuan Guang, Zihan Tan","submitted_at":"2015-01-06T05:55:34Z","abstract_excerpt":"A function computation problem in directed acyclic networks has been considered in the literature, where a sink node wants to compute a target function with the inputs generated at multiple source nodes. The network links are error-free but capacity-limited, and the intermediate network nodes perform network coding. The target function is required to be computed with zero error. The computing rate of a network code is measured by the average number of times that the target function can be computed for one use of the network, i.e., each link in the network is used at most once. In the papers [1"},"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":"1501.01084","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-06T05:55:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ffa0014adc80e7d3bce330d470d32630ff2f38fbec62415a88ea637d4e9be99f","abstract_canon_sha256":"45f55486d826ca6cd96f6dec05440ded3eca2ce8521309db174177c554874ad5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:51.427130Z","signature_b64":"E39UN5qTEoGthAZKG/QkoKsCaNeG7y5FNMBzk8dQXqaHyQ3hfnjWQ9cP+CyKKBh0IFyvxJj2oOny0wIqs23zCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10f7c43bad4c9a78eea75d800f26d8a833e89d6fcba76a6a0a8e113082f4b119","last_reissued_at":"2026-05-18T00:47:51.426403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:51.426403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comments on Cut-Set Bounds on Network Function Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cupjin Huang, Shenghao Yang, Xuan Guang, Zihan Tan","submitted_at":"2015-01-06T05:55:34Z","abstract_excerpt":"A function computation problem in directed acyclic networks has been considered in the literature, where a sink node wants to compute a target function with the inputs generated at multiple source nodes. The network links are error-free but capacity-limited, and the intermediate network nodes perform network coding. The target function is required to be computed with zero error. The computing rate of a network code is measured by the average number of times that the target function can be computed for one use of the network, i.e., each link in the network is used at most once. In the papers [1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01084","kind":"arxiv","version":3},"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":"1501.01084","created_at":"2026-05-18T00:47:51.426514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01084v3","created_at":"2026-05-18T00:47:51.426514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01084","created_at":"2026-05-18T00:47:51.426514+00:00"},{"alias_kind":"pith_short_12","alias_value":"CD34IO5NJSNH","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CD34IO5NJSNHR3VH","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CD34IO5N","created_at":"2026-05-18T12:29:14.074870+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/CD34IO5NJSNHR3VHLWAA6JWYVA","json":"https://pith.science/pith/CD34IO5NJSNHR3VHLWAA6JWYVA.json","graph_json":"https://pith.science/api/pith-number/CD34IO5NJSNHR3VHLWAA6JWYVA/graph.json","events_json":"https://pith.science/api/pith-number/CD34IO5NJSNHR3VHLWAA6JWYVA/events.json","paper":"https://pith.science/paper/CD34IO5N"},"agent_actions":{"view_html":"https://pith.science/pith/CD34IO5NJSNHR3VHLWAA6JWYVA","download_json":"https://pith.science/pith/CD34IO5NJSNHR3VHLWAA6JWYVA.json","view_paper":"https://pith.science/paper/CD34IO5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01084&json=true","fetch_graph":"https://pith.science/api/pith-number/CD34IO5NJSNHR3VHLWAA6JWYVA/graph.json","fetch_events":"https://pith.science/api/pith-number/CD34IO5NJSNHR3VHLWAA6JWYVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CD34IO5NJSNHR3VHLWAA6JWYVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CD34IO5NJSNHR3VHLWAA6JWYVA/action/storage_attestation","attest_author":"https://pith.science/pith/CD34IO5NJSNHR3VHLWAA6JWYVA/action/author_attestation","sign_citation":"https://pith.science/pith/CD34IO5NJSNHR3VHLWAA6JWYVA/action/citation_signature","submit_replication":"https://pith.science/pith/CD34IO5NJSNHR3VHLWAA6JWYVA/action/replication_record"}},"created_at":"2026-05-18T00:47:51.426514+00:00","updated_at":"2026-05-18T00:47:51.426514+00:00"}