{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VR7Z7JUNZRWMXFL4NRMTW5KSMY","short_pith_number":"pith:VR7Z7JUN","canonical_record":{"source":{"id":"2606.12380","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T17:43:13Z","cross_cats_sorted":[],"title_canon_sha256":"150f32981190a16ca54f2a7a4a6e89cce0e2bff02d122295452910cbd85fbfb5","abstract_canon_sha256":"9ad908eba97dbbe65bb1cbda081a781846ff0270412d082e34f477a518b5338d"},"schema_version":"1.0"},"canonical_sha256":"ac7f9fa68dcc6ccb957c6c593b75526609e8b6580256800e80f4bbb01abede93","source":{"kind":"arxiv","id":"2606.12380","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12380","created_at":"2026-06-11T02:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12380v1","created_at":"2026-06-11T02:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12380","created_at":"2026-06-11T02:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"VR7Z7JUNZRWM","created_at":"2026-06-11T02:09:49Z"},{"alias_kind":"pith_short_16","alias_value":"VR7Z7JUNZRWMXFL4","created_at":"2026-06-11T02:09:49Z"},{"alias_kind":"pith_short_8","alias_value":"VR7Z7JUN","created_at":"2026-06-11T02:09:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VR7Z7JUNZRWMXFL4NRMTW5KSMY","target":"record","payload":{"canonical_record":{"source":{"id":"2606.12380","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T17:43:13Z","cross_cats_sorted":[],"title_canon_sha256":"150f32981190a16ca54f2a7a4a6e89cce0e2bff02d122295452910cbd85fbfb5","abstract_canon_sha256":"9ad908eba97dbbe65bb1cbda081a781846ff0270412d082e34f477a518b5338d"},"schema_version":"1.0"},"canonical_sha256":"ac7f9fa68dcc6ccb957c6c593b75526609e8b6580256800e80f4bbb01abede93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T02:09:49.181038Z","signature_b64":"nUaMnZkBjKfBN+MhWKAwTP06LtUJIN9x+t3aqUQOxIikqSIr7gibki9XMnTiTuhX9cScKQm5mnPYt0nlmVSgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac7f9fa68dcc6ccb957c6c593b75526609e8b6580256800e80f4bbb01abede93","last_reissued_at":"2026-06-11T02:09:49.180488Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T02:09:49.180488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.12380","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-06-11T02:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JcpBp5zKvxdntUTYl8HLdIPGCIA6hjoPjedUXK111B6491kTy7yoIViIXZF50JhEgY7S4x9Sp43/8Uon49JyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:40:58.163241Z"},"content_sha256":"e84776d65f10f418dadea5486f74cdd59bd61f00d9226f71a58e97c7f336cf8d","schema_version":"1.0","event_id":"sha256:e84776d65f10f418dadea5486f74cdd59bd61f00d9226f71a58e97c7f336cf8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VR7Z7JUNZRWMXFL4NRMTW5KSMY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Forbidden Intersection Theorems for Matrix Spaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Esty Kelman, Nathan Lindzey, Ohad Sheinfeld","submitted_at":"2026-06-10T17:43:13Z","abstract_excerpt":"A family of $m \\times n$ matrices $\\mathcal{F} \\subseteq \\mathbb{F}_q^{m \\times n}$ is {$(t-1)$-intersection-free} if $\\dim \\ker(A-B) \\neq t-1$ for all $A,B \\in \\mathcal{F}$. A \\emph{forbidden $(t-1)$-intersection problem} for a collection of matrices asks for the size and structure of extremal $(t-1)$-intersection-free families within that collection.\n  We solve this problem in $\\mathrm{GL}(n,q)$ for all pairs $(n,t)$ such that $t<c\\cdot n$ where $c$ is a universal constant. We show that the $t$-umvirates and their duals, are the only maximal $(t-1)$-intersection-free families $\\mathcal{F} \\s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12380","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/2606.12380/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-06-11T02:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eoA85XNv1Oi3emL2XZNS9fWKNak7FzgMN7KQAlWT18bb4UVO9lYMdlFEJQOBSihmF07h+0cAQW7m/u+MhbwhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:40:58.163635Z"},"content_sha256":"5f1f4913ca650ebf1ba4e20b156669f5dcdef27b1ff0b4d6f937b17be7ae2880","schema_version":"1.0","event_id":"sha256:5f1f4913ca650ebf1ba4e20b156669f5dcdef27b1ff0b4d6f937b17be7ae2880"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VR7Z7JUNZRWMXFL4NRMTW5KSMY/bundle.json","state_url":"https://pith.science/pith/VR7Z7JUNZRWMXFL4NRMTW5KSMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VR7Z7JUNZRWMXFL4NRMTW5KSMY/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-23T17:40:58Z","links":{"resolver":"https://pith.science/pith/VR7Z7JUNZRWMXFL4NRMTW5KSMY","bundle":"https://pith.science/pith/VR7Z7JUNZRWMXFL4NRMTW5KSMY/bundle.json","state":"https://pith.science/pith/VR7Z7JUNZRWMXFL4NRMTW5KSMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VR7Z7JUNZRWMXFL4NRMTW5KSMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VR7Z7JUNZRWMXFL4NRMTW5KSMY","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":"9ad908eba97dbbe65bb1cbda081a781846ff0270412d082e34f477a518b5338d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T17:43:13Z","title_canon_sha256":"150f32981190a16ca54f2a7a4a6e89cce0e2bff02d122295452910cbd85fbfb5"},"schema_version":"1.0","source":{"id":"2606.12380","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12380","created_at":"2026-06-11T02:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12380v1","created_at":"2026-06-11T02:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12380","created_at":"2026-06-11T02:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"VR7Z7JUNZRWM","created_at":"2026-06-11T02:09:49Z"},{"alias_kind":"pith_short_16","alias_value":"VR7Z7JUNZRWMXFL4","created_at":"2026-06-11T02:09:49Z"},{"alias_kind":"pith_short_8","alias_value":"VR7Z7JUN","created_at":"2026-06-11T02:09:49Z"}],"graph_snapshots":[{"event_id":"sha256:5f1f4913ca650ebf1ba4e20b156669f5dcdef27b1ff0b4d6f937b17be7ae2880","target":"graph","created_at":"2026-06-11T02:09:49Z","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/2606.12380/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A family of $m \\times n$ matrices $\\mathcal{F} \\subseteq \\mathbb{F}_q^{m \\times n}$ is {$(t-1)$-intersection-free} if $\\dim \\ker(A-B) \\neq t-1$ for all $A,B \\in \\mathcal{F}$. A \\emph{forbidden $(t-1)$-intersection problem} for a collection of matrices asks for the size and structure of extremal $(t-1)$-intersection-free families within that collection.\n  We solve this problem in $\\mathrm{GL}(n,q)$ for all pairs $(n,t)$ such that $t<c\\cdot n$ where $c$ is a universal constant. We show that the $t$-umvirates and their duals, are the only maximal $(t-1)$-intersection-free families $\\mathcal{F} \\s","authors_text":"Esty Kelman, Nathan Lindzey, Ohad Sheinfeld","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T17:43:13Z","title":"Forbidden Intersection Theorems for Matrix Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12380","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:e84776d65f10f418dadea5486f74cdd59bd61f00d9226f71a58e97c7f336cf8d","target":"record","created_at":"2026-06-11T02:09:49Z","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":"9ad908eba97dbbe65bb1cbda081a781846ff0270412d082e34f477a518b5338d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T17:43:13Z","title_canon_sha256":"150f32981190a16ca54f2a7a4a6e89cce0e2bff02d122295452910cbd85fbfb5"},"schema_version":"1.0","source":{"id":"2606.12380","kind":"arxiv","version":1}},"canonical_sha256":"ac7f9fa68dcc6ccb957c6c593b75526609e8b6580256800e80f4bbb01abede93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac7f9fa68dcc6ccb957c6c593b75526609e8b6580256800e80f4bbb01abede93","first_computed_at":"2026-06-11T02:09:49.180488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T02:09:49.180488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nUaMnZkBjKfBN+MhWKAwTP06LtUJIN9x+t3aqUQOxIikqSIr7gibki9XMnTiTuhX9cScKQm5mnPYt0nlmVSgBA==","signature_status":"signed_v1","signed_at":"2026-06-11T02:09:49.181038Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12380","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e84776d65f10f418dadea5486f74cdd59bd61f00d9226f71a58e97c7f336cf8d","sha256:5f1f4913ca650ebf1ba4e20b156669f5dcdef27b1ff0b4d6f937b17be7ae2880"],"state_sha256":"f36d5772ea8d62e2ff5407d759b205115b0d32c89efa22e32e2b57e0ff334d49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ayASRaN7M2sueY4eWAPsa/QR7Y68PRapvYC7M8MvR7XTCXLUCNegEeQfKuHOoYK1n2dJcvFjx4yZ4BHcqU9aCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:40:58.165711Z","bundle_sha256":"b67506053bb093c820d56bd7e9cd6e8e18552426304b5db1073307ddf8a96a04"}}