{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OOXUZR7YZ5DVKRL4SDLPLFCGQT","short_pith_number":"pith:OOXUZR7Y","schema_version":"1.0","canonical_sha256":"73af4cc7f8cf4755457c90d6f5944684c047f5036527c318c4efe1d8dceb4544","source":{"kind":"arxiv","id":"1708.07290","version":2},"attestation_state":"computed","paper":{"title":"A Parallel Algorithm for Generating a Random Graph with a Prescribed Degree Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hasanuzzaman Bhuiyan, Madhav Marathe, Maleq Khan","submitted_at":"2017-08-24T06:35:12Z","abstract_excerpt":"Random graphs (or networks) have gained a significant increase of interest due to its popularity in modeling and simulating many complex real-world systems. Degree sequence is one of the most important aspects of these systems. Random graphs with a given degree sequence can capture many characteristics like dependent edges and non-binomial degree distribution that are absent in many classical random graph models such as the Erd\\H{o}s-R\\'{e}nyi graph model. In addition, they have important applications in the uniform sampling of random graphs, counting the number of graphs having the same degre"},"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":"1708.07290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-08-24T06:35:12Z","cross_cats_sorted":[],"title_canon_sha256":"9ac3f81197993db67829bfe6d5a552e543c3c23ee0ce8bc6e874f28f6b63aedf","abstract_canon_sha256":"0efc3a01af19c6c65d507e725c578768e29b45a247defd6ee65d55916d69521f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:40.762597Z","signature_b64":"sS0FXMYajMUgOY+x3nGKggSQNABJMh0d8q86UwmV86ENz7L68LRcgVCAb15+Q+HhZkOFE5eFXo1KbqStErR4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73af4cc7f8cf4755457c90d6f5944684c047f5036527c318c4efe1d8dceb4544","last_reissued_at":"2026-05-18T00:35:40.761937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:40.761937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Algorithm for Generating a Random Graph with a Prescribed Degree Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hasanuzzaman Bhuiyan, Madhav Marathe, Maleq Khan","submitted_at":"2017-08-24T06:35:12Z","abstract_excerpt":"Random graphs (or networks) have gained a significant increase of interest due to its popularity in modeling and simulating many complex real-world systems. Degree sequence is one of the most important aspects of these systems. Random graphs with a given degree sequence can capture many characteristics like dependent edges and non-binomial degree distribution that are absent in many classical random graph models such as the Erd\\H{o}s-R\\'{e}nyi graph model. In addition, they have important applications in the uniform sampling of random graphs, counting the number of graphs having the same degre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07290","kind":"arxiv","version":2},"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":"1708.07290","created_at":"2026-05-18T00:35:40.762044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07290v2","created_at":"2026-05-18T00:35:40.762044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07290","created_at":"2026-05-18T00:35:40.762044+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOXUZR7YZ5DV","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOXUZR7YZ5DVKRL4","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOXUZR7Y","created_at":"2026-05-18T12:31:34.259226+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/OOXUZR7YZ5DVKRL4SDLPLFCGQT","json":"https://pith.science/pith/OOXUZR7YZ5DVKRL4SDLPLFCGQT.json","graph_json":"https://pith.science/api/pith-number/OOXUZR7YZ5DVKRL4SDLPLFCGQT/graph.json","events_json":"https://pith.science/api/pith-number/OOXUZR7YZ5DVKRL4SDLPLFCGQT/events.json","paper":"https://pith.science/paper/OOXUZR7Y"},"agent_actions":{"view_html":"https://pith.science/pith/OOXUZR7YZ5DVKRL4SDLPLFCGQT","download_json":"https://pith.science/pith/OOXUZR7YZ5DVKRL4SDLPLFCGQT.json","view_paper":"https://pith.science/paper/OOXUZR7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07290&json=true","fetch_graph":"https://pith.science/api/pith-number/OOXUZR7YZ5DVKRL4SDLPLFCGQT/graph.json","fetch_events":"https://pith.science/api/pith-number/OOXUZR7YZ5DVKRL4SDLPLFCGQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOXUZR7YZ5DVKRL4SDLPLFCGQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOXUZR7YZ5DVKRL4SDLPLFCGQT/action/storage_attestation","attest_author":"https://pith.science/pith/OOXUZR7YZ5DVKRL4SDLPLFCGQT/action/author_attestation","sign_citation":"https://pith.science/pith/OOXUZR7YZ5DVKRL4SDLPLFCGQT/action/citation_signature","submit_replication":"https://pith.science/pith/OOXUZR7YZ5DVKRL4SDLPLFCGQT/action/replication_record"}},"created_at":"2026-05-18T00:35:40.762044+00:00","updated_at":"2026-05-18T00:35:40.762044+00:00"}