{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EO5W5BXAWIN3MK7RPZKOLQBINO","short_pith_number":"pith:EO5W5BXA","schema_version":"1.0","canonical_sha256":"23bb6e86e0b21bb62bf17e54e5c0286b99fd2799e0bdf5eb9f2c2e25afc9b1c7","source":{"kind":"arxiv","id":"1608.00335","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.00335","created_at":"2026-05-18T00:35:44.127906+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00335v2","created_at":"2026-05-18T00:35:44.127906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00335","created_at":"2026-05-18T00:35:44.127906+00:00"},{"alias_kind":"pith_short_12","alias_value":"EO5W5BXAWIN3","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EO5W5BXAWIN3MK7R","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EO5W5BXA","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO","json":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO.json","graph_json":"https://pith.science/api/pith-number/EO5W5BXAWIN3MK7RPZKOLQBINO/graph.json","events_json":"https://pith.science/api/pith-number/EO5W5BXAWIN3MK7RPZKOLQBINO/events.json","paper":"https://pith.science/paper/EO5W5BXA"},"agent_actions":{"view_html":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO","download_json":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO.json","view_paper":"https://pith.science/paper/EO5W5BXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00335&json=true","fetch_graph":"https://pith.science/api/pith-number/EO5W5BXAWIN3MK7RPZKOLQBINO/graph.json","fetch_events":"https://pith.science/api/pith-number/EO5W5BXAWIN3MK7RPZKOLQBINO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/action/storage_attestation","attest_author":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/action/author_attestation","sign_citation":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/action/citation_signature","submit_replication":"https://pith.science/pith/EO5W5BXAWIN3MK7RPZKOLQBINO/action/replication_record"}},"created_at":"2026-05-18T00:35:44.127906+00:00","updated_at":"2026-05-18T00:35:44.127906+00:00"}