{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:63KBHBNCGO6N3TN5Q4TTRQ635K","short_pith_number":"pith:63KBHBNC","schema_version":"1.0","canonical_sha256":"f6d41385a233bcddcdbd872738c3dbeaa3182cc75e747f8437bb0ff3d7d1629e","source":{"kind":"arxiv","id":"1102.4825","version":1},"attestation_state":"computed","paper":{"title":"Computing linear functions by linear coding over networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Massimo Franceschetti, Rathinakumar Appuswamy","submitted_at":"2011-02-23T19:35:32Z","abstract_excerpt":"We consider the scenario in which a set of sources generate messages in a network and a receiver node demands an arbitrary linear function of these messages. We formulate an algebraic test to determine whether an arbitrary network can compute linear functions using linear codes. We identify a class of linear functions that can be computed using linear codes in every network that satisfies a natural cut-based condition. Conversely, for another class of linear functions, we show that the cut-based condition does not guarantee the existence of a linear coding solution. For linear functions over t"},"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":"1102.4825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-23T19:35:32Z","cross_cats_sorted":["math.AC","math.IT"],"title_canon_sha256":"325f9daaafe620ec6279443a95aec4692f4542982b2687a5bfe159f28ae9b90c","abstract_canon_sha256":"fe9305997343682439283d16aa5efe1cc276cc847f8571869059d58b7e1fdd33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:07.272059Z","signature_b64":"pNr4c7bAT/9Qk4XXHa5PnCMwYc9GMOh7tUcYRab/Kc2MQyJlDH4TVP1v1grR0TSyppguynvLcD1X4n5UsBnXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6d41385a233bcddcdbd872738c3dbeaa3182cc75e747f8437bb0ff3d7d1629e","last_reissued_at":"2026-05-18T04:28:07.271397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:07.271397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing linear functions by linear coding over networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Massimo Franceschetti, Rathinakumar Appuswamy","submitted_at":"2011-02-23T19:35:32Z","abstract_excerpt":"We consider the scenario in which a set of sources generate messages in a network and a receiver node demands an arbitrary linear function of these messages. We formulate an algebraic test to determine whether an arbitrary network can compute linear functions using linear codes. We identify a class of linear functions that can be computed using linear codes in every network that satisfies a natural cut-based condition. Conversely, for another class of linear functions, we show that the cut-based condition does not guarantee the existence of a linear coding solution. For linear functions over t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4825","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":"1102.4825","created_at":"2026-05-18T04:28:07.271508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4825v1","created_at":"2026-05-18T04:28:07.271508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4825","created_at":"2026-05-18T04:28:07.271508+00:00"},{"alias_kind":"pith_short_12","alias_value":"63KBHBNCGO6N","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"63KBHBNCGO6N3TN5","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"63KBHBNC","created_at":"2026-05-18T12:26:22.705136+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/63KBHBNCGO6N3TN5Q4TTRQ635K","json":"https://pith.science/pith/63KBHBNCGO6N3TN5Q4TTRQ635K.json","graph_json":"https://pith.science/api/pith-number/63KBHBNCGO6N3TN5Q4TTRQ635K/graph.json","events_json":"https://pith.science/api/pith-number/63KBHBNCGO6N3TN5Q4TTRQ635K/events.json","paper":"https://pith.science/paper/63KBHBNC"},"agent_actions":{"view_html":"https://pith.science/pith/63KBHBNCGO6N3TN5Q4TTRQ635K","download_json":"https://pith.science/pith/63KBHBNCGO6N3TN5Q4TTRQ635K.json","view_paper":"https://pith.science/paper/63KBHBNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4825&json=true","fetch_graph":"https://pith.science/api/pith-number/63KBHBNCGO6N3TN5Q4TTRQ635K/graph.json","fetch_events":"https://pith.science/api/pith-number/63KBHBNCGO6N3TN5Q4TTRQ635K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63KBHBNCGO6N3TN5Q4TTRQ635K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63KBHBNCGO6N3TN5Q4TTRQ635K/action/storage_attestation","attest_author":"https://pith.science/pith/63KBHBNCGO6N3TN5Q4TTRQ635K/action/author_attestation","sign_citation":"https://pith.science/pith/63KBHBNCGO6N3TN5Q4TTRQ635K/action/citation_signature","submit_replication":"https://pith.science/pith/63KBHBNCGO6N3TN5Q4TTRQ635K/action/replication_record"}},"created_at":"2026-05-18T04:28:07.271508+00:00","updated_at":"2026-05-18T04:28:07.271508+00:00"}