{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Z52VYYCLD5EXYHFHEHA74TO5JW","short_pith_number":"pith:Z52VYYCL","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"},"canonical_sha256":"cf755c604b1f497c1ca721c1fe4ddd4d94c359c2ef655f86c6ad9a47616c74b6","source":{"kind":"arxiv","id":"1607.08547","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08547","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08547v1","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08547","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"pith_short_12","alias_value":"Z52VYYCLD5EX","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z52VYYCLD5EXYHFH","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z52VYYCL","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Z52VYYCLD5EXYHFHEHA74TO5JW","target":"record","payload":{"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"},"canonical_sha256":"cf755c604b1f497c1ca721c1fe4ddd4d94c359c2ef655f86c6ad9a47616c74b6","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"},"source_kind":"arxiv","source_id":"1607.08547","source_version":1,"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-18T01:10:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PG1uzlcfQMOWQs+E6xpbKkcE515357sN2/MR+j+4h7ML6kFWwskHGfT7HVod2/1JjY/BdLxF8IZHbU7g2/GGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:55:54.934548Z"},"content_sha256":"a0b84871cd8e2cd1cdcbb04a59a09d5fe2bc584ac43bcea12250b56b6098b26c","schema_version":"1.0","event_id":"sha256:a0b84871cd8e2cd1cdcbb04a59a09d5fe2bc584ac43bcea12250b56b6098b26c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Z52VYYCLD5EXYHFHEHA74TO5JW","target":"graph","payload":{"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"},"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-18T01:10:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOGpaNi7Vv5oyyN+d41kzXN9G7aTieHtY5enKtOUwVsHw4+Ezf/nPHdvonEmcfXl7abaxWlOTpVQwHZGcAJ2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:55:54.934887Z"},"content_sha256":"ed04146d9067f36d5166dca8dd274c58f920393db0c83e41b0b5f1dfd4d935c9","schema_version":"1.0","event_id":"sha256:ed04146d9067f36d5166dca8dd274c58f920393db0c83e41b0b5f1dfd4d935c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/bundle.json","state_url":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/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-06-03T22:55:54Z","links":{"resolver":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW","bundle":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/bundle.json","state":"https://pith.science/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z52VYYCLD5EXYHFHEHA74TO5JW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z52VYYCLD5EXYHFHEHA74TO5JW","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":"c42cc954fda21b84a5a5b0e729c732d511aee5c040d47221f3d8775808d7455c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-28T17:51:53Z","title_canon_sha256":"03343444b248a140e9ff51db6a197d48ca3b6c3e24cc24581246460303c35858"},"schema_version":"1.0","source":{"id":"1607.08547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08547","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08547v1","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08547","created_at":"2026-05-18T01:10:18Z"},{"alias_kind":"pith_short_12","alias_value":"Z52VYYCLD5EX","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z52VYYCLD5EXYHFH","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z52VYYCL","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:ed04146d9067f36d5166dca8dd274c58f920393db0c83e41b0b5f1dfd4d935c9","target":"graph","created_at":"2026-05-18T01:10:18Z","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 (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}.","authors_text":"Abhishek Agarwal, Arya Mazumdar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-28T17:51:53Z","title":"Bounds on the Rate of Linear Locally Repairable Codes over Small Alphabets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08547","kind":"arxiv","version":1},"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:a0b84871cd8e2cd1cdcbb04a59a09d5fe2bc584ac43bcea12250b56b6098b26c","target":"record","created_at":"2026-05-18T01:10:18Z","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":"c42cc954fda21b84a5a5b0e729c732d511aee5c040d47221f3d8775808d7455c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-28T17:51:53Z","title_canon_sha256":"03343444b248a140e9ff51db6a197d48ca3b6c3e24cc24581246460303c35858"},"schema_version":"1.0","source":{"id":"1607.08547","kind":"arxiv","version":1}},"canonical_sha256":"cf755c604b1f497c1ca721c1fe4ddd4d94c359c2ef655f86c6ad9a47616c74b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf755c604b1f497c1ca721c1fe4ddd4d94c359c2ef655f86c6ad9a47616c74b6","first_computed_at":"2026-05-18T01:10:18.918171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:18.918171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W6vXYnTNkDtPQe3Rh11DrWiKNj5r2EwlGNWHOrg7ChxtRab4S0EnxW8ybDI/P0Sp94kQPu3UfVTcFj4vHs3VAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:18.918824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0b84871cd8e2cd1cdcbb04a59a09d5fe2bc584ac43bcea12250b56b6098b26c","sha256:ed04146d9067f36d5166dca8dd274c58f920393db0c83e41b0b5f1dfd4d935c9"],"state_sha256":"e3aca330115d47c7dea6fe65d97e08392d392f13bb70d68307a9bd8cbac455ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTy+l5rE7CdpF6Yk3gMb5uwS4isEg/iu19pxlUr47DKAseZRvqjM5JjVwRcMDz+5tZ3z9mvHNLPxwZHhDmnICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:55:54.936713Z","bundle_sha256":"9a3a36196187365e35c5a49ddd0d925037d354bab78b1badc0c684b3c6992fe1"}}