{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HGH55ZC4H4FSQ6KGVQA2FF3W5O","short_pith_number":"pith:HGH55ZC4","schema_version":"1.0","canonical_sha256":"398fdee45c3f0b287946ac01a29776eba75d6ebe7bd68afa58a5fd31efdfff1f","source":{"kind":"arxiv","id":"1709.03438","version":1},"attestation_state":"computed","paper":{"title":"Coin-flipping, ball-dropping, and grass-hopping for generating random graphs from matrices of edge probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.SI","authors_text":"Arjun S. Ramani, David F. Gleich, Nicole Eikmeier","submitted_at":"2017-09-11T15:32:37Z","abstract_excerpt":"Common models for random graphs, such as Erd\\H{o}s-R\\'{e}nyi and Kronecker graphs, correspond to generating random adjacency matrices where each entry is non-zero based on a large matrix of probabilities. Generating an instance of a random graph based on these models is easy, although inefficient, by flipping biased coins (i.e. sampling binomial random variables) for each possible edge. This process is inefficient because most large graph models correspond to sparse graphs where the vast majority of coin flips will result in no edges. We describe some not-entirely-well-known, but not-entirely-"},"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":"1709.03438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-11T15:32:37Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"8e4f5a6b325bed21c0524cb60e6e02ded148b7055407918fcd5e55392e01a9d7","abstract_canon_sha256":"2368b088eee6b4af7d0b0c99e37e8ca85d84c0da29541734e7bf4b14c560759a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:15.836959Z","signature_b64":"w0AXODd86LnmdYFL7c5X6ieuqtLkcL26yvvtX2cOafofuGWFqeFoO3hnXFUpTzyoJSO9Oa/sFINGZxikCniQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"398fdee45c3f0b287946ac01a29776eba75d6ebe7bd68afa58a5fd31efdfff1f","last_reissued_at":"2026-05-18T00:35:15.836365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:15.836365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coin-flipping, ball-dropping, and grass-hopping for generating random graphs from matrices of edge probabilities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.SI","authors_text":"Arjun S. Ramani, David F. Gleich, Nicole Eikmeier","submitted_at":"2017-09-11T15:32:37Z","abstract_excerpt":"Common models for random graphs, such as Erd\\H{o}s-R\\'{e}nyi and Kronecker graphs, correspond to generating random adjacency matrices where each entry is non-zero based on a large matrix of probabilities. Generating an instance of a random graph based on these models is easy, although inefficient, by flipping biased coins (i.e. sampling binomial random variables) for each possible edge. This process is inefficient because most large graph models correspond to sparse graphs where the vast majority of coin flips will result in no edges. We describe some not-entirely-well-known, but not-entirely-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03438","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":"1709.03438","created_at":"2026-05-18T00:35:15.836452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03438v1","created_at":"2026-05-18T00:35:15.836452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03438","created_at":"2026-05-18T00:35:15.836452+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGH55ZC4H4FS","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGH55ZC4H4FSQ6KG","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGH55ZC4","created_at":"2026-05-18T12:31:18.294218+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/HGH55ZC4H4FSQ6KGVQA2FF3W5O","json":"https://pith.science/pith/HGH55ZC4H4FSQ6KGVQA2FF3W5O.json","graph_json":"https://pith.science/api/pith-number/HGH55ZC4H4FSQ6KGVQA2FF3W5O/graph.json","events_json":"https://pith.science/api/pith-number/HGH55ZC4H4FSQ6KGVQA2FF3W5O/events.json","paper":"https://pith.science/paper/HGH55ZC4"},"agent_actions":{"view_html":"https://pith.science/pith/HGH55ZC4H4FSQ6KGVQA2FF3W5O","download_json":"https://pith.science/pith/HGH55ZC4H4FSQ6KGVQA2FF3W5O.json","view_paper":"https://pith.science/paper/HGH55ZC4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03438&json=true","fetch_graph":"https://pith.science/api/pith-number/HGH55ZC4H4FSQ6KGVQA2FF3W5O/graph.json","fetch_events":"https://pith.science/api/pith-number/HGH55ZC4H4FSQ6KGVQA2FF3W5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGH55ZC4H4FSQ6KGVQA2FF3W5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGH55ZC4H4FSQ6KGVQA2FF3W5O/action/storage_attestation","attest_author":"https://pith.science/pith/HGH55ZC4H4FSQ6KGVQA2FF3W5O/action/author_attestation","sign_citation":"https://pith.science/pith/HGH55ZC4H4FSQ6KGVQA2FF3W5O/action/citation_signature","submit_replication":"https://pith.science/pith/HGH55ZC4H4FSQ6KGVQA2FF3W5O/action/replication_record"}},"created_at":"2026-05-18T00:35:15.836452+00:00","updated_at":"2026-05-18T00:35:15.836452+00:00"}