{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:256CY2KBGA5DCBJLVVMXVEV7FI","short_pith_number":"pith:256CY2KB","canonical_record":{"source":{"id":"1701.06208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T19:15:50Z","cross_cats_sorted":[],"title_canon_sha256":"2e83c11509c14f56a97189da43b1c1ce44b4e409a960b89f9d9a032081c5e2ca","abstract_canon_sha256":"2039f5b3428e85219e2bfd1a3efde69914f4c7482533c7b88e6efa9d88534c10"},"schema_version":"1.0"},"canonical_sha256":"d77c2c6941303a31052bad597a92bf2a1a59692550c86ad900ab28b3b747cc6a","source":{"kind":"arxiv","id":"1701.06208","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06208","created_at":"2026-07-05T00:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06208v3","created_at":"2026-07-05T00:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06208","created_at":"2026-07-05T00:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"256CY2KBGA5D","created_at":"2026-07-05T00:40:33Z"},{"alias_kind":"pith_short_16","alias_value":"256CY2KBGA5DCBJL","created_at":"2026-07-05T00:40:33Z"},{"alias_kind":"pith_short_8","alias_value":"256CY2KB","created_at":"2026-07-05T00:40:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:256CY2KBGA5DCBJLVVMXVEV7FI","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T19:15:50Z","cross_cats_sorted":[],"title_canon_sha256":"2e83c11509c14f56a97189da43b1c1ce44b4e409a960b89f9d9a032081c5e2ca","abstract_canon_sha256":"2039f5b3428e85219e2bfd1a3efde69914f4c7482533c7b88e6efa9d88534c10"},"schema_version":"1.0"},"canonical_sha256":"d77c2c6941303a31052bad597a92bf2a1a59692550c86ad900ab28b3b747cc6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:33.886382Z","signature_b64":"ndJ58sQQCntWywjuOemv5RWpuJElyy/egf0+AUCWSks+bCsyBESpk1BS7Plcpd4rcK1OQBS2PsQuUlsLefJWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d77c2c6941303a31052bad597a92bf2a1a59692550c86ad900ab28b3b747cc6a","last_reissued_at":"2026-07-05T00:40:33.885996Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:33.885996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06208","source_version":3,"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-05T00:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VI/trYDn0YxcQ5Nx3mGQ+roa7o42W0jyjirW9EJC2BwLph90Q17COFRP2HOltYPgIvcN6thaWmlRFgyQbMxOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:07:13.859166Z"},"content_sha256":"903eaef2c00cd151b35d19999601201f642e86952561196388f8008a67dac4a2","schema_version":"1.0","event_id":"sha256:903eaef2c00cd151b35d19999601201f642e86952561196388f8008a67dac4a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:256CY2KBGA5DCBJLVVMXVEV7FI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Union of Random Trees and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Salmon, Austen James, Daniel Montealegre, Matthew Larson","submitted_at":"2017-01-22T19:15:50Z","abstract_excerpt":"In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this result, and we obtain an explicit rate of convergence. This rate of convergence allows us to show a new upper tail bound on the number of trees in $G(n,p)$, for $p$ a constant not depending on $n$. The number of edges in the union of $k$ random trees is related to moments of the number of spanning trees in $G(n, p)$.\n  As an application, we prove the law of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06208","kind":"arxiv","version":3},"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/1701.06208/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-05T00:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XpvTZVRG9z5XdGgsdO1RdQFQikZiKctttvwfpiziPbZmetCeMAraXUMAnXwsBgJygwWbrWiTpy3TsPTsgpUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:07:13.859555Z"},"content_sha256":"13511746e55df9b57482a6e83bc5779f4ffa12afea6d012728e1f0c20d11f23e","schema_version":"1.0","event_id":"sha256:13511746e55df9b57482a6e83bc5779f4ffa12afea6d012728e1f0c20d11f23e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/256CY2KBGA5DCBJLVVMXVEV7FI/bundle.json","state_url":"https://pith.science/pith/256CY2KBGA5DCBJLVVMXVEV7FI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/256CY2KBGA5DCBJLVVMXVEV7FI/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-06T19:07:13Z","links":{"resolver":"https://pith.science/pith/256CY2KBGA5DCBJLVVMXVEV7FI","bundle":"https://pith.science/pith/256CY2KBGA5DCBJLVVMXVEV7FI/bundle.json","state":"https://pith.science/pith/256CY2KBGA5DCBJLVVMXVEV7FI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/256CY2KBGA5DCBJLVVMXVEV7FI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:256CY2KBGA5DCBJLVVMXVEV7FI","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":"2039f5b3428e85219e2bfd1a3efde69914f4c7482533c7b88e6efa9d88534c10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T19:15:50Z","title_canon_sha256":"2e83c11509c14f56a97189da43b1c1ce44b4e409a960b89f9d9a032081c5e2ca"},"schema_version":"1.0","source":{"id":"1701.06208","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06208","created_at":"2026-07-05T00:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06208v3","created_at":"2026-07-05T00:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06208","created_at":"2026-07-05T00:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"256CY2KBGA5D","created_at":"2026-07-05T00:40:33Z"},{"alias_kind":"pith_short_16","alias_value":"256CY2KBGA5DCBJL","created_at":"2026-07-05T00:40:33Z"},{"alias_kind":"pith_short_8","alias_value":"256CY2KB","created_at":"2026-07-05T00:40:33Z"}],"graph_snapshots":[{"event_id":"sha256:13511746e55df9b57482a6e83bc5779f4ffa12afea6d012728e1f0c20d11f23e","target":"graph","created_at":"2026-07-05T00:40:33Z","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/1701.06208/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this result, and we obtain an explicit rate of convergence. This rate of convergence allows us to show a new upper tail bound on the number of trees in $G(n,p)$, for $p$ a constant not depending on $n$. The number of edges in the union of $k$ random trees is related to moments of the number of spanning trees in $G(n, p)$.\n  As an application, we prove the law of th","authors_text":"Andrew Salmon, Austen James, Daniel Montealegre, Matthew Larson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T19:15:50Z","title":"Union of Random Trees and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06208","kind":"arxiv","version":3},"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:903eaef2c00cd151b35d19999601201f642e86952561196388f8008a67dac4a2","target":"record","created_at":"2026-07-05T00:40:33Z","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":"2039f5b3428e85219e2bfd1a3efde69914f4c7482533c7b88e6efa9d88534c10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-22T19:15:50Z","title_canon_sha256":"2e83c11509c14f56a97189da43b1c1ce44b4e409a960b89f9d9a032081c5e2ca"},"schema_version":"1.0","source":{"id":"1701.06208","kind":"arxiv","version":3}},"canonical_sha256":"d77c2c6941303a31052bad597a92bf2a1a59692550c86ad900ab28b3b747cc6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d77c2c6941303a31052bad597a92bf2a1a59692550c86ad900ab28b3b747cc6a","first_computed_at":"2026-07-05T00:40:33.885996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:40:33.885996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ndJ58sQQCntWywjuOemv5RWpuJElyy/egf0+AUCWSks+bCsyBESpk1BS7Plcpd4rcK1OQBS2PsQuUlsLefJWAg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:40:33.886382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06208","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:903eaef2c00cd151b35d19999601201f642e86952561196388f8008a67dac4a2","sha256:13511746e55df9b57482a6e83bc5779f4ffa12afea6d012728e1f0c20d11f23e"],"state_sha256":"ee394902483e6130b343a15b709138a3865551eb0dfe33e4d09442363642b052"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HPMTpME0EaLef7UTGRsNSe6dWIZOkof4a49jsVzIDoBTZoihveQHND5YRQXKDJpHqrwz9X0FJDHrmnS7j5qOCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:07:13.861745Z","bundle_sha256":"9995b75909f50ecc17c2f7fcd6f6d10a1771b55cb775303ee13ebb4d06610c13"}}