{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IKG57ONPITXHPTY2BOU3GU6BJV","short_pith_number":"pith:IKG57ONP","schema_version":"1.0","canonical_sha256":"428ddfb9af44ee77cf1a0ba9b353c14d779b55aa845a8aef04f0b34b921690b8","source":{"kind":"arxiv","id":"2502.08128","version":2},"attestation_state":"computed","paper":{"title":"Intersecting Families of Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Ferdinand Ihringer, Glenn Hurlbert, Karen Meagher, Nathan Lindzey, Peter Frankl, Venkata Raghu Tej Pantangi","submitted_at":"2025-02-12T05:17:19Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.08128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-12T05:17:19Z","cross_cats_sorted":[],"title_canon_sha256":"d0e932477198a0357f5f2d938195bdfe166dac683cf8f6a4f5000ee0b701a945","abstract_canon_sha256":"0ac2beb5e37f3d4015b33fdadf750376f4c94af3f78df71c54490f4b3e102a1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:43:09.592951Z","signature_b64":"5LIAbpZC2Mhluj5m9QP/o+2UTZph4kvRvKauSSbpguRZIWTcmaM71x0cFbIqZN17VfrAFibJx0eou2E1gG3qBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428ddfb9af44ee77cf1a0ba9b353c14d779b55aa845a8aef04f0b34b921690b8","last_reissued_at":"2026-07-05T11:43:09.592426Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:43:09.592426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intersecting Families of Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Ferdinand Ihringer, Glenn Hurlbert, Karen Meagher, Nathan Lindzey, Peter Frankl, Venkata Raghu Tej Pantangi","submitted_at":"2025-02-12T05:17:19Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08128","kind":"arxiv","version":2},"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/2502.08128/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.08128","created_at":"2026-07-05T11:43:09.592487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.08128v2","created_at":"2026-07-05T11:43:09.592487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08128","created_at":"2026-07-05T11:43:09.592487+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKG57ONPITXH","created_at":"2026-07-05T11:43:09.592487+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKG57ONPITXHPTY2","created_at":"2026-07-05T11:43:09.592487+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKG57ONP","created_at":"2026-07-05T11:43:09.592487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22697","citing_title":"Intersecting Families of Spanning Trees of $K_{n,n}$","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IKG57ONPITXHPTY2BOU3GU6BJV","json":"https://pith.science/pith/IKG57ONPITXHPTY2BOU3GU6BJV.json","graph_json":"https://pith.science/api/pith-number/IKG57ONPITXHPTY2BOU3GU6BJV/graph.json","events_json":"https://pith.science/api/pith-number/IKG57ONPITXHPTY2BOU3GU6BJV/events.json","paper":"https://pith.science/paper/IKG57ONP"},"agent_actions":{"view_html":"https://pith.science/pith/IKG57ONPITXHPTY2BOU3GU6BJV","download_json":"https://pith.science/pith/IKG57ONPITXHPTY2BOU3GU6BJV.json","view_paper":"https://pith.science/paper/IKG57ONP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.08128&json=true","fetch_graph":"https://pith.science/api/pith-number/IKG57ONPITXHPTY2BOU3GU6BJV/graph.json","fetch_events":"https://pith.science/api/pith-number/IKG57ONPITXHPTY2BOU3GU6BJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKG57ONPITXHPTY2BOU3GU6BJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKG57ONPITXHPTY2BOU3GU6BJV/action/storage_attestation","attest_author":"https://pith.science/pith/IKG57ONPITXHPTY2BOU3GU6BJV/action/author_attestation","sign_citation":"https://pith.science/pith/IKG57ONPITXHPTY2BOU3GU6BJV/action/citation_signature","submit_replication":"https://pith.science/pith/IKG57ONPITXHPTY2BOU3GU6BJV/action/replication_record"}},"created_at":"2026-07-05T11:43:09.592487+00:00","updated_at":"2026-07-05T11:43:09.592487+00:00"}