{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:K5U4UHECOLANBRPPRDBKSYLJOS","short_pith_number":"pith:K5U4UHEC","canonical_record":{"source":{"id":"1409.0952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-03T05:21:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59b7bbc55788f62da574afcb2042012ffc1eca76bed83b40d1d37f6e39bd3d4e","abstract_canon_sha256":"431f174cccf101929e9ddcb7d0e8cfd4536bb9710032a334d0b4273418f9e49d"},"schema_version":"1.0"},"canonical_sha256":"5769ca1c8272c0d0c5ef88c2a96169748205a0eb6fde5a264eb8873599daebc3","source":{"kind":"arxiv","id":"1409.0952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0952","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0952v1","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0952","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"K5U4UHECOLAN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"K5U4UHECOLANBRPP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"K5U4UHEC","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:K5U4UHECOLANBRPPRDBKSYLJOS","target":"record","payload":{"canonical_record":{"source":{"id":"1409.0952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-03T05:21:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"59b7bbc55788f62da574afcb2042012ffc1eca76bed83b40d1d37f6e39bd3d4e","abstract_canon_sha256":"431f174cccf101929e9ddcb7d0e8cfd4536bb9710032a334d0b4273418f9e49d"},"schema_version":"1.0"},"canonical_sha256":"5769ca1c8272c0d0c5ef88c2a96169748205a0eb6fde5a264eb8873599daebc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:44.697290Z","signature_b64":"sg2A8R5Zj4r2mtYLkZSQDazXJNIYxzCBxDR+6dHx0rvjkXL50Spp68mxrKs4RdL56xtiJ0wPXbVhU8PVqYYODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5769ca1c8272c0d0c5ef88c2a96169748205a0eb6fde5a264eb8873599daebc3","last_reissued_at":"2026-05-18T02:43:44.696885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:44.696885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.0952","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-18T02:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFKTTmqFHsgyMsLhgGEyF9taGMsoQd5p39UrSbwhfaqZBkWSSNoYF1Hu/cH4HN8vIbkAD1a1jW8fPDYW4bxfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:36:46.580572Z"},"content_sha256":"583537a887c9a0f41dc44790d565c0750a727b7072362f95b461b1bed5f27314","schema_version":"1.0","event_id":"sha256:583537a887c9a0f41dc44790d565c0750a727b7072362f95b461b1bed5f27314"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:K5U4UHECOLANBRPPRDBKSYLJOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Integer Programming Based Bound for Locally Repairable Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anyu Wang, Zhifang Zhang","submitted_at":"2014-09-03T05:21:35Z","abstract_excerpt":"The locally repairable code (LRC) studied in this paper is an $[n,k]$ linear code of which the value at each coordinate can be recovered by a linear combination of at most $r$ other coordinates. The central problem in this work is to determine the largest possible minimum distance for LRCs. First, an integer programming based upper bound is derived for any LRC. Then by solving the programming problem under certain conditions, an explicit upper bound is obtained for LRCs with parameters $n_1>n_2$, where $n_1 = \\left\\lceil \\frac{n}{r+1} \\right\\rceil$ and $n_2 = n_1 (r+1) - n$. Finally, an explic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0952","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-18T02:43:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrE0kFi57UC2mV+M5rB4h3MOQCj3fGJtCA64NSVs2N9WHvhVgl5Ouv0V9Sm4vFxO6pddTgLujtiExqO/HpIpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:36:46.580911Z"},"content_sha256":"9621f5510f0a489563328bafc988d96f34ff864e5d0a94d0dba866ed25bee3bc","schema_version":"1.0","event_id":"sha256:9621f5510f0a489563328bafc988d96f34ff864e5d0a94d0dba866ed25bee3bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5U4UHECOLANBRPPRDBKSYLJOS/bundle.json","state_url":"https://pith.science/pith/K5U4UHECOLANBRPPRDBKSYLJOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5U4UHECOLANBRPPRDBKSYLJOS/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-10T20:36:46Z","links":{"resolver":"https://pith.science/pith/K5U4UHECOLANBRPPRDBKSYLJOS","bundle":"https://pith.science/pith/K5U4UHECOLANBRPPRDBKSYLJOS/bundle.json","state":"https://pith.science/pith/K5U4UHECOLANBRPPRDBKSYLJOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5U4UHECOLANBRPPRDBKSYLJOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:K5U4UHECOLANBRPPRDBKSYLJOS","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":"431f174cccf101929e9ddcb7d0e8cfd4536bb9710032a334d0b4273418f9e49d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-03T05:21:35Z","title_canon_sha256":"59b7bbc55788f62da574afcb2042012ffc1eca76bed83b40d1d37f6e39bd3d4e"},"schema_version":"1.0","source":{"id":"1409.0952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0952","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0952v1","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0952","created_at":"2026-05-18T02:43:44Z"},{"alias_kind":"pith_short_12","alias_value":"K5U4UHECOLAN","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"K5U4UHECOLANBRPP","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"K5U4UHEC","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:9621f5510f0a489563328bafc988d96f34ff864e5d0a94d0dba866ed25bee3bc","target":"graph","created_at":"2026-05-18T02:43:44Z","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":"The locally repairable code (LRC) studied in this paper is an $[n,k]$ linear code of which the value at each coordinate can be recovered by a linear combination of at most $r$ other coordinates. The central problem in this work is to determine the largest possible minimum distance for LRCs. First, an integer programming based upper bound is derived for any LRC. Then by solving the programming problem under certain conditions, an explicit upper bound is obtained for LRCs with parameters $n_1>n_2$, where $n_1 = \\left\\lceil \\frac{n}{r+1} \\right\\rceil$ and $n_2 = n_1 (r+1) - n$. Finally, an explic","authors_text":"Anyu Wang, Zhifang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-03T05:21:35Z","title":"An Integer Programming Based Bound for Locally Repairable Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0952","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:583537a887c9a0f41dc44790d565c0750a727b7072362f95b461b1bed5f27314","target":"record","created_at":"2026-05-18T02:43:44Z","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":"431f174cccf101929e9ddcb7d0e8cfd4536bb9710032a334d0b4273418f9e49d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-03T05:21:35Z","title_canon_sha256":"59b7bbc55788f62da574afcb2042012ffc1eca76bed83b40d1d37f6e39bd3d4e"},"schema_version":"1.0","source":{"id":"1409.0952","kind":"arxiv","version":1}},"canonical_sha256":"5769ca1c8272c0d0c5ef88c2a96169748205a0eb6fde5a264eb8873599daebc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5769ca1c8272c0d0c5ef88c2a96169748205a0eb6fde5a264eb8873599daebc3","first_computed_at":"2026-05-18T02:43:44.696885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:44.696885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sg2A8R5Zj4r2mtYLkZSQDazXJNIYxzCBxDR+6dHx0rvjkXL50Spp68mxrKs4RdL56xtiJ0wPXbVhU8PVqYYODg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:44.697290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:583537a887c9a0f41dc44790d565c0750a727b7072362f95b461b1bed5f27314","sha256:9621f5510f0a489563328bafc988d96f34ff864e5d0a94d0dba866ed25bee3bc"],"state_sha256":"b88dc12e55e8f54134ee90affc0b62fc541f3ddef909f206367c057fce647f4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9pOy/U4ODtNtH/a8RDjmYGJMWNt/wkQ5iCa4dBf2+y01EMbFnCQSR7tZzu/CjC3HDuJTc8d8MTT7MIFk19RAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:36:46.585366Z","bundle_sha256":"90b0bc786a719e431545d21c05abdceb2d5b1a13e9a60f587bdfccc7d8642413"}}