{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4FPX77T43IXWEPCOZQMRM7BOKG","short_pith_number":"pith:4FPX77T4","canonical_record":{"source":{"id":"1707.00421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-03T06:47:36Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"64577dd725173889755b43cf1546970c35bd407ed8a81283d493934d8a7e671b","abstract_canon_sha256":"0f6894b4712939fc3ba8ca9096e50a495bd1a3c30f58fd759bff4625d85702d0"},"schema_version":"1.0"},"canonical_sha256":"e15f7ffe7cda2f623c4ecc19167c2e5191b165b1b87a13603a9f96acdedd2d8d","source":{"kind":"arxiv","id":"1707.00421","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00421","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00421v2","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00421","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"4FPX77T43IXW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4FPX77T43IXWEPCO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4FPX77T4","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4FPX77T43IXWEPCOZQMRM7BOKG","target":"record","payload":{"canonical_record":{"source":{"id":"1707.00421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-03T06:47:36Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"64577dd725173889755b43cf1546970c35bd407ed8a81283d493934d8a7e671b","abstract_canon_sha256":"0f6894b4712939fc3ba8ca9096e50a495bd1a3c30f58fd759bff4625d85702d0"},"schema_version":"1.0"},"canonical_sha256":"e15f7ffe7cda2f623c4ecc19167c2e5191b165b1b87a13603a9f96acdedd2d8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:08.738899Z","signature_b64":"8gyhquoDc6zogqUXM0e2jHQhdOwYJPXVKlM3U8cZubkTkPq8o+9PYj+6P1rF9KS0zVwqxScByJIrHls78LQ0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e15f7ffe7cda2f623c4ecc19167c2e5191b165b1b87a13603a9f96acdedd2d8d","last_reissued_at":"2026-05-18T00:23:08.738257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:08.738257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.00421","source_version":2,"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-18T00:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ey1TQ/n7mYl6QWli2NVCzPNsnVMBfWWTxPDXydnA1Z14BzOVFqVD5g2/nFdRwmoozRwc3pQe0SSsdEDX9ybSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T03:33:17.277588Z"},"content_sha256":"96546726df984f8a47e30930b77a03825d92c08cf3714d282a2b63d6255caf08","schema_version":"1.0","event_id":"sha256:96546726df984f8a47e30930b77a03825d92c08cf3714d282a2b63d6255caf08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4FPX77T43IXWEPCOZQMRM7BOKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Binary Matroid Minors and Applications to Data Storage over Small Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerb\\\"ack","submitted_at":"2017-07-03T06:47:36Z","abstract_excerpt":"Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the constructions result in either large field sizes and hence too high computational complexity for practical implementation, or in low rates translating into waste of the available storage space. In this paper we address this issue by developing theory towards code existence and design over a given field. This is done via exploiting recently established connections between linear locally repairable codes and matroids, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00421","kind":"arxiv","version":2},"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-18T00:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yc00HY7X8PSGDtyQ+uX7G0tC034mMI8yGXgskWY/LyVWz0ZanicDewL0eUqZ2XtYYg36gbCwrbQWaY846G0yBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T03:33:17.277940Z"},"content_sha256":"d66f5e82c4bca81e58c5873cb9cd38c172536214c8ec3cfa3f9382dacfac0a00","schema_version":"1.0","event_id":"sha256:d66f5e82c4bca81e58c5873cb9cd38c172536214c8ec3cfa3f9382dacfac0a00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FPX77T43IXWEPCOZQMRM7BOKG/bundle.json","state_url":"https://pith.science/pith/4FPX77T43IXWEPCOZQMRM7BOKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FPX77T43IXWEPCOZQMRM7BOKG/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-21T03:33:17Z","links":{"resolver":"https://pith.science/pith/4FPX77T43IXWEPCOZQMRM7BOKG","bundle":"https://pith.science/pith/4FPX77T43IXWEPCOZQMRM7BOKG/bundle.json","state":"https://pith.science/pith/4FPX77T43IXWEPCOZQMRM7BOKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FPX77T43IXWEPCOZQMRM7BOKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4FPX77T43IXWEPCOZQMRM7BOKG","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":"0f6894b4712939fc3ba8ca9096e50a495bd1a3c30f58fd759bff4625d85702d0","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-03T06:47:36Z","title_canon_sha256":"64577dd725173889755b43cf1546970c35bd407ed8a81283d493934d8a7e671b"},"schema_version":"1.0","source":{"id":"1707.00421","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.00421","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1707.00421v2","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00421","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"4FPX77T43IXW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4FPX77T43IXWEPCO","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4FPX77T4","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:d66f5e82c4bca81e58c5873cb9cd38c172536214c8ec3cfa3f9382dacfac0a00","target":"graph","created_at":"2026-05-18T00:23:08Z","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":"Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the constructions result in either large field sizes and hence too high computational complexity for practical implementation, or in low rates translating into waste of the available storage space. In this paper we address this issue by developing theory towards code existence and design over a given field. This is done via exploiting recently established connections between linear locally repairable codes and matroids, and ","authors_text":"Camilla Hollanti, Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerb\\\"ack","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-03T06:47:36Z","title":"On Binary Matroid Minors and Applications to Data Storage over Small Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00421","kind":"arxiv","version":2},"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:96546726df984f8a47e30930b77a03825d92c08cf3714d282a2b63d6255caf08","target":"record","created_at":"2026-05-18T00:23:08Z","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":"0f6894b4712939fc3ba8ca9096e50a495bd1a3c30f58fd759bff4625d85702d0","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-03T06:47:36Z","title_canon_sha256":"64577dd725173889755b43cf1546970c35bd407ed8a81283d493934d8a7e671b"},"schema_version":"1.0","source":{"id":"1707.00421","kind":"arxiv","version":2}},"canonical_sha256":"e15f7ffe7cda2f623c4ecc19167c2e5191b165b1b87a13603a9f96acdedd2d8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e15f7ffe7cda2f623c4ecc19167c2e5191b165b1b87a13603a9f96acdedd2d8d","first_computed_at":"2026-05-18T00:23:08.738257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:08.738257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8gyhquoDc6zogqUXM0e2jHQhdOwYJPXVKlM3U8cZubkTkPq8o+9PYj+6P1rF9KS0zVwqxScByJIrHls78LQ0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:08.738899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.00421","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96546726df984f8a47e30930b77a03825d92c08cf3714d282a2b63d6255caf08","sha256:d66f5e82c4bca81e58c5873cb9cd38c172536214c8ec3cfa3f9382dacfac0a00"],"state_sha256":"018a32c96cd46bcb7236c5e30fa11dea87c737ec87e3538b4265dc6785298883"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/OB748CpwQMVff2OykkLbiXJX/ed9XOoov5qrRvGUm+9G0Pva1ZachL43meQdXixtjvuvtS0pW09dnxyRlD7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T03:33:17.279982Z","bundle_sha256":"0a44632ad830a3369c8bc965c7a62aefe9e7d8382a1d39a0f5979522503e6a59"}}