{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KWRMQFK4UCTFHAV22FZ53HKN67","short_pith_number":"pith:KWRMQFK4","schema_version":"1.0","canonical_sha256":"55a2c8155ca0a65382bad173dd9d4df7eab951556afbc83445799053bfdbead2","source":{"kind":"arxiv","id":"1306.4727","version":2},"attestation_state":"computed","paper":{"title":"On the second Hamming weight of some Reed-Muller type codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Cicero Carvalho","submitted_at":"2013-06-20T01:21:55Z","abstract_excerpt":"We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C. Renteria-Marquez and R. Villareal and, in a generalized form, in a work by O. Geil and C. Thomsen. Using methods from Gr\\\"obner basis theory we determine the second Hamming weight (also called next-to-minimal weight) for particular cases of affine cartesian codes and also some higher Hamming weights of this type of code."},"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":"1306.4727","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-20T01:21:55Z","cross_cats_sorted":["math.AC","math.IT"],"title_canon_sha256":"0b55013ad57f88b154ebb7ba01196ccf7a4fe590e0f92308662a3b18eb1fa29a","abstract_canon_sha256":"c5563849a1f54543e9dac9cc477805b01e3cb5c82f6f2bffd6f15050ef37bbda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:05.721748Z","signature_b64":"gIEK8LanDCQY1cdnZc8Mx+8skH8u2xmqo/KeNhwiyjyw89Y+L+QLdleONQ0S7qWOUtw1bqpdglLpD/tm+DtkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55a2c8155ca0a65382bad173dd9d4df7eab951556afbc83445799053bfdbead2","last_reissued_at":"2026-05-18T03:15:05.720827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:05.720827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the second Hamming weight of some Reed-Muller type codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC","math.IT"],"primary_cat":"cs.IT","authors_text":"Cicero Carvalho","submitted_at":"2013-06-20T01:21:55Z","abstract_excerpt":"We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C. Renteria-Marquez and R. Villareal and, in a generalized form, in a work by O. Geil and C. Thomsen. Using methods from Gr\\\"obner basis theory we determine the second Hamming weight (also called next-to-minimal weight) for particular cases of affine cartesian codes and also some higher Hamming weights of this type of code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4727","kind":"arxiv","version":2},"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":"1306.4727","created_at":"2026-05-18T03:15:05.720990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4727v2","created_at":"2026-05-18T03:15:05.720990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4727","created_at":"2026-05-18T03:15:05.720990+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWRMQFK4UCTF","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWRMQFK4UCTFHAV2","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWRMQFK4","created_at":"2026-05-18T12:27:51.066281+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/KWRMQFK4UCTFHAV22FZ53HKN67","json":"https://pith.science/pith/KWRMQFK4UCTFHAV22FZ53HKN67.json","graph_json":"https://pith.science/api/pith-number/KWRMQFK4UCTFHAV22FZ53HKN67/graph.json","events_json":"https://pith.science/api/pith-number/KWRMQFK4UCTFHAV22FZ53HKN67/events.json","paper":"https://pith.science/paper/KWRMQFK4"},"agent_actions":{"view_html":"https://pith.science/pith/KWRMQFK4UCTFHAV22FZ53HKN67","download_json":"https://pith.science/pith/KWRMQFK4UCTFHAV22FZ53HKN67.json","view_paper":"https://pith.science/paper/KWRMQFK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4727&json=true","fetch_graph":"https://pith.science/api/pith-number/KWRMQFK4UCTFHAV22FZ53HKN67/graph.json","fetch_events":"https://pith.science/api/pith-number/KWRMQFK4UCTFHAV22FZ53HKN67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWRMQFK4UCTFHAV22FZ53HKN67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWRMQFK4UCTFHAV22FZ53HKN67/action/storage_attestation","attest_author":"https://pith.science/pith/KWRMQFK4UCTFHAV22FZ53HKN67/action/author_attestation","sign_citation":"https://pith.science/pith/KWRMQFK4UCTFHAV22FZ53HKN67/action/citation_signature","submit_replication":"https://pith.science/pith/KWRMQFK4UCTFHAV22FZ53HKN67/action/replication_record"}},"created_at":"2026-05-18T03:15:05.720990+00:00","updated_at":"2026-05-18T03:15:05.720990+00:00"}