{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:6EJC3GMZO4AKSKIP7YEUUTX3SQ","short_pith_number":"pith:6EJC3GMZ","schema_version":"1.0","canonical_sha256":"f1122d99997700a9290ffe094a4efb9405b284fd07ecd4122eab91ce0506d9f4","source":{"kind":"arxiv","id":"0912.2820","version":3},"attestation_state":"computed","paper":{"title":"Network Coding for Computing: Cut-Set Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ken Zeger, Massimo Franceschetti, Nikhil Karamchandani, Rathinakumar Appuswamy","submitted_at":"2009-12-15T08:51:53Z","abstract_excerpt":"The following \\textit{network computing} problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a target function $f$ of the messages. The objective is to maximize the average number of times $f$ can be computed per network usage, i.e., the ``computing capacity''. The \\textit{network coding} problem for a single-receiver network is a special case of the network computing problem in which all of the source messages must be reproduced at the receiver. For network coding with a single receiver, routing is known to achiev"},"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":"0912.2820","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-12-15T08:51:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4f23da0a78ba450d561a8074cd50e19580fe7d5f4e2f761fd472f34585c3e60c","abstract_canon_sha256":"8152cb6a47cfd3ec9ca0297b096ca73aa1316409581548fc8382d473f37428a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.978619Z","signature_b64":"iW7nIRrsDbSyqsgN5e+ED21kbDRbXz21mtuBiScQ0/YvrSAguQ6JqpUMU2BNQbVPKDjV7AaHcX1PHdj6I6fSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1122d99997700a9290ffe094a4efb9405b284fd07ecd4122eab91ce0506d9f4","last_reissued_at":"2026-05-18T00:57:57.978120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.978120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Network Coding for Computing: Cut-Set Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ken Zeger, Massimo Franceschetti, Nikhil Karamchandani, Rathinakumar Appuswamy","submitted_at":"2009-12-15T08:51:53Z","abstract_excerpt":"The following \\textit{network computing} problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a target function $f$ of the messages. The objective is to maximize the average number of times $f$ can be computed per network usage, i.e., the ``computing capacity''. The \\textit{network coding} problem for a single-receiver network is a special case of the network computing problem in which all of the source messages must be reproduced at the receiver. For network coding with a single receiver, routing is known to achiev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.2820","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":"0912.2820","created_at":"2026-05-18T00:57:57.978212+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.2820v3","created_at":"2026-05-18T00:57:57.978212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.2820","created_at":"2026-05-18T00:57:57.978212+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EJC3GMZO4AK","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EJC3GMZO4AKSKIP","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EJC3GMZ","created_at":"2026-05-18T12:25:58.837520+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/6EJC3GMZO4AKSKIP7YEUUTX3SQ","json":"https://pith.science/pith/6EJC3GMZO4AKSKIP7YEUUTX3SQ.json","graph_json":"https://pith.science/api/pith-number/6EJC3GMZO4AKSKIP7YEUUTX3SQ/graph.json","events_json":"https://pith.science/api/pith-number/6EJC3GMZO4AKSKIP7YEUUTX3SQ/events.json","paper":"https://pith.science/paper/6EJC3GMZ"},"agent_actions":{"view_html":"https://pith.science/pith/6EJC3GMZO4AKSKIP7YEUUTX3SQ","download_json":"https://pith.science/pith/6EJC3GMZO4AKSKIP7YEUUTX3SQ.json","view_paper":"https://pith.science/paper/6EJC3GMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.2820&json=true","fetch_graph":"https://pith.science/api/pith-number/6EJC3GMZO4AKSKIP7YEUUTX3SQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6EJC3GMZO4AKSKIP7YEUUTX3SQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EJC3GMZO4AKSKIP7YEUUTX3SQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EJC3GMZO4AKSKIP7YEUUTX3SQ/action/storage_attestation","attest_author":"https://pith.science/pith/6EJC3GMZO4AKSKIP7YEUUTX3SQ/action/author_attestation","sign_citation":"https://pith.science/pith/6EJC3GMZO4AKSKIP7YEUUTX3SQ/action/citation_signature","submit_replication":"https://pith.science/pith/6EJC3GMZO4AKSKIP7YEUUTX3SQ/action/replication_record"}},"created_at":"2026-05-18T00:57:57.978212+00:00","updated_at":"2026-05-18T00:57:57.978212+00:00"}