{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AZR64TZL4DZFEDCCLT33XEZ3AX","short_pith_number":"pith:AZR64TZL","schema_version":"1.0","canonical_sha256":"0663ee4f2be0f2520c425cf7bb933b05c5f342c5385d07c65ca0375c1e53c34a","source":{"kind":"arxiv","id":"1801.03379","version":1},"attestation_state":"computed","paper":{"title":"On Maximally Recoverable Codes for Product Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, D. Shivakrishna, V. Arvind Rameshwar, V. Lalitha","submitted_at":"2018-01-10T13:58:14Z","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"},"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":"1801.03379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-10T13:58:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"75886bf359d06cc0f035033e4b940ea9db4e4f9c88ce1708952eeecb03bd6502","abstract_canon_sha256":"bbf19c87f5cf7cfd6c53308448e6086369ccc8dbdf61af3ee52fc096a8b716cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:17.241775Z","signature_b64":"H2OEem5IVD6sNyYfQVN7eQNpH0WCDiPVk/P5sk8zBIsjdwheAFORHMH6Uc2gfsHBqiq5MinU1ph14pCXcLF7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0663ee4f2be0f2520c425cf7bb933b05c5f342c5385d07c65ca0375c1e53c34a","last_reissued_at":"2026-05-18T00:26:17.241107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:17.241107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Maximally Recoverable Codes for Product Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Birenjith Sasidharan, D. Shivakrishna, V. Arvind Rameshwar, V. Lalitha","submitted_at":"2018-01-10T13:58:14Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03379","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":""},"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":"1801.03379","created_at":"2026-05-18T00:26:17.241208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.03379v1","created_at":"2026-05-18T00:26:17.241208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03379","created_at":"2026-05-18T00:26:17.241208+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZR64TZL4DZF","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZR64TZL4DZFEDCC","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZR64TZL","created_at":"2026-05-18T12:32:13.499390+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/AZR64TZL4DZFEDCCLT33XEZ3AX","json":"https://pith.science/pith/AZR64TZL4DZFEDCCLT33XEZ3AX.json","graph_json":"https://pith.science/api/pith-number/AZR64TZL4DZFEDCCLT33XEZ3AX/graph.json","events_json":"https://pith.science/api/pith-number/AZR64TZL4DZFEDCCLT33XEZ3AX/events.json","paper":"https://pith.science/paper/AZR64TZL"},"agent_actions":{"view_html":"https://pith.science/pith/AZR64TZL4DZFEDCCLT33XEZ3AX","download_json":"https://pith.science/pith/AZR64TZL4DZFEDCCLT33XEZ3AX.json","view_paper":"https://pith.science/paper/AZR64TZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.03379&json=true","fetch_graph":"https://pith.science/api/pith-number/AZR64TZL4DZFEDCCLT33XEZ3AX/graph.json","fetch_events":"https://pith.science/api/pith-number/AZR64TZL4DZFEDCCLT33XEZ3AX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZR64TZL4DZFEDCCLT33XEZ3AX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZR64TZL4DZFEDCCLT33XEZ3AX/action/storage_attestation","attest_author":"https://pith.science/pith/AZR64TZL4DZFEDCCLT33XEZ3AX/action/author_attestation","sign_citation":"https://pith.science/pith/AZR64TZL4DZFEDCCLT33XEZ3AX/action/citation_signature","submit_replication":"https://pith.science/pith/AZR64TZL4DZFEDCCLT33XEZ3AX/action/replication_record"}},"created_at":"2026-05-18T00:26:17.241208+00:00","updated_at":"2026-05-18T00:26:17.241208+00:00"}