{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QSVX7UYF4CRNP3X7KORWUEKAFT","short_pith_number":"pith:QSVX7UYF","schema_version":"1.0","canonical_sha256":"84ab7fd305e0a2d7eeff53a36a11402cd76e64d1f92edc04bb676e14c244528f","source":{"kind":"arxiv","id":"1402.2854","version":2},"attestation_state":"computed","paper":{"title":"The Total Acquisition Number of Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Deepak Bal, Patrick Bennett, Pawe{\\l} Pra{\\l}at","submitted_at":"2014-02-12T15:37:34Z","abstract_excerpt":"Let $G$ be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex $u$ can be moved to a neighbouring vertex $v$, provided that the weight on $v$ is at least as large as the weight on $u$. The total acquisition number of $G$, denoted by $a_t(G)$, is the minimum possible size of the set of vertices with positive weight at the end of the process. LeSaulnier, Prince, Wenger, West, and Worah asked for the minimum value of $p=p(n)$ such that $a_t(\\mathcal{G}(n,p)) = 1$ with high probability, where $\\mathcal{G}(n,p)$ is a binomial random graph. We show that $p = \\"},"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":"1402.2854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-12T15:37:34Z","cross_cats_sorted":[],"title_canon_sha256":"8397ef816acb0637062f39b09cefc98da7211db2160bdc3b76aaec1db0304a22","abstract_canon_sha256":"dd5c635d4e7cf10c16d08a41016505db8c2262d7f72f6860f81af807ad060bd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:09.556190Z","signature_b64":"qrsBgLeaol3XKzFQOuEicq3Iauey21hlZ16ujH53zB0IJ6qySCC8uEuhWx0RB/t0FT046s+Vp1TDzw28gdgKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84ab7fd305e0a2d7eeff53a36a11402cd76e64d1f92edc04bb676e14c244528f","last_reissued_at":"2026-05-18T01:53:09.555710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:09.555710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Total Acquisition Number of Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Dudek, Deepak Bal, Patrick Bennett, Pawe{\\l} Pra{\\l}at","submitted_at":"2014-02-12T15:37:34Z","abstract_excerpt":"Let $G$ be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex $u$ can be moved to a neighbouring vertex $v$, provided that the weight on $v$ is at least as large as the weight on $u$. The total acquisition number of $G$, denoted by $a_t(G)$, is the minimum possible size of the set of vertices with positive weight at the end of the process. LeSaulnier, Prince, Wenger, West, and Worah asked for the minimum value of $p=p(n)$ such that $a_t(\\mathcal{G}(n,p)) = 1$ with high probability, where $\\mathcal{G}(n,p)$ is a binomial random graph. We show that $p = \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2854","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":"1402.2854","created_at":"2026-05-18T01:53:09.555795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.2854v2","created_at":"2026-05-18T01:53:09.555795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2854","created_at":"2026-05-18T01:53:09.555795+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSVX7UYF4CRN","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSVX7UYF4CRNP3X7","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSVX7UYF","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/QSVX7UYF4CRNP3X7KORWUEKAFT","json":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT.json","graph_json":"https://pith.science/api/pith-number/QSVX7UYF4CRNP3X7KORWUEKAFT/graph.json","events_json":"https://pith.science/api/pith-number/QSVX7UYF4CRNP3X7KORWUEKAFT/events.json","paper":"https://pith.science/paper/QSVX7UYF"},"agent_actions":{"view_html":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT","download_json":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT.json","view_paper":"https://pith.science/paper/QSVX7UYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.2854&json=true","fetch_graph":"https://pith.science/api/pith-number/QSVX7UYF4CRNP3X7KORWUEKAFT/graph.json","fetch_events":"https://pith.science/api/pith-number/QSVX7UYF4CRNP3X7KORWUEKAFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/action/storage_attestation","attest_author":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/action/author_attestation","sign_citation":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/action/citation_signature","submit_replication":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/action/replication_record"}},"created_at":"2026-05-18T01:53:09.555795+00:00","updated_at":"2026-05-18T01:53:09.555795+00:00"}