{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DRLSM6HDBJ3O7I4QYP4ZVSVXFA","short_pith_number":"pith:DRLSM6HD","schema_version":"1.0","canonical_sha256":"1c572678e30a76efa390c3f99acab7281b6d6e8972764a5ea203c7bae0043ba9","source":{"kind":"arxiv","id":"1301.6802","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Generating Large-scale Clustered Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Cheng Wang","submitted_at":"2013-01-28T23:09:54Z","abstract_excerpt":"Real social networks are often compared to random graphs in order to assess whether their typological structure could be the result of random processes. However, an Erd\\H{o}s-R\\'enyi random graph in large scale is often lack of local structure beyond the dyadic level and as a result we need to generate the clustered random graph instead of the simple random graph to compare the local structure at the triadic level. In this paper a generalized version of Gleeson's algorithm is advanced to generate a clustered random graph in large-scale which persists the number of nodes |V|, the number of edge"},"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":"1301.6802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-01-28T23:09:54Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"11cb469831b5f385cf00459ebed3b0cd5baf0b8944d2839f35a90b485ddd46bb","abstract_canon_sha256":"bacb400a8c85e8f276f16b008e62c1f64345b81ec1a5689289d18df2d124962b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:12.264415Z","signature_b64":"G2dWTAQD4wy/+h+92262jstHcItVhYuZHSUW3A3WfcuFJqkbvP1n4tXPpaNa0dv4OYNhUAl6U3tDvKNzuBWqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c572678e30a76efa390c3f99acab7281b6d6e8972764a5ea203c7bae0043ba9","last_reissued_at":"2026-05-18T03:35:12.263631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:12.263631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Generating Large-scale Clustered Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Cheng Wang","submitted_at":"2013-01-28T23:09:54Z","abstract_excerpt":"Real social networks are often compared to random graphs in order to assess whether their typological structure could be the result of random processes. However, an Erd\\H{o}s-R\\'enyi random graph in large scale is often lack of local structure beyond the dyadic level and as a result we need to generate the clustered random graph instead of the simple random graph to compare the local structure at the triadic level. In this paper a generalized version of Gleeson's algorithm is advanced to generate a clustered random graph in large-scale which persists the number of nodes |V|, the number of edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6802","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":"1301.6802","created_at":"2026-05-18T03:35:12.263762+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6802v1","created_at":"2026-05-18T03:35:12.263762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6802","created_at":"2026-05-18T03:35:12.263762+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRLSM6HDBJ3O","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRLSM6HDBJ3O7I4Q","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRLSM6HD","created_at":"2026-05-18T12:27:43.054852+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/DRLSM6HDBJ3O7I4QYP4ZVSVXFA","json":"https://pith.science/pith/DRLSM6HDBJ3O7I4QYP4ZVSVXFA.json","graph_json":"https://pith.science/api/pith-number/DRLSM6HDBJ3O7I4QYP4ZVSVXFA/graph.json","events_json":"https://pith.science/api/pith-number/DRLSM6HDBJ3O7I4QYP4ZVSVXFA/events.json","paper":"https://pith.science/paper/DRLSM6HD"},"agent_actions":{"view_html":"https://pith.science/pith/DRLSM6HDBJ3O7I4QYP4ZVSVXFA","download_json":"https://pith.science/pith/DRLSM6HDBJ3O7I4QYP4ZVSVXFA.json","view_paper":"https://pith.science/paper/DRLSM6HD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6802&json=true","fetch_graph":"https://pith.science/api/pith-number/DRLSM6HDBJ3O7I4QYP4ZVSVXFA/graph.json","fetch_events":"https://pith.science/api/pith-number/DRLSM6HDBJ3O7I4QYP4ZVSVXFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRLSM6HDBJ3O7I4QYP4ZVSVXFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRLSM6HDBJ3O7I4QYP4ZVSVXFA/action/storage_attestation","attest_author":"https://pith.science/pith/DRLSM6HDBJ3O7I4QYP4ZVSVXFA/action/author_attestation","sign_citation":"https://pith.science/pith/DRLSM6HDBJ3O7I4QYP4ZVSVXFA/action/citation_signature","submit_replication":"https://pith.science/pith/DRLSM6HDBJ3O7I4QYP4ZVSVXFA/action/replication_record"}},"created_at":"2026-05-18T03:35:12.263762+00:00","updated_at":"2026-05-18T03:35:12.263762+00:00"}