{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2ZRL3VHKPUJYJWPPB5KJTZULYO","short_pith_number":"pith:2ZRL3VHK","canonical_record":{"source":{"id":"2606.22697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T22:23:59Z","cross_cats_sorted":[],"title_canon_sha256":"ccdca2ec4667fd9ea30b2444bb50e1954b03daea624a6a1f70bf67510d2bfb45","abstract_canon_sha256":"26fee71aaca66a22783ab91ac0affc508510ce83efacf960ed3ae444a0ba005c"},"schema_version":"1.0"},"canonical_sha256":"d662bdd4ea7d1384d9ef0f5499e68bc3a30ebd4ab1dd5727f8dab4abba6a0075","source":{"kind":"arxiv","id":"2606.22697","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22697","created_at":"2026-06-23T02:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22697v1","created_at":"2026-06-23T02:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22697","created_at":"2026-06-23T02:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"2ZRL3VHKPUJY","created_at":"2026-06-23T02:13:45Z"},{"alias_kind":"pith_short_16","alias_value":"2ZRL3VHKPUJYJWPP","created_at":"2026-06-23T02:13:45Z"},{"alias_kind":"pith_short_8","alias_value":"2ZRL3VHK","created_at":"2026-06-23T02:13:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2ZRL3VHKPUJYJWPPB5KJTZULYO","target":"record","payload":{"canonical_record":{"source":{"id":"2606.22697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T22:23:59Z","cross_cats_sorted":[],"title_canon_sha256":"ccdca2ec4667fd9ea30b2444bb50e1954b03daea624a6a1f70bf67510d2bfb45","abstract_canon_sha256":"26fee71aaca66a22783ab91ac0affc508510ce83efacf960ed3ae444a0ba005c"},"schema_version":"1.0"},"canonical_sha256":"d662bdd4ea7d1384d9ef0f5499e68bc3a30ebd4ab1dd5727f8dab4abba6a0075","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:45.122845Z","signature_b64":"BnZjE+IIKZSi1n1SmgwO3o/1V2lvqn9doGwSWwvjHKl6n9sJ1+Xzuh3M0kxlzDs75Mq03ikoCjPlKaZXnuxUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d662bdd4ea7d1384d9ef0f5499e68bc3a30ebd4ab1dd5727f8dab4abba6a0075","last_reissued_at":"2026-06-23T02:13:45.122470Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:45.122470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.22697","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-23T02:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3i7F9nUtzXVo25H3pVwb5/8ciIp2BkcUgIeqI3yPc8WDd6TaGLjvIj3siKrUbc6vuYETuqY6eoSq+xYKzZlGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:45:08.443367Z"},"content_sha256":"18fe47e2446047be92b8d6c4c72183d2d98cd5b86894c203b8613c2906d7c6ef","schema_version":"1.0","event_id":"sha256:18fe47e2446047be92b8d6c4c72183d2d98cd5b86894c203b8613c2906d7c6ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2ZRL3VHKPUJYJWPPB5KJTZULYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Intersecting Families of Spanning Trees of $K_{n,n}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexander L. Gavrilyuk, Dheer Noal Desai, Gordian C. Bruns, Josias Gomez, Nathan Lindzey","submitted_at":"2026-06-21T22:23:59Z","abstract_excerpt":"A family of spanning trees of a graph is $t$-intersecting if any pair of spanning trees in the family has $t$ or more edges in common. For sufficiently large $n$ and $t \\leq n/C\\log_2 n$ for some absolute constant $C>0$, we give a nearly complete characterization of the extremal $t$-intersecting families of spanning trees in balanced complete bipartite graphs with parts of order $n$. In particular, for $t=1$, we give exact bounds and a full characterization of the extremal families. For $t \\geq 2$, our bounds are tight up to lower-order terms, and we show that any extremal $t$-intersecting fam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22697","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.22697/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-23T02:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BE4MdC477v5unMdtP/UXM1dvEqBdewyPne1aR6nVVntEbEWav5iF1q/XJuG5KSAql1/6cXt/50jRX0GvgUEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T17:45:08.443743Z"},"content_sha256":"128a0b981b0ba11f56eb112cafe6acc320f5d39c041cde9a738f6595ecfb2231","schema_version":"1.0","event_id":"sha256:128a0b981b0ba11f56eb112cafe6acc320f5d39c041cde9a738f6595ecfb2231"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZRL3VHKPUJYJWPPB5KJTZULYO/bundle.json","state_url":"https://pith.science/pith/2ZRL3VHKPUJYJWPPB5KJTZULYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZRL3VHKPUJYJWPPB5KJTZULYO/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:45:08Z","links":{"resolver":"https://pith.science/pith/2ZRL3VHKPUJYJWPPB5KJTZULYO","bundle":"https://pith.science/pith/2ZRL3VHKPUJYJWPPB5KJTZULYO/bundle.json","state":"https://pith.science/pith/2ZRL3VHKPUJYJWPPB5KJTZULYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZRL3VHKPUJYJWPPB5KJTZULYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2ZRL3VHKPUJYJWPPB5KJTZULYO","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":"26fee71aaca66a22783ab91ac0affc508510ce83efacf960ed3ae444a0ba005c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T22:23:59Z","title_canon_sha256":"ccdca2ec4667fd9ea30b2444bb50e1954b03daea624a6a1f70bf67510d2bfb45"},"schema_version":"1.0","source":{"id":"2606.22697","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22697","created_at":"2026-06-23T02:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22697v1","created_at":"2026-06-23T02:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22697","created_at":"2026-06-23T02:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"2ZRL3VHKPUJY","created_at":"2026-06-23T02:13:45Z"},{"alias_kind":"pith_short_16","alias_value":"2ZRL3VHKPUJYJWPP","created_at":"2026-06-23T02:13:45Z"},{"alias_kind":"pith_short_8","alias_value":"2ZRL3VHK","created_at":"2026-06-23T02:13:45Z"}],"graph_snapshots":[{"event_id":"sha256:128a0b981b0ba11f56eb112cafe6acc320f5d39c041cde9a738f6595ecfb2231","target":"graph","created_at":"2026-06-23T02:13:45Z","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.22697/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A family of spanning trees of a graph is $t$-intersecting if any pair of spanning trees in the family has $t$ or more edges in common. For sufficiently large $n$ and $t \\leq n/C\\log_2 n$ for some absolute constant $C>0$, we give a nearly complete characterization of the extremal $t$-intersecting families of spanning trees in balanced complete bipartite graphs with parts of order $n$. In particular, for $t=1$, we give exact bounds and a full characterization of the extremal families. For $t \\geq 2$, our bounds are tight up to lower-order terms, and we show that any extremal $t$-intersecting fam","authors_text":"Alexander L. Gavrilyuk, Dheer Noal Desai, Gordian C. Bruns, Josias Gomez, Nathan Lindzey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T22:23:59Z","title":"Intersecting Families of Spanning Trees of $K_{n,n}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22697","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:18fe47e2446047be92b8d6c4c72183d2d98cd5b86894c203b8613c2906d7c6ef","target":"record","created_at":"2026-06-23T02:13:45Z","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":"26fee71aaca66a22783ab91ac0affc508510ce83efacf960ed3ae444a0ba005c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-21T22:23:59Z","title_canon_sha256":"ccdca2ec4667fd9ea30b2444bb50e1954b03daea624a6a1f70bf67510d2bfb45"},"schema_version":"1.0","source":{"id":"2606.22697","kind":"arxiv","version":1}},"canonical_sha256":"d662bdd4ea7d1384d9ef0f5499e68bc3a30ebd4ab1dd5727f8dab4abba6a0075","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d662bdd4ea7d1384d9ef0f5499e68bc3a30ebd4ab1dd5727f8dab4abba6a0075","first_computed_at":"2026-06-23T02:13:45.122470Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:45.122470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BnZjE+IIKZSi1n1SmgwO3o/1V2lvqn9doGwSWwvjHKl6n9sJ1+Xzuh3M0kxlzDs75Mq03ikoCjPlKaZXnuxUAA==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:45.122845Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22697","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18fe47e2446047be92b8d6c4c72183d2d98cd5b86894c203b8613c2906d7c6ef","sha256:128a0b981b0ba11f56eb112cafe6acc320f5d39c041cde9a738f6595ecfb2231"],"state_sha256":"65218ef6a055807dbb5e80bf4fb5a859bfe53e3660ad3e892c8f1309cbe21cca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xDD5F+Lummjr8df0rUG1GfGmNaJoYxuONV4ynKuR7VUcEcyt7+LncqMcXjwddOON2K5ugXUbdBmsneVrOxZQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T17:45:08.445753Z","bundle_sha256":"f3917ac99bd6e874d5ff0f0d1d21cf3cd4b217b852a3c230f633bcb90885d5fa"}}