{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZSW6VT4VF6GGVJUKNKKMIUJNQ4","short_pith_number":"pith:ZSW6VT4V","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"},"canonical_sha256":"ccadeacf952f8c6aa68a6a94c4512d873441ce53a3d82e084a15f236127e24f6","source":{"kind":"arxiv","id":"1702.02671","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02671","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02671v1","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02671","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZSW6VT4VF6GG","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSW6VT4VF6GGVJUK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSW6VT4V","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZSW6VT4VF6GGVJUKNKKMIUJNQ4","target":"record","payload":{"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"},"canonical_sha256":"ccadeacf952f8c6aa68a6a94c4512d873441ce53a3d82e084a15f236127e24f6","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"},"source_kind":"arxiv","source_id":"1702.02671","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-18T00:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4VsxFrWvCnygBr1yIRKkHRszhcxqzKwAwHit0VsDK2PJT8lrHYtzP+PH2FTUr+dw3T3B0CGGNmPrkiVFN6FTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:35:23.638076Z"},"content_sha256":"501072aa7bf92e891638b70a0378d5248777ae0d40c402c38b71cbc9519b0e96","schema_version":"1.0","event_id":"sha256:501072aa7bf92e891638b70a0378d5248777ae0d40c402c38b71cbc9519b0e96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZSW6VT4VF6GGVJUKNKKMIUJNQ4","target":"graph","payload":{"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"},"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:51:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxa7NE8vc0j7XTngbRUqyRR3KFvsWQ98Majk199qVIF7nkY9qZ4wueQPTSVx/tWn3dF7E2PABocb8kVV9HS7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:35:23.638442Z"},"content_sha256":"c7c31520ecb22a43ead9ce20703a4b5427bd53c6f5f21ef0b97e9e1f317a403b","schema_version":"1.0","event_id":"sha256:c7c31520ecb22a43ead9ce20703a4b5427bd53c6f5f21ef0b97e9e1f317a403b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/bundle.json","state_url":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/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-12T09:35:23Z","links":{"resolver":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4","bundle":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/bundle.json","state":"https://pith.science/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSW6VT4VF6GGVJUKNKKMIUJNQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZSW6VT4VF6GGVJUKNKKMIUJNQ4","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":"e392162161a5b2d87641dbd86b61136661d9476edddd46b0c3e845f7841980ae","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2017-02-09T01:32:26Z","title_canon_sha256":"e6999f53689d608f7914e698a5f44e01becf855fc339448123df868109428d66"},"schema_version":"1.0","source":{"id":"1702.02671","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02671","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02671v1","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02671","created_at":"2026-05-18T00:51:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZSW6VT4VF6GG","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSW6VT4VF6GGVJUK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSW6VT4V","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:c7c31520ecb22a43ead9ce20703a4b5427bd53c6f5f21ef0b97e9e1f317a403b","target":"graph","created_at":"2026-05-18T00:51:03Z","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":"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","authors_text":"Sian-Jheng Lin","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2017-02-09T01:32:26Z","title":"On the Local Correctabilities of Projective Reed-Muller Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02671","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:501072aa7bf92e891638b70a0378d5248777ae0d40c402c38b71cbc9519b0e96","target":"record","created_at":"2026-05-18T00:51:03Z","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":"e392162161a5b2d87641dbd86b61136661d9476edddd46b0c3e845f7841980ae","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2017-02-09T01:32:26Z","title_canon_sha256":"e6999f53689d608f7914e698a5f44e01becf855fc339448123df868109428d66"},"schema_version":"1.0","source":{"id":"1702.02671","kind":"arxiv","version":1}},"canonical_sha256":"ccadeacf952f8c6aa68a6a94c4512d873441ce53a3d82e084a15f236127e24f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccadeacf952f8c6aa68a6a94c4512d873441ce53a3d82e084a15f236127e24f6","first_computed_at":"2026-05-18T00:51:03.743907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:03.743907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CenQr824QXN/Z3WSG4tUh9+6JhnpCFfuyCfnVWwae0jeU9CHw/+z4UgcxTYDZys4Yro97hicVWkM0x5fMDMqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:03.744362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02671","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:501072aa7bf92e891638b70a0378d5248777ae0d40c402c38b71cbc9519b0e96","sha256:c7c31520ecb22a43ead9ce20703a4b5427bd53c6f5f21ef0b97e9e1f317a403b"],"state_sha256":"779982c7038d6da57dd35511ce1dc84a388190d2790364b188fd73883eaa94ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/aBtJXODqXlquapkX9K1kx/SvZy9dAO7gXDH1/O/e9dMLlb3ymiBvIYHZBVhDxEFIRjJ+fzTVTbCPaXRdpUAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:35:23.647225Z","bundle_sha256":"84974520846aad6f57618f47553899fe57a9083550d8666fd5612c40f097fd84"}}