{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MP53SXDGXFJCLRAR5XPGGIYBGU","short_pith_number":"pith:MP53SXDG","schema_version":"1.0","canonical_sha256":"63fbb95c66b95225c411edde632301351f4b7065329774b53c4ad8d68658f686","source":{"kind":"arxiv","id":"2409.10854","version":1},"attestation_state":"computed","paper":{"title":"Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Hengjia Wei, Min Xu","submitted_at":"2024-09-17T02:40:07Z","abstract_excerpt":"We investigate linear network coding in the context of robust function computation, where a sink node is tasked with computing a target function of messages generated at multiple source nodes. In a previous work, a new distance measure was introduced to evaluate the error tolerance of a linear network code for function computation, along with a Singleton-like bound for this distance. In this paper, we first present a minimum distance decoder for these linear network codes. We then focus on the sum function and the identity function, showing that in any directed acyclic network there are two cl"},"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":"2409.10854","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2024-09-17T02:40:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"34655140cfca0cca55cb246966e89088f3c7ef594abe9e588f49f3fd0b3a6247","abstract_canon_sha256":"54d711d56d1faf33de660d4fa941d2ce2648e5ef5e47062fa220fc6a424a6089"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:58.094025Z","signature_b64":"bllGj5sQN3XtuW2MhUPLZAGfwUlueCsC+GM8gqfJQox+Ha+pgElQsQQ4x0z1lLX/Tfy1GsweI47A+CSb+aFWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63fbb95c66b95225c411edde632301351f4b7065329774b53c4ad8d68658f686","last_reissued_at":"2026-07-05T09:07:58.093618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:58.093618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Hengjia Wei, Min Xu","submitted_at":"2024-09-17T02:40:07Z","abstract_excerpt":"We investigate linear network coding in the context of robust function computation, where a sink node is tasked with computing a target function of messages generated at multiple source nodes. In a previous work, a new distance measure was introduced to evaluate the error tolerance of a linear network code for function computation, along with a Singleton-like bound for this distance. In this paper, we first present a minimum distance decoder for these linear network codes. We then focus on the sum function and the identity function, showing that in any directed acyclic network there are two cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10854","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.10854/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.10854","created_at":"2026-07-05T09:07:58.093688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.10854v1","created_at":"2026-07-05T09:07:58.093688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10854","created_at":"2026-07-05T09:07:58.093688+00:00"},{"alias_kind":"pith_short_12","alias_value":"MP53SXDGXFJC","created_at":"2026-07-05T09:07:58.093688+00:00"},{"alias_kind":"pith_short_16","alias_value":"MP53SXDGXFJCLRAR","created_at":"2026-07-05T09:07:58.093688+00:00"},{"alias_kind":"pith_short_8","alias_value":"MP53SXDG","created_at":"2026-07-05T09:07:58.093688+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/MP53SXDGXFJCLRAR5XPGGIYBGU","json":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU.json","graph_json":"https://pith.science/api/pith-number/MP53SXDGXFJCLRAR5XPGGIYBGU/graph.json","events_json":"https://pith.science/api/pith-number/MP53SXDGXFJCLRAR5XPGGIYBGU/events.json","paper":"https://pith.science/paper/MP53SXDG"},"agent_actions":{"view_html":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU","download_json":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU.json","view_paper":"https://pith.science/paper/MP53SXDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.10854&json=true","fetch_graph":"https://pith.science/api/pith-number/MP53SXDGXFJCLRAR5XPGGIYBGU/graph.json","fetch_events":"https://pith.science/api/pith-number/MP53SXDGXFJCLRAR5XPGGIYBGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/action/storage_attestation","attest_author":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/action/author_attestation","sign_citation":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/action/citation_signature","submit_replication":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/action/replication_record"}},"created_at":"2026-07-05T09:07:58.093688+00:00","updated_at":"2026-07-05T09:07:58.093688+00:00"}