{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MVZ6N7O7HU75LGVKSR6JGKC7FM","short_pith_number":"pith:MVZ6N7O7","schema_version":"1.0","canonical_sha256":"6573e6fddf3d3fd59aaa947c93285f2b3adec2fb8ada3a5942f1fee76f6b6fba","source":{"kind":"arxiv","id":"1812.04289","version":1},"attestation_state":"computed","paper":{"title":"Counting triangles in power-law uniform random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Angus Southwell, Clara Stegehuis, Pu Gao, Remco van der Hofstad","submitted_at":"2018-12-11T09:30:26Z","abstract_excerpt":"We count the asymptotic number of triangles in uniform random graphs where the degree distribution follows a power law with degree exponent $\\tau\\in(2,3)$. We also analyze the local clustering coefficient $c(k)$, the probability that two random neighbors of a vertex of degree $k$ are connected. We find that the number of triangles, as well as the local clustering coefficient, scale similarly as in the erased configuration model, where all self-loops and multiple edges of the configuration model are removed. Interestingly, uniform random graphs contain more triangles than erased configuration m"},"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":"1812.04289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-12-11T09:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"3a99e965dc8b377820fc8252c222b1841eacdd724bd763a2499d3e886eeed6ad","abstract_canon_sha256":"d3a186e622113e0bde7e6c4a8ff7b1683d35258c12c1c8d1c0f91a1ef5f02250"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:32.699028Z","signature_b64":"ycTXqUyGE9d6XKMRy8qSWmBb6bpi3dIoTTHH9D614fDco+gpEqvgoUMw+3i5sJAci7UZFFyAguZF9stKpVd8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6573e6fddf3d3fd59aaa947c93285f2b3adec2fb8ada3a5942f1fee76f6b6fba","last_reissued_at":"2026-05-17T23:58:32.698299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:32.698299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting triangles in power-law uniform random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Angus Southwell, Clara Stegehuis, Pu Gao, Remco van der Hofstad","submitted_at":"2018-12-11T09:30:26Z","abstract_excerpt":"We count the asymptotic number of triangles in uniform random graphs where the degree distribution follows a power law with degree exponent $\\tau\\in(2,3)$. We also analyze the local clustering coefficient $c(k)$, the probability that two random neighbors of a vertex of degree $k$ are connected. We find that the number of triangles, as well as the local clustering coefficient, scale similarly as in the erased configuration model, where all self-loops and multiple edges of the configuration model are removed. Interestingly, uniform random graphs contain more triangles than erased configuration m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04289","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":"1812.04289","created_at":"2026-05-17T23:58:32.698458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.04289v1","created_at":"2026-05-17T23:58:32.698458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04289","created_at":"2026-05-17T23:58:32.698458+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVZ6N7O7HU75","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVZ6N7O7HU75LGVK","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVZ6N7O7","created_at":"2026-05-18T12:32:40.477152+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/MVZ6N7O7HU75LGVKSR6JGKC7FM","json":"https://pith.science/pith/MVZ6N7O7HU75LGVKSR6JGKC7FM.json","graph_json":"https://pith.science/api/pith-number/MVZ6N7O7HU75LGVKSR6JGKC7FM/graph.json","events_json":"https://pith.science/api/pith-number/MVZ6N7O7HU75LGVKSR6JGKC7FM/events.json","paper":"https://pith.science/paper/MVZ6N7O7"},"agent_actions":{"view_html":"https://pith.science/pith/MVZ6N7O7HU75LGVKSR6JGKC7FM","download_json":"https://pith.science/pith/MVZ6N7O7HU75LGVKSR6JGKC7FM.json","view_paper":"https://pith.science/paper/MVZ6N7O7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.04289&json=true","fetch_graph":"https://pith.science/api/pith-number/MVZ6N7O7HU75LGVKSR6JGKC7FM/graph.json","fetch_events":"https://pith.science/api/pith-number/MVZ6N7O7HU75LGVKSR6JGKC7FM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVZ6N7O7HU75LGVKSR6JGKC7FM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVZ6N7O7HU75LGVKSR6JGKC7FM/action/storage_attestation","attest_author":"https://pith.science/pith/MVZ6N7O7HU75LGVKSR6JGKC7FM/action/author_attestation","sign_citation":"https://pith.science/pith/MVZ6N7O7HU75LGVKSR6JGKC7FM/action/citation_signature","submit_replication":"https://pith.science/pith/MVZ6N7O7HU75LGVKSR6JGKC7FM/action/replication_record"}},"created_at":"2026-05-17T23:58:32.698458+00:00","updated_at":"2026-05-17T23:58:32.698458+00:00"}