{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VUVDF5WRZNTHU6PZ6JUH5EIOP4","short_pith_number":"pith:VUVDF5WR","schema_version":"1.0","canonical_sha256":"ad2a32f6d1cb667a79f9f2687e910e7f059c3c8c72ae96ca1412c14f1cc70a5d","source":{"kind":"arxiv","id":"1306.4552","version":3},"attestation_state":"computed","paper":{"title":"A Novel Lowest Density MDS Array Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Filippo Tosato, Magnus Sandell","submitted_at":"2013-06-19T13:58:11Z","abstract_excerpt":"In this paper we introduce a novel MDS array code with lowest density. In contrast to existing codes, this one has no restrictions on the size or the number of erasures it can correct. It is based on a simple matrix construction involving totally nonsingular matrices. We also introduce a simple decoding algorithm based on the structure of the code."},"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":"1306.4552","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-19T13:58:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"43d146851d5309c66872c0dee26a6c363fbc706667796ae72f9389c35f08ab8d","abstract_canon_sha256":"8fd3a1f3366a1f3904e583bc4c48d01e5184ad6c94e8c78d38183e7eb9fef898"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:54.514112Z","signature_b64":"u4kjDCh6GxoJpgsTm5uTUjaiJ+xxahYzAJiUPP3pLffTxzXoPcBCUANhaGf21lZtbmH6vmRi+EfvlFCrhP36Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad2a32f6d1cb667a79f9f2687e910e7f059c3c8c72ae96ca1412c14f1cc70a5d","last_reissued_at":"2026-05-18T03:07:54.513356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:54.513356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Lowest Density MDS Array Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Filippo Tosato, Magnus Sandell","submitted_at":"2013-06-19T13:58:11Z","abstract_excerpt":"In this paper we introduce a novel MDS array code with lowest density. In contrast to existing codes, this one has no restrictions on the size or the number of erasures it can correct. It is based on a simple matrix construction involving totally nonsingular matrices. We also introduce a simple decoding algorithm based on the structure of the code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4552","kind":"arxiv","version":3},"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":"1306.4552","created_at":"2026-05-18T03:07:54.513478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4552v3","created_at":"2026-05-18T03:07:54.513478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4552","created_at":"2026-05-18T03:07:54.513478+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUVDF5WRZNTH","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUVDF5WRZNTHU6PZ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUVDF5WR","created_at":"2026-05-18T12:28:04.890932+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/VUVDF5WRZNTHU6PZ6JUH5EIOP4","json":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4.json","graph_json":"https://pith.science/api/pith-number/VUVDF5WRZNTHU6PZ6JUH5EIOP4/graph.json","events_json":"https://pith.science/api/pith-number/VUVDF5WRZNTHU6PZ6JUH5EIOP4/events.json","paper":"https://pith.science/paper/VUVDF5WR"},"agent_actions":{"view_html":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4","download_json":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4.json","view_paper":"https://pith.science/paper/VUVDF5WR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4552&json=true","fetch_graph":"https://pith.science/api/pith-number/VUVDF5WRZNTHU6PZ6JUH5EIOP4/graph.json","fetch_events":"https://pith.science/api/pith-number/VUVDF5WRZNTHU6PZ6JUH5EIOP4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/action/storage_attestation","attest_author":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/action/author_attestation","sign_citation":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/action/citation_signature","submit_replication":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/action/replication_record"}},"created_at":"2026-05-18T03:07:54.513478+00:00","updated_at":"2026-05-18T03:07:54.513478+00:00"}