{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HCVHCFZWQKJFCCN77GCAUBANE7","short_pith_number":"pith:HCVHCFZW","canonical_record":{"source":{"id":"1109.5242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-24T08:14:24Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"0709f173863bffeb90cbd9f3ef0171a3600899e386594902118f347e31dc9183","abstract_canon_sha256":"dd9d4421f42e1ce0ed0ebe7cd303ed26eff9f852ee49895ec55aa398f2fe40bd"},"schema_version":"1.0"},"canonical_sha256":"38aa71173682925109bff9840a040d27f2ac9e462912481363a4d34c0824857b","source":{"kind":"arxiv","id":"1109.5242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5242","created_at":"2026-05-18T04:04:29Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5242v1","created_at":"2026-05-18T04:04:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5242","created_at":"2026-05-18T04:04:29Z"},{"alias_kind":"pith_short_12","alias_value":"HCVHCFZWQKJF","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HCVHCFZWQKJFCCN7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HCVHCFZW","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HCVHCFZWQKJFCCN77GCAUBANE7","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-24T08:14:24Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"0709f173863bffeb90cbd9f3ef0171a3600899e386594902118f347e31dc9183","abstract_canon_sha256":"dd9d4421f42e1ce0ed0ebe7cd303ed26eff9f852ee49895ec55aa398f2fe40bd"},"schema_version":"1.0"},"canonical_sha256":"38aa71173682925109bff9840a040d27f2ac9e462912481363a4d34c0824857b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:29.816491Z","signature_b64":"knH9XRxU+PgyD4WaG6f3oPlPFGvoTYIxmvxvnIEcIXiSwrmJzfL6LYLDTcwSNSRIDncnFyYML92s0UI3GbObDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38aa71173682925109bff9840a040d27f2ac9e462912481363a4d34c0824857b","last_reissued_at":"2026-05-18T04:04:29.815783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:29.815783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5242","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-18T04:04:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aw9vTV37ZGgHHQ86BE0XnCgQuGYJ+eVn0Jb5KikV9w3j/vDdSanmHMvQINp+nE7S4NvX34iu6kdC2ZvlgIbHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:32:55.754062Z"},"content_sha256":"ddcaddc00978db2d46e1e243d63c49fdfdca9f9bda289446736c466bd5b0d2c2","schema_version":"1.0","event_id":"sha256:ddcaddc00978db2d46e1e243d63c49fdfdca9f9bda289446736c466bd5b0d2c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HCVHCFZWQKJFCCN77GCAUBANE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Counterexample to rapid mixing of the Ge-Stefankovic Process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"math.PR","authors_text":"Leslie Ann Goldberg, Mark Jerrum","submitted_at":"2011-09-24T08:14:24Z","abstract_excerpt":"Ge and Stefankovic have recently introduced a novel two-variable graph polynomial. When specialised to a bipartite graphs G and evaluated at the point (1/2,1) this polynomial gives the number of independent sets in the graph. Inspired by this polynomial, they also introduced a Markov chain which, if rapidly mixing, would provide an efficient sampling procedure for independent sets in G. This sampling procedure in turn would imply the existence of efficient approximation algorithms for a number of significant counting problems whose complexity is so far unresolved. The proposed Markov chain is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5242","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-18T04:04:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0LRegwhe1vu/4+uT9E1/dfj7ml2XHZ5vGhl05cveUZUpar0CikDjUuXJua5jQpATcxnuZZgbGZlNpkV0FETAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:32:55.754428Z"},"content_sha256":"fef830e1444d435af63e902b020fe9e81fd8b87247e38a7676a6ea47681ea8af","schema_version":"1.0","event_id":"sha256:fef830e1444d435af63e902b020fe9e81fd8b87247e38a7676a6ea47681ea8af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCVHCFZWQKJFCCN77GCAUBANE7/bundle.json","state_url":"https://pith.science/pith/HCVHCFZWQKJFCCN77GCAUBANE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCVHCFZWQKJFCCN77GCAUBANE7/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-12T09:32:55Z","links":{"resolver":"https://pith.science/pith/HCVHCFZWQKJFCCN77GCAUBANE7","bundle":"https://pith.science/pith/HCVHCFZWQKJFCCN77GCAUBANE7/bundle.json","state":"https://pith.science/pith/HCVHCFZWQKJFCCN77GCAUBANE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCVHCFZWQKJFCCN77GCAUBANE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HCVHCFZWQKJFCCN77GCAUBANE7","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":"dd9d4421f42e1ce0ed0ebe7cd303ed26eff9f852ee49895ec55aa398f2fe40bd","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-24T08:14:24Z","title_canon_sha256":"0709f173863bffeb90cbd9f3ef0171a3600899e386594902118f347e31dc9183"},"schema_version":"1.0","source":{"id":"1109.5242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5242","created_at":"2026-05-18T04:04:29Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5242v1","created_at":"2026-05-18T04:04:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5242","created_at":"2026-05-18T04:04:29Z"},{"alias_kind":"pith_short_12","alias_value":"HCVHCFZWQKJF","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HCVHCFZWQKJFCCN7","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HCVHCFZW","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:fef830e1444d435af63e902b020fe9e81fd8b87247e38a7676a6ea47681ea8af","target":"graph","created_at":"2026-05-18T04:04:29Z","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":"Ge and Stefankovic have recently introduced a novel two-variable graph polynomial. When specialised to a bipartite graphs G and evaluated at the point (1/2,1) this polynomial gives the number of independent sets in the graph. Inspired by this polynomial, they also introduced a Markov chain which, if rapidly mixing, would provide an efficient sampling procedure for independent sets in G. This sampling procedure in turn would imply the existence of efficient approximation algorithms for a number of significant counting problems whose complexity is so far unresolved. The proposed Markov chain is ","authors_text":"Leslie Ann Goldberg, Mark Jerrum","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-24T08:14:24Z","title":"A Counterexample to rapid mixing of the Ge-Stefankovic Process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5242","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:ddcaddc00978db2d46e1e243d63c49fdfdca9f9bda289446736c466bd5b0d2c2","target":"record","created_at":"2026-05-18T04:04:29Z","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":"dd9d4421f42e1ce0ed0ebe7cd303ed26eff9f852ee49895ec55aa398f2fe40bd","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-09-24T08:14:24Z","title_canon_sha256":"0709f173863bffeb90cbd9f3ef0171a3600899e386594902118f347e31dc9183"},"schema_version":"1.0","source":{"id":"1109.5242","kind":"arxiv","version":1}},"canonical_sha256":"38aa71173682925109bff9840a040d27f2ac9e462912481363a4d34c0824857b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38aa71173682925109bff9840a040d27f2ac9e462912481363a4d34c0824857b","first_computed_at":"2026-05-18T04:04:29.815783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:29.815783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"knH9XRxU+PgyD4WaG6f3oPlPFGvoTYIxmvxvnIEcIXiSwrmJzfL6LYLDTcwSNSRIDncnFyYML92s0UI3GbObDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:29.816491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddcaddc00978db2d46e1e243d63c49fdfdca9f9bda289446736c466bd5b0d2c2","sha256:fef830e1444d435af63e902b020fe9e81fd8b87247e38a7676a6ea47681ea8af"],"state_sha256":"bd4a955923a71a594b467ba74a048edf34be06defcbdec804c040c9353fbc523"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j7UmE86JrGuocD0aRaJBXbYtv2OHF+B1KwA2Vg3EfqFuKJ60dytmbz2G0HHfxN6wUXTnA1dhUDnaWk7aQpqRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:32:55.756394Z","bundle_sha256":"7fe29f8701db0bd76c7424b232409d43e04ad9f62c1c1c760e9cdc9d760c8d9c"}}