{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RWGCIUKBBKEKFZT5O7OCR5OHFO","short_pith_number":"pith:RWGCIUKB","canonical_record":{"source":{"id":"1305.1675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T23:05:25Z","cross_cats_sorted":[],"title_canon_sha256":"5f3856192d584697aed5fe146d42259ef5eac40c875ebd021f119b4f95ec6b4d","abstract_canon_sha256":"5d4101f212f7cd2bf5edf75fb1d3a0407ac60c77ff32bd7fe8b708f6eea69b21"},"schema_version":"1.0"},"canonical_sha256":"8d8c2451410a88a2e67d77dc28f5c72b9c4486e55131171cf29efe4e28fdf610","source":{"kind":"arxiv","id":"1305.1675","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1675","created_at":"2026-05-18T02:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1675v2","created_at":"2026-05-18T02:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1675","created_at":"2026-05-18T02:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"RWGCIUKBBKEK","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RWGCIUKBBKEKFZT5","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RWGCIUKB","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RWGCIUKBBKEKFZT5O7OCR5OHFO","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T23:05:25Z","cross_cats_sorted":[],"title_canon_sha256":"5f3856192d584697aed5fe146d42259ef5eac40c875ebd021f119b4f95ec6b4d","abstract_canon_sha256":"5d4101f212f7cd2bf5edf75fb1d3a0407ac60c77ff32bd7fe8b708f6eea69b21"},"schema_version":"1.0"},"canonical_sha256":"8d8c2451410a88a2e67d77dc28f5c72b9c4486e55131171cf29efe4e28fdf610","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:00.944026Z","signature_b64":"H+YoJR+Y7JI39F8UcxhSSBp8eBRKwYCRDtCdGsaH1OFQfdB6ZOHXziDY3dq7F2XhsSHgXMWNVpJwueg+0GEiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d8c2451410a88a2e67d77dc28f5c72b9c4486e55131171cf29efe4e28fdf610","last_reissued_at":"2026-05-18T02:50:00.943519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:00.943519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1675","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-18T02:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HADf7dvNGYcSgUcEFWQLshXrKvt+yAPsrtFiab3XGeZ8Cx/PmD52bKjklCJ7xSxTKSaPsmDg7Kh1pGIBB25BBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:38:52.578071Z"},"content_sha256":"2fc497c086d78698dc12ff7f6acec57f70199c4691069bd51a022bd15eae7867","schema_version":"1.0","event_id":"sha256:2fc497c086d78698dc12ff7f6acec57f70199c4691069bd51a022bd15eae7867"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RWGCIUKBBKEKFZT5O7OCR5OHFO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the acquaintance time of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. Mitsche, P. Pralat, W. Kinnersley","submitted_at":"2013-05-07T23:05:25Z","abstract_excerpt":"In this short note, we prove the conjecture of Benjamini, Shinkar, and Tsur on the acquaintance time $AC(G)$ of a random graph $G \\in G(n,p)$. It is shown that asymptotically almost surely $AC(G) = O(\\log n / p)$ for $G \\in G(n,p)$, provided that $pn > (1+\\epsilon) \\log n$ for some $\\epsilon > 0$ (slightly above the threshold for connectivity). Moreover, we show a matching lower bound for dense random graphs, which also implies that asymptotically almost surely $K_n$ cannot be covered with $o(\\log n / p)$ copies of a random graph $G \\in G(n,p)$, provided that $pn > n^{1/2+\\epsilon}$ and $p < 1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1675","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-18T02:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEZeV08BAkhp5zZbbpiFLoZyfAc2R0FDq1BBnNr4ILbTZetoSo9vhAtJoYHZuVskr1/ymoN2+1PFb51UFoZBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:38:52.578429Z"},"content_sha256":"8fafc61bb7b5d5bd85927270d5261c5bc2ca4e0c6ebea684be3d80de818a6f70","schema_version":"1.0","event_id":"sha256:8fafc61bb7b5d5bd85927270d5261c5bc2ca4e0c6ebea684be3d80de818a6f70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWGCIUKBBKEKFZT5O7OCR5OHFO/bundle.json","state_url":"https://pith.science/pith/RWGCIUKBBKEKFZT5O7OCR5OHFO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWGCIUKBBKEKFZT5O7OCR5OHFO/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-07-01T18:38:52Z","links":{"resolver":"https://pith.science/pith/RWGCIUKBBKEKFZT5O7OCR5OHFO","bundle":"https://pith.science/pith/RWGCIUKBBKEKFZT5O7OCR5OHFO/bundle.json","state":"https://pith.science/pith/RWGCIUKBBKEKFZT5O7OCR5OHFO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWGCIUKBBKEKFZT5O7OCR5OHFO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RWGCIUKBBKEKFZT5O7OCR5OHFO","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":"5d4101f212f7cd2bf5edf75fb1d3a0407ac60c77ff32bd7fe8b708f6eea69b21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T23:05:25Z","title_canon_sha256":"5f3856192d584697aed5fe146d42259ef5eac40c875ebd021f119b4f95ec6b4d"},"schema_version":"1.0","source":{"id":"1305.1675","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1675","created_at":"2026-05-18T02:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1675v2","created_at":"2026-05-18T02:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1675","created_at":"2026-05-18T02:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"RWGCIUKBBKEK","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RWGCIUKBBKEKFZT5","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RWGCIUKB","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:8fafc61bb7b5d5bd85927270d5261c5bc2ca4e0c6ebea684be3d80de818a6f70","target":"graph","created_at":"2026-05-18T02:50:00Z","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":"In this short note, we prove the conjecture of Benjamini, Shinkar, and Tsur on the acquaintance time $AC(G)$ of a random graph $G \\in G(n,p)$. It is shown that asymptotically almost surely $AC(G) = O(\\log n / p)$ for $G \\in G(n,p)$, provided that $pn > (1+\\epsilon) \\log n$ for some $\\epsilon > 0$ (slightly above the threshold for connectivity). Moreover, we show a matching lower bound for dense random graphs, which also implies that asymptotically almost surely $K_n$ cannot be covered with $o(\\log n / p)$ copies of a random graph $G \\in G(n,p)$, provided that $pn > n^{1/2+\\epsilon}$ and $p < 1","authors_text":"D. Mitsche, P. Pralat, W. Kinnersley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T23:05:25Z","title":"A note on the acquaintance time of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1675","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:2fc497c086d78698dc12ff7f6acec57f70199c4691069bd51a022bd15eae7867","target":"record","created_at":"2026-05-18T02:50:00Z","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":"5d4101f212f7cd2bf5edf75fb1d3a0407ac60c77ff32bd7fe8b708f6eea69b21","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T23:05:25Z","title_canon_sha256":"5f3856192d584697aed5fe146d42259ef5eac40c875ebd021f119b4f95ec6b4d"},"schema_version":"1.0","source":{"id":"1305.1675","kind":"arxiv","version":2}},"canonical_sha256":"8d8c2451410a88a2e67d77dc28f5c72b9c4486e55131171cf29efe4e28fdf610","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d8c2451410a88a2e67d77dc28f5c72b9c4486e55131171cf29efe4e28fdf610","first_computed_at":"2026-05-18T02:50:00.943519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:00.943519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H+YoJR+Y7JI39F8UcxhSSBp8eBRKwYCRDtCdGsaH1OFQfdB6ZOHXziDY3dq7F2XhsSHgXMWNVpJwueg+0GEiAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:00.944026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1675","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fc497c086d78698dc12ff7f6acec57f70199c4691069bd51a022bd15eae7867","sha256:8fafc61bb7b5d5bd85927270d5261c5bc2ca4e0c6ebea684be3d80de818a6f70"],"state_sha256":"640162cb06cb551c03895b26525f88650dd1233422d5ce04445e5de65fa5dc29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6S0bawQ1noqZtdGI9IFrdPfw31877A3aCV9w7LHk+tc+aY3vIXE72ed+1fRqicH+vaZqv16DJFx2CYGoNYEtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T18:38:52.580323Z","bundle_sha256":"666849b176353f45d6c435c1d4be3f601612c5cc1cd343023de62fa81718fb29"}}