{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HJOSELS7UO6JL5QYP7MZUQNUAD","short_pith_number":"pith:HJOSELS7","schema_version":"1.0","canonical_sha256":"3a5d222e5fa3bc95f6187fd99a41b400f9b26c977d76f1e6199193c81c74d047","source":{"kind":"arxiv","id":"1404.1250","version":3},"attestation_state":"computed","paper":{"title":"Enumeration of graphs with a heavy-tailed degree sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicholas Wormald, Pu Gao","submitted_at":"2014-04-04T13:34:19Z","abstract_excerpt":"In this paper, we asymptotically enumerate graphs with a given degree sequence d=(d_1,...,d_n) satisfying restrictions designed to permit heavy-tailed sequences in the sparse case (i.e. where the average degree is rather small). Our general result requires upper bounds on functions of M_k= \\sum_{i=1}^n [d_i]_k for a few small integers k\\ge 1. Note that M_1 is simply the total degree of the graphs. As special cases, we asymptotically enumerate graphs with (i) degree sequences satisfying M_2=o(M_1^{ 9/8}); (ii) degree sequences following a power law with parameter gamma>5/2; (iii) power-law degr"},"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":"1404.1250","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T13:34:19Z","cross_cats_sorted":[],"title_canon_sha256":"7977ac100ce99aa31a31b832bdc9a1bbd1654df8883eeb446d5a708c92cb093f","abstract_canon_sha256":"000a04d8ea5ee78e5666d9691624be344653eefc3da21af5ef857ce83032ad39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:46.105636Z","signature_b64":"C3g636GxzSyED48IAkeMmrWmwaXQ3FMtpmtSmemCce7Uazvcbf7XHjkdp1hTqup8e5gj3BfjDGolknCDkAOmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a5d222e5fa3bc95f6187fd99a41b400f9b26c977d76f1e6199193c81c74d047","last_reissued_at":"2026-05-18T01:10:46.104942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:46.104942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of graphs with a heavy-tailed degree sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nicholas Wormald, Pu Gao","submitted_at":"2014-04-04T13:34:19Z","abstract_excerpt":"In this paper, we asymptotically enumerate graphs with a given degree sequence d=(d_1,...,d_n) satisfying restrictions designed to permit heavy-tailed sequences in the sparse case (i.e. where the average degree is rather small). Our general result requires upper bounds on functions of M_k= \\sum_{i=1}^n [d_i]_k for a few small integers k\\ge 1. Note that M_1 is simply the total degree of the graphs. As special cases, we asymptotically enumerate graphs with (i) degree sequences satisfying M_2=o(M_1^{ 9/8}); (ii) degree sequences following a power law with parameter gamma>5/2; (iii) power-law degr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1250","kind":"arxiv","version":3},"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":"1404.1250","created_at":"2026-05-18T01:10:46.105063+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1250v3","created_at":"2026-05-18T01:10:46.105063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1250","created_at":"2026-05-18T01:10:46.105063+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJOSELS7UO6J","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJOSELS7UO6JL5QY","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJOSELS7","created_at":"2026-05-18T12:28:30.664211+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/HJOSELS7UO6JL5QYP7MZUQNUAD","json":"https://pith.science/pith/HJOSELS7UO6JL5QYP7MZUQNUAD.json","graph_json":"https://pith.science/api/pith-number/HJOSELS7UO6JL5QYP7MZUQNUAD/graph.json","events_json":"https://pith.science/api/pith-number/HJOSELS7UO6JL5QYP7MZUQNUAD/events.json","paper":"https://pith.science/paper/HJOSELS7"},"agent_actions":{"view_html":"https://pith.science/pith/HJOSELS7UO6JL5QYP7MZUQNUAD","download_json":"https://pith.science/pith/HJOSELS7UO6JL5QYP7MZUQNUAD.json","view_paper":"https://pith.science/paper/HJOSELS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1250&json=true","fetch_graph":"https://pith.science/api/pith-number/HJOSELS7UO6JL5QYP7MZUQNUAD/graph.json","fetch_events":"https://pith.science/api/pith-number/HJOSELS7UO6JL5QYP7MZUQNUAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJOSELS7UO6JL5QYP7MZUQNUAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJOSELS7UO6JL5QYP7MZUQNUAD/action/storage_attestation","attest_author":"https://pith.science/pith/HJOSELS7UO6JL5QYP7MZUQNUAD/action/author_attestation","sign_citation":"https://pith.science/pith/HJOSELS7UO6JL5QYP7MZUQNUAD/action/citation_signature","submit_replication":"https://pith.science/pith/HJOSELS7UO6JL5QYP7MZUQNUAD/action/replication_record"}},"created_at":"2026-05-18T01:10:46.105063+00:00","updated_at":"2026-05-18T01:10:46.105063+00:00"}