{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FD75RGFXJRJOF32KTICUEOIFBV","short_pith_number":"pith:FD75RGFX","schema_version":"1.0","canonical_sha256":"28ffd898b74c52e2ef4a9a054239050d4739afcb9ab86ddebd934a9e146a79eb","source":{"kind":"arxiv","id":"2507.17913","version":1},"attestation_state":"computed","paper":{"title":"A complete $t$-intersection theorem for families of spanning trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Elizaveta Iarovikova","submitted_at":"2025-07-23T20:23:34Z","abstract_excerpt":"Let $\\mathcal T_n$ denote the set of all labelled spanning trees of $K_n$. A family $\\mathcal F \\subset \\mathcal T_n$ is $t$-intersecting if for all $A, B \\in \\mathcal F$ the trees $A$ and $B$ share at least $t$ edges. In this paper, we determine for $n>n_0$ the size of the largest $t$-intersecting family $\\mathcal F\\subset \\mathcal T_n$ for all meaningful values of $t$ ($t\\le n-1$). This result is a rare instance when a complete $t$-intersection theorem for a given type of structures is known."},"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":"2507.17913","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-23T20:23:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"35eb5ae6770cdd9a088cda30bbc9a6091191ebf09901e65f9bc19e200d7b922f","abstract_canon_sha256":"38d357a1f4b3143bd193797847f025280ba6461390ab43c92375399011cb565a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:37.487207Z","signature_b64":"tgTU2gWIG2iCdskQJyf28vl7EvOIfb3ryoe6e/HcBEFVtRopabfNiZWKwAGbl1jJlPrVFgKgR9xLcKi5iWpWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28ffd898b74c52e2ef4a9a054239050d4739afcb9ab86ddebd934a9e146a79eb","last_reissued_at":"2026-07-05T11:42:37.486787Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:37.486787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A complete $t$-intersection theorem for families of spanning trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andrey Kupavskii, Elizaveta Iarovikova","submitted_at":"2025-07-23T20:23:34Z","abstract_excerpt":"Let $\\mathcal T_n$ denote the set of all labelled spanning trees of $K_n$. A family $\\mathcal F \\subset \\mathcal T_n$ is $t$-intersecting if for all $A, B \\in \\mathcal F$ the trees $A$ and $B$ share at least $t$ edges. In this paper, we determine for $n>n_0$ the size of the largest $t$-intersecting family $\\mathcal F\\subset \\mathcal T_n$ for all meaningful values of $t$ ($t\\le n-1$). This result is a rare instance when a complete $t$-intersection theorem for a given type of structures is known."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17913","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/2507.17913/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":"2507.17913","created_at":"2026-07-05T11:42:37.486842+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.17913v1","created_at":"2026-07-05T11:42:37.486842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17913","created_at":"2026-07-05T11:42:37.486842+00:00"},{"alias_kind":"pith_short_12","alias_value":"FD75RGFXJRJO","created_at":"2026-07-05T11:42:37.486842+00:00"},{"alias_kind":"pith_short_16","alias_value":"FD75RGFXJRJOF32K","created_at":"2026-07-05T11:42:37.486842+00:00"},{"alias_kind":"pith_short_8","alias_value":"FD75RGFX","created_at":"2026-07-05T11:42:37.486842+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":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FD75RGFXJRJOF32KTICUEOIFBV","json":"https://pith.science/pith/FD75RGFXJRJOF32KTICUEOIFBV.json","graph_json":"https://pith.science/api/pith-number/FD75RGFXJRJOF32KTICUEOIFBV/graph.json","events_json":"https://pith.science/api/pith-number/FD75RGFXJRJOF32KTICUEOIFBV/events.json","paper":"https://pith.science/paper/FD75RGFX"},"agent_actions":{"view_html":"https://pith.science/pith/FD75RGFXJRJOF32KTICUEOIFBV","download_json":"https://pith.science/pith/FD75RGFXJRJOF32KTICUEOIFBV.json","view_paper":"https://pith.science/paper/FD75RGFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.17913&json=true","fetch_graph":"https://pith.science/api/pith-number/FD75RGFXJRJOF32KTICUEOIFBV/graph.json","fetch_events":"https://pith.science/api/pith-number/FD75RGFXJRJOF32KTICUEOIFBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FD75RGFXJRJOF32KTICUEOIFBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FD75RGFXJRJOF32KTICUEOIFBV/action/storage_attestation","attest_author":"https://pith.science/pith/FD75RGFXJRJOF32KTICUEOIFBV/action/author_attestation","sign_citation":"https://pith.science/pith/FD75RGFXJRJOF32KTICUEOIFBV/action/citation_signature","submit_replication":"https://pith.science/pith/FD75RGFXJRJOF32KTICUEOIFBV/action/replication_record"}},"created_at":"2026-07-05T11:42:37.486842+00:00","updated_at":"2026-07-05T11:42:37.486842+00:00"}