{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XCNPPL5DJ35IP4N4TLOKUJ76I5","short_pith_number":"pith:XCNPPL5D","schema_version":"1.0","canonical_sha256":"b89af7afa34efa87f1bc9adcaa27fe47756c174f65eba33c7d53c8e76ac9da2c","source":{"kind":"arxiv","id":"1802.00157","version":1},"attestation_state":"computed","paper":{"title":"Optimal LRC codes for all lenghts n <= q","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Gala Yadgar, Itzhak Tamo, Oleg Kolosov","submitted_at":"2018-02-01T05:27:23Z","abstract_excerpt":"A family of distance-optimal LRC codes from certain subcodes of $q$-ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length $n$ is a multiple of $r+1.$ By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes."},"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":"1802.00157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-01T05:27:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7397b8a97197ceb39bfd6d47bb6a50c3831ce736d6b0034129608822d44d3d68","abstract_canon_sha256":"b75b6a86910c99c2413982b58e38f244e7651002534310b4ccc07f556cd4dedf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.656275Z","signature_b64":"hoa8s55JyujFpA2EzcGHjzdDewaz0mdymqWUpyu0BMBdEnng4ccUBt7AdA6X27rn5dE9rwrG+sR2l/KCbVyfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89af7afa34efa87f1bc9adcaa27fe47756c174f65eba33c7d53c8e76ac9da2c","last_reissued_at":"2026-05-18T00:24:36.655857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.655857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal LRC codes for all lenghts n <= q","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Barg, Gala Yadgar, Itzhak Tamo, Oleg Kolosov","submitted_at":"2018-02-01T05:27:23Z","abstract_excerpt":"A family of distance-optimal LRC codes from certain subcodes of $q$-ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length $n$ is a multiple of $r+1.$ By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00157","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":"1802.00157","created_at":"2026-05-18T00:24:36.655924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00157v1","created_at":"2026-05-18T00:24:36.655924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00157","created_at":"2026-05-18T00:24:36.655924+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCNPPL5DJ35I","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCNPPL5DJ35IP4N4","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCNPPL5D","created_at":"2026-05-18T12:33:01.666342+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/XCNPPL5DJ35IP4N4TLOKUJ76I5","json":"https://pith.science/pith/XCNPPL5DJ35IP4N4TLOKUJ76I5.json","graph_json":"https://pith.science/api/pith-number/XCNPPL5DJ35IP4N4TLOKUJ76I5/graph.json","events_json":"https://pith.science/api/pith-number/XCNPPL5DJ35IP4N4TLOKUJ76I5/events.json","paper":"https://pith.science/paper/XCNPPL5D"},"agent_actions":{"view_html":"https://pith.science/pith/XCNPPL5DJ35IP4N4TLOKUJ76I5","download_json":"https://pith.science/pith/XCNPPL5DJ35IP4N4TLOKUJ76I5.json","view_paper":"https://pith.science/paper/XCNPPL5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00157&json=true","fetch_graph":"https://pith.science/api/pith-number/XCNPPL5DJ35IP4N4TLOKUJ76I5/graph.json","fetch_events":"https://pith.science/api/pith-number/XCNPPL5DJ35IP4N4TLOKUJ76I5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCNPPL5DJ35IP4N4TLOKUJ76I5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCNPPL5DJ35IP4N4TLOKUJ76I5/action/storage_attestation","attest_author":"https://pith.science/pith/XCNPPL5DJ35IP4N4TLOKUJ76I5/action/author_attestation","sign_citation":"https://pith.science/pith/XCNPPL5DJ35IP4N4TLOKUJ76I5/action/citation_signature","submit_replication":"https://pith.science/pith/XCNPPL5DJ35IP4N4TLOKUJ76I5/action/replication_record"}},"created_at":"2026-05-18T00:24:36.655924+00:00","updated_at":"2026-05-18T00:24:36.655924+00:00"}