{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZRLYB6TUYOGEWOHTBAJ3HJQ5SM","short_pith_number":"pith:ZRLYB6TU","schema_version":"1.0","canonical_sha256":"cc5780fa74c38c4b38f30813b3a61d9301f97043104295f962a75ff17ccd9ad6","source":{"kind":"arxiv","id":"2501.18570","version":2},"attestation_state":"computed","paper":{"title":"On the intersection of pairs of trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Fabian Burghart, Miklos Bona, Stephan Wagner","submitted_at":"2025-01-30T18:40:28Z","abstract_excerpt":"We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson distribution with expected value $2$. This is applied to show a Poisson limit law for the number of common edges in two independent random spanning trees of an Erd\\H{o}s--R\\'enyi random graph $G(n,p)$ for constant~$p$. We also use the same method to prove an analogous result for complete multipartite graphs."},"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":"2501.18570","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-30T18:40:28Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"a5a82f640a81ddcb5f6d6504058b221a11c467a31cb8dd8976dbadf60948618e","abstract_canon_sha256":"fab761f42f1ebde0cc96dbf4fa33da686c2ba01381f635770499fd0a3845286b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:23.295800Z","signature_b64":"3D1t1EmyWko8EmpxcJ1143d4VfBSDXF0kO+JaUybZ1WTiAFMGFCJbO+zvSlsHmZIz9EMMZPSeBDez5d0NZsDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc5780fa74c38c4b38f30813b3a61d9301f97043104295f962a75ff17ccd9ad6","last_reissued_at":"2026-07-05T11:17:23.295273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:23.295273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the intersection of pairs of trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Fabian Burghart, Miklos Bona, Stephan Wagner","submitted_at":"2025-01-30T18:40:28Z","abstract_excerpt":"We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson distribution with expected value $2$. This is applied to show a Poisson limit law for the number of common edges in two independent random spanning trees of an Erd\\H{o}s--R\\'enyi random graph $G(n,p)$ for constant~$p$. We also use the same method to prove an analogous result for complete multipartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18570","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/2501.18570/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":"2501.18570","created_at":"2026-07-05T11:17:23.295347+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18570v2","created_at":"2026-07-05T11:17:23.295347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18570","created_at":"2026-07-05T11:17:23.295347+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZRLYB6TUYOGE","created_at":"2026-07-05T11:17:23.295347+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZRLYB6TUYOGEWOHT","created_at":"2026-07-05T11:17:23.295347+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZRLYB6TU","created_at":"2026-07-05T11:17:23.295347+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.22697","citing_title":"Intersecting Families of Spanning Trees of $K_{n,n}$","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM","json":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM.json","graph_json":"https://pith.science/api/pith-number/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/graph.json","events_json":"https://pith.science/api/pith-number/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/events.json","paper":"https://pith.science/paper/ZRLYB6TU"},"agent_actions":{"view_html":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM","download_json":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM.json","view_paper":"https://pith.science/paper/ZRLYB6TU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18570&json=true","fetch_graph":"https://pith.science/api/pith-number/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/action/storage_attestation","attest_author":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/action/author_attestation","sign_citation":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/action/citation_signature","submit_replication":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/action/replication_record"}},"created_at":"2026-07-05T11:17:23.295347+00:00","updated_at":"2026-07-05T11:17:23.295347+00:00"}