{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VUVDF5WRZNTHU6PZ6JUH5EIOP4","short_pith_number":"pith:VUVDF5WR","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"},"canonical_sha256":"ad2a32f6d1cb667a79f9f2687e910e7f059c3c8c72ae96ca1412c14f1cc70a5d","source":{"kind":"arxiv","id":"1306.4552","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4552","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4552v3","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4552","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"VUVDF5WRZNTH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VUVDF5WRZNTHU6PZ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VUVDF5WR","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VUVDF5WRZNTHU6PZ6JUH5EIOP4","target":"record","payload":{"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"},"canonical_sha256":"ad2a32f6d1cb667a79f9f2687e910e7f059c3c8c72ae96ca1412c14f1cc70a5d","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"},"source_kind":"arxiv","source_id":"1306.4552","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FSheUgEfgDR5LI8f+qnH41DaRfcqwPEFgMYe+TMzfzVmnFXq7ciZdNItkt58weDjJMRD0Z4Tk1xyRyuZTRjrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:14:31.268112Z"},"content_sha256":"1d32cc1e30ae90308db1d5d73d411347cf1b0489c0e9408c8842ecbb282e2278","schema_version":"1.0","event_id":"sha256:1d32cc1e30ae90308db1d5d73d411347cf1b0489c0e9408c8842ecbb282e2278"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VUVDF5WRZNTHU6PZ6JUH5EIOP4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MM2fFe9EQ/DiTYPgvfWKaVq3mdhVN8QZ5rlgqhH0RHrg47N6WQKmY7YUwaHPncBstaiCnPMqd3YIPIA13ZppAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:14:31.268484Z"},"content_sha256":"cb13b82eaea565e4bca79d07a370d75368195b96d6df6504b3a16b9f87a75040","schema_version":"1.0","event_id":"sha256:cb13b82eaea565e4bca79d07a370d75368195b96d6df6504b3a16b9f87a75040"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/bundle.json","state_url":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T14:14:31Z","links":{"resolver":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4","bundle":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/bundle.json","state":"https://pith.science/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VUVDF5WRZNTHU6PZ6JUH5EIOP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VUVDF5WRZNTHU6PZ6JUH5EIOP4","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":"8fd3a1f3366a1f3904e583bc4c48d01e5184ad6c94e8c78d38183e7eb9fef898","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-19T13:58:11Z","title_canon_sha256":"43d146851d5309c66872c0dee26a6c363fbc706667796ae72f9389c35f08ab8d"},"schema_version":"1.0","source":{"id":"1306.4552","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.4552","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"1306.4552v3","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4552","created_at":"2026-05-18T03:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"VUVDF5WRZNTH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VUVDF5WRZNTHU6PZ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VUVDF5WR","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:cb13b82eaea565e4bca79d07a370d75368195b96d6df6504b3a16b9f87a75040","target":"graph","created_at":"2026-05-18T03:07:54Z","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":"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.","authors_text":"Filippo Tosato, Magnus Sandell","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-19T13:58:11Z","title":"A Novel Lowest Density MDS Array Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4552","kind":"arxiv","version":3},"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:1d32cc1e30ae90308db1d5d73d411347cf1b0489c0e9408c8842ecbb282e2278","target":"record","created_at":"2026-05-18T03:07:54Z","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":"8fd3a1f3366a1f3904e583bc4c48d01e5184ad6c94e8c78d38183e7eb9fef898","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-19T13:58:11Z","title_canon_sha256":"43d146851d5309c66872c0dee26a6c363fbc706667796ae72f9389c35f08ab8d"},"schema_version":"1.0","source":{"id":"1306.4552","kind":"arxiv","version":3}},"canonical_sha256":"ad2a32f6d1cb667a79f9f2687e910e7f059c3c8c72ae96ca1412c14f1cc70a5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad2a32f6d1cb667a79f9f2687e910e7f059c3c8c72ae96ca1412c14f1cc70a5d","first_computed_at":"2026-05-18T03:07:54.513356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:54.513356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u4kjDCh6GxoJpgsTm5uTUjaiJ+xxahYzAJiUPP3pLffTxzXoPcBCUANhaGf21lZtbmH6vmRi+EfvlFCrhP36Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:54.514112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.4552","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d32cc1e30ae90308db1d5d73d411347cf1b0489c0e9408c8842ecbb282e2278","sha256:cb13b82eaea565e4bca79d07a370d75368195b96d6df6504b3a16b9f87a75040"],"state_sha256":"650626d61254b8963d6ebcaffd1bd4aeeb648a04c9f85ee5b51a33f1415e785c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"88FhbMYj/W6OxA3KRNteptL3lkgVpKEM8RMkaL4JinNcZAaZBt1pPMw6J8AkT14pWEDw/tta7P7K5LuaE/rcAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:14:31.270473Z","bundle_sha256":"fc6d73ce43b1ca31b10ec88b69aa083fcdcbe3b2ebe9693e8a83f1670c3db436"}}