{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AKEJ53RXAQON62UAGF6QUEDNRY","short_pith_number":"pith:AKEJ53RX","canonical_record":{"source":{"id":"2605.22958","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-21T18:44:40Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"f70280f345badcc976a1ff06574bb651594954f0ef3147da6cb887f1aeffee0a","abstract_canon_sha256":"17eeeb71358b4b91cd4a5a00820da2f063d472f3fac0cb313d98dc6d49b4b3be"},"schema_version":"1.0"},"canonical_sha256":"02889eee37041cdf6a80317d0a106d8e17f15adc760f2ab793f402bc43dfe18d","source":{"kind":"arxiv","id":"2605.22958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22958","created_at":"2026-05-25T02:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22958v1","created_at":"2026-05-25T02:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22958","created_at":"2026-05-25T02:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"AKEJ53RXAQON","created_at":"2026-05-25T02:01:32Z"},{"alias_kind":"pith_short_16","alias_value":"AKEJ53RXAQON62UA","created_at":"2026-05-25T02:01:32Z"},{"alias_kind":"pith_short_8","alias_value":"AKEJ53RX","created_at":"2026-05-25T02:01:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AKEJ53RXAQON62UAGF6QUEDNRY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.22958","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-21T18:44:40Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"f70280f345badcc976a1ff06574bb651594954f0ef3147da6cb887f1aeffee0a","abstract_canon_sha256":"17eeeb71358b4b91cd4a5a00820da2f063d472f3fac0cb313d98dc6d49b4b3be"},"schema_version":"1.0"},"canonical_sha256":"02889eee37041cdf6a80317d0a106d8e17f15adc760f2ab793f402bc43dfe18d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:32.217904Z","signature_b64":"mKCziPuj04rC9H6fQ/eMxm8MGaA1fCAfBQp/lgj99EQ9o3hpp2u3Yaclvu81g2ZwKlid/8TYjZ1OjLOQnQmlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02889eee37041cdf6a80317d0a106d8e17f15adc760f2ab793f402bc43dfe18d","last_reissued_at":"2026-05-25T02:01:32.217094Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:32.217094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.22958","source_version":1,"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-25T02:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDdxPtAGjLQ4IT3ZQzO+fr9E4TGeeBBHrnKd8PmY5TbrRlH0P+P/IoFaFEDj8FHyE8xfwqw+oxbWH2LeAyXTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:13:43.603266Z"},"content_sha256":"5225ec8678f4d454cc332a7d45a03d563f5ae61dc8a5a1fb91e381025e20610d","schema_version":"1.0","event_id":"sha256:5225ec8678f4d454cc332a7d45a03d563f5ae61dc8a5a1fb91e381025e20610d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AKEJ53RXAQON62UAGF6QUEDNRY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Reed-Muller subcodes, Grassmannian partitions and sum-free functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Kaspers, Philipp Heering, Vladislav Taranchuk","submitted_at":"2026-05-21T18:44:40Z","abstract_excerpt":"A function $F:\\mathbb{F}_{2}^{n}\\to \\mathbb{F}_{2}^{m}$ is called $k$th-order sum-free if the sum of its values over any $k$-dimensional affine subspace of $\\mathbb{F}_2^n$ is non-zero. Carlet recently introduced this notion and constructed such functions for every $2\\le k\\le n$. We prove that, for $2\\le k\\le n-2$ and $m \\leq n$, the existence of a (non-degenerate) $\\mathbb{F}_{2}^{m}$-valued $k$th-order sum-free function on $\\mathbb{F}_{2}^{n}$ is equivalent to the existence of a codimension $m$ linear subcode of the Reed-Muller code $\\mathrm{RM}(n-k,n)$ with minimum distance $3\\cdot 2^{k-1}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22958","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.22958/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-25T02:01:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fhm27RefcM83/SxyOXU9ZwliM/K+xIdNGxl0hBSFXno2lNmSUpkFq62S4q580aTuGNOyQL8F0fCNpr5nYn4zCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:13:43.604074Z"},"content_sha256":"ec4e757a95597a16c1f8ee662a20351754286a4811f4059169b2196230a391b8","schema_version":"1.0","event_id":"sha256:ec4e757a95597a16c1f8ee662a20351754286a4811f4059169b2196230a391b8"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:AKEJ53RXAQON62UAGF6QUEDNRY","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TIT.2020.3004749.22) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"E. Abbe, A. Shpilka, and M. Ye. Reed-Muller codes: theory and algorithms.IEEE Trans. Inform. Theory, 67(6, part 1):3251–3277, 2021.doi:10.1109/TIT.2020. 3004749. 22","arxiv_id":"2605.22958","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"E. Abbe, A. Shpilka, and M. Ye. Reed-Muller codes: theory and algorithms.IEEE Trans. Inform. Theory, 67(6, part 1):3251–3277, 2021.doi:10.1109/TIT.2020. 3004749. 22","reconstructed_doi":"10.1109/TIT.2020.3004749.22"},"severity":"advisory","ref_index":1,"audited_at":"2026-05-25T05:39:47.684983Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/TIT.2020.3004749.22","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"16f32085dc281e937a14ae0791664dd5c52855bb58cb3da46f285b40e6015a50","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":7469,"payload_sha256":"5e236d3d0866a6e55b8465f41ab738d9a6bed6738a3dba48f7795d62aa7f1b52","signature_b64":"1VbcAKPR71ICtk1srjTkezlefnaSKkLefWp0xxKjgtVFubsDfU9YoeiW6913ZtOdxoPEIvkst7zHPZJJI/JNDA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T05:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hYTRe+TbajlouP8O8Xbj26ZNgTmgPqnr1yjs494Qz4aFphrk0fNgclJQtqGpw4p0Y8Xih0JQLPFbsBG1oItnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:13:43.605854Z"},"content_sha256":"7fe60badcfbd7a33ab8406c1ae82c75af9491c8d9031e6c79c7e5316aa76ba24","schema_version":"1.0","event_id":"sha256:7fe60badcfbd7a33ab8406c1ae82c75af9491c8d9031e6c79c7e5316aa76ba24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKEJ53RXAQON62UAGF6QUEDNRY/bundle.json","state_url":"https://pith.science/pith/AKEJ53RXAQON62UAGF6QUEDNRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKEJ53RXAQON62UAGF6QUEDNRY/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-08T15:13:43Z","links":{"resolver":"https://pith.science/pith/AKEJ53RXAQON62UAGF6QUEDNRY","bundle":"https://pith.science/pith/AKEJ53RXAQON62UAGF6QUEDNRY/bundle.json","state":"https://pith.science/pith/AKEJ53RXAQON62UAGF6QUEDNRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKEJ53RXAQON62UAGF6QUEDNRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AKEJ53RXAQON62UAGF6QUEDNRY","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"17eeeb71358b4b91cd4a5a00820da2f063d472f3fac0cb313d98dc6d49b4b3be","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-21T18:44:40Z","title_canon_sha256":"f70280f345badcc976a1ff06574bb651594954f0ef3147da6cb887f1aeffee0a"},"schema_version":"1.0","source":{"id":"2605.22958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22958","created_at":"2026-05-25T02:01:32Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22958v1","created_at":"2026-05-25T02:01:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22958","created_at":"2026-05-25T02:01:32Z"},{"alias_kind":"pith_short_12","alias_value":"AKEJ53RXAQON","created_at":"2026-05-25T02:01:32Z"},{"alias_kind":"pith_short_16","alias_value":"AKEJ53RXAQON62UA","created_at":"2026-05-25T02:01:32Z"},{"alias_kind":"pith_short_8","alias_value":"AKEJ53RX","created_at":"2026-05-25T02:01:32Z"}],"graph_snapshots":[{"event_id":"sha256:ec4e757a95597a16c1f8ee662a20351754286a4811f4059169b2196230a391b8","target":"graph","created_at":"2026-05-25T02:01:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.22958/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A function $F:\\mathbb{F}_{2}^{n}\\to \\mathbb{F}_{2}^{m}$ is called $k$th-order sum-free if the sum of its values over any $k$-dimensional affine subspace of $\\mathbb{F}_2^n$ is non-zero. Carlet recently introduced this notion and constructed such functions for every $2\\le k\\le n$. We prove that, for $2\\le k\\le n-2$ and $m \\leq n$, the existence of a (non-degenerate) $\\mathbb{F}_{2}^{m}$-valued $k$th-order sum-free function on $\\mathbb{F}_{2}^{n}$ is equivalent to the existence of a codimension $m$ linear subcode of the Reed-Muller code $\\mathrm{RM}(n-k,n)$ with minimum distance $3\\cdot 2^{k-1}$","authors_text":"Christian Kaspers, Philipp Heering, Vladislav Taranchuk","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-21T18:44:40Z","title":"On Reed-Muller subcodes, Grassmannian partitions and sum-free functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22958","kind":"arxiv","version":1},"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:5225ec8678f4d454cc332a7d45a03d563f5ae61dc8a5a1fb91e381025e20610d","target":"record","created_at":"2026-05-25T02:01:32Z","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":"17eeeb71358b4b91cd4a5a00820da2f063d472f3fac0cb313d98dc6d49b4b3be","cross_cats_sorted":["math.CO","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-21T18:44:40Z","title_canon_sha256":"f70280f345badcc976a1ff06574bb651594954f0ef3147da6cb887f1aeffee0a"},"schema_version":"1.0","source":{"id":"2605.22958","kind":"arxiv","version":1}},"canonical_sha256":"02889eee37041cdf6a80317d0a106d8e17f15adc760f2ab793f402bc43dfe18d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02889eee37041cdf6a80317d0a106d8e17f15adc760f2ab793f402bc43dfe18d","first_computed_at":"2026-05-25T02:01:32.217094Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:32.217094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mKCziPuj04rC9H6fQ/eMxm8MGaA1fCAfBQp/lgj99EQ9o3hpp2u3Yaclvu81g2ZwKlid/8TYjZ1OjLOQnQmlBw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:32.217904Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5225ec8678f4d454cc332a7d45a03d563f5ae61dc8a5a1fb91e381025e20610d","sha256:ec4e757a95597a16c1f8ee662a20351754286a4811f4059169b2196230a391b8","sha256:7fe60badcfbd7a33ab8406c1ae82c75af9491c8d9031e6c79c7e5316aa76ba24"],"state_sha256":"a800253a79bf58a13016090753ecc2be4b56d3b5c0730807b41200fd2d79f3be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QMfV5QIor4IOkxgC+w/DgR7spyUM0qF9kIqwapQ6d/kgLzpKzOjam+jYZ17jz+vb2havYwiqNwfPCivaGBAsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:13:43.610549Z","bundle_sha256":"31b24aa034419cc7701da8bd8431e87f3127b067ef87252977a04a130aa21002"}}