{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SFU4EVDMLPCOTLF52KLLTJKCPJ","short_pith_number":"pith:SFU4EVDM","schema_version":"1.0","canonical_sha256":"9169c2546c5bc4e9acbdd296b9a5427a5b532f077cc083103c12683975fcb057","source":{"kind":"arxiv","id":"1512.04788","version":1},"attestation_state":"computed","paper":{"title":"Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Miriam Abdon, Robert Rolland","submitted_at":"2015-12-15T14:04:09Z","abstract_excerpt":"For any finite field ${\\mathbb F}_q$ with $q$ elements, we study the set ${\\mathcal F}_{(q,m)}$ of functions from ${\\mathbb F}_q^m$ into ${\\mathbb F}^q$. We introduce a transformation that allows us to determine a linear system of $q^{m+1}$ equations and $q^{m+1}$ unknowns, which has for solution the Hamming distances of a function in ${\\mathcal F}_{(q,m)}$ to all the affine functions."},"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":"1512.04788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-12-15T14:04:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"30aa7286b83f204601a5f952d5c32811d84fcef84f26d61f0ae71f4f596e782d","abstract_canon_sha256":"48a6f5cbf2d589bc0a3b19d7da12c2c581fe7df6ed8ac5da7482242c08e76821"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:15.504516Z","signature_b64":"uFe6Ms+PCbkTlmxOkfq3t0BoEiFwXkKgaH6lO6pMCLBRaVbYppvF89mc03hwunwNVpRca4LOMxCuSSqPcGZzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9169c2546c5bc4e9acbdd296b9a5427a5b532f077cc083103c12683975fcb057","last_reissued_at":"2026-05-18T01:24:15.503954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:15.503954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Miriam Abdon, Robert Rolland","submitted_at":"2015-12-15T14:04:09Z","abstract_excerpt":"For any finite field ${\\mathbb F}_q$ with $q$ elements, we study the set ${\\mathcal F}_{(q,m)}$ of functions from ${\\mathbb F}_q^m$ into ${\\mathbb F}^q$. We introduce a transformation that allows us to determine a linear system of $q^{m+1}$ equations and $q^{m+1}$ unknowns, which has for solution the Hamming distances of a function in ${\\mathcal F}_{(q,m)}$ to all the affine functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04788","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":"1512.04788","created_at":"2026-05-18T01:24:15.504050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.04788v1","created_at":"2026-05-18T01:24:15.504050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04788","created_at":"2026-05-18T01:24:15.504050+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFU4EVDMLPCO","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFU4EVDMLPCOTLF5","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFU4EVDM","created_at":"2026-05-18T12:29:39.896362+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/SFU4EVDMLPCOTLF52KLLTJKCPJ","json":"https://pith.science/pith/SFU4EVDMLPCOTLF52KLLTJKCPJ.json","graph_json":"https://pith.science/api/pith-number/SFU4EVDMLPCOTLF52KLLTJKCPJ/graph.json","events_json":"https://pith.science/api/pith-number/SFU4EVDMLPCOTLF52KLLTJKCPJ/events.json","paper":"https://pith.science/paper/SFU4EVDM"},"agent_actions":{"view_html":"https://pith.science/pith/SFU4EVDMLPCOTLF52KLLTJKCPJ","download_json":"https://pith.science/pith/SFU4EVDMLPCOTLF52KLLTJKCPJ.json","view_paper":"https://pith.science/paper/SFU4EVDM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.04788&json=true","fetch_graph":"https://pith.science/api/pith-number/SFU4EVDMLPCOTLF52KLLTJKCPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SFU4EVDMLPCOTLF52KLLTJKCPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFU4EVDMLPCOTLF52KLLTJKCPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFU4EVDMLPCOTLF52KLLTJKCPJ/action/storage_attestation","attest_author":"https://pith.science/pith/SFU4EVDMLPCOTLF52KLLTJKCPJ/action/author_attestation","sign_citation":"https://pith.science/pith/SFU4EVDMLPCOTLF52KLLTJKCPJ/action/citation_signature","submit_replication":"https://pith.science/pith/SFU4EVDMLPCOTLF52KLLTJKCPJ/action/replication_record"}},"created_at":"2026-05-18T01:24:15.504050+00:00","updated_at":"2026-05-18T01:24:15.504050+00:00"}