{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YSZNMUDOX6QMNMYLLYXIK3TSJV","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":"6f6715da68fdeed352c2a0b3d3feec43bf52c398a61f55dc017f56f4f666f873","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-15T18:18:50Z","title_canon_sha256":"8f8d3336be17993048af982b174cd1d6f95e920263dec4e51876925cb1bef0ae"},"schema_version":"1.0","source":{"id":"1904.07273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07273","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07273v1","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07273","created_at":"2026-05-17T23:48:29Z"},{"alias_kind":"pith_short_12","alias_value":"YSZNMUDOX6QM","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YSZNMUDOX6QMNMYL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YSZNMUDO","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:59bb80420f9335cda709cefbf6bc315966f32f42fa1c52962507e6a4a145e2f5","target":"graph","created_at":"2026-05-17T23:48:29Z","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"},"paper":{"abstract_excerpt":"A code construction and repair scheme for optimal functional regeneration of multiple node failures is presented, which is based on stitching together short MDS codes on carefully chosen sets of points lying on a linearized polynomial. The nodes are connected wirelessly, hence all transmissions by helper nodes during a repair round are available to all the nodes being repaired. The scheme is simple and practical because of low subpacketization, low I/O cost and low computational cost. Achievability of the minimum-bandwidth regenerating (MBR) point, as well as an interior point, on the optimal ","authors_text":"Cong Ling, Deniz Gunduz, Katina Kralevska, Nitish Mital","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-15T18:18:50Z","title":"Practical Functional Regenerating Codes for Broadcast Repair of Multiple Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07273","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:233993517d1d28cac282a1f5f4d9223360333451f70d122a9a84d53b40757368","target":"record","created_at":"2026-05-17T23:48:29Z","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":"6f6715da68fdeed352c2a0b3d3feec43bf52c398a61f55dc017f56f4f666f873","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-15T18:18:50Z","title_canon_sha256":"8f8d3336be17993048af982b174cd1d6f95e920263dec4e51876925cb1bef0ae"},"schema_version":"1.0","source":{"id":"1904.07273","kind":"arxiv","version":1}},"canonical_sha256":"c4b2d6506ebfa0c6b30b5e2e856e724d4de058bd342f231879885d5778a1054b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4b2d6506ebfa0c6b30b5e2e856e724d4de058bd342f231879885d5778a1054b","first_computed_at":"2026-05-17T23:48:29.119409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:29.119409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WvjWXqaMBzllV/WOBvLNtpjuZJPSi8/Rwfo3yK+BR8qJSUIYbDvyHyPcsqpxw4GKpTUHPtXsWmASTb2iVhA+Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:29.119963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:233993517d1d28cac282a1f5f4d9223360333451f70d122a9a84d53b40757368","sha256:59bb80420f9335cda709cefbf6bc315966f32f42fa1c52962507e6a4a145e2f5"],"state_sha256":"b3581d3b41f8a12b434ee662b358bf98686317565f3a6169945f0510ee21e250"}