{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C7P4VF46RDGVYIVNB5Y5Z47HZS","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":"f183547ac8e7591c66dda49081ca261a31933fafc5aae7ec95f7830cf9af9f89","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-27T08:06:27Z","title_canon_sha256":"6fbcbefd92780afee5775719de74eda07d6ea65488668d9f43afd195742a1546"},"schema_version":"1.0","source":{"id":"1601.07283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.07283","created_at":"2026-05-18T01:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1601.07283v1","created_at":"2026-05-18T01:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.07283","created_at":"2026-05-18T01:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"C7P4VF46RDGV","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C7P4VF46RDGVYIVN","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C7P4VF46","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:9d9b5bc5c75ec1e9376245c088c92909e884e0eb74f907d933485ae6981bfdc2","target":"graph","created_at":"2026-05-18T01:21:46Z","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":"We consider the problem of constructing linear Maximum Distance Separable (MDS) error-correcting codes with generator matrices that are sparsest and balanced. In this context, sparsest means that every row has the least possible number of non-zero entries, and balanced means that every column contains the same number of non-zero entries. Codes with this structure minimize the maximal computation time of computing any code symbol, a property that is appealing to systems where computational load-balancing is critical. The problem was studied before by Dau et al. where it was shown that there alw","authors_text":"Babak Hassibi, Wael Halbawi, Zihan Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-27T08:06:27Z","title":"Balanced Reed-Solomon Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.07283","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:51a611ab8c9c331910ac5f586a65e0a869ad89852f57bd8f684df208010daa78","target":"record","created_at":"2026-05-18T01:21:46Z","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":"f183547ac8e7591c66dda49081ca261a31933fafc5aae7ec95f7830cf9af9f89","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-27T08:06:27Z","title_canon_sha256":"6fbcbefd92780afee5775719de74eda07d6ea65488668d9f43afd195742a1546"},"schema_version":"1.0","source":{"id":"1601.07283","kind":"arxiv","version":1}},"canonical_sha256":"17dfca979e88cd5c22ad0f71dcf3e7cc9f957888f8792e4dac3ae123caed0221","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17dfca979e88cd5c22ad0f71dcf3e7cc9f957888f8792e4dac3ae123caed0221","first_computed_at":"2026-05-18T01:21:46.210490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:46.210490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DH2kdadoc+MQgbtY2IHxK3kdQsdgc+LFZvg6eXoRGdKsNmIV+8inZnjbUKmjADX8nD0ikfmp5z5/I8Nsb20RBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:46.210961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.07283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51a611ab8c9c331910ac5f586a65e0a869ad89852f57bd8f684df208010daa78","sha256:9d9b5bc5c75ec1e9376245c088c92909e884e0eb74f907d933485ae6981bfdc2"],"state_sha256":"2fdc6f69f16a5d9e41fec62c71e4c23d668d84d409e3c2382b1c2223c3a09aba"}