{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VFQB37DNUA5XXSDJAGHEZ2JZ7H","short_pith_number":"pith:VFQB37DN","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"},"canonical_sha256":"a9601dfc6da03b7bc869018e4ce939f9c0eb83089e37cb701406bc9a069638a8","source":{"kind":"arxiv","id":"1706.02114","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02114","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02114v2","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02114","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"VFQB37DNUA5X","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VFQB37DNUA5XXSDJ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VFQB37DN","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VFQB37DNUA5XXSDJAGHEZ2JZ7H","target":"record","payload":{"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"},"canonical_sha256":"a9601dfc6da03b7bc869018e4ce939f9c0eb83089e37cb701406bc9a069638a8","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"},"source_kind":"arxiv","source_id":"1706.02114","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z1X78uhoGd510yY0JBl5FZbW/b1XeeQocT2XPZXfYwDalZcOzhQ8mrK1UtZsyHU7q1jJMxwRIG7qbUa7X5ZlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:19:45.371808Z"},"content_sha256":"e13646e23486d7a2de70bf68ff47fffdd69d2a7e9c5e8405c30105887a5c6609","schema_version":"1.0","event_id":"sha256:e13646e23486d7a2de70bf68ff47fffdd69d2a7e9c5e8405c30105887a5c6609"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VFQB37DNUA5XXSDJAGHEZ2JZ7H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IT8shACfwmgl3qVRCnwjsez8z4etKLvJeLB3OEgevsHOZni3O+Ov9r8r5pNra8M1rdun4c4+QBWrXf0j0/rUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:19:45.372136Z"},"content_sha256":"ed27341058c78a847d636c4bf1de62688a7cace0c5e8a8c935b9a714b3c08a59","schema_version":"1.0","event_id":"sha256:ed27341058c78a847d636c4bf1de62688a7cace0c5e8a8c935b9a714b3c08a59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/bundle.json","state_url":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T18:19:45Z","links":{"resolver":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H","bundle":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/bundle.json","state":"https://pith.science/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFQB37DNUA5XXSDJAGHEZ2JZ7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VFQB37DNUA5XXSDJAGHEZ2JZ7H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6a0ed62328cc38da425de024c72d55ae2773b4393003ae69d4e96326c115973e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2017-06-07T10:20:57Z","title_canon_sha256":"caed179c5556256b937aafdbc22fae10b067f9655c87d13fc2da155edb7534fc"},"schema_version":"1.0","source":{"id":"1706.02114","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02114","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02114v2","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02114","created_at":"2026-05-18T00:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"VFQB37DNUA5X","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VFQB37DNUA5XXSDJ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VFQB37DN","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:ed27341058c78a847d636c4bf1de62688a7cace0c5e8a8c935b9a714b3c08a59","target":"graph","created_at":"2026-05-18T00:39:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Mrinmoy Datta, Peter Beelen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2017-06-07T10:20:57Z","title":"Generalized Hamming weights of affine cartesian codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02114","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e13646e23486d7a2de70bf68ff47fffdd69d2a7e9c5e8405c30105887a5c6609","target":"record","created_at":"2026-05-18T00:39:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6a0ed62328cc38da425de024c72d55ae2773b4393003ae69d4e96326c115973e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2017-06-07T10:20:57Z","title_canon_sha256":"caed179c5556256b937aafdbc22fae10b067f9655c87d13fc2da155edb7534fc"},"schema_version":"1.0","source":{"id":"1706.02114","kind":"arxiv","version":2}},"canonical_sha256":"a9601dfc6da03b7bc869018e4ce939f9c0eb83089e37cb701406bc9a069638a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9601dfc6da03b7bc869018e4ce939f9c0eb83089e37cb701406bc9a069638a8","first_computed_at":"2026-05-18T00:39:06.439412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:06.439412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b5qOGJDJWdEOQrK0ujDk2k8Chwiu37nMlgdlqyh9Eb9nxgoEuWLZAVeUXMAgji8pPcLNg14TV4Ko7UYgwrD8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:06.439932Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02114","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e13646e23486d7a2de70bf68ff47fffdd69d2a7e9c5e8405c30105887a5c6609","sha256:ed27341058c78a847d636c4bf1de62688a7cace0c5e8a8c935b9a714b3c08a59"],"state_sha256":"d04a2eb7473cb44e149439f44d8ff49148d59fcb37762039fb2c67f4f1ee6917"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjhQ2P7y2unigb1b2NqlTsyhW7qnrkxGgLmPpOdGtDMnhgao4FOahVkWGUtknpLh9ICh+VCJjwVdzs3C0zusAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:19:45.373929Z","bundle_sha256":"085721a4c2426d0ab755792aa689365c324f9eb0f536f2ba93f7a5fd98675028"}}