{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IKG57ONPITXHPTY2BOU3GU6BJV","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":"0ac2beb5e37f3d4015b33fdadf750376f4c94af3f78df71c54490f4b3e102a1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-12T05:17:19Z","title_canon_sha256":"d0e932477198a0357f5f2d938195bdfe166dac683cf8f6a4f5000ee0b701a945"},"schema_version":"1.0","source":{"id":"2502.08128","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08128","created_at":"2026-07-05T11:43:09Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08128v2","created_at":"2026-07-05T11:43:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08128","created_at":"2026-07-05T11:43:09Z"},{"alias_kind":"pith_short_12","alias_value":"IKG57ONPITXH","created_at":"2026-07-05T11:43:09Z"},{"alias_kind":"pith_short_16","alias_value":"IKG57ONPITXHPTY2","created_at":"2026-07-05T11:43:09Z"},{"alias_kind":"pith_short_8","alias_value":"IKG57ONP","created_at":"2026-07-05T11:43:09Z"}],"graph_snapshots":[{"event_id":"sha256:c1f87f362f8421afd874d31fc49887854529005dee4df345efd2e6175442c531","target":"graph","created_at":"2026-07-05T11:43:09Z","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/2502.08128/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A family $\\mathcal{F}$ of spanning trees of the complete graph on $n$ vertices $K_n$ is \\emph{$t$-intersecting} if any two members have a forest on $t$ edges in common. We prove an Erd\\H{o}s--Ko--Rado result for $t$-intersecting families of spanning trees of $K_n$. In particular, we show there exists a constant $C > 0$ such that for all $n \\geq C (\\log n) t$ the largest $t$-intersecting families are the families consisting of all trees that contain a fixed set of $t$ disjoint edges (as well as the stars on $n$ vertices for $t = 1$). The proof uses the spread approximation technique in conjunct","authors_text":"Andrey Kupavskii, Ferdinand Ihringer, Glenn Hurlbert, Karen Meagher, Nathan Lindzey, Peter Frankl, Venkata Raghu Tej Pantangi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-12T05:17:19Z","title":"Intersecting Families of Spanning Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08128","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:a4eefe9454f2962638221ba2bc3d106ae73fb667ced89c70c6767533d9cfd9e6","target":"record","created_at":"2026-07-05T11:43:09Z","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":"0ac2beb5e37f3d4015b33fdadf750376f4c94af3f78df71c54490f4b3e102a1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-12T05:17:19Z","title_canon_sha256":"d0e932477198a0357f5f2d938195bdfe166dac683cf8f6a4f5000ee0b701a945"},"schema_version":"1.0","source":{"id":"2502.08128","kind":"arxiv","version":2}},"canonical_sha256":"428ddfb9af44ee77cf1a0ba9b353c14d779b55aa845a8aef04f0b34b921690b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"428ddfb9af44ee77cf1a0ba9b353c14d779b55aa845a8aef04f0b34b921690b8","first_computed_at":"2026-07-05T11:43:09.592426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:43:09.592426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5LIAbpZC2Mhluj5m9QP/o+2UTZph4kvRvKauSSbpguRZIWTcmaM71x0cFbIqZN17VfrAFibJx0eou2E1gG3qBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:43:09.592951Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.08128","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4eefe9454f2962638221ba2bc3d106ae73fb667ced89c70c6767533d9cfd9e6","sha256:c1f87f362f8421afd874d31fc49887854529005dee4df345efd2e6175442c531"],"state_sha256":"c23560c310e263dca41c166b75ec8cf054e4ccb518ca8b2eebd09c97e1e1ad9d"}