{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QSVX7UYF4CRNP3X7KORWUEKAFT","short_pith_number":"pith:QSVX7UYF","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"},"canonical_sha256":"84ab7fd305e0a2d7eeff53a36a11402cd76e64d1f92edc04bb676e14c244528f","source":{"kind":"arxiv","id":"1402.2854","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2854","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2854v2","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2854","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"QSVX7UYF4CRN","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QSVX7UYF4CRNP3X7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QSVX7UYF","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QSVX7UYF4CRNP3X7KORWUEKAFT","target":"record","payload":{"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"},"canonical_sha256":"84ab7fd305e0a2d7eeff53a36a11402cd76e64d1f92edc04bb676e14c244528f","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"},"source_kind":"arxiv","source_id":"1402.2854","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-18T01:53:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69w1aJCvlVI64lsNv8Sa3jrR5OV+cHzc+3S4k8w9ehzB4aivmRZlysQhvGoatSyFvkB5euGB8RDAIMpdi8NfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:17:25.397283Z"},"content_sha256":"96a60bc757a56395c135c3edbb9424e346a35e4037d45e60b4142110c2e70d71","schema_version":"1.0","event_id":"sha256:96a60bc757a56395c135c3edbb9424e346a35e4037d45e60b4142110c2e70d71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QSVX7UYF4CRNP3X7KORWUEKAFT","target":"graph","payload":{"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"},"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-18T01:53:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgQK83XRk0Oh1D3dtyFGq6w2tA/U2fi+XkkT9LniFaZlxDJmrGERZUq8OqR4LD5tjQIFP/aqh7Voq49qsiW0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:17:25.397649Z"},"content_sha256":"1df63c9b4ec61dfefc72367a8f1d01eb78ced19538d24fb6ea5d1d5c916ba66f","schema_version":"1.0","event_id":"sha256:1df63c9b4ec61dfefc72367a8f1d01eb78ced19538d24fb6ea5d1d5c916ba66f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/bundle.json","state_url":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/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-02T22:17:25Z","links":{"resolver":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT","bundle":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/bundle.json","state":"https://pith.science/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSVX7UYF4CRNP3X7KORWUEKAFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QSVX7UYF4CRNP3X7KORWUEKAFT","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":"dd5c635d4e7cf10c16d08a41016505db8c2262d7f72f6860f81af807ad060bd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-12T15:37:34Z","title_canon_sha256":"8397ef816acb0637062f39b09cefc98da7211db2160bdc3b76aaec1db0304a22"},"schema_version":"1.0","source":{"id":"1402.2854","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2854","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2854v2","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2854","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"QSVX7UYF4CRN","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QSVX7UYF4CRNP3X7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QSVX7UYF","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:1df63c9b4ec61dfefc72367a8f1d01eb78ced19538d24fb6ea5d1d5c916ba66f","target":"graph","created_at":"2026-05-18T01:53:09Z","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":"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 = \\","authors_text":"Andrzej Dudek, Deepak Bal, Patrick Bennett, Pawe{\\l} Pra{\\l}at","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-12T15:37:34Z","title":"The Total Acquisition Number of Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2854","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:96a60bc757a56395c135c3edbb9424e346a35e4037d45e60b4142110c2e70d71","target":"record","created_at":"2026-05-18T01:53:09Z","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":"dd5c635d4e7cf10c16d08a41016505db8c2262d7f72f6860f81af807ad060bd3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-12T15:37:34Z","title_canon_sha256":"8397ef816acb0637062f39b09cefc98da7211db2160bdc3b76aaec1db0304a22"},"schema_version":"1.0","source":{"id":"1402.2854","kind":"arxiv","version":2}},"canonical_sha256":"84ab7fd305e0a2d7eeff53a36a11402cd76e64d1f92edc04bb676e14c244528f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84ab7fd305e0a2d7eeff53a36a11402cd76e64d1f92edc04bb676e14c244528f","first_computed_at":"2026-05-18T01:53:09.555710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:53:09.555710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qrsBgLeaol3XKzFQOuEicq3Iauey21hlZ16ujH53zB0IJ6qySCC8uEuhWx0RB/t0FT046s+Vp1TDzw28gdgKBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:53:09.556190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2854","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96a60bc757a56395c135c3edbb9424e346a35e4037d45e60b4142110c2e70d71","sha256:1df63c9b4ec61dfefc72367a8f1d01eb78ced19538d24fb6ea5d1d5c916ba66f"],"state_sha256":"153985e63e5ad159470ab10b2bd9191812848da7c10712152178612f2c34703f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzUtqRkIl6Ipqt4v1A8/jsN94yLHwOVbRdqNQt68PcsOQjBAjOnYRDiZCyv1Bi4goBm67TfnRpuMfgyuhrW+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:17:25.399629Z","bundle_sha256":"b8473e96cbac04ebc9af9b848d459bd560bded7880a1806bdae432f9a3b25f8b"}}