{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZSW6VT4VF6GGVJUKNKKMIUJNQ4","short_pith_number":"pith:ZSW6VT4V","schema_version":"1.0","canonical_sha256":"ccadeacf952f8c6aa68a6a94c4512d873441ce53a3d82e084a15f236127e24f6","source":{"kind":"arxiv","id":"1702.02671","version":1},"attestation_state":"computed","paper":{"title":"On the Local Correctabilities of Projective Reed-Muller Codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sian-Jheng Lin","submitted_at":"2017-02-09T01:32:26Z","abstract_excerpt":"In this paper, we show that the projective Reed-Muller~(PRM) codes form a family of locally correctable codes~(LCC) in the regime of low query complexities. A PRM code is specified by the alphabet size $q$, the number of variables $m$, and the degree $d$. When $d\\leq q-1$, we present a perfectly smooth local decoder to recover a symbol by accessing $\\gamma\\leq q$ symbols to the coordinates fall on a line. There are three major parameters considered in LCCs, namely the query complexity, the message length and the code length. This paper shows that PRM codes are shorter than generalized Reed-Mul"},"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":"1702.02671","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2017-02-09T01:32:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e6999f53689d608f7914e698a5f44e01becf855fc339448123df868109428d66","abstract_canon_sha256":"e392162161a5b2d87641dbd86b61136661d9476edddd46b0c3e845f7841980ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:03.744362Z","signature_b64":"CenQr824QXN/Z3WSG4tUh9+6JhnpCFfuyCfnVWwae0jeU9CHw/+z4UgcxTYDZys4Yro97hicVWkM0x5fMDMqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccadeacf952f8c6aa68a6a94c4512d873441ce53a3d82e084a15f236127e24f6","last_reissued_at":"2026-05-18T00:51:03.743907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:03.743907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Local Correctabilities of Projective Reed-Muller Codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Sian-Jheng Lin","submitted_at":"2017-02-09T01:32:26Z","abstract_excerpt":"In this paper, we show that the projective Reed-Muller~(PRM) codes form a family of locally correctable codes~(LCC) in the regime of low query complexities. A PRM code is specified by the alphabet size $q$, the number of variables $m$, and the degree $d$. When $d\\leq q-1$, we present a perfectly smooth local decoder to recover a symbol by accessing $\\gamma\\leq q$ symbols to the coordinates fall on a line. There are three major parameters considered in LCCs, namely the query complexity, the message length and the code length. This paper shows that PRM codes are shorter than generalized Reed-Mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02671","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":"1702.02671","created_at":"2026-05-18T00:51:03.743974+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02671v1","created_at":"2026-05-18T00:51:03.743974+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02671","created_at":"2026-05-18T00:51:03.743974+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSW6VT4VF6GG","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSW6VT4VF6GGVJUK","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSW6VT4V","created_at":"2026-05-18T12:31:59.375834+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/ZSW6VT4VF6GGVJUKNKKMIUJNQ4","json":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4.json","graph_json":"https://pith.science/api/pith-number/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/graph.json","events_json":"https://pith.science/api/pith-number/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/events.json","paper":"https://pith.science/paper/ZSW6VT4V"},"agent_actions":{"view_html":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4","download_json":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4.json","view_paper":"https://pith.science/paper/ZSW6VT4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02671&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/action/storage_attestation","attest_author":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/action/author_attestation","sign_citation":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/action/citation_signature","submit_replication":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/action/replication_record"}},"created_at":"2026-05-18T00:51:03.743974+00:00","updated_at":"2026-05-18T00:51:03.743974+00:00"}