{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YWBAGDMRBIHBX7NSLKRMHCJ7RO","short_pith_number":"pith:YWBAGDMR","schema_version":"1.0","canonical_sha256":"c582030d910a0e1bfdb25aa2c3893f8b975bed6a52abf2763b89ff5b590eb4e3","source":{"kind":"arxiv","id":"1701.01663","version":1},"attestation_state":"computed","paper":{"title":"On the next-to-minimal weight of projective Reed-Muller codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"C\\'icero Carvalho, Victor G.L. Neumann","submitted_at":"2017-01-06T15:29:45Z","abstract_excerpt":"In this paper we present several values for the next-to-minimal weights of projective Reed-Muller codes. We work over $\\mathbb{F}_q$ with $q \\geq 3$ since in IEEE-IT 62(11) p. 6300-6303 (2016) we have determined the complete values for the next-to-minimal weights of binary projective Reed-Muller codes. As in loc. cit. here we also find examples of codewords with next-to-minimal weight whose set of zeros is not in a hyperplane arrangement."},"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":"1701.01663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-06T15:29:45Z","cross_cats_sorted":["math.AG","math.IT"],"title_canon_sha256":"b8b1f82a71c3d4dffdcb7791ebd8593488b24e3dc085e408dd5d5b9dc3c8e55c","abstract_canon_sha256":"8e583aa58414c9e560d7e4ef104acf95366e2f237491777f72bea6c41bb55fa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:29.375395Z","signature_b64":"oiYQUz9aWBJRsU70fAhTyliWZRTsxZvJIFAhFexvSPav1PDqspdelRz5KH6cJd9ooE1cphbZUzXobVQfAzzHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c582030d910a0e1bfdb25aa2c3893f8b975bed6a52abf2763b89ff5b590eb4e3","last_reissued_at":"2026-05-18T00:48:29.374706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:29.374706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the next-to-minimal weight of projective Reed-Muller codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"C\\'icero Carvalho, Victor G.L. Neumann","submitted_at":"2017-01-06T15:29:45Z","abstract_excerpt":"In this paper we present several values for the next-to-minimal weights of projective Reed-Muller codes. We work over $\\mathbb{F}_q$ with $q \\geq 3$ since in IEEE-IT 62(11) p. 6300-6303 (2016) we have determined the complete values for the next-to-minimal weights of binary projective Reed-Muller codes. As in loc. cit. here we also find examples of codewords with next-to-minimal weight whose set of zeros is not in a hyperplane arrangement."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01663","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":"1701.01663","created_at":"2026-05-18T00:48:29.374805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01663v1","created_at":"2026-05-18T00:48:29.374805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01663","created_at":"2026-05-18T00:48:29.374805+00:00"},{"alias_kind":"pith_short_12","alias_value":"YWBAGDMRBIHB","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YWBAGDMRBIHBX7NS","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YWBAGDMR","created_at":"2026-05-18T12:31:56.362134+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/YWBAGDMRBIHBX7NSLKRMHCJ7RO","json":"https://pith.science/pith/YWBAGDMRBIHBX7NSLKRMHCJ7RO.json","graph_json":"https://pith.science/api/pith-number/YWBAGDMRBIHBX7NSLKRMHCJ7RO/graph.json","events_json":"https://pith.science/api/pith-number/YWBAGDMRBIHBX7NSLKRMHCJ7RO/events.json","paper":"https://pith.science/paper/YWBAGDMR"},"agent_actions":{"view_html":"https://pith.science/pith/YWBAGDMRBIHBX7NSLKRMHCJ7RO","download_json":"https://pith.science/pith/YWBAGDMRBIHBX7NSLKRMHCJ7RO.json","view_paper":"https://pith.science/paper/YWBAGDMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01663&json=true","fetch_graph":"https://pith.science/api/pith-number/YWBAGDMRBIHBX7NSLKRMHCJ7RO/graph.json","fetch_events":"https://pith.science/api/pith-number/YWBAGDMRBIHBX7NSLKRMHCJ7RO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YWBAGDMRBIHBX7NSLKRMHCJ7RO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YWBAGDMRBIHBX7NSLKRMHCJ7RO/action/storage_attestation","attest_author":"https://pith.science/pith/YWBAGDMRBIHBX7NSLKRMHCJ7RO/action/author_attestation","sign_citation":"https://pith.science/pith/YWBAGDMRBIHBX7NSLKRMHCJ7RO/action/citation_signature","submit_replication":"https://pith.science/pith/YWBAGDMRBIHBX7NSLKRMHCJ7RO/action/replication_record"}},"created_at":"2026-05-18T00:48:29.374805+00:00","updated_at":"2026-05-18T00:48:29.374805+00:00"}