{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ZRLYB6TUYOGEWOHTBAJ3HJQ5SM","short_pith_number":"pith:ZRLYB6TU","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"},"canonical_sha256":"cc5780fa74c38c4b38f30813b3a61d9301f97043104295f962a75ff17ccd9ad6","source":{"kind":"arxiv","id":"2501.18570","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.18570","created_at":"2026-07-05T11:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"2501.18570v2","created_at":"2026-07-05T11:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18570","created_at":"2026-07-05T11:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZRLYB6TUYOGE","created_at":"2026-07-05T11:17:23Z"},{"alias_kind":"pith_short_16","alias_value":"ZRLYB6TUYOGEWOHT","created_at":"2026-07-05T11:17:23Z"},{"alias_kind":"pith_short_8","alias_value":"ZRLYB6TU","created_at":"2026-07-05T11:17:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ZRLYB6TUYOGEWOHTBAJ3HJQ5SM","target":"record","payload":{"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"},"canonical_sha256":"cc5780fa74c38c4b38f30813b3a61d9301f97043104295f962a75ff17ccd9ad6","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"},"source_kind":"arxiv","source_id":"2501.18570","source_version":2,"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-07-05T11:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3zqccmHJAlbqvegFcy+RX2Hvg9UvfwYM2gUa5hSyXAyx1CeSnTjFn1G4PiZ1HKPpX0ffGPRP9Ncl87LVaQhMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:23:07.326502Z"},"content_sha256":"7322855a928b41f6fbcc10fbb68d1f8e50720d9903b163cbbd59d6e3e93e171a","schema_version":"1.0","event_id":"sha256:7322855a928b41f6fbcc10fbb68d1f8e50720d9903b163cbbd59d6e3e93e171a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ZRLYB6TUYOGEWOHTBAJ3HJQ5SM","target":"graph","payload":{"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"},"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-07-05T11:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cA9mdfe7bSa00gs6h8XDBVnTnvrpanTwO4TvaPhlOV2eTA1ks5M2vKeBeiziJe+pfg6HzHkd0IA8PlXpghFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T03:23:07.326875Z"},"content_sha256":"9e4ee5eac4c7226cb38b7f8604af2d1065e41a85e7ed985d679bd6f396f624ee","schema_version":"1.0","event_id":"sha256:9e4ee5eac4c7226cb38b7f8604af2d1065e41a85e7ed985d679bd6f396f624ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/bundle.json","state_url":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/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-07-07T03:23:07Z","links":{"resolver":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM","bundle":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/bundle.json","state":"https://pith.science/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRLYB6TUYOGEWOHTBAJ3HJQ5SM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZRLYB6TUYOGEWOHTBAJ3HJQ5SM","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":"fab761f42f1ebde0cc96dbf4fa33da686c2ba01381f635770499fd0a3845286b","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-30T18:40:28Z","title_canon_sha256":"a5a82f640a81ddcb5f6d6504058b221a11c467a31cb8dd8976dbadf60948618e"},"schema_version":"1.0","source":{"id":"2501.18570","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.18570","created_at":"2026-07-05T11:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"2501.18570v2","created_at":"2026-07-05T11:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18570","created_at":"2026-07-05T11:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZRLYB6TUYOGE","created_at":"2026-07-05T11:17:23Z"},{"alias_kind":"pith_short_16","alias_value":"ZRLYB6TUYOGEWOHT","created_at":"2026-07-05T11:17:23Z"},{"alias_kind":"pith_short_8","alias_value":"ZRLYB6TU","created_at":"2026-07-05T11:17:23Z"}],"graph_snapshots":[{"event_id":"sha256:9e4ee5eac4c7226cb38b7f8604af2d1065e41a85e7ed985d679bd6f396f624ee","target":"graph","created_at":"2026-07-05T11:17:23Z","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/2501.18570/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Fabian Burghart, Miklos Bona, Stephan Wagner","cross_cats":["math.PR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-30T18:40:28Z","title":"On the intersection of pairs of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18570","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:7322855a928b41f6fbcc10fbb68d1f8e50720d9903b163cbbd59d6e3e93e171a","target":"record","created_at":"2026-07-05T11:17:23Z","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":"fab761f42f1ebde0cc96dbf4fa33da686c2ba01381f635770499fd0a3845286b","cross_cats_sorted":["math.PR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-30T18:40:28Z","title_canon_sha256":"a5a82f640a81ddcb5f6d6504058b221a11c467a31cb8dd8976dbadf60948618e"},"schema_version":"1.0","source":{"id":"2501.18570","kind":"arxiv","version":2}},"canonical_sha256":"cc5780fa74c38c4b38f30813b3a61d9301f97043104295f962a75ff17ccd9ad6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc5780fa74c38c4b38f30813b3a61d9301f97043104295f962a75ff17ccd9ad6","first_computed_at":"2026-07-05T11:17:23.295273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:23.295273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3D1t1EmyWko8EmpxcJ1143d4VfBSDXF0kO+JaUybZ1WTiAFMGFCJbO+zvSlsHmZIz9EMMZPSeBDez5d0NZsDAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:23.295800Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.18570","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7322855a928b41f6fbcc10fbb68d1f8e50720d9903b163cbbd59d6e3e93e171a","sha256:9e4ee5eac4c7226cb38b7f8604af2d1065e41a85e7ed985d679bd6f396f624ee"],"state_sha256":"b76221d9a937d1935eee5caecda07dde2d3219c8d69e31fd1a355b365cd92bb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHZ6fZxUyM4dHX1kSsgCtbGMdrAfHOrFjEbyCZSK6LXsj1r2UXSZg/x+iOuRfezPc9snJXoSIOZKuJ4xwGvkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T03:23:07.328836Z","bundle_sha256":"20bcf71311c105f1053c3afcc04f1de49ac8d1d0622bd4f56432c5da6b0c912f"}}