{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YAH7LPICRJYFQ4Z5ED57RAXY4L","short_pith_number":"pith:YAH7LPIC","schema_version":"1.0","canonical_sha256":"c00ff5bd028a7058733d20fbf882f8e2db52bd9085af456277d04073eb0bfb07","source":{"kind":"arxiv","id":"1204.5834","version":2},"attestation_state":"computed","paper":{"title":"Efficient Generation \\epsilon-close to G(n,p) and Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonio Blanca, Milena Mihail","submitted_at":"2012-04-26T06:06:52Z","abstract_excerpt":"We give an efficient algorithm to generate a graph from a distribution $\\epsilon$-close to $G(n,p)$, in the sense of total variation distance. In particular, if $p$ is represented with $O(\\log n)$-bit accuracy, then, with high probability, the running time is linear in the expected number of edges of the output graph (up to poly-logarithmic factors). All our running times include the complexity of the arithmetic involved in the corresponding algorithms. Previous standard methods for exact $G(n,p)$ sampling (see e.g. Batagelj and Brandes, 2005) achieve similar running times, however, under the "},"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":"1204.5834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-26T06:06:52Z","cross_cats_sorted":[],"title_canon_sha256":"5e0597cf372a9d280ce4c1f7ba92084be37643e6e2c0de1bc03bb388103ac286","abstract_canon_sha256":"43f56a01f1a396da50b2e23ee59aa2c15cf5d3c996cfe069ad9e83b35f98b583"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:13.963421Z","signature_b64":"ZZe9go78qAqqiOKdZke980Zt1OQD+XqBFTFOiIZtd32pSZ31kuj8pSJ/+59qszzQbxds9zRSRmFIfmoKFWmYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c00ff5bd028a7058733d20fbf882f8e2db52bd9085af456277d04073eb0bfb07","last_reissued_at":"2026-05-18T03:51:13.962666Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:13.962666Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Generation \\epsilon-close to G(n,p) and Generalizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonio Blanca, Milena Mihail","submitted_at":"2012-04-26T06:06:52Z","abstract_excerpt":"We give an efficient algorithm to generate a graph from a distribution $\\epsilon$-close to $G(n,p)$, in the sense of total variation distance. In particular, if $p$ is represented with $O(\\log n)$-bit accuracy, then, with high probability, the running time is linear in the expected number of edges of the output graph (up to poly-logarithmic factors). All our running times include the complexity of the arithmetic involved in the corresponding algorithms. Previous standard methods for exact $G(n,p)$ sampling (see e.g. Batagelj and Brandes, 2005) achieve similar running times, however, under the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5834","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":"1204.5834","created_at":"2026-05-18T03:51:13.962792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.5834v2","created_at":"2026-05-18T03:51:13.962792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.5834","created_at":"2026-05-18T03:51:13.962792+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAH7LPICRJYF","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAH7LPICRJYFQ4Z5","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAH7LPIC","created_at":"2026-05-18T12:27:27.928770+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/YAH7LPICRJYFQ4Z5ED57RAXY4L","json":"https://pith.science/pith/YAH7LPICRJYFQ4Z5ED57RAXY4L.json","graph_json":"https://pith.science/api/pith-number/YAH7LPICRJYFQ4Z5ED57RAXY4L/graph.json","events_json":"https://pith.science/api/pith-number/YAH7LPICRJYFQ4Z5ED57RAXY4L/events.json","paper":"https://pith.science/paper/YAH7LPIC"},"agent_actions":{"view_html":"https://pith.science/pith/YAH7LPICRJYFQ4Z5ED57RAXY4L","download_json":"https://pith.science/pith/YAH7LPICRJYFQ4Z5ED57RAXY4L.json","view_paper":"https://pith.science/paper/YAH7LPIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.5834&json=true","fetch_graph":"https://pith.science/api/pith-number/YAH7LPICRJYFQ4Z5ED57RAXY4L/graph.json","fetch_events":"https://pith.science/api/pith-number/YAH7LPICRJYFQ4Z5ED57RAXY4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAH7LPICRJYFQ4Z5ED57RAXY4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAH7LPICRJYFQ4Z5ED57RAXY4L/action/storage_attestation","attest_author":"https://pith.science/pith/YAH7LPICRJYFQ4Z5ED57RAXY4L/action/author_attestation","sign_citation":"https://pith.science/pith/YAH7LPICRJYFQ4Z5ED57RAXY4L/action/citation_signature","submit_replication":"https://pith.science/pith/YAH7LPICRJYFQ4Z5ED57RAXY4L/action/replication_record"}},"created_at":"2026-05-18T03:51:13.962792+00:00","updated_at":"2026-05-18T03:51:13.962792+00:00"}