{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GY5RP6STDBZVHQAAUMLSEULOYM","short_pith_number":"pith:GY5RP6ST","schema_version":"1.0","canonical_sha256":"363b17fa53187353c000a31722516ec310309944ce7bd3f7293e8def07bbebb7","source":{"kind":"arxiv","id":"1510.08535","version":1},"attestation_state":"computed","paper":{"title":"On the Covering Radius of the Second Order Reed-Muller Code of Length 128","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qichun Wang","submitted_at":"2015-10-29T01:21:55Z","abstract_excerpt":"In 1981, Schatz proved that the covering radius of the binary Reed-Muller code $RM(2,6)$ is 18. For $RM(2,7)$, we only know that its covering radius is between 40 and 44. In this paper, we prove that the covering radius of the binary Reed-Muller code $RM(2,7)$ is at most 42. Moreover, we give a sufficient and necessary condition for Boolean functions of 7-variable to achieve the second-order nonlinearity 42."},"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":"1510.08535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-29T01:21:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"adaa0ff2baa999646649bb93786a1abad7beda64b5dd7ee55fad104214ee0fc7","abstract_canon_sha256":"061077f339820df4f63892d9d2dd3852c31f5ce2bfc4fc890089c61ac95536f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:28.613550Z","signature_b64":"F9b1oDH1c7r9yBLl2QqjenJlR73bzgP37GOdbhXRpxxSdxIYaEEhMGH3zRCrjt3P/5IQNKrI5JMH/jqiSvGFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"363b17fa53187353c000a31722516ec310309944ce7bd3f7293e8def07bbebb7","last_reissued_at":"2026-05-18T01:28:28.612857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:28.612857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Covering Radius of the Second Order Reed-Muller Code of Length 128","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qichun Wang","submitted_at":"2015-10-29T01:21:55Z","abstract_excerpt":"In 1981, Schatz proved that the covering radius of the binary Reed-Muller code $RM(2,6)$ is 18. For $RM(2,7)$, we only know that its covering radius is between 40 and 44. In this paper, we prove that the covering radius of the binary Reed-Muller code $RM(2,7)$ is at most 42. Moreover, we give a sufficient and necessary condition for Boolean functions of 7-variable to achieve the second-order nonlinearity 42."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08535","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":"1510.08535","created_at":"2026-05-18T01:28:28.612961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08535v1","created_at":"2026-05-18T01:28:28.612961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08535","created_at":"2026-05-18T01:28:28.612961+00:00"},{"alias_kind":"pith_short_12","alias_value":"GY5RP6STDBZV","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GY5RP6STDBZVHQAA","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GY5RP6ST","created_at":"2026-05-18T12:29:22.688609+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/GY5RP6STDBZVHQAAUMLSEULOYM","json":"https://pith.science/pith/GY5RP6STDBZVHQAAUMLSEULOYM.json","graph_json":"https://pith.science/api/pith-number/GY5RP6STDBZVHQAAUMLSEULOYM/graph.json","events_json":"https://pith.science/api/pith-number/GY5RP6STDBZVHQAAUMLSEULOYM/events.json","paper":"https://pith.science/paper/GY5RP6ST"},"agent_actions":{"view_html":"https://pith.science/pith/GY5RP6STDBZVHQAAUMLSEULOYM","download_json":"https://pith.science/pith/GY5RP6STDBZVHQAAUMLSEULOYM.json","view_paper":"https://pith.science/paper/GY5RP6ST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08535&json=true","fetch_graph":"https://pith.science/api/pith-number/GY5RP6STDBZVHQAAUMLSEULOYM/graph.json","fetch_events":"https://pith.science/api/pith-number/GY5RP6STDBZVHQAAUMLSEULOYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GY5RP6STDBZVHQAAUMLSEULOYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GY5RP6STDBZVHQAAUMLSEULOYM/action/storage_attestation","attest_author":"https://pith.science/pith/GY5RP6STDBZVHQAAUMLSEULOYM/action/author_attestation","sign_citation":"https://pith.science/pith/GY5RP6STDBZVHQAAUMLSEULOYM/action/citation_signature","submit_replication":"https://pith.science/pith/GY5RP6STDBZVHQAAUMLSEULOYM/action/replication_record"}},"created_at":"2026-05-18T01:28:28.612961+00:00","updated_at":"2026-05-18T01:28:28.612961+00:00"}