{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ADJKPKXUTGVNOEUA7HA7YFIN6O","short_pith_number":"pith:ADJKPKXU","schema_version":"1.0","canonical_sha256":"00d2a7aaf499aad71280f9c1fc150df38d3557d688e3342ee2ad19ea82c67a54","source":{"kind":"arxiv","id":"2605.14023","version":1},"attestation_state":"computed","paper":{"title":"Function-Correction with Optimal Data Protection for the General Hamming Code Membership","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Bent Boolean functions deliver optimal parity assignments for single-error-correcting function-correcting codes on the general Hamming code membership function when the length parameter is even.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adityawardhan Yadava, Anjana A. Mahesh, Swaraj Sharma Durgi","submitted_at":"2026-05-13T18:35:53Z","abstract_excerpt":"This paper investigates single-error-correcting function-correcting codes~(SEFCCs) for the $[2^n-1,\\,2^n-1-n,\\,3]$-Hamming code membership function~(HCMF) for general $n\\geq 2$. Necessary and sufficient conditions for valid parity assignments are established, and the distance-$3$ codeword graph is shown to induce a connected bipartite structure for all $n\\geq 2$, which is exploited to develop a systematic SEFCC construction achieving the largest possible minimum distance of~$2$. A novel framework is then developed that reduces the minimization of distance-$2$ codeword pairs to a max-cut proble"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.14023","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-13T18:35:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d64e8841c954cc03fe90bab0a9b6c04b424dba47d8ebb9bac443e4621b505df6","abstract_canon_sha256":"8233793005bdb79b35beaa0dcf8ace05f90e9a6e32ffe5a2aec1cb0d28fda4e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:12.921210Z","signature_b64":"hU/JsfViDVaHBDHPE4bvkSl7ZDxBOrn9olS2srspJQ3AMLhPHp+VJWgmGhUi4VvivKV7xPQBnNp0FMjkqCuhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00d2a7aaf499aad71280f9c1fc150df38d3557d688e3342ee2ad19ea82c67a54","last_reissued_at":"2026-05-17T23:39:12.920750Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:12.920750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Function-Correction with Optimal Data Protection for the General Hamming Code Membership","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Bent Boolean functions deliver optimal parity assignments for single-error-correcting function-correcting codes on the general Hamming code membership function when the length parameter is even.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adityawardhan Yadava, Anjana A. Mahesh, Swaraj Sharma Durgi","submitted_at":"2026-05-13T18:35:53Z","abstract_excerpt":"This paper investigates single-error-correcting function-correcting codes~(SEFCCs) for the $[2^n-1,\\,2^n-1-n,\\,3]$-Hamming code membership function~(HCMF) for general $n\\geq 2$. Necessary and sufficient conditions for valid parity assignments are established, and the distance-$3$ codeword graph is shown to induce a connected bipartite structure for all $n\\geq 2$, which is exploited to develop a systematic SEFCC construction achieving the largest possible minimum distance of~$2$. A novel framework is then developed that reduces the minimization of distance-$2$ codeword pairs to a max-cut proble"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Eigenvectors corresponding to the minimum eigenvalue of these graphs are shown to directly yield optimal parity assignments. We reduce the problem of finding these eigenvectors to an optimization problem involving moments of the Walsh coefficients of a related function, which we solve for even n by deriving a tight lower bound shown to be attained by bent functions, establishing a precise connection between optimal SEFCC design and bent Boolean functions.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The distance-3 codeword graph is shown to induce a connected bipartite structure for all n≥2, which is exploited to develop a systematic SEFCC construction achieving the largest possible minimum distance of 2.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A construction for optimal SEFCCs on the Hamming code membership function is given by reducing distance-2 pair minimization to a max-cut problem solved via eigenvectors of distance-4 graphs, with optimality for even n attained by bent functions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Bent Boolean functions deliver optimal parity assignments for single-error-correcting function-correcting codes on the general Hamming code membership function when the length parameter is even.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5993c674be0fa0a7e9b2b00bd264d1e4d5e9e1dab205cfd7e9b9c827112db36e"},"source":{"id":"2605.14023","kind":"arxiv","version":1},"verdict":{"id":"a60ee7c7-8011-4ee2-8168-6205709d02fc","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:11:06.020910Z","strongest_claim":"Eigenvectors corresponding to the minimum eigenvalue of these graphs are shown to directly yield optimal parity assignments. We reduce the problem of finding these eigenvectors to an optimization problem involving moments of the Walsh coefficients of a related function, which we solve for even n by deriving a tight lower bound shown to be attained by bent functions, establishing a precise connection between optimal SEFCC design and bent Boolean functions.","one_line_summary":"A construction for optimal SEFCCs on the Hamming code membership function is given by reducing distance-2 pair minimization to a max-cut problem solved via eigenvectors of distance-4 graphs, with optimality for even n attained by bent functions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The distance-3 codeword graph is shown to induce a connected bipartite structure for all n≥2, which is exploited to develop a systematic SEFCC construction achieving the largest possible minimum distance of 2.","pith_extraction_headline":"Bent Boolean functions deliver optimal parity assignments for single-error-correcting function-correcting codes on the general Hamming code membership function when the length parameter is even."},"references":{"count":14,"sample":[{"doi":"","year":2023,"title":"A. Lenz, R. Bitar, A. Wachter-Zeh, and E. Yaakobi, “Function-correcting codes,”IEEE Trans. Inf. Theory, vol. 69, no. 9, pp. 5604–5618, 2023","work_id":"f31bed34-56d7-4925-96e2-4735d6920d50","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Optimal redundancy of function-correcting codes","work_id":"f4a11a50-5985-4704-8339-10f3003db2f1","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"R. Premlal and B. S. Rajan, “On Function-Correcting Codes,” in IEEE Transactions on Information Theory, vol. 71, no. 8, pp. 5884-5897","work_id":"5c83c41f-5324-4ba3-abf6-6feb0ceb77dc","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Function-correcting codes for symbol-pair read channels,","work_id":"dd77c364-469b-4fcd-8b81-6d5aed2bac43","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Function-correcting codes forb-symbol read channels","work_id":"b86611a6-0981-4d7e-be88-8ac2a2308fda","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":14,"snapshot_sha256":"be72df832d67bc1e97a0ac10ddc2dff4372c99850528674d970dfe6e50035738","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"311482af43d1cc2de99c43d5bcb22ebed1825b7cebb81ec7ad6893584734536d"},"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":"2605.14023","created_at":"2026-05-17T23:39:12.920817+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14023v1","created_at":"2026-05-17T23:39:12.920817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14023","created_at":"2026-05-17T23:39:12.920817+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADJKPKXUTGVN","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADJKPKXUTGVNOEUA","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADJKPKXU","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ADJKPKXUTGVNOEUA7HA7YFIN6O","json":"https://pith.science/pith/ADJKPKXUTGVNOEUA7HA7YFIN6O.json","graph_json":"https://pith.science/api/pith-number/ADJKPKXUTGVNOEUA7HA7YFIN6O/graph.json","events_json":"https://pith.science/api/pith-number/ADJKPKXUTGVNOEUA7HA7YFIN6O/events.json","paper":"https://pith.science/paper/ADJKPKXU"},"agent_actions":{"view_html":"https://pith.science/pith/ADJKPKXUTGVNOEUA7HA7YFIN6O","download_json":"https://pith.science/pith/ADJKPKXUTGVNOEUA7HA7YFIN6O.json","view_paper":"https://pith.science/paper/ADJKPKXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14023&json=true","fetch_graph":"https://pith.science/api/pith-number/ADJKPKXUTGVNOEUA7HA7YFIN6O/graph.json","fetch_events":"https://pith.science/api/pith-number/ADJKPKXUTGVNOEUA7HA7YFIN6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADJKPKXUTGVNOEUA7HA7YFIN6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADJKPKXUTGVNOEUA7HA7YFIN6O/action/storage_attestation","attest_author":"https://pith.science/pith/ADJKPKXUTGVNOEUA7HA7YFIN6O/action/author_attestation","sign_citation":"https://pith.science/pith/ADJKPKXUTGVNOEUA7HA7YFIN6O/action/citation_signature","submit_replication":"https://pith.science/pith/ADJKPKXUTGVNOEUA7HA7YFIN6O/action/replication_record"}},"created_at":"2026-05-17T23:39:12.920817+00:00","updated_at":"2026-05-17T23:39:12.920817+00:00"}