{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4MQRDDSJISCNAUIZBZ7G7ZU2B2","short_pith_number":"pith:4MQRDDSJ","schema_version":"1.0","canonical_sha256":"e321118e494484d051190e7e6fe69a0e8143ee0d3a8cdf44a36260aa464a2c9f","source":{"kind":"arxiv","id":"1404.2741","version":1},"attestation_state":"computed","paper":{"title":"Nonlinearity of Boolean functions: an algorithmic approach based on multivariate polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"E. Bellini, I. Simonetti, M. Sala","submitted_at":"2014-04-10T09:02:16Z","abstract_excerpt":"We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our rational algorithm, arriving at a worst-case complexity of $O(n2^n)$ operations over the integers, that is, sums and doublings. This way, with a different approach, we reach the same complexity of established algorithms, such as those based on the fast Walsh transform."},"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":"1404.2741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-10T09:02:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"554411468781124d6685a3b86b8613e92bfa098c040bb8cca3e194521cb26e61","abstract_canon_sha256":"e91d49089c819fa983a949407e232b2b17ab7e83b2cb7fa83540611efc516196"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:28.650022Z","signature_b64":"UYE2AfQTlwGMvOK2GiXbYa4/Y2TYCMCbQjjAATZMVPRmMSJ/1qR8wHrEa2nDMUdeg5EQRh2cqrPdxTCaFrYfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e321118e494484d051190e7e6fe69a0e8143ee0d3a8cdf44a36260aa464a2c9f","last_reissued_at":"2026-05-18T02:54:28.649387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:28.649387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonlinearity of Boolean functions: an algorithmic approach based on multivariate polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"E. Bellini, I. Simonetti, M. Sala","submitted_at":"2014-04-10T09:02:16Z","abstract_excerpt":"We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our rational algorithm, arriving at a worst-case complexity of $O(n2^n)$ operations over the integers, that is, sums and doublings. This way, with a different approach, we reach the same complexity of established algorithms, such as those based on the fast Walsh transform."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2741","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":"1404.2741","created_at":"2026-05-18T02:54:28.649474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.2741v1","created_at":"2026-05-18T02:54:28.649474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2741","created_at":"2026-05-18T02:54:28.649474+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MQRDDSJISCN","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MQRDDSJISCNAUIZ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MQRDDSJ","created_at":"2026-05-18T12:28:14.216126+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/4MQRDDSJISCNAUIZBZ7G7ZU2B2","json":"https://pith.science/pith/4MQRDDSJISCNAUIZBZ7G7ZU2B2.json","graph_json":"https://pith.science/api/pith-number/4MQRDDSJISCNAUIZBZ7G7ZU2B2/graph.json","events_json":"https://pith.science/api/pith-number/4MQRDDSJISCNAUIZBZ7G7ZU2B2/events.json","paper":"https://pith.science/paper/4MQRDDSJ"},"agent_actions":{"view_html":"https://pith.science/pith/4MQRDDSJISCNAUIZBZ7G7ZU2B2","download_json":"https://pith.science/pith/4MQRDDSJISCNAUIZBZ7G7ZU2B2.json","view_paper":"https://pith.science/paper/4MQRDDSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.2741&json=true","fetch_graph":"https://pith.science/api/pith-number/4MQRDDSJISCNAUIZBZ7G7ZU2B2/graph.json","fetch_events":"https://pith.science/api/pith-number/4MQRDDSJISCNAUIZBZ7G7ZU2B2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MQRDDSJISCNAUIZBZ7G7ZU2B2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MQRDDSJISCNAUIZBZ7G7ZU2B2/action/storage_attestation","attest_author":"https://pith.science/pith/4MQRDDSJISCNAUIZBZ7G7ZU2B2/action/author_attestation","sign_citation":"https://pith.science/pith/4MQRDDSJISCNAUIZBZ7G7ZU2B2/action/citation_signature","submit_replication":"https://pith.science/pith/4MQRDDSJISCNAUIZBZ7G7ZU2B2/action/replication_record"}},"created_at":"2026-05-18T02:54:28.649474+00:00","updated_at":"2026-05-18T02:54:28.649474+00:00"}