{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QI7QGB2RBZM7VC2PUGVLU3JMNG","short_pith_number":"pith:QI7QGB2R","schema_version":"1.0","canonical_sha256":"823f0307510e59fa8b4fa1aaba6d2c69aff6df4b107af883311915c13094fbf2","source":{"kind":"arxiv","id":"1410.3405","version":1},"attestation_state":"computed","paper":{"title":"Power of $k$ choices and rainbow spanning trees in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Deepak Bal, Patrick Bennett, Pawe{\\l} Pra{\\l}at","submitted_at":"2014-10-13T17:35:06Z","abstract_excerpt":"We consider the Erd\\H{o}s-R\\'enyi random graph process, which is a stochastic process that starts with $n$ vertices and no edges, and at each step adds one new edge chosen uniformly at random from the set of missing edges. Let $\\mathcal{G}(n,m)$ be a graph with $m$ edges obtained after $m$ steps of this process. Each edge $e_i$ ($i=1,2,..., m$) of $\\mathcal{G}(n,m)$ independently chooses precisely $k \\in \\mathbb{N}$ colours, uniformly at random, from a given set of $n-1$ colours (one may view $e_i$ as a multi-edge). We stop the process prematurely at time $M$ when the following two events hold"},"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":"1410.3405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-13T17:35:06Z","cross_cats_sorted":[],"title_canon_sha256":"321205d0c661f72fefb2d15d83488b6d88364987a95bca54f147b33698cf085d","abstract_canon_sha256":"d8d01ed6ae87240be7b630a16ea7ec56b1925022c6bfe85272d4c1e176422590"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:11.397386Z","signature_b64":"+I1jEe2SFMkG0rWMeckEJOutoPVhmgLqOAXZr4VVpnN7yYtyglrTIAEQh7DFiF9MmdDgnADkwYaJvAUfRh+NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823f0307510e59fa8b4fa1aaba6d2c69aff6df4b107af883311915c13094fbf2","last_reissued_at":"2026-05-18T02:40:11.396865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:11.396865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Power of $k$ choices and rainbow spanning trees in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Deepak Bal, Patrick Bennett, Pawe{\\l} Pra{\\l}at","submitted_at":"2014-10-13T17:35:06Z","abstract_excerpt":"We consider the Erd\\H{o}s-R\\'enyi random graph process, which is a stochastic process that starts with $n$ vertices and no edges, and at each step adds one new edge chosen uniformly at random from the set of missing edges. Let $\\mathcal{G}(n,m)$ be a graph with $m$ edges obtained after $m$ steps of this process. Each edge $e_i$ ($i=1,2,..., m$) of $\\mathcal{G}(n,m)$ independently chooses precisely $k \\in \\mathbb{N}$ colours, uniformly at random, from a given set of $n-1$ colours (one may view $e_i$ as a multi-edge). We stop the process prematurely at time $M$ when the following two events hold"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3405","kind":"arxiv","version":1},"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":"1410.3405","created_at":"2026-05-18T02:40:11.396943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3405v1","created_at":"2026-05-18T02:40:11.396943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3405","created_at":"2026-05-18T02:40:11.396943+00:00"},{"alias_kind":"pith_short_12","alias_value":"QI7QGB2RBZM7","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QI7QGB2RBZM7VC2P","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QI7QGB2R","created_at":"2026-05-18T12:28:46.137349+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/QI7QGB2RBZM7VC2PUGVLU3JMNG","json":"https://pith.science/pith/QI7QGB2RBZM7VC2PUGVLU3JMNG.json","graph_json":"https://pith.science/api/pith-number/QI7QGB2RBZM7VC2PUGVLU3JMNG/graph.json","events_json":"https://pith.science/api/pith-number/QI7QGB2RBZM7VC2PUGVLU3JMNG/events.json","paper":"https://pith.science/paper/QI7QGB2R"},"agent_actions":{"view_html":"https://pith.science/pith/QI7QGB2RBZM7VC2PUGVLU3JMNG","download_json":"https://pith.science/pith/QI7QGB2RBZM7VC2PUGVLU3JMNG.json","view_paper":"https://pith.science/paper/QI7QGB2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3405&json=true","fetch_graph":"https://pith.science/api/pith-number/QI7QGB2RBZM7VC2PUGVLU3JMNG/graph.json","fetch_events":"https://pith.science/api/pith-number/QI7QGB2RBZM7VC2PUGVLU3JMNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QI7QGB2RBZM7VC2PUGVLU3JMNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QI7QGB2RBZM7VC2PUGVLU3JMNG/action/storage_attestation","attest_author":"https://pith.science/pith/QI7QGB2RBZM7VC2PUGVLU3JMNG/action/author_attestation","sign_citation":"https://pith.science/pith/QI7QGB2RBZM7VC2PUGVLU3JMNG/action/citation_signature","submit_replication":"https://pith.science/pith/QI7QGB2RBZM7VC2PUGVLU3JMNG/action/replication_record"}},"created_at":"2026-05-18T02:40:11.396943+00:00","updated_at":"2026-05-18T02:40:11.396943+00:00"}