{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VFQB37DNUA5XXSDJAGHEZ2JZ7H","short_pith_number":"pith:VFQB37DN","schema_version":"1.0","canonical_sha256":"a9601dfc6da03b7bc869018e4ce939f9c0eb83089e37cb701406bc9a069638a8","source":{"kind":"arxiv","id":"1706.02114","version":2},"attestation_state":"computed","paper":{"title":"Generalized Hamming weights of affine cartesian codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Mrinmoy Datta, Peter Beelen","submitted_at":"2017-06-07T10:20:57Z","abstract_excerpt":"In this article, we give the answer to the following question: Given a field $\\mathbb{F}$, finite subsets $A_1,\\dots,A_m$ of $\\mathbb{F}$, and $r$ linearly independent polynomials $f_1,\\dots,f_r \\in \\mathbb{F}[x_1,\\dots,x_m]$ of total degree at most $d$. What is the maximal number of common zeros $f_1,\\dots,f_r$ can have in $A_1 \\times \\cdots \\times A_m$? For $\\mathbb{F}=\\mathbb{F}_q$, the finite field with $q$ elements, answering this question is equivalent to determining the generalized Hamming weights of the so-called affine Cartesian codes. Seen in this light, our work is a generalization "},"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":"1706.02114","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2017-06-07T10:20:57Z","cross_cats_sorted":[],"title_canon_sha256":"caed179c5556256b937aafdbc22fae10b067f9655c87d13fc2da155edb7534fc","abstract_canon_sha256":"6a0ed62328cc38da425de024c72d55ae2773b4393003ae69d4e96326c115973e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:06.439932Z","signature_b64":"b5qOGJDJWdEOQrK0ujDk2k8Chwiu37nMlgdlqyh9Eb9nxgoEuWLZAVeUXMAgji8pPcLNg14TV4Ko7UYgwrD8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9601dfc6da03b7bc869018e4ce939f9c0eb83089e37cb701406bc9a069638a8","last_reissued_at":"2026-05-18T00:39:06.439412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:06.439412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Hamming weights of affine cartesian codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Mrinmoy Datta, Peter Beelen","submitted_at":"2017-06-07T10:20:57Z","abstract_excerpt":"In this article, we give the answer to the following question: Given a field $\\mathbb{F}$, finite subsets $A_1,\\dots,A_m$ of $\\mathbb{F}$, and $r$ linearly independent polynomials $f_1,\\dots,f_r \\in \\mathbb{F}[x_1,\\dots,x_m]$ of total degree at most $d$. What is the maximal number of common zeros $f_1,\\dots,f_r$ can have in $A_1 \\times \\cdots \\times A_m$? For $\\mathbb{F}=\\mathbb{F}_q$, the finite field with $q$ elements, answering this question is equivalent to determining the generalized Hamming weights of the so-called affine Cartesian codes. Seen in this light, our work is a generalization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02114","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":"1706.02114","created_at":"2026-05-18T00:39:06.439496+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02114v2","created_at":"2026-05-18T00:39:06.439496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02114","created_at":"2026-05-18T00:39:06.439496+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFQB37DNUA5X","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFQB37DNUA5XXSDJ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFQB37DN","created_at":"2026-05-18T12:31:49.984773+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/VFQB37DNUA5XXSDJAGHEZ2JZ7H","json":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H.json","graph_json":"https://pith.science/api/pith-number/VFQB37DNUA5XXSDJAGHEZ2JZ7H/graph.json","events_json":"https://pith.science/api/pith-number/VFQB37DNUA5XXSDJAGHEZ2JZ7H/events.json","paper":"https://pith.science/paper/VFQB37DN"},"agent_actions":{"view_html":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H","download_json":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H.json","view_paper":"https://pith.science/paper/VFQB37DN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02114&json=true","fetch_graph":"https://pith.science/api/pith-number/VFQB37DNUA5XXSDJAGHEZ2JZ7H/graph.json","fetch_events":"https://pith.science/api/pith-number/VFQB37DNUA5XXSDJAGHEZ2JZ7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/action/storage_attestation","attest_author":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/action/author_attestation","sign_citation":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/action/citation_signature","submit_replication":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/action/replication_record"}},"created_at":"2026-05-18T00:39:06.439496+00:00","updated_at":"2026-05-18T00:39:06.439496+00:00"}