{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MMDJG3IU4HS665RNX2AQCK3PQ3","short_pith_number":"pith:MMDJG3IU","canonical_record":{"source":{"id":"1307.6344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-24T09:24:07Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f4e2e053055d1ce52c6c58f66b34224d2b9832473a280faed183b098411b4df0","abstract_canon_sha256":"d7581a7f0873c015945189bc058dbe0e3e1359ce5ba9b92352210c0474b346a5"},"schema_version":"1.0"},"canonical_sha256":"6306936d14e1e5ef762dbe81012b6f86d6c33b89f5e58ecc8bf571c1b1eb9f78","source":{"kind":"arxiv","id":"1307.6344","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6344","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6344v1","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6344","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"MMDJG3IU4HS6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MMDJG3IU4HS665RN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MMDJG3IU","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MMDJG3IU4HS665RNX2AQCK3PQ3","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-24T09:24:07Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"f4e2e053055d1ce52c6c58f66b34224d2b9832473a280faed183b098411b4df0","abstract_canon_sha256":"d7581a7f0873c015945189bc058dbe0e3e1359ce5ba9b92352210c0474b346a5"},"schema_version":"1.0"},"canonical_sha256":"6306936d14e1e5ef762dbe81012b6f86d6c33b89f5e58ecc8bf571c1b1eb9f78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:43.624113Z","signature_b64":"kUAjF2fo2YNt0HaLI8GZLaUh5yAPsLWdsgYjpCzBM1SSW0Ps5W8F+KrGdNCWGSJg8Ddalg7XcmiZhKdbh4CTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6306936d14e1e5ef762dbe81012b6f86d6c33b89f5e58ecc8bf571c1b1eb9f78","last_reissued_at":"2026-05-18T03:17:43.623442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:43.623442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6344","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pm4bp/yitKdCDfqGqvWTN1b8T10f3fwtURZ7nzEBxmrLcsbd8thm/jEFTVuILaPiOaYlgd+tsEWdIVSFlRxPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:25:53.366903Z"},"content_sha256":"e0ed5566530dd2db77a392521ea54e92d714ec19517cfdff33486542c6cd8e40","schema_version":"1.0","event_id":"sha256:e0ed5566530dd2db77a392521ea54e92d714ec19517cfdff33486542c6cd8e40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MMDJG3IU4HS665RNX2AQCK3PQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The probability that a random multigraph is simple, II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Svante Janson","submitted_at":"2013-07-24T09:24:07Z","abstract_excerpt":"Consider a random multigraph with given vertex degrees constructed by the configuration model. We give a new proof of the fact that, asymptotically for a sequence of such multigraphs with the number of edges tending to infinity, the probability that the multigraph is simple stays away from 0 if and only if $\\sum d_i^2 = O(\\sum d_i)$, where $d_i$ are the vertex degrees. The new proof uses the method of moments, which makes it possible to use it in some applications concerning convergence in distribution. Corresponding results for bipartite graphs are included."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6344","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8znzIl2Yg6a8i88qC0/4BiGkcgR3LUuQLRpl1kNNRiF/1HQ6KI62MvRIB9nyK2jGctX9YhU3i9yHN3zV/XbdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:25:53.367603Z"},"content_sha256":"2cbfb1a1c9942e02e5c024d5069433aa429d50235b77d05001ba4a4b397ef73b","schema_version":"1.0","event_id":"sha256:2cbfb1a1c9942e02e5c024d5069433aa429d50235b77d05001ba4a4b397ef73b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMDJG3IU4HS665RNX2AQCK3PQ3/bundle.json","state_url":"https://pith.science/pith/MMDJG3IU4HS665RNX2AQCK3PQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMDJG3IU4HS665RNX2AQCK3PQ3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T15:25:53Z","links":{"resolver":"https://pith.science/pith/MMDJG3IU4HS665RNX2AQCK3PQ3","bundle":"https://pith.science/pith/MMDJG3IU4HS665RNX2AQCK3PQ3/bundle.json","state":"https://pith.science/pith/MMDJG3IU4HS665RNX2AQCK3PQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMDJG3IU4HS665RNX2AQCK3PQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MMDJG3IU4HS665RNX2AQCK3PQ3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d7581a7f0873c015945189bc058dbe0e3e1359ce5ba9b92352210c0474b346a5","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-24T09:24:07Z","title_canon_sha256":"f4e2e053055d1ce52c6c58f66b34224d2b9832473a280faed183b098411b4df0"},"schema_version":"1.0","source":{"id":"1307.6344","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6344","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6344v1","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6344","created_at":"2026-05-18T03:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"MMDJG3IU4HS6","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MMDJG3IU4HS665RN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MMDJG3IU","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:2cbfb1a1c9942e02e5c024d5069433aa429d50235b77d05001ba4a4b397ef73b","target":"graph","created_at":"2026-05-18T03:17:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Consider a random multigraph with given vertex degrees constructed by the configuration model. We give a new proof of the fact that, asymptotically for a sequence of such multigraphs with the number of edges tending to infinity, the probability that the multigraph is simple stays away from 0 if and only if $\\sum d_i^2 = O(\\sum d_i)$, where $d_i$ are the vertex degrees. The new proof uses the method of moments, which makes it possible to use it in some applications concerning convergence in distribution. Corresponding results for bipartite graphs are included.","authors_text":"Svante Janson","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-24T09:24:07Z","title":"The probability that a random multigraph is simple, II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6344","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e0ed5566530dd2db77a392521ea54e92d714ec19517cfdff33486542c6cd8e40","target":"record","created_at":"2026-05-18T03:17:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d7581a7f0873c015945189bc058dbe0e3e1359ce5ba9b92352210c0474b346a5","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-24T09:24:07Z","title_canon_sha256":"f4e2e053055d1ce52c6c58f66b34224d2b9832473a280faed183b098411b4df0"},"schema_version":"1.0","source":{"id":"1307.6344","kind":"arxiv","version":1}},"canonical_sha256":"6306936d14e1e5ef762dbe81012b6f86d6c33b89f5e58ecc8bf571c1b1eb9f78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6306936d14e1e5ef762dbe81012b6f86d6c33b89f5e58ecc8bf571c1b1eb9f78","first_computed_at":"2026-05-18T03:17:43.623442Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:43.623442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kUAjF2fo2YNt0HaLI8GZLaUh5yAPsLWdsgYjpCzBM1SSW0Ps5W8F+KrGdNCWGSJg8Ddalg7XcmiZhKdbh4CTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:43.624113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6344","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0ed5566530dd2db77a392521ea54e92d714ec19517cfdff33486542c6cd8e40","sha256:2cbfb1a1c9942e02e5c024d5069433aa429d50235b77d05001ba4a4b397ef73b"],"state_sha256":"6e89415e75a3774a013b748e104009929f4f08376cb9be52e2c60896bd2e03be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzoX9f3fJxZNXXF87xSSt7GD76ZNyUut5Q4hlQ+rYAMgxi+T8xk35f2iVuoQwkybpq9nqR+bw3PNV+qcJXu7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:25:53.370961Z","bundle_sha256":"7422acc8a8dd1e40529188dec5908056def4fe9277a18cf70005c4ce7d9af804"}}