{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:MP53SXDGXFJCLRAR5XPGGIYBGU","short_pith_number":"pith:MP53SXDG","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"},"canonical_sha256":"63fbb95c66b95225c411edde632301351f4b7065329774b53c4ad8d68658f686","source":{"kind":"arxiv","id":"2409.10854","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10854","created_at":"2026-07-05T09:07:58Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10854v1","created_at":"2026-07-05T09:07:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10854","created_at":"2026-07-05T09:07:58Z"},{"alias_kind":"pith_short_12","alias_value":"MP53SXDGXFJC","created_at":"2026-07-05T09:07:58Z"},{"alias_kind":"pith_short_16","alias_value":"MP53SXDGXFJCLRAR","created_at":"2026-07-05T09:07:58Z"},{"alias_kind":"pith_short_8","alias_value":"MP53SXDG","created_at":"2026-07-05T09:07:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:MP53SXDGXFJCLRAR5XPGGIYBGU","target":"record","payload":{"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"},"canonical_sha256":"63fbb95c66b95225c411edde632301351f4b7065329774b53c4ad8d68658f686","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"},"source_kind":"arxiv","source_id":"2409.10854","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:07:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSlcvUdP7L45Kv3ImFIhE4rXqA/ZtO7UFufesFxKrfLhdli99FCR+VgUu1YC6zzZdO517cZinco5dEd6iz8RBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T05:26:56.776257Z"},"content_sha256":"9204dbb5a0d9a5bc90d8cca9c1dea4d28c587e03902cef490fbd15cd6742199b","schema_version":"1.0","event_id":"sha256:9204dbb5a0d9a5bc90d8cca9c1dea4d28c587e03902cef490fbd15cd6742199b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:MP53SXDGXFJCLRAR5XPGGIYBGU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:07:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vVqTM3uaNS3y1/H7uaTjhtZVZPMbricl5LdU/by5WpDvHPrUt6YCml3TSBY03EJ4TyW1bNmdpQPy0hq8LUkmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T05:26:56.776773Z"},"content_sha256":"75c4e6e0724a4c889795b9a3d07f23ad0ab2d505c62a12f05cf444f926fa614d","schema_version":"1.0","event_id":"sha256:75c4e6e0724a4c889795b9a3d07f23ad0ab2d505c62a12f05cf444f926fa614d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/bundle.json","state_url":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T05:26:56Z","links":{"resolver":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU","bundle":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/bundle.json","state":"https://pith.science/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MP53SXDGXFJCLRAR5XPGGIYBGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MP53SXDGXFJCLRAR5XPGGIYBGU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"54d711d56d1faf33de660d4fa941d2ce2648e5ef5e47062fa220fc6a424a6089","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2024-09-17T02:40:07Z","title_canon_sha256":"34655140cfca0cca55cb246966e89088f3c7ef594abe9e588f49f3fd0b3a6247"},"schema_version":"1.0","source":{"id":"2409.10854","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10854","created_at":"2026-07-05T09:07:58Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10854v1","created_at":"2026-07-05T09:07:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10854","created_at":"2026-07-05T09:07:58Z"},{"alias_kind":"pith_short_12","alias_value":"MP53SXDGXFJC","created_at":"2026-07-05T09:07:58Z"},{"alias_kind":"pith_short_16","alias_value":"MP53SXDGXFJCLRAR","created_at":"2026-07-05T09:07:58Z"},{"alias_kind":"pith_short_8","alias_value":"MP53SXDG","created_at":"2026-07-05T09:07:58Z"}],"graph_snapshots":[{"event_id":"sha256:75c4e6e0724a4c889795b9a3d07f23ad0ab2d505c62a12f05cf444f926fa614d","target":"graph","created_at":"2026-07-05T09:07:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2409.10854/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gennian Ge, Hengjia Wei, Min Xu","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2024-09-17T02:40:07Z","title":"Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10854","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9204dbb5a0d9a5bc90d8cca9c1dea4d28c587e03902cef490fbd15cd6742199b","target":"record","created_at":"2026-07-05T09:07:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"54d711d56d1faf33de660d4fa941d2ce2648e5ef5e47062fa220fc6a424a6089","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2024-09-17T02:40:07Z","title_canon_sha256":"34655140cfca0cca55cb246966e89088f3c7ef594abe9e588f49f3fd0b3a6247"},"schema_version":"1.0","source":{"id":"2409.10854","kind":"arxiv","version":1}},"canonical_sha256":"63fbb95c66b95225c411edde632301351f4b7065329774b53c4ad8d68658f686","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63fbb95c66b95225c411edde632301351f4b7065329774b53c4ad8d68658f686","first_computed_at":"2026-07-05T09:07:58.093618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:07:58.093618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bllGj5sQN3XtuW2MhUPLZAGfwUlueCsC+GM8gqfJQox+Ha+pgElQsQQ4x0z1lLX/Tfy1GsweI47A+CSb+aFWDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:07:58.094025Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.10854","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9204dbb5a0d9a5bc90d8cca9c1dea4d28c587e03902cef490fbd15cd6742199b","sha256:75c4e6e0724a4c889795b9a3d07f23ad0ab2d505c62a12f05cf444f926fa614d"],"state_sha256":"92cfbe9eeeb412e0cdd4c0931632105ecc72b1c013bc583b543b9d226fdbaf82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ejLuos3uTZBQKIp1QUuVH+5ZCR4QY9/QEZwAByAlUzWrOMix5w7ryIAlKHko+sWNImUARGQ9U5auiIAAw+srDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T05:26:56.794645Z","bundle_sha256":"c10f51aece98d24cb8ecb707a9f71dbb7bb6b3f8126ec1809015275c968b6582"}}