{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MCXKUEO74NCBDWV5YIB4MI5MPF","short_pith_number":"pith:MCXKUEO7","canonical_record":{"source":{"id":"2505.24072","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-29T23:29:25Z","cross_cats_sorted":[],"title_canon_sha256":"d747a09a5c53d32a958e732d5db84ade16199ee9861855d5d834ef720f235810","abstract_canon_sha256":"341d294369b1d8612cd3bb8d9ae35ad52dc6270b54bcc41c7243d474bb087240"},"schema_version":"1.0"},"canonical_sha256":"60aeaa11dfe34411dabdc203c623ac795c53a825d6368aa5b2fcd0d811dbae54","source":{"kind":"arxiv","id":"2505.24072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24072","created_at":"2026-07-05T11:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24072v1","created_at":"2026-07-05T11:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24072","created_at":"2026-07-05T11:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"MCXKUEO74NCB","created_at":"2026-07-05T11:12:41Z"},{"alias_kind":"pith_short_16","alias_value":"MCXKUEO74NCBDWV5","created_at":"2026-07-05T11:12:41Z"},{"alias_kind":"pith_short_8","alias_value":"MCXKUEO7","created_at":"2026-07-05T11:12:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MCXKUEO74NCBDWV5YIB4MI5MPF","target":"record","payload":{"canonical_record":{"source":{"id":"2505.24072","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-29T23:29:25Z","cross_cats_sorted":[],"title_canon_sha256":"d747a09a5c53d32a958e732d5db84ade16199ee9861855d5d834ef720f235810","abstract_canon_sha256":"341d294369b1d8612cd3bb8d9ae35ad52dc6270b54bcc41c7243d474bb087240"},"schema_version":"1.0"},"canonical_sha256":"60aeaa11dfe34411dabdc203c623ac795c53a825d6368aa5b2fcd0d811dbae54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:41.176691Z","signature_b64":"58FMAKbmlDTf+EIAyqKHhDY+ZGNTxbgpgrYy2dey6OOjyO1Z3CFsIuIYBkZPAfbY9qdTMe/RF0jQYeWuvqGuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60aeaa11dfe34411dabdc203c623ac795c53a825d6368aa5b2fcd0d811dbae54","last_reissued_at":"2026-07-05T11:12:41.176210Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:41.176210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.24072","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-07-05T11:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67diObXHMCw+9VpaJ3QVYxSqzfYbwRMUCgmShMrqyXQr/tm9KEfk8Jx843F2o8CLZFK3gQsc4BnoVBTbWP7qDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:38:12.609768Z"},"content_sha256":"6833277870b3663ca36a86a9c4bf86556ac4ad02e2b40f1d1a457258f373e2bb","schema_version":"1.0","event_id":"sha256:6833277870b3663ca36a86a9c4bf86556ac4ad02e2b40f1d1a457258f373e2bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MCXKUEO74NCBDWV5YIB4MI5MPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Code-based $[3,1]$-avoiders in finite affine spaces $\\mathrm{AG}(n,2)$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benedek Kov\\'acs","submitted_at":"2025-05-29T23:29:25Z","abstract_excerpt":"The author, together with Nagy, studied the following problem on unavoidable intersections of given size in binary affine spaces. Given an $m$-element set $S\\subseteq \\mathbb{F}_2^n$, is there guaranteed to be a $[k,t]$-flat, that is, a $k$-dimensional affine subspace of $\\mathbb{F}_2^n$ containing exactly $t$ points of $S$? Such problems can be viewed as generalizations of the cap set problem over the binary field. They conjectured that for every fixed pair $(k,t)$ with $k\\ge 1$ and $0\\le t\\le 2^k$, the density of values $m\\in \\{0,...,2^n\\}$ for which a $[k,t]$-flat is guaranteed tends to $1$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24072","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/2505.24072/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-07-05T11:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nXdJBcnTjKT6oiT1l0gylUSdcRYhSZScA/uY7wDO0YtSIWnrgr+cLdK6//IwKql6djuOAHR0PIevtBc+zDaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T02:38:12.610271Z"},"content_sha256":"0f9b2c3a7734f212d2eb3f995ba2a4dc4011be6d1df7a2a032f8686f95ccdbdd","schema_version":"1.0","event_id":"sha256:0f9b2c3a7734f212d2eb3f995ba2a4dc4011be6d1df7a2a032f8686f95ccdbdd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MCXKUEO74NCBDWV5YIB4MI5MPF/bundle.json","state_url":"https://pith.science/pith/MCXKUEO74NCBDWV5YIB4MI5MPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MCXKUEO74NCBDWV5YIB4MI5MPF/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-08-09T02:38:12Z","links":{"resolver":"https://pith.science/pith/MCXKUEO74NCBDWV5YIB4MI5MPF","bundle":"https://pith.science/pith/MCXKUEO74NCBDWV5YIB4MI5MPF/bundle.json","state":"https://pith.science/pith/MCXKUEO74NCBDWV5YIB4MI5MPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MCXKUEO74NCBDWV5YIB4MI5MPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MCXKUEO74NCBDWV5YIB4MI5MPF","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":"341d294369b1d8612cd3bb8d9ae35ad52dc6270b54bcc41c7243d474bb087240","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-29T23:29:25Z","title_canon_sha256":"d747a09a5c53d32a958e732d5db84ade16199ee9861855d5d834ef720f235810"},"schema_version":"1.0","source":{"id":"2505.24072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.24072","created_at":"2026-07-05T11:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"2505.24072v1","created_at":"2026-07-05T11:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.24072","created_at":"2026-07-05T11:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"MCXKUEO74NCB","created_at":"2026-07-05T11:12:41Z"},{"alias_kind":"pith_short_16","alias_value":"MCXKUEO74NCBDWV5","created_at":"2026-07-05T11:12:41Z"},{"alias_kind":"pith_short_8","alias_value":"MCXKUEO7","created_at":"2026-07-05T11:12:41Z"}],"graph_snapshots":[{"event_id":"sha256:0f9b2c3a7734f212d2eb3f995ba2a4dc4011be6d1df7a2a032f8686f95ccdbdd","target":"graph","created_at":"2026-07-05T11:12:41Z","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/2505.24072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The author, together with Nagy, studied the following problem on unavoidable intersections of given size in binary affine spaces. Given an $m$-element set $S\\subseteq \\mathbb{F}_2^n$, is there guaranteed to be a $[k,t]$-flat, that is, a $k$-dimensional affine subspace of $\\mathbb{F}_2^n$ containing exactly $t$ points of $S$? Such problems can be viewed as generalizations of the cap set problem over the binary field. They conjectured that for every fixed pair $(k,t)$ with $k\\ge 1$ and $0\\le t\\le 2^k$, the density of values $m\\in \\{0,...,2^n\\}$ for which a $[k,t]$-flat is guaranteed tends to $1$","authors_text":"Benedek Kov\\'acs","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-29T23:29:25Z","title":"Code-based $[3,1]$-avoiders in finite affine spaces $\\mathrm{AG}(n,2)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.24072","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:6833277870b3663ca36a86a9c4bf86556ac4ad02e2b40f1d1a457258f373e2bb","target":"record","created_at":"2026-07-05T11:12:41Z","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":"341d294369b1d8612cd3bb8d9ae35ad52dc6270b54bcc41c7243d474bb087240","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-29T23:29:25Z","title_canon_sha256":"d747a09a5c53d32a958e732d5db84ade16199ee9861855d5d834ef720f235810"},"schema_version":"1.0","source":{"id":"2505.24072","kind":"arxiv","version":1}},"canonical_sha256":"60aeaa11dfe34411dabdc203c623ac795c53a825d6368aa5b2fcd0d811dbae54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60aeaa11dfe34411dabdc203c623ac795c53a825d6368aa5b2fcd0d811dbae54","first_computed_at":"2026-07-05T11:12:41.176210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:12:41.176210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"58FMAKbmlDTf+EIAyqKHhDY+ZGNTxbgpgrYy2dey6OOjyO1Z3CFsIuIYBkZPAfbY9qdTMe/RF0jQYeWuvqGuCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:12:41.176691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.24072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6833277870b3663ca36a86a9c4bf86556ac4ad02e2b40f1d1a457258f373e2bb","sha256:0f9b2c3a7734f212d2eb3f995ba2a4dc4011be6d1df7a2a032f8686f95ccdbdd"],"state_sha256":"0499dfcbe2a00af4b5ba549c62c627b15a1010d50893094074ddaa21c5d7eeae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgs8W3lfEvwV2BOvYmIP0VLB8YJ09JSWg4869DlJQg81a0yd2IpcRWys/wxkafDKe49kRi6N5zAX7Cw/vv04AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T02:38:12.614714Z","bundle_sha256":"1ef9db05824e215c53a6a48588e1710b3d084bdebcbce2f70690a258fb055f1b"}}