{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4WK7EBDG3MXCPT5PAZ3VEWDXSR","short_pith_number":"pith:4WK7EBDG","schema_version":"1.0","canonical_sha256":"e595f20466db2e27cfaf067752587794791523683fe34c3baba5e7aaafd336f3","source":{"kind":"arxiv","id":"1501.07130","version":1},"attestation_state":"computed","paper":{"title":"On Partial Maximally-Recoverable and Maximally-Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"P. Vijay Kumar, S. B. Balaji","submitted_at":"2015-01-28T15:06:25Z","abstract_excerpt":"An [n, k] linear code C that is subject to locality constraints imposed by a parity check matrix H0 is said to be a maximally recoverable (MR) code if it can recover from any erasure pattern that some k-dimensional subcode of the null space of H0 can recover from. The focus in this paper is on MR codes constrained to have all-symbol locality r. Given that it is challenging to construct MR codes having small field size, we present results in two directions. In the first, we relax the MR constraint and require only that apart from the requirement of being an optimum all-symbol locality code, the"},"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":"1501.07130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-28T15:06:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"68e6927799070a054c9870045e8842a5b8b8c73dbcdf21dc5ac259c89d140323","abstract_canon_sha256":"b1871f67c87e175505291c73989f8b5be1c1662a9824d66aade063f41823b920"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:30.146674Z","signature_b64":"3NXVcJ3nx3v8qBLLhYMehARvPQ4EtFD7dYIhk07+7zN9MLmoE8xv5GWfBG71TxGE5b6O54IDFKHCZZ/bZJbzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e595f20466db2e27cfaf067752587794791523683fe34c3baba5e7aaafd336f3","last_reissued_at":"2026-05-18T02:28:30.146234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:30.146234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Partial Maximally-Recoverable and Maximally-Recoverable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"P. Vijay Kumar, S. B. Balaji","submitted_at":"2015-01-28T15:06:25Z","abstract_excerpt":"An [n, k] linear code C that is subject to locality constraints imposed by a parity check matrix H0 is said to be a maximally recoverable (MR) code if it can recover from any erasure pattern that some k-dimensional subcode of the null space of H0 can recover from. The focus in this paper is on MR codes constrained to have all-symbol locality r. Given that it is challenging to construct MR codes having small field size, we present results in two directions. In the first, we relax the MR constraint and require only that apart from the requirement of being an optimum all-symbol locality code, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.07130","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":"1501.07130","created_at":"2026-05-18T02:28:30.146299+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.07130v1","created_at":"2026-05-18T02:28:30.146299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.07130","created_at":"2026-05-18T02:28:30.146299+00:00"},{"alias_kind":"pith_short_12","alias_value":"4WK7EBDG3MXC","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4WK7EBDG3MXCPT5P","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4WK7EBDG","created_at":"2026-05-18T12:29:05.191682+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/4WK7EBDG3MXCPT5PAZ3VEWDXSR","json":"https://pith.science/pith/4WK7EBDG3MXCPT5PAZ3VEWDXSR.json","graph_json":"https://pith.science/api/pith-number/4WK7EBDG3MXCPT5PAZ3VEWDXSR/graph.json","events_json":"https://pith.science/api/pith-number/4WK7EBDG3MXCPT5PAZ3VEWDXSR/events.json","paper":"https://pith.science/paper/4WK7EBDG"},"agent_actions":{"view_html":"https://pith.science/pith/4WK7EBDG3MXCPT5PAZ3VEWDXSR","download_json":"https://pith.science/pith/4WK7EBDG3MXCPT5PAZ3VEWDXSR.json","view_paper":"https://pith.science/paper/4WK7EBDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.07130&json=true","fetch_graph":"https://pith.science/api/pith-number/4WK7EBDG3MXCPT5PAZ3VEWDXSR/graph.json","fetch_events":"https://pith.science/api/pith-number/4WK7EBDG3MXCPT5PAZ3VEWDXSR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4WK7EBDG3MXCPT5PAZ3VEWDXSR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4WK7EBDG3MXCPT5PAZ3VEWDXSR/action/storage_attestation","attest_author":"https://pith.science/pith/4WK7EBDG3MXCPT5PAZ3VEWDXSR/action/author_attestation","sign_citation":"https://pith.science/pith/4WK7EBDG3MXCPT5PAZ3VEWDXSR/action/citation_signature","submit_replication":"https://pith.science/pith/4WK7EBDG3MXCPT5PAZ3VEWDXSR/action/replication_record"}},"created_at":"2026-05-18T02:28:30.146299+00:00","updated_at":"2026-05-18T02:28:30.146299+00:00"}