{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EO5W5BXAWIN3MK7RPZKOLQBINO","short_pith_number":"pith:EO5W5BXA","canonical_record":{"source":{"id":"1608.00335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T06:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"84a0a64f372340b38c89d9a84b19f7325bcccf78f35a590e52edf8dcac378024","abstract_canon_sha256":"35f0256a0b575f0863d4cc281638aa7ce07fb8e6b35202e67fbea757fa961221"},"schema_version":"1.0"},"canonical_sha256":"23bb6e86e0b21bb62bf17e54e5c0286b99fd2799e0bdf5eb9f2c2e25afc9b1c7","source":{"kind":"arxiv","id":"1608.00335","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00335","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00335v2","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00335","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"pith_short_12","alias_value":"EO5W5BXAWIN3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EO5W5BXAWIN3MK7R","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EO5W5BXA","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EO5W5BXAWIN3MK7RPZKOLQBINO","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T06:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"84a0a64f372340b38c89d9a84b19f7325bcccf78f35a590e52edf8dcac378024","abstract_canon_sha256":"35f0256a0b575f0863d4cc281638aa7ce07fb8e6b35202e67fbea757fa961221"},"schema_version":"1.0"},"canonical_sha256":"23bb6e86e0b21bb62bf17e54e5c0286b99fd2799e0bdf5eb9f2c2e25afc9b1c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:44.128402Z","signature_b64":"gXvbw4Cw5lYnRi/RUddC9Cm8tyvwYx9T8CaJTFAHzGrjgI2zGcqZy+DwODol4uKNUdVFJgGSDiQXIKJCAtxpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23bb6e86e0b21bb62bf17e54e5c0286b99fd2799e0bdf5eb9f2c2e25afc9b1c7","last_reissued_at":"2026-05-18T00:35:44.127788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:44.127788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00335","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-05-18T00:35:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dFyDOR5weBhkw2jq6Zrh78vrQFZ+JduLSucPDPwLikHVJuSI9vPtccfNJsuW5o0njQ64O8CsY93rhzKbm8DmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:29:03.736635Z"},"content_sha256":"1e6ef95d005e3b3402c674d3b2831ade215869563cf1e90a9eedbc30b49b1201","schema_version":"1.0","event_id":"sha256:1e6ef95d005e3b3402c674d3b2831ade215869563cf1e90a9eedbc30b49b1201"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EO5W5BXAWIN3MK7RPZKOLQBINO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A forest building process on simple graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brent Moran, Jay Cummings, Kristin Heysse, Paul Horn, Ruth Luo, Steve Butler, Zhanar Berikkyzy","submitted_at":"2016-08-01T06:58:06Z","abstract_excerpt":"Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a spanning forest of the graph.\n  The probability of obtaining $k$ components in this process for complete bipartite graphs is determined as well as a formula for the expected number of components in any graph. A generic recurrence and some additional basic properties are discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00335","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":""},"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-05-18T00:35:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LouJfhHLnS5MHtn57Me5aNKdS0c93N61DUuCjimF5BOGwioom8Yhjz6GcN5N1JdZBYRyZM2EzBup+peJ8i76Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:29:03.736981Z"},"content_sha256":"7a83b59578f40aefc9ebeccfa268d3f0e88c9a320f5725e61cd23089769b4315","schema_version":"1.0","event_id":"sha256:7a83b59578f40aefc9ebeccfa268d3f0e88c9a320f5725e61cd23089769b4315"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/bundle.json","state_url":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/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-06-03T11:29:03Z","links":{"resolver":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO","bundle":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/bundle.json","state":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EO5W5BXAWIN3MK7RPZKOLQBINO","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":"35f0256a0b575f0863d4cc281638aa7ce07fb8e6b35202e67fbea757fa961221","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T06:58:06Z","title_canon_sha256":"84a0a64f372340b38c89d9a84b19f7325bcccf78f35a590e52edf8dcac378024"},"schema_version":"1.0","source":{"id":"1608.00335","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00335","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00335v2","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00335","created_at":"2026-05-18T00:35:44Z"},{"alias_kind":"pith_short_12","alias_value":"EO5W5BXAWIN3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EO5W5BXAWIN3MK7R","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EO5W5BXA","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:7a83b59578f40aefc9ebeccfa268d3f0e88c9a320f5725e61cd23089769b4315","target":"graph","created_at":"2026-05-18T00:35:44Z","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"},"paper":{"abstract_excerpt":"Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a spanning forest of the graph.\n  The probability of obtaining $k$ components in this process for complete bipartite graphs is determined as well as a formula for the expected number of components in any graph. A generic recurrence and some additional basic properties are discussed.","authors_text":"Brent Moran, Jay Cummings, Kristin Heysse, Paul Horn, Ruth Luo, Steve Butler, Zhanar Berikkyzy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T06:58:06Z","title":"A forest building process on simple graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00335","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:1e6ef95d005e3b3402c674d3b2831ade215869563cf1e90a9eedbc30b49b1201","target":"record","created_at":"2026-05-18T00:35:44Z","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":"35f0256a0b575f0863d4cc281638aa7ce07fb8e6b35202e67fbea757fa961221","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-01T06:58:06Z","title_canon_sha256":"84a0a64f372340b38c89d9a84b19f7325bcccf78f35a590e52edf8dcac378024"},"schema_version":"1.0","source":{"id":"1608.00335","kind":"arxiv","version":2}},"canonical_sha256":"23bb6e86e0b21bb62bf17e54e5c0286b99fd2799e0bdf5eb9f2c2e25afc9b1c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23bb6e86e0b21bb62bf17e54e5c0286b99fd2799e0bdf5eb9f2c2e25afc9b1c7","first_computed_at":"2026-05-18T00:35:44.127788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:44.127788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gXvbw4Cw5lYnRi/RUddC9Cm8tyvwYx9T8CaJTFAHzGrjgI2zGcqZy+DwODol4uKNUdVFJgGSDiQXIKJCAtxpCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:44.128402Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00335","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e6ef95d005e3b3402c674d3b2831ade215869563cf1e90a9eedbc30b49b1201","sha256:7a83b59578f40aefc9ebeccfa268d3f0e88c9a320f5725e61cd23089769b4315"],"state_sha256":"bd6c11fcdf89aa4503dcd0d5c8562432c5b8f4d89717a7f4a45da33239ea5c7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5p82HTNS9hDKpeTyvW31O5Wr6bpoqL2arzrMAEboUPQ6LTaLcukRuPsW48kZNA3L7SfLW7EB6TvTnWgCeGKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:29:03.738949Z","bundle_sha256":"2ec0a6d7ec6636e179ddba1577d030bf0080a3aa6a70d774b16ebf9037751410"}}