{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FFFQNZR2BTVJ2CPH337D5PNC6Z","short_pith_number":"pith:FFFQNZR2","canonical_record":{"source":{"id":"1507.01653","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-07-07T01:31:02Z","cross_cats_sorted":[],"title_canon_sha256":"00782f7cbdb7934649607f171f4ec1b497045d61519ec5949a740a04184e4698","abstract_canon_sha256":"3dc1aa1407a25ca5e63dcc469ee322d59ee084f3c68abd4e131fccdd8d254ee8"},"schema_version":"1.0"},"canonical_sha256":"294b06e63a0cea9d09e7defe3ebda2f667f8b87662b7585195c428384ad5ef13","source":{"kind":"arxiv","id":"1507.01653","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01653","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01653v4","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01653","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"FFFQNZR2BTVJ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FFFQNZR2BTVJ2CPH","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FFFQNZR2","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FFFQNZR2BTVJ2CPH337D5PNC6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01653","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-07-07T01:31:02Z","cross_cats_sorted":[],"title_canon_sha256":"00782f7cbdb7934649607f171f4ec1b497045d61519ec5949a740a04184e4698","abstract_canon_sha256":"3dc1aa1407a25ca5e63dcc469ee322d59ee084f3c68abd4e131fccdd8d254ee8"},"schema_version":"1.0"},"canonical_sha256":"294b06e63a0cea9d09e7defe3ebda2f667f8b87662b7585195c428384ad5ef13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:00.669619Z","signature_b64":"5EmgmJK1/PRr/ktmj+2v1Xpfy71TuqLZm5ODhoEZzlL+CG+LtPTsxaLTLtV8y7FlfaqKDn2ePCOXx2vGkmyTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"294b06e63a0cea9d09e7defe3ebda2f667f8b87662b7585195c428384ad5ef13","last_reissued_at":"2026-05-18T01:17:00.669074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:00.669074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01653","source_version":4,"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:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0SJdyaI5EU4b0m3ZEpXqPzOExumNFmFIIegtC80J3L+d54jLnbGgC6ns8jHMMnhNsDPEAzrj6+uwbPd+cUdDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:00:09.013289Z"},"content_sha256":"12e65a62b12b4bdfb1eeff48a643bf1b30bebda07a66bd804fe2633b3f99f445","schema_version":"1.0","event_id":"sha256:12e65a62b12b4bdfb1eeff48a643bf1b30bebda07a66bd804fe2633b3f99f445"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FFFQNZR2BTVJ2CPH337D5PNC6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Holes in Reed-Solomon Codes Based on Dickson Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Daqing Wan, Matt Keti","submitted_at":"2015-07-07T01:31:02Z","abstract_excerpt":"For an $[n,k]$ Reed-Solomon code $\\mathcal{C}$, it can be shown that any received word $r$ lies a distance at most $n-k$ from $\\mathcal{C}$, denoted $d(r,\\mathcal{C})\\leq n-k$. Any word $r$ meeting the equality is called a deep hole. Guruswami and Vardy (2005) showed that for a specific class of codes, determining whether or not a word is a deep hole is NP-hard. They suggested passingly that it may be easier when the evaluation set of $\\mathcal{C}$ is large or structured. Following this idea, we study the case where the evaluation set is the image of a Dickson polynomial, whose values appear w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01653","kind":"arxiv","version":4},"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:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fodA76G7W2IYAd0hR5NuimbF0JWT3khQbykHx8DGNW3uJuK6ZQf0ZcrR70nfsCtSwXsaxAbJ3N86b/7JQ4PuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:00:09.013657Z"},"content_sha256":"5f1fb26e5f2f8d0a1ac48e8b0358d21f2b56e4d7c93df05c39057dae7e63dfa1","schema_version":"1.0","event_id":"sha256:5f1fb26e5f2f8d0a1ac48e8b0358d21f2b56e4d7c93df05c39057dae7e63dfa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFFQNZR2BTVJ2CPH337D5PNC6Z/bundle.json","state_url":"https://pith.science/pith/FFFQNZR2BTVJ2CPH337D5PNC6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFFQNZR2BTVJ2CPH337D5PNC6Z/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-03T05:00:09Z","links":{"resolver":"https://pith.science/pith/FFFQNZR2BTVJ2CPH337D5PNC6Z","bundle":"https://pith.science/pith/FFFQNZR2BTVJ2CPH337D5PNC6Z/bundle.json","state":"https://pith.science/pith/FFFQNZR2BTVJ2CPH337D5PNC6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFFQNZR2BTVJ2CPH337D5PNC6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FFFQNZR2BTVJ2CPH337D5PNC6Z","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":"3dc1aa1407a25ca5e63dcc469ee322d59ee084f3c68abd4e131fccdd8d254ee8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-07-07T01:31:02Z","title_canon_sha256":"00782f7cbdb7934649607f171f4ec1b497045d61519ec5949a740a04184e4698"},"schema_version":"1.0","source":{"id":"1507.01653","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01653","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01653v4","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01653","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"FFFQNZR2BTVJ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FFFQNZR2BTVJ2CPH","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FFFQNZR2","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:5f1fb26e5f2f8d0a1ac48e8b0358d21f2b56e4d7c93df05c39057dae7e63dfa1","target":"graph","created_at":"2026-05-18T01:17:00Z","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":"For an $[n,k]$ Reed-Solomon code $\\mathcal{C}$, it can be shown that any received word $r$ lies a distance at most $n-k$ from $\\mathcal{C}$, denoted $d(r,\\mathcal{C})\\leq n-k$. Any word $r$ meeting the equality is called a deep hole. Guruswami and Vardy (2005) showed that for a specific class of codes, determining whether or not a word is a deep hole is NP-hard. They suggested passingly that it may be easier when the evaluation set of $\\mathcal{C}$ is large or structured. Following this idea, we study the case where the evaluation set is the image of a Dickson polynomial, whose values appear w","authors_text":"Daqing Wan, Matt Keti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-07-07T01:31:02Z","title":"Deep Holes in Reed-Solomon Codes Based on Dickson Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01653","kind":"arxiv","version":4},"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:12e65a62b12b4bdfb1eeff48a643bf1b30bebda07a66bd804fe2633b3f99f445","target":"record","created_at":"2026-05-18T01:17:00Z","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":"3dc1aa1407a25ca5e63dcc469ee322d59ee084f3c68abd4e131fccdd8d254ee8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-07-07T01:31:02Z","title_canon_sha256":"00782f7cbdb7934649607f171f4ec1b497045d61519ec5949a740a04184e4698"},"schema_version":"1.0","source":{"id":"1507.01653","kind":"arxiv","version":4}},"canonical_sha256":"294b06e63a0cea9d09e7defe3ebda2f667f8b87662b7585195c428384ad5ef13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"294b06e63a0cea9d09e7defe3ebda2f667f8b87662b7585195c428384ad5ef13","first_computed_at":"2026-05-18T01:17:00.669074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:00.669074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5EmgmJK1/PRr/ktmj+2v1Xpfy71TuqLZm5ODhoEZzlL+CG+LtPTsxaLTLtV8y7FlfaqKDn2ePCOXx2vGkmyTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:00.669619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01653","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12e65a62b12b4bdfb1eeff48a643bf1b30bebda07a66bd804fe2633b3f99f445","sha256:5f1fb26e5f2f8d0a1ac48e8b0358d21f2b56e4d7c93df05c39057dae7e63dfa1"],"state_sha256":"a5aa7c62505a8c879bd3c6356be8fe8d6b360afd75c98907e4e6cc56424fa908"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MzfecwAX7bROY84hEkEKgydgq1ivaDWBeiE9aTLxX9EsNYA9GUjsOZ0JF+edMkTwhJNZw+rJsHbnn5TapaXlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:00:09.015647Z","bundle_sha256":"9562696f4805e47aa92338f2662d2429856d9a98ab55cfd5a9adbce85de40572"}}