{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MOCE7WM3CYNL2S3HDSAPLDCBRQ","short_pith_number":"pith:MOCE7WM3","canonical_record":{"source":{"id":"1601.08224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-29T19:16:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e9c2f9b2c28a03a445e5f0386f1d54ff12381adbf56c55cd17abb852fbdce503","abstract_canon_sha256":"f03d2d5aa79a1bf017fe96475e5984962780136b55816030ed17cf045562a3a3"},"schema_version":"1.0"},"canonical_sha256":"63844fd99b161abd4b671c80f58c418c2476ead603801c66ca0962f8df25f6c7","source":{"kind":"arxiv","id":"1601.08224","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.08224","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1601.08224v2","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08224","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"MOCE7WM3CYNL","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MOCE7WM3CYNL2S3H","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MOCE7WM3","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MOCE7WM3CYNL2S3HDSAPLDCBRQ","target":"record","payload":{"canonical_record":{"source":{"id":"1601.08224","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-29T19:16:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e9c2f9b2c28a03a445e5f0386f1d54ff12381adbf56c55cd17abb852fbdce503","abstract_canon_sha256":"f03d2d5aa79a1bf017fe96475e5984962780136b55816030ed17cf045562a3a3"},"schema_version":"1.0"},"canonical_sha256":"63844fd99b161abd4b671c80f58c418c2476ead603801c66ca0962f8df25f6c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:38.211449Z","signature_b64":"PC9jrrdcGXcZ4L4EVXpNW5dajSzKEYQ7MWenclYMWD8gmpCD1u4BnHfP60qOt+qU8gVes8T/45hNbbJ7XsirAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63844fd99b161abd4b671c80f58c418c2476ead603801c66ca0962f8df25f6c7","last_reissued_at":"2026-05-18T00:15:38.210768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:38.210768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.08224","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-18T00:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g5ApRk0BFyX+cB9r0A+EEf1JO1AP0Vp4+HHV0gdIREGadChbo6zIIpuek/SS+Xb4kHFtAPa1/TO3VURJPHdYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:38:08.754499Z"},"content_sha256":"e60d6b849e4132afcc3ec2e2d1bb59608e8703cb44673f4a03a4ca9403dcf2b2","schema_version":"1.0","event_id":"sha256:e60d6b849e4132afcc3ec2e2d1bb59608e8703cb44673f4a03a4ca9403dcf2b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MOCE7WM3CYNL2S3HDSAPLDCBRQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New classes of degree sequences with fast mixing swap Markov chain sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Istv\\'an Mikl\\'os, P\\'eter L. Erd\\H{o}s, Zolt\\'an Toroczkai","submitted_at":"2016-01-29T19:16:52Z","abstract_excerpt":"In network modeling of complex systems one is often required to sample random realizations of networks that obey a given set of constraints, usually in form of graph measures. A much studied class of problems targets uniform sampling of simple graphs with given degree sequence or also with given degree correlations expressed in the form of a joint degree matrix. One approach is to use Markov chains based on edge switches (swaps) that preserve the constraints, are irreducible (ergodic) and fast mixing. In 1999, Kannan, Tetali and Vempala (KTV) proposed a simple swap Markov chain for sampling gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08224","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-18T00:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkIZyIYXAq+hDTE/MJV61S1cbMFzvMspTWnBp8oAnGQQ4xySa3JroA5/01tyGWer6H2eOJM6JctBZyPZyUbbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:38:08.755265Z"},"content_sha256":"d87b8fea22ac4ce6768039d1312f471dc17a7382f58fa4b4e9c4e63095483a43","schema_version":"1.0","event_id":"sha256:d87b8fea22ac4ce6768039d1312f471dc17a7382f58fa4b4e9c4e63095483a43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MOCE7WM3CYNL2S3HDSAPLDCBRQ/bundle.json","state_url":"https://pith.science/pith/MOCE7WM3CYNL2S3HDSAPLDCBRQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MOCE7WM3CYNL2S3HDSAPLDCBRQ/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-11T07:38:08Z","links":{"resolver":"https://pith.science/pith/MOCE7WM3CYNL2S3HDSAPLDCBRQ","bundle":"https://pith.science/pith/MOCE7WM3CYNL2S3HDSAPLDCBRQ/bundle.json","state":"https://pith.science/pith/MOCE7WM3CYNL2S3HDSAPLDCBRQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MOCE7WM3CYNL2S3HDSAPLDCBRQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MOCE7WM3CYNL2S3HDSAPLDCBRQ","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":"f03d2d5aa79a1bf017fe96475e5984962780136b55816030ed17cf045562a3a3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-29T19:16:52Z","title_canon_sha256":"e9c2f9b2c28a03a445e5f0386f1d54ff12381adbf56c55cd17abb852fbdce503"},"schema_version":"1.0","source":{"id":"1601.08224","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.08224","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1601.08224v2","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08224","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"MOCE7WM3CYNL","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MOCE7WM3CYNL2S3H","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MOCE7WM3","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:d87b8fea22ac4ce6768039d1312f471dc17a7382f58fa4b4e9c4e63095483a43","target":"graph","created_at":"2026-05-18T00:15:38Z","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":"In network modeling of complex systems one is often required to sample random realizations of networks that obey a given set of constraints, usually in form of graph measures. A much studied class of problems targets uniform sampling of simple graphs with given degree sequence or also with given degree correlations expressed in the form of a joint degree matrix. One approach is to use Markov chains based on edge switches (swaps) that preserve the constraints, are irreducible (ergodic) and fast mixing. In 1999, Kannan, Tetali and Vempala (KTV) proposed a simple swap Markov chain for sampling gr","authors_text":"Istv\\'an Mikl\\'os, P\\'eter L. Erd\\H{o}s, Zolt\\'an Toroczkai","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-29T19:16:52Z","title":"New classes of degree sequences with fast mixing swap Markov chain sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08224","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:e60d6b849e4132afcc3ec2e2d1bb59608e8703cb44673f4a03a4ca9403dcf2b2","target":"record","created_at":"2026-05-18T00:15:38Z","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":"f03d2d5aa79a1bf017fe96475e5984962780136b55816030ed17cf045562a3a3","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-29T19:16:52Z","title_canon_sha256":"e9c2f9b2c28a03a445e5f0386f1d54ff12381adbf56c55cd17abb852fbdce503"},"schema_version":"1.0","source":{"id":"1601.08224","kind":"arxiv","version":2}},"canonical_sha256":"63844fd99b161abd4b671c80f58c418c2476ead603801c66ca0962f8df25f6c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63844fd99b161abd4b671c80f58c418c2476ead603801c66ca0962f8df25f6c7","first_computed_at":"2026-05-18T00:15:38.210768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:38.210768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PC9jrrdcGXcZ4L4EVXpNW5dajSzKEYQ7MWenclYMWD8gmpCD1u4BnHfP60qOt+qU8gVes8T/45hNbbJ7XsirAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:38.211449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.08224","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e60d6b849e4132afcc3ec2e2d1bb59608e8703cb44673f4a03a4ca9403dcf2b2","sha256:d87b8fea22ac4ce6768039d1312f471dc17a7382f58fa4b4e9c4e63095483a43"],"state_sha256":"3419b571c4d03b47999b5139bf98c79996038d38ebe7487ce132ac7f66394cc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gjFfEbEN6OjoHrKsa5nn8WeaGcpvmCPK1OR7gJAzF7lqcY1l2QIiBlWWFcb12biFofOdQErK0g5eknSzHgyJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:38:08.759968Z","bundle_sha256":"bff5c8e6ebc9bdddd9b9fbc33cd35456f50de1fbf4c2290556785da3a4a1b759"}}