{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XPCJ7W6ZNXE2NJ63ISW2TNBG2W","short_pith_number":"pith:XPCJ7W6Z","schema_version":"1.0","canonical_sha256":"bbc49fdbd96dc9a6a7db44ada9b426d5bc813e578e76c15b251167cf8f35e0f1","source":{"kind":"arxiv","id":"1812.06897","version":3},"attestation_state":"computed","paper":{"title":"Cyclic Codes with Locality and Availability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Lukas Holzbaur, Ragnar Freij-Hollanti","submitted_at":"2018-12-17T17:07:36Z","abstract_excerpt":"In this work codes with availability are constructed based on the cyclic \\emph{locally repairable code} (LRC) construction by Tamo et al. and their extension to $(r,\\rho)$-locality by Chen et al. The minimum distance of these codes is increased by carefully extending their defining set. We give a bound on the dimension of LRCs with availability and orthogonal repair sets and show that the given construction is optimal for a range of parameters."},"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":"1812.06897","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-17T17:07:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1b7ee225e3d2691daeedc626b51c49ddd8f7a21fccd9d2ad0f473abb96f2388d","abstract_canon_sha256":"bd339ecfdda6ff9047a5c230109976130be064d7a1e46f8db59556b1b86c33d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:27.249484Z","signature_b64":"5qtYwkf+3DEyb37w9pCFzEyghUDFSVFCeObHjlXBrSTX4Hay/bptFHTNcJVDwWEpq9jcRNo0oS+ZB0mSEkvoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbc49fdbd96dc9a6a7db44ada9b426d5bc813e578e76c15b251167cf8f35e0f1","last_reissued_at":"2026-05-17T23:49:27.248947Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:27.248947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic Codes with Locality and Availability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Lukas Holzbaur, Ragnar Freij-Hollanti","submitted_at":"2018-12-17T17:07:36Z","abstract_excerpt":"In this work codes with availability are constructed based on the cyclic \\emph{locally repairable code} (LRC) construction by Tamo et al. and their extension to $(r,\\rho)$-locality by Chen et al. The minimum distance of these codes is increased by carefully extending their defining set. We give a bound on the dimension of LRCs with availability and orthogonal repair sets and show that the given construction is optimal for a range of parameters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06897","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":"1812.06897","created_at":"2026-05-17T23:49:27.249023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06897v3","created_at":"2026-05-17T23:49:27.249023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06897","created_at":"2026-05-17T23:49:27.249023+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPCJ7W6ZNXE2","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPCJ7W6ZNXE2NJ63","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPCJ7W6Z","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/XPCJ7W6ZNXE2NJ63ISW2TNBG2W","json":"https://pith.science/pith/XPCJ7W6ZNXE2NJ63ISW2TNBG2W.json","graph_json":"https://pith.science/api/pith-number/XPCJ7W6ZNXE2NJ63ISW2TNBG2W/graph.json","events_json":"https://pith.science/api/pith-number/XPCJ7W6ZNXE2NJ63ISW2TNBG2W/events.json","paper":"https://pith.science/paper/XPCJ7W6Z"},"agent_actions":{"view_html":"https://pith.science/pith/XPCJ7W6ZNXE2NJ63ISW2TNBG2W","download_json":"https://pith.science/pith/XPCJ7W6ZNXE2NJ63ISW2TNBG2W.json","view_paper":"https://pith.science/paper/XPCJ7W6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06897&json=true","fetch_graph":"https://pith.science/api/pith-number/XPCJ7W6ZNXE2NJ63ISW2TNBG2W/graph.json","fetch_events":"https://pith.science/api/pith-number/XPCJ7W6ZNXE2NJ63ISW2TNBG2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPCJ7W6ZNXE2NJ63ISW2TNBG2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPCJ7W6ZNXE2NJ63ISW2TNBG2W/action/storage_attestation","attest_author":"https://pith.science/pith/XPCJ7W6ZNXE2NJ63ISW2TNBG2W/action/author_attestation","sign_citation":"https://pith.science/pith/XPCJ7W6ZNXE2NJ63ISW2TNBG2W/action/citation_signature","submit_replication":"https://pith.science/pith/XPCJ7W6ZNXE2NJ63ISW2TNBG2W/action/replication_record"}},"created_at":"2026-05-17T23:49:27.249023+00:00","updated_at":"2026-05-17T23:49:27.249023+00:00"}