{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AZR64TZL4DZFEDCCLT33XEZ3AX","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":"bbf19c87f5cf7cfd6c53308448e6086369ccc8dbdf61af3ee52fc096a8b716cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-10T13:58:14Z","title_canon_sha256":"75886bf359d06cc0f035033e4b940ea9db4e4f9c88ce1708952eeecb03bd6502"},"schema_version":"1.0","source":{"id":"1801.03379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03379","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03379v1","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03379","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"AZR64TZL4DZF","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AZR64TZL4DZFEDCC","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AZR64TZL","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:6d9e55afaedcf22347c7289664a790e775c6faf129cae51bc5d390f627347bdd","target":"graph","created_at":"2026-05-18T00:26:17Z","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":"Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct all erasure patterns that are information-theoretically correctable. In a grid-like topology, there are $a$ local constraints in every column forming a column code, $b$ local constraints in every row forming a row code, and $h$ global constraints in an $(m \\times n)$ grid of codeword. Recently, Gopalan et al. initiated the study of MRCs under grid-like topology, and derived a necessary and sufficient condition, termed as the regularity condition, for an erasure pattern to be recoverable when $a=1","authors_text":"Birenjith Sasidharan, D. Shivakrishna, V. Arvind Rameshwar, V. Lalitha","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-10T13:58:14Z","title":"On Maximally Recoverable Codes for Product Topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03379","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:bcfab344bdaa3a09c9f1f9cf99a6e1d4560d23c994818a7a456fe6aaee6fe20a","target":"record","created_at":"2026-05-18T00:26:17Z","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":"bbf19c87f5cf7cfd6c53308448e6086369ccc8dbdf61af3ee52fc096a8b716cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-10T13:58:14Z","title_canon_sha256":"75886bf359d06cc0f035033e4b940ea9db4e4f9c88ce1708952eeecb03bd6502"},"schema_version":"1.0","source":{"id":"1801.03379","kind":"arxiv","version":1}},"canonical_sha256":"0663ee4f2be0f2520c425cf7bb933b05c5f342c5385d07c65ca0375c1e53c34a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0663ee4f2be0f2520c425cf7bb933b05c5f342c5385d07c65ca0375c1e53c34a","first_computed_at":"2026-05-18T00:26:17.241107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:17.241107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H2OEem5IVD6sNyYfQVN7eQNpH0WCDiPVk/P5sk8zBIsjdwheAFORHMH6Uc2gfsHBqiq5MinU1ph14pCXcLF7Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:17.241775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcfab344bdaa3a09c9f1f9cf99a6e1d4560d23c994818a7a456fe6aaee6fe20a","sha256:6d9e55afaedcf22347c7289664a790e775c6faf129cae51bc5d390f627347bdd"],"state_sha256":"85a3d67fea5d8a36c3f0cd0c6197f3589b8c9ab84e711a35b0b3316c2edd8bf4"}