{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Z52VYYCLD5EXYHFHEHA74TO5JW","short_pith_number":"pith:Z52VYYCL","schema_version":"1.0","canonical_sha256":"cf755c604b1f497c1ca721c1fe4ddd4d94c359c2ef655f86c6ad9a47616c74b6","source":{"kind":"arxiv","id":"1607.08547","version":1},"attestation_state":"computed","paper":{"title":"Bounds on the Rate of Linear Locally Repairable Codes over Small Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Agarwal, Arya Mazumdar","submitted_at":"2016-07-28T17:51:53Z","abstract_excerpt":"Locally repairable codes (LRC) have recently been a subject of intense research due to theoretical appeal and their application in distributed storage systems. In an LRC, any coordinate of a codeword can be recovered by accessing only few other coordinates. For LRCs over small alphabet (such as binary), the optimal rate-distance trade-off is unknown. In this paper we provide the tightest known upper bound on the rate of linear LRCs of a given relative distance, an improvement over any previous result, in particular \\cite{cadambe2013upper}."},"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":"1607.08547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-28T17:51:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"03343444b248a140e9ff51db6a197d48ca3b6c3e24cc24581246460303c35858","abstract_canon_sha256":"c42cc954fda21b84a5a5b0e729c732d511aee5c040d47221f3d8775808d7455c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:18.918824Z","signature_b64":"W6vXYnTNkDtPQe3Rh11DrWiKNj5r2EwlGNWHOrg7ChxtRab4S0EnxW8ybDI/P0Sp94kQPu3UfVTcFj4vHs3VAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf755c604b1f497c1ca721c1fe4ddd4d94c359c2ef655f86c6ad9a47616c74b6","last_reissued_at":"2026-05-18T01:10:18.918171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:18.918171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the Rate of Linear Locally Repairable Codes over Small Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abhishek Agarwal, Arya Mazumdar","submitted_at":"2016-07-28T17:51:53Z","abstract_excerpt":"Locally repairable codes (LRC) have recently been a subject of intense research due to theoretical appeal and their application in distributed storage systems. In an LRC, any coordinate of a codeword can be recovered by accessing only few other coordinates. For LRCs over small alphabet (such as binary), the optimal rate-distance trade-off is unknown. In this paper we provide the tightest known upper bound on the rate of linear LRCs of a given relative distance, an improvement over any previous result, in particular \\cite{cadambe2013upper}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08547","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":"1607.08547","created_at":"2026-05-18T01:10:18.918272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08547v1","created_at":"2026-05-18T01:10:18.918272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08547","created_at":"2026-05-18T01:10:18.918272+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z52VYYCLD5EX","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z52VYYCLD5EXYHFH","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z52VYYCL","created_at":"2026-05-18T12:30:53.716459+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/Z52VYYCLD5EXYHFHEHA74TO5JW","json":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW.json","graph_json":"https://pith.science/api/pith-number/Z52VYYCLD5EXYHFHEHA74TO5JW/graph.json","events_json":"https://pith.science/api/pith-number/Z52VYYCLD5EXYHFHEHA74TO5JW/events.json","paper":"https://pith.science/paper/Z52VYYCL"},"agent_actions":{"view_html":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW","download_json":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW.json","view_paper":"https://pith.science/paper/Z52VYYCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08547&json=true","fetch_graph":"https://pith.science/api/pith-number/Z52VYYCLD5EXYHFHEHA74TO5JW/graph.json","fetch_events":"https://pith.science/api/pith-number/Z52VYYCLD5EXYHFHEHA74TO5JW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/action/storage_attestation","attest_author":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/action/author_attestation","sign_citation":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/action/citation_signature","submit_replication":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/action/replication_record"}},"created_at":"2026-05-18T01:10:18.918272+00:00","updated_at":"2026-05-18T01:10:18.918272+00:00"}