{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NTB7OPTHWWGGK3OHU473IWIWEH","short_pith_number":"pith:NTB7OPTH","canonical_record":{"source":{"id":"1806.11276","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-29T06:03:20Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"169264eddc5f3aa1a353227b71733928857bf84f0667a8d859263821e0a7499d","abstract_canon_sha256":"8d60af392f9286ded8c22bcebca711aec93e6838852f28bdb3794cf491a194b1"},"schema_version":"1.0"},"canonical_sha256":"6cc3f73e67b58c656dc7a73fb4591621e25e718914c7ab58c5da8c24eca409fd","source":{"kind":"arxiv","id":"1806.11276","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11276","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11276v2","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11276","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"pith_short_12","alias_value":"NTB7OPTHWWGG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NTB7OPTHWWGGK3OH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NTB7OPTH","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NTB7OPTHWWGGK3OHU473IWIWEH","target":"record","payload":{"canonical_record":{"source":{"id":"1806.11276","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-29T06:03:20Z","cross_cats_sorted":["cs.DS","stat.CO"],"title_canon_sha256":"169264eddc5f3aa1a353227b71733928857bf84f0667a8d859263821e0a7499d","abstract_canon_sha256":"8d60af392f9286ded8c22bcebca711aec93e6838852f28bdb3794cf491a194b1"},"schema_version":"1.0"},"canonical_sha256":"6cc3f73e67b58c656dc7a73fb4591621e25e718914c7ab58c5da8c24eca409fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:17.716500Z","signature_b64":"4KgNZ9jywNhrgN69cGJEbZGsAxGLgC/v1Unz4AusU0b2NzWpbkYuda6bFe7wsV3d5u8IAunBbaNe9jGYkLZUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc3f73e67b58c656dc7a73fb4591621e25e718914c7ab58c5da8c24eca409fd","last_reissued_at":"2026-05-18T00:02:17.715902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:17.715902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.11276","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:02:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DM8a3G2RdhjBTCH/cOQOB1TLn2HPbEiq9HQqYCLQF/ctMUu9yD9ghviFEM9uYkam23TFHzYa+MsvcPf2EZdPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:46:49.919927Z"},"content_sha256":"1283c78aa32e2faf7c32d7dce9ca8fb007d0ef02a3dc3a0adb7919eff7937c72","schema_version":"1.0","event_id":"sha256:1283c78aa32e2faf7c32d7dce9ca8fb007d0ef02a3dc3a0adb7919eff7937c72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NTB7OPTHWWGGK3OHU473IWIWEH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating Connected Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.CO"],"primary_cat":"cs.SI","authors_text":"Caitlin Gray, Lewis Mitchell, Matthew Roughan","submitted_at":"2018-06-29T06:03:20Z","abstract_excerpt":"Sampling random graphs is essential in many applications, and often algorithms use Markov chain Monte Carlo methods to sample uniformly from the space of graphs. However, often there is a need to sample graphs with some property that we are unable, or it is too inefficient, to sample using standard approaches. In this paper, we are interested in sampling graphs from a conditional ensemble of the underlying graph model. We present an algorithm to generate samples from an ensemble of connected random graphs using a Metropolis-Hastings framework. The algorithm extends to a general framework for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11276","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:02:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RD8vZTYrSQAdy5RWWio4ckDNEfHE7e/dFntaFPh3L6PpBqaFu13kAlvmb6tPBGcrV6CD4GzLFTjoTW1vuSilAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:46:49.920617Z"},"content_sha256":"36d952b9745a2d5bf57888ee65682f1526c3aadbe726c63adc1abc1e7f148a9d","schema_version":"1.0","event_id":"sha256:36d952b9745a2d5bf57888ee65682f1526c3aadbe726c63adc1abc1e7f148a9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTB7OPTHWWGGK3OHU473IWIWEH/bundle.json","state_url":"https://pith.science/pith/NTB7OPTHWWGGK3OHU473IWIWEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTB7OPTHWWGGK3OHU473IWIWEH/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-06T06:46:49Z","links":{"resolver":"https://pith.science/pith/NTB7OPTHWWGGK3OHU473IWIWEH","bundle":"https://pith.science/pith/NTB7OPTHWWGGK3OHU473IWIWEH/bundle.json","state":"https://pith.science/pith/NTB7OPTHWWGGK3OHU473IWIWEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTB7OPTHWWGGK3OHU473IWIWEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NTB7OPTHWWGGK3OHU473IWIWEH","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":"8d60af392f9286ded8c22bcebca711aec93e6838852f28bdb3794cf491a194b1","cross_cats_sorted":["cs.DS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-29T06:03:20Z","title_canon_sha256":"169264eddc5f3aa1a353227b71733928857bf84f0667a8d859263821e0a7499d"},"schema_version":"1.0","source":{"id":"1806.11276","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11276","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11276v2","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11276","created_at":"2026-05-18T00:02:17Z"},{"alias_kind":"pith_short_12","alias_value":"NTB7OPTHWWGG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NTB7OPTHWWGGK3OH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NTB7OPTH","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:36d952b9745a2d5bf57888ee65682f1526c3aadbe726c63adc1abc1e7f148a9d","target":"graph","created_at":"2026-05-18T00:02:17Z","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":"Sampling random graphs is essential in many applications, and often algorithms use Markov chain Monte Carlo methods to sample uniformly from the space of graphs. However, often there is a need to sample graphs with some property that we are unable, or it is too inefficient, to sample using standard approaches. In this paper, we are interested in sampling graphs from a conditional ensemble of the underlying graph model. We present an algorithm to generate samples from an ensemble of connected random graphs using a Metropolis-Hastings framework. The algorithm extends to a general framework for s","authors_text":"Caitlin Gray, Lewis Mitchell, Matthew Roughan","cross_cats":["cs.DS","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-29T06:03:20Z","title":"Generating Connected Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11276","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:1283c78aa32e2faf7c32d7dce9ca8fb007d0ef02a3dc3a0adb7919eff7937c72","target":"record","created_at":"2026-05-18T00:02:17Z","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":"8d60af392f9286ded8c22bcebca711aec93e6838852f28bdb3794cf491a194b1","cross_cats_sorted":["cs.DS","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-29T06:03:20Z","title_canon_sha256":"169264eddc5f3aa1a353227b71733928857bf84f0667a8d859263821e0a7499d"},"schema_version":"1.0","source":{"id":"1806.11276","kind":"arxiv","version":2}},"canonical_sha256":"6cc3f73e67b58c656dc7a73fb4591621e25e718914c7ab58c5da8c24eca409fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cc3f73e67b58c656dc7a73fb4591621e25e718914c7ab58c5da8c24eca409fd","first_computed_at":"2026-05-18T00:02:17.715902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:17.715902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4KgNZ9jywNhrgN69cGJEbZGsAxGLgC/v1Unz4AusU0b2NzWpbkYuda6bFe7wsV3d5u8IAunBbaNe9jGYkLZUCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:17.716500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.11276","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1283c78aa32e2faf7c32d7dce9ca8fb007d0ef02a3dc3a0adb7919eff7937c72","sha256:36d952b9745a2d5bf57888ee65682f1526c3aadbe726c63adc1abc1e7f148a9d"],"state_sha256":"332aefeb78306d1186036d3260b1e986299d5a51ce3d45a978913713161b5e97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9CS/q/Nxr/37UaXuEfN/J1cn3I7uB3JNmdYRus5eEwFebjAJKX70TKStn47hpGL7grfQv09qLpoXCZQpxrFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:46:49.925871Z","bundle_sha256":"3a627ec448258e4556e23ed5b0f9c1fb0e90c9d8785d6494580d4e0ec875d3ec"}}