{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FTPAOEY2IRNNCWHZMFI2JRKBX2","short_pith_number":"pith:FTPAOEY2","canonical_record":{"source":{"id":"1712.03744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-11T12:24:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"54dbb333b14fe707f0e4767a52d93fd9073c6c874f5824a0af860aeefa8b4559","abstract_canon_sha256":"2968e2dbf5d86841925a2e514e26cf220f5d9822984d2c6576adb6bbdca73084"},"schema_version":"1.0"},"canonical_sha256":"2cde07131a445ad158f96151a4c541bea050e4c0b4674694318efd0940e5d1e9","source":{"kind":"arxiv","id":"1712.03744","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03744","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03744v2","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03744","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"FTPAOEY2IRNN","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FTPAOEY2IRNNCWHZ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FTPAOEY2","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FTPAOEY2IRNNCWHZMFI2JRKBX2","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03744","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-11T12:24:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"54dbb333b14fe707f0e4767a52d93fd9073c6c874f5824a0af860aeefa8b4559","abstract_canon_sha256":"2968e2dbf5d86841925a2e514e26cf220f5d9822984d2c6576adb6bbdca73084"},"schema_version":"1.0"},"canonical_sha256":"2cde07131a445ad158f96151a4c541bea050e4c0b4674694318efd0940e5d1e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:04.290065Z","signature_b64":"nhygAVksmTW5OCnE42/GvzNZTOu5mvcw8gRXqIHM54cpzlY/URV7KXI+MbeWp6qaWrekktWNUHrKJks69pLpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cde07131a445ad158f96151a4c541bea050e4c0b4674694318efd0940e5d1e9","last_reissued_at":"2026-05-18T00:28:04.289348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:04.289348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03744","source_version":2,"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-18T00:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m8oryY586fuSlPUYSFWOk3IcBMUT+OxF0wdtnchbVjcJie+2Eu1el00jWe9A2b1N5iN+m7g/GNiWbNsYuSbJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:18:40.523112Z"},"content_sha256":"a9d2c9afeff3805ce29237cf54c0237bf1015e6077ff81e8c72da1f1bc983ef7","schema_version":"1.0","event_id":"sha256:a9d2c9afeff3805ce29237cf54c0237bf1015e6077ff81e8c72da1f1bc983ef7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FTPAOEY2IRNNCWHZMFI2JRKBX2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal locally repairable codes via elliptic curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chaoping Xing, Liming Ma, Xudong Li","submitted_at":"2017-12-11T12:24:00Z","abstract_excerpt":"Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg \\cite{TB14} first gave a breakthrough result in this topic by cleverly considering subcodes of Reed-Solomon codes. Thus, $q$-ary optimal locally repairable codes from subcodes of Reed-Solomon codes given in \\cite{TB14} have length upper bounded by $q$. Recently, it was shown through extension of construction in \\cite{TB14} that length of $q$-ary optimal locally repairable codes can be $q+1$ i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03744","kind":"arxiv","version":2},"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-18T00:28:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqpzuJWESw4sAbzo7Eht/Z+28KEBgyO/UApS9ASkOx1wQF/zfycKkFRYEgQR+NZ07sFGYlCVlQmmpWi2birLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:18:40.523801Z"},"content_sha256":"54321c49f871ab951c18907f59273717cebb6fcbd163fee9ce012dfe9e23d06e","schema_version":"1.0","event_id":"sha256:54321c49f871ab951c18907f59273717cebb6fcbd163fee9ce012dfe9e23d06e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTPAOEY2IRNNCWHZMFI2JRKBX2/bundle.json","state_url":"https://pith.science/pith/FTPAOEY2IRNNCWHZMFI2JRKBX2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTPAOEY2IRNNCWHZMFI2JRKBX2/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-07T17:18:40Z","links":{"resolver":"https://pith.science/pith/FTPAOEY2IRNNCWHZMFI2JRKBX2","bundle":"https://pith.science/pith/FTPAOEY2IRNNCWHZMFI2JRKBX2/bundle.json","state":"https://pith.science/pith/FTPAOEY2IRNNCWHZMFI2JRKBX2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTPAOEY2IRNNCWHZMFI2JRKBX2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FTPAOEY2IRNNCWHZMFI2JRKBX2","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":"2968e2dbf5d86841925a2e514e26cf220f5d9822984d2c6576adb6bbdca73084","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-11T12:24:00Z","title_canon_sha256":"54dbb333b14fe707f0e4767a52d93fd9073c6c874f5824a0af860aeefa8b4559"},"schema_version":"1.0","source":{"id":"1712.03744","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03744","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03744v2","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03744","created_at":"2026-05-18T00:28:04Z"},{"alias_kind":"pith_short_12","alias_value":"FTPAOEY2IRNN","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FTPAOEY2IRNNCWHZ","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FTPAOEY2","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:54321c49f871ab951c18907f59273717cebb6fcbd163fee9ce012dfe9e23d06e","target":"graph","created_at":"2026-05-18T00:28:04Z","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":"Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg \\cite{TB14} first gave a breakthrough result in this topic by cleverly considering subcodes of Reed-Solomon codes. Thus, $q$-ary optimal locally repairable codes from subcodes of Reed-Solomon codes given in \\cite{TB14} have length upper bounded by $q$. Recently, it was shown through extension of construction in \\cite{TB14} that length of $q$-ary optimal locally repairable codes can be $q+1$ i","authors_text":"Chaoping Xing, Liming Ma, Xudong Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-11T12:24:00Z","title":"Optimal locally repairable codes via elliptic curves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03744","kind":"arxiv","version":2},"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:a9d2c9afeff3805ce29237cf54c0237bf1015e6077ff81e8c72da1f1bc983ef7","target":"record","created_at":"2026-05-18T00:28:04Z","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":"2968e2dbf5d86841925a2e514e26cf220f5d9822984d2c6576adb6bbdca73084","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-11T12:24:00Z","title_canon_sha256":"54dbb333b14fe707f0e4767a52d93fd9073c6c874f5824a0af860aeefa8b4559"},"schema_version":"1.0","source":{"id":"1712.03744","kind":"arxiv","version":2}},"canonical_sha256":"2cde07131a445ad158f96151a4c541bea050e4c0b4674694318efd0940e5d1e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cde07131a445ad158f96151a4c541bea050e4c0b4674694318efd0940e5d1e9","first_computed_at":"2026-05-18T00:28:04.289348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:04.289348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nhygAVksmTW5OCnE42/GvzNZTOu5mvcw8gRXqIHM54cpzlY/URV7KXI+MbeWp6qaWrekktWNUHrKJks69pLpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:04.290065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03744","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9d2c9afeff3805ce29237cf54c0237bf1015e6077ff81e8c72da1f1bc983ef7","sha256:54321c49f871ab951c18907f59273717cebb6fcbd163fee9ce012dfe9e23d06e"],"state_sha256":"1d5c203dc55b439fee1d13e51f62590b83f691aaeea801fcfb826ddd68525753"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ApdKdiCxRsl6OQmDDRhfuxCKLLwHXeypudAld9lu5KgzSZhp/Ha6i3XfSSOn2QlrbwsxdcjKCMWEWEyLH0nlBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:18:40.527377Z","bundle_sha256":"18ca52f819dd5fd783f2f24aa1e7a401c9e9d6b2f818f6f302d70413b9c537f6"}}