{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3AJPC454PVDKVF4ZG77U5LYGQB","short_pith_number":"pith:3AJPC454","schema_version":"1.0","canonical_sha256":"d812f173bc7d46aa979937ff4eaf068044aff4a2671f9a95a98e596a1ec7f10a","source":{"kind":"arxiv","id":"1005.1136","version":5},"attestation_state":"computed","paper":{"title":"Random graphs with a given degree sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Allan Sly, Persi Diaconis, Sourav Chatterjee","submitted_at":"2010-05-07T06:05:00Z","abstract_excerpt":"Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in the sense of Lov\\'{a}sz and Szegedy with identifiable limits. This allows simple determination of other features such as the number of triangles. The argument proceeds by studying a natural exponential model having the degree sequence as a sufficient statistic. The maximum likelihood estimate (MLE) of the parameters is shown to be unique and c"},"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":"1005.1136","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-05-07T06:05:00Z","cross_cats_sorted":["math.CO","math.ST","stat.TH"],"title_canon_sha256":"155f69c3309d5fe97e3fb0aa59a9fc3e56bc59bfbec50974a62c9b2a2ed7a661","abstract_canon_sha256":"2d3abb52249a139ccf1ba3fc9432e03e3dff283d57f53cfdbffb75d3a122243d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:29.615055Z","signature_b64":"Mww8l1ruifbjM5JKlkfHEd7F3h4zTxxSAyr3ixKMZzS6kVq38mNUEEy8kmWbfNfeh+HHcdM4WbX8D+69BDCVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d812f173bc7d46aa979937ff4eaf068044aff4a2671f9a95a98e596a1ec7f10a","last_reissued_at":"2026-05-18T04:14:29.614561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:29.614561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random graphs with a given degree sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Allan Sly, Persi Diaconis, Sourav Chatterjee","submitted_at":"2010-05-07T06:05:00Z","abstract_excerpt":"Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in the sense of Lov\\'{a}sz and Szegedy with identifiable limits. This allows simple determination of other features such as the number of triangles. The argument proceeds by studying a natural exponential model having the degree sequence as a sufficient statistic. The maximum likelihood estimate (MLE) of the parameters is shown to be unique and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1136","kind":"arxiv","version":5},"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":"1005.1136","created_at":"2026-05-18T04:14:29.614641+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.1136v5","created_at":"2026-05-18T04:14:29.614641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1136","created_at":"2026-05-18T04:14:29.614641+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AJPC454PVDK","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AJPC454PVDKVF4Z","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AJPC454","created_at":"2026-05-18T12:26:03.138858+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/3AJPC454PVDKVF4ZG77U5LYGQB","json":"https://pith.science/pith/3AJPC454PVDKVF4ZG77U5LYGQB.json","graph_json":"https://pith.science/api/pith-number/3AJPC454PVDKVF4ZG77U5LYGQB/graph.json","events_json":"https://pith.science/api/pith-number/3AJPC454PVDKVF4ZG77U5LYGQB/events.json","paper":"https://pith.science/paper/3AJPC454"},"agent_actions":{"view_html":"https://pith.science/pith/3AJPC454PVDKVF4ZG77U5LYGQB","download_json":"https://pith.science/pith/3AJPC454PVDKVF4ZG77U5LYGQB.json","view_paper":"https://pith.science/paper/3AJPC454","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.1136&json=true","fetch_graph":"https://pith.science/api/pith-number/3AJPC454PVDKVF4ZG77U5LYGQB/graph.json","fetch_events":"https://pith.science/api/pith-number/3AJPC454PVDKVF4ZG77U5LYGQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AJPC454PVDKVF4ZG77U5LYGQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AJPC454PVDKVF4ZG77U5LYGQB/action/storage_attestation","attest_author":"https://pith.science/pith/3AJPC454PVDKVF4ZG77U5LYGQB/action/author_attestation","sign_citation":"https://pith.science/pith/3AJPC454PVDKVF4ZG77U5LYGQB/action/citation_signature","submit_replication":"https://pith.science/pith/3AJPC454PVDKVF4ZG77U5LYGQB/action/replication_record"}},"created_at":"2026-05-18T04:14:29.614641+00:00","updated_at":"2026-05-18T04:14:29.614641+00:00"}