{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4QN5H4CHVVXVEFKDDIAQ4MDLXX","short_pith_number":"pith:4QN5H4CH","canonical_record":{"source":{"id":"1507.05008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-17T16:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"c05316a416935cde02eca1db867ce08a8232e7e0e4e07fe2556f89140e8e898c","abstract_canon_sha256":"8fbc6fe898031f896b7c1f8f36f521f1011617b11e1efe9e4dc81d81ee7dc035"},"schema_version":"1.0"},"canonical_sha256":"e41bd3f047ad6f5215431a010e306bbde3a3a9b5600ac0f5d9d6f348edca65bf","source":{"kind":"arxiv","id":"1507.05008","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05008","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05008v2","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05008","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"pith_short_12","alias_value":"4QN5H4CHVVXV","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4QN5H4CHVVXVEFKD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4QN5H4CH","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4QN5H4CHVVXVEFKDDIAQ4MDLXX","target":"record","payload":{"canonical_record":{"source":{"id":"1507.05008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-17T16:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"c05316a416935cde02eca1db867ce08a8232e7e0e4e07fe2556f89140e8e898c","abstract_canon_sha256":"8fbc6fe898031f896b7c1f8f36f521f1011617b11e1efe9e4dc81d81ee7dc035"},"schema_version":"1.0"},"canonical_sha256":"e41bd3f047ad6f5215431a010e306bbde3a3a9b5600ac0f5d9d6f348edca65bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:10.071077Z","signature_b64":"+DXNWay3FpAqAiJ4lClRnXut1xAtJ5ig2nF68FuvX3x5XnnqFvG8gFSxES+yDKcuHkjRjh1S6iqSpifzCZc3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e41bd3f047ad6f5215431a010e306bbde3a3a9b5600ac0f5d9d6f348edca65bf","last_reissued_at":"2026-05-18T01:32:10.070212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:10.070212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.05008","source_version":2,"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-18T01:32:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xc2BJbw191gs4/NYJHv5a/miEwG1FNTlRf4amg8Fw5WPfwvbyikQp2ityw73MzqyrdDP1EL7N26yiUCxA6T+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T00:19:47.107407Z"},"content_sha256":"5decfbc77d69807dcd19b2faa9ee6c4979575a350c9e9f990ceb68e451970068","schema_version":"1.0","event_id":"sha256:5decfbc77d69807dcd19b2faa9ee6c4979575a350c9e9f990ceb68e451970068"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4QN5H4CHVVXVEFKDDIAQ4MDLXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bounds for number of removed edges in the Erased Configuration Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Nelly Litvak, Pim van der Hoorn","submitted_at":"2015-07-17T16:04:47Z","abstract_excerpt":"Models for generating simple graphs are important in the study of real-world complex networks. A well established example of such a model is the erased configuration model, where each node receives a number of half-edges that are connected to half-edges of other nodes at random, and then self-loops are removed and multiple edges are concatenated to make the graph simple. Although asymptotic results for many properties of this model, such as the limiting degree distribution, are known, the exact speed of convergence in terms of the graph sizes remains an open question. We provide a first answer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05008","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"},"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-18T01:32:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/vqBZ46VglHVd86lDs4C/K9qt4gxti2fzJ18mId+0RzflQpqPsWo2yyhpWi2s9bMS27OL1VwSNVAeflC/JDtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T00:19:47.107776Z"},"content_sha256":"cc789b277678ec68999ca62f5e62d9e068aece87ecf5182829b9de190382ecc3","schema_version":"1.0","event_id":"sha256:cc789b277678ec68999ca62f5e62d9e068aece87ecf5182829b9de190382ecc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4QN5H4CHVVXVEFKDDIAQ4MDLXX/bundle.json","state_url":"https://pith.science/pith/4QN5H4CHVVXVEFKDDIAQ4MDLXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4QN5H4CHVVXVEFKDDIAQ4MDLXX/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-06-29T00:19:47Z","links":{"resolver":"https://pith.science/pith/4QN5H4CHVVXVEFKDDIAQ4MDLXX","bundle":"https://pith.science/pith/4QN5H4CHVVXVEFKDDIAQ4MDLXX/bundle.json","state":"https://pith.science/pith/4QN5H4CHVVXVEFKDDIAQ4MDLXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4QN5H4CHVVXVEFKDDIAQ4MDLXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4QN5H4CHVVXVEFKDDIAQ4MDLXX","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":"8fbc6fe898031f896b7c1f8f36f521f1011617b11e1efe9e4dc81d81ee7dc035","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-17T16:04:47Z","title_canon_sha256":"c05316a416935cde02eca1db867ce08a8232e7e0e4e07fe2556f89140e8e898c"},"schema_version":"1.0","source":{"id":"1507.05008","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05008","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05008v2","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05008","created_at":"2026-05-18T01:32:10Z"},{"alias_kind":"pith_short_12","alias_value":"4QN5H4CHVVXV","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4QN5H4CHVVXVEFKD","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4QN5H4CH","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:cc789b277678ec68999ca62f5e62d9e068aece87ecf5182829b9de190382ecc3","target":"graph","created_at":"2026-05-18T01:32:10Z","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":"Models for generating simple graphs are important in the study of real-world complex networks. A well established example of such a model is the erased configuration model, where each node receives a number of half-edges that are connected to half-edges of other nodes at random, and then self-loops are removed and multiple edges are concatenated to make the graph simple. Although asymptotic results for many properties of this model, such as the limiting degree distribution, are known, the exact speed of convergence in terms of the graph sizes remains an open question. We provide a first answer","authors_text":"Nelly Litvak, Pim van der Hoorn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-17T16:04:47Z","title":"Upper bounds for number of removed edges in the Erased Configuration Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05008","kind":"arxiv","version":2},"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:5decfbc77d69807dcd19b2faa9ee6c4979575a350c9e9f990ceb68e451970068","target":"record","created_at":"2026-05-18T01:32:10Z","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":"8fbc6fe898031f896b7c1f8f36f521f1011617b11e1efe9e4dc81d81ee7dc035","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-07-17T16:04:47Z","title_canon_sha256":"c05316a416935cde02eca1db867ce08a8232e7e0e4e07fe2556f89140e8e898c"},"schema_version":"1.0","source":{"id":"1507.05008","kind":"arxiv","version":2}},"canonical_sha256":"e41bd3f047ad6f5215431a010e306bbde3a3a9b5600ac0f5d9d6f348edca65bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e41bd3f047ad6f5215431a010e306bbde3a3a9b5600ac0f5d9d6f348edca65bf","first_computed_at":"2026-05-18T01:32:10.070212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:10.070212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+DXNWay3FpAqAiJ4lClRnXut1xAtJ5ig2nF68FuvX3x5XnnqFvG8gFSxES+yDKcuHkjRjh1S6iqSpifzCZc3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:10.071077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05008","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5decfbc77d69807dcd19b2faa9ee6c4979575a350c9e9f990ceb68e451970068","sha256:cc789b277678ec68999ca62f5e62d9e068aece87ecf5182829b9de190382ecc3"],"state_sha256":"73db7b89b33f519de77f12d1c9c6089a4bbd0978dea12eeecd2bc2110b6123a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErNUdRpNTKTk3r8sj1ZlZrgVFlesiqy75D1aQEpJX3fMDlXVRRCg2sxtp3HhtqUMmWDcI+JqS1j0JE/eIrKxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T00:19:47.110141Z","bundle_sha256":"69a2a251e6418eccf24c9d28b3b6cec43f31ff4e4b51ba33981f440f18b2b102"}}