{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P7LAIIY42WAVYBCWSDN2Z43GTG","short_pith_number":"pith:P7LAIIY4","schema_version":"1.0","canonical_sha256":"7fd604231cd5815c045690dbacf36699a08eff03311876737e670df46cc46300","source":{"kind":"arxiv","id":"1710.09638","version":1},"attestation_state":"computed","paper":{"title":"Construction of optimal locally repairable codes via automorphism groups of rational function fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Liming Ma, Lingfei Jin","submitted_at":"2017-10-26T10:51:47Z","abstract_excerpt":"Locally repairable codes, or locally recoverable codes (LRC for short) are designed for application in distributed and cloud storage systems. Similar to classical block codes, there is an important bound called the Singleton-type bound for locally repairable codes. In this paper, an optimal locally repairable code refers to a block code achieving this Singleton-type bound. Like classical MDS codes, optimal locally repairable codes carry some very nice combinatorial structures. Since introduction of the Singleton-type bound for locally repairable codes, people have put tremendous effort on cons"},"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":"1710.09638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-26T10:51:47Z","cross_cats_sorted":["math.IT","math.NT"],"title_canon_sha256":"2a23de0e7d11baf78ec88ab897cd509fccb84c19baf69d7be8b5f8fde5022792","abstract_canon_sha256":"9bb8c4957c713b14d88b281f38cbb7af67ee6134e412ee32eda7b5c60810a362"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:56.761196Z","signature_b64":"AemewAlSfmcZowEZOY6x6LtFyKR156okL+ck68v3jBzA7BZ1aTWrCga8oZJ7dOIHCzmQ2VPkAcgJpx3zS2/kBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fd604231cd5815c045690dbacf36699a08eff03311876737e670df46cc46300","last_reissued_at":"2026-05-18T00:31:56.760722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:56.760722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of optimal locally repairable codes via automorphism groups of rational function fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Liming Ma, Lingfei Jin","submitted_at":"2017-10-26T10:51:47Z","abstract_excerpt":"Locally repairable codes, or locally recoverable codes (LRC for short) are designed for application in distributed and cloud storage systems. Similar to classical block codes, there is an important bound called the Singleton-type bound for locally repairable codes. In this paper, an optimal locally repairable code refers to a block code achieving this Singleton-type bound. Like classical MDS codes, optimal locally repairable codes carry some very nice combinatorial structures. Since introduction of the Singleton-type bound for locally repairable codes, people have put tremendous effort on cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09638","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":"1710.09638","created_at":"2026-05-18T00:31:56.760805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09638v1","created_at":"2026-05-18T00:31:56.760805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09638","created_at":"2026-05-18T00:31:56.760805+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7LAIIY42WAV","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7LAIIY42WAVYBCW","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7LAIIY4","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05316","citing_title":"Computing sharp recovery structures for Locally Recoverable codes","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P7LAIIY42WAVYBCWSDN2Z43GTG","json":"https://pith.science/pith/P7LAIIY42WAVYBCWSDN2Z43GTG.json","graph_json":"https://pith.science/api/pith-number/P7LAIIY42WAVYBCWSDN2Z43GTG/graph.json","events_json":"https://pith.science/api/pith-number/P7LAIIY42WAVYBCWSDN2Z43GTG/events.json","paper":"https://pith.science/paper/P7LAIIY4"},"agent_actions":{"view_html":"https://pith.science/pith/P7LAIIY42WAVYBCWSDN2Z43GTG","download_json":"https://pith.science/pith/P7LAIIY42WAVYBCWSDN2Z43GTG.json","view_paper":"https://pith.science/paper/P7LAIIY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09638&json=true","fetch_graph":"https://pith.science/api/pith-number/P7LAIIY42WAVYBCWSDN2Z43GTG/graph.json","fetch_events":"https://pith.science/api/pith-number/P7LAIIY42WAVYBCWSDN2Z43GTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7LAIIY42WAVYBCWSDN2Z43GTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7LAIIY42WAVYBCWSDN2Z43GTG/action/storage_attestation","attest_author":"https://pith.science/pith/P7LAIIY42WAVYBCWSDN2Z43GTG/action/author_attestation","sign_citation":"https://pith.science/pith/P7LAIIY42WAVYBCWSDN2Z43GTG/action/citation_signature","submit_replication":"https://pith.science/pith/P7LAIIY42WAVYBCWSDN2Z43GTG/action/replication_record"}},"created_at":"2026-05-18T00:31:56.760805+00:00","updated_at":"2026-05-18T00:31:56.760805+00:00"}