{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BSGN6773DAPI74RJHDLHRRQFJK","short_pith_number":"pith:BSGN6773","canonical_record":{"source":{"id":"1809.06758","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2018-09-18T14:17:30Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"07fa3c1748bc6136a381b5f47679b9db90c1e5e49fa0949cbcdcdfe2ea7b4cfd","abstract_canon_sha256":"3c819562f8ea47fc90ac838f7313e966d92c279a0bf1c57068cf020849a75a58"},"schema_version":"1.0"},"canonical_sha256":"0c8cdf7ffb181e8ff22938d678c6054a9ceec9ab91ab758664044eb285655c9c","source":{"kind":"arxiv","id":"1809.06758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06758","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06758v1","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06758","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"pith_short_12","alias_value":"BSGN6773DAPI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BSGN6773DAPI74RJ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BSGN6773","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BSGN6773DAPI74RJHDLHRRQFJK","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06758","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2018-09-18T14:17:30Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"07fa3c1748bc6136a381b5f47679b9db90c1e5e49fa0949cbcdcdfe2ea7b4cfd","abstract_canon_sha256":"3c819562f8ea47fc90ac838f7313e966d92c279a0bf1c57068cf020849a75a58"},"schema_version":"1.0"},"canonical_sha256":"0c8cdf7ffb181e8ff22938d678c6054a9ceec9ab91ab758664044eb285655c9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:24.761887Z","signature_b64":"BdY2jqTGpA+Z1nG5W3OJoGeOSkHjA8rd2dxTnVyQCTllf39eh1cdy2ZjVuvN/cxXYz6kxcE6+8qPA3dmsyiUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c8cdf7ffb181e8ff22938d678c6054a9ceec9ab91ab758664044eb285655c9c","last_reissued_at":"2026-05-18T00:05:24.761186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:24.761186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06758","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-18T00:05:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iP7byp+3k4Ztsxp5JHFY5Cs70tmjszDYW9aZZVZ96s0LjmxXTSl5gOJliEt2E9hNQ2IicT7KC3spNasUQBKhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:17:47.374490Z"},"content_sha256":"07a3676b12e1064092fd7f30d301554cfdd96e8ea4d380b745edf2d8d66e4534","schema_version":"1.0","event_id":"sha256:07a3676b12e1064092fd7f30d301554cfdd96e8ea4d380b745edf2d8d66e4534"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BSGN6773DAPI74RJHDLHRRQFJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"State-Dependent Kernel Selection for Conditional Sampling of Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Axel Gandy, James Scott","submitted_at":"2018-09-18T14:17:30Z","abstract_excerpt":"This paper introduces new efficient algorithms for two problems: sampling conditional on vertex degrees in unweighted graphs, and sampling conditional on vertex strengths in weighted graphs. The algorithms can sample conditional on the presence or absence of an arbitrary number of edges. The resulting conditional distributions provide the basis for exact tests. Existing samplers based on MCMC or sequential importance sampling are generally not scalable; their efficiency degrades in sparse graphs. MCMC methods usually require explicit computation of a Markov basis to navigate the complex state "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06758","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-18T00:05:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjLzh0vm0nziZa00cdagfn5a8TcJk56pqqz/CP4tbTdL/OUnqGrdxm+hXCCzRoYfDRQgjne0PKcPSVSlaDU4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T14:17:47.375209Z"},"content_sha256":"01c0d876d28f57ac3ea54094d066c6521909b22ac7edb1300ff4b9e5eb70d8aa","schema_version":"1.0","event_id":"sha256:01c0d876d28f57ac3ea54094d066c6521909b22ac7edb1300ff4b9e5eb70d8aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BSGN6773DAPI74RJHDLHRRQFJK/bundle.json","state_url":"https://pith.science/pith/BSGN6773DAPI74RJHDLHRRQFJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BSGN6773DAPI74RJHDLHRRQFJK/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-25T14:17:47Z","links":{"resolver":"https://pith.science/pith/BSGN6773DAPI74RJHDLHRRQFJK","bundle":"https://pith.science/pith/BSGN6773DAPI74RJHDLHRRQFJK/bundle.json","state":"https://pith.science/pith/BSGN6773DAPI74RJHDLHRRQFJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BSGN6773DAPI74RJHDLHRRQFJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BSGN6773DAPI74RJHDLHRRQFJK","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":"3c819562f8ea47fc90ac838f7313e966d92c279a0bf1c57068cf020849a75a58","cross_cats_sorted":["stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2018-09-18T14:17:30Z","title_canon_sha256":"07fa3c1748bc6136a381b5f47679b9db90c1e5e49fa0949cbcdcdfe2ea7b4cfd"},"schema_version":"1.0","source":{"id":"1809.06758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06758","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06758v1","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06758","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"pith_short_12","alias_value":"BSGN6773DAPI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BSGN6773DAPI74RJ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BSGN6773","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:01c0d876d28f57ac3ea54094d066c6521909b22ac7edb1300ff4b9e5eb70d8aa","target":"graph","created_at":"2026-05-18T00:05:24Z","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":"This paper introduces new efficient algorithms for two problems: sampling conditional on vertex degrees in unweighted graphs, and sampling conditional on vertex strengths in weighted graphs. The algorithms can sample conditional on the presence or absence of an arbitrary number of edges. The resulting conditional distributions provide the basis for exact tests. Existing samplers based on MCMC or sequential importance sampling are generally not scalable; their efficiency degrades in sparse graphs. MCMC methods usually require explicit computation of a Markov basis to navigate the complex state ","authors_text":"Axel Gandy, James Scott","cross_cats":["stat.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2018-09-18T14:17:30Z","title":"State-Dependent Kernel Selection for Conditional Sampling of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06758","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:07a3676b12e1064092fd7f30d301554cfdd96e8ea4d380b745edf2d8d66e4534","target":"record","created_at":"2026-05-18T00:05:24Z","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":"3c819562f8ea47fc90ac838f7313e966d92c279a0bf1c57068cf020849a75a58","cross_cats_sorted":["stat.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2018-09-18T14:17:30Z","title_canon_sha256":"07fa3c1748bc6136a381b5f47679b9db90c1e5e49fa0949cbcdcdfe2ea7b4cfd"},"schema_version":"1.0","source":{"id":"1809.06758","kind":"arxiv","version":1}},"canonical_sha256":"0c8cdf7ffb181e8ff22938d678c6054a9ceec9ab91ab758664044eb285655c9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c8cdf7ffb181e8ff22938d678c6054a9ceec9ab91ab758664044eb285655c9c","first_computed_at":"2026-05-18T00:05:24.761186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:24.761186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BdY2jqTGpA+Z1nG5W3OJoGeOSkHjA8rd2dxTnVyQCTllf39eh1cdy2ZjVuvN/cxXYz6kxcE6+8qPA3dmsyiUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:24.761887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07a3676b12e1064092fd7f30d301554cfdd96e8ea4d380b745edf2d8d66e4534","sha256:01c0d876d28f57ac3ea54094d066c6521909b22ac7edb1300ff4b9e5eb70d8aa"],"state_sha256":"abc03d390c7a83d43c888ce6c8cd77b4b9d4c5cbb94c808101ea07d7c388bc42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wQJCgvsqj+nodRUDRNj5dnk1mmGJzCLDd0z0mWxmU/mtJnxJFtNi7MTjFjEV9rXpnTaa0Og6fa/E6ObKdPFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T14:17:47.378808Z","bundle_sha256":"ce0f1bbfe73fb8fa82256e25a4814b6865585c6144b9cf2cf9a883876af07faf"}}