{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UWXM2SC7ZNLKT5TX4MNDSNIGKA","short_pith_number":"pith:UWXM2SC7","schema_version":"1.0","canonical_sha256":"a5aecd485fcb56a9f677e31a393506503ee08ad6ba9bbae24d2f16f7baf95a3a","source":{"kind":"arxiv","id":"1207.2475","version":1},"attestation_state":"computed","paper":{"title":"Directed random graphs with given degree distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Mariana Olvera-Cravioto, Ningyuan Chen","submitted_at":"2012-07-10T20:03:45Z","abstract_excerpt":"Given two distributions F and G on the nonnegative integers we propose an algorithm to construct in- and out-degree sequences from samples of i.i.d. observations from F and G, respectively, that with high probability will be graphical, that is, from which a simple directed graph can be drawn. We then analyze a directed version of the configuration model and show that, provided that F and G have finite variance, the probability of obtaining a simple graph is bounded away from zero as the number of nodes grows. We show that conditional on the resulting graph being simple, the in- and out-degree "},"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":"1207.2475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-07-10T20:03:45Z","cross_cats_sorted":[],"title_canon_sha256":"fea65170fd8ec9fa15a4bd6fb45779097b45ae9b5334ac7ef74ab093f16b2ab9","abstract_canon_sha256":"a95e7774ad34299b54dc95b8f8d2d0baefd312b8b2dc248821ae19231a9f0f4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:15.326180Z","signature_b64":"sfHBXUsH3bTQ7PfQDekxoBJEyTKTmCLuonjYWjyA1YR4opLdBwsssfQEJl2md2FdDqcU/L/nPrVATgA+den6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5aecd485fcb56a9f677e31a393506503ee08ad6ba9bbae24d2f16f7baf95a3a","last_reissued_at":"2026-05-18T03:51:15.325500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:15.325500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed random graphs with given degree distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Mariana Olvera-Cravioto, Ningyuan Chen","submitted_at":"2012-07-10T20:03:45Z","abstract_excerpt":"Given two distributions F and G on the nonnegative integers we propose an algorithm to construct in- and out-degree sequences from samples of i.i.d. observations from F and G, respectively, that with high probability will be graphical, that is, from which a simple directed graph can be drawn. We then analyze a directed version of the configuration model and show that, provided that F and G have finite variance, the probability of obtaining a simple graph is bounded away from zero as the number of nodes grows. We show that conditional on the resulting graph being simple, the in- and out-degree "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2475","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":"1207.2475","created_at":"2026-05-18T03:51:15.325619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2475v1","created_at":"2026-05-18T03:51:15.325619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2475","created_at":"2026-05-18T03:51:15.325619+00:00"},{"alias_kind":"pith_short_12","alias_value":"UWXM2SC7ZNLK","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"UWXM2SC7ZNLKT5TX","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"UWXM2SC7","created_at":"2026-05-18T12:27:25.539911+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/UWXM2SC7ZNLKT5TX4MNDSNIGKA","json":"https://pith.science/pith/UWXM2SC7ZNLKT5TX4MNDSNIGKA.json","graph_json":"https://pith.science/api/pith-number/UWXM2SC7ZNLKT5TX4MNDSNIGKA/graph.json","events_json":"https://pith.science/api/pith-number/UWXM2SC7ZNLKT5TX4MNDSNIGKA/events.json","paper":"https://pith.science/paper/UWXM2SC7"},"agent_actions":{"view_html":"https://pith.science/pith/UWXM2SC7ZNLKT5TX4MNDSNIGKA","download_json":"https://pith.science/pith/UWXM2SC7ZNLKT5TX4MNDSNIGKA.json","view_paper":"https://pith.science/paper/UWXM2SC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2475&json=true","fetch_graph":"https://pith.science/api/pith-number/UWXM2SC7ZNLKT5TX4MNDSNIGKA/graph.json","fetch_events":"https://pith.science/api/pith-number/UWXM2SC7ZNLKT5TX4MNDSNIGKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UWXM2SC7ZNLKT5TX4MNDSNIGKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UWXM2SC7ZNLKT5TX4MNDSNIGKA/action/storage_attestation","attest_author":"https://pith.science/pith/UWXM2SC7ZNLKT5TX4MNDSNIGKA/action/author_attestation","sign_citation":"https://pith.science/pith/UWXM2SC7ZNLKT5TX4MNDSNIGKA/action/citation_signature","submit_replication":"https://pith.science/pith/UWXM2SC7ZNLKT5TX4MNDSNIGKA/action/replication_record"}},"created_at":"2026-05-18T03:51:15.325619+00:00","updated_at":"2026-05-18T03:51:15.325619+00:00"}