{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QMHPM6EVTERUX2QNKXDDHFOKAS","short_pith_number":"pith:QMHPM6EV","canonical_record":{"source":{"id":"1908.08881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-23T15:52:19Z","cross_cats_sorted":["cs.CY","cs.DM","math.CO"],"title_canon_sha256":"2224865606671ee2bd1cbec63ad5b331fbc89ac09f2d3ef3cf8b17898d4a4ee0","abstract_canon_sha256":"d3d6fc30129931c1d7901184033eb99cd33b978ca97b5cff37df0e27ee8fa4be"},"schema_version":"1.0"},"canonical_sha256":"830ef6789599234bea0d55c63395ca048a0cb0b5ed787cf5c80ec01ddd0fe8b1","source":{"kind":"arxiv","id":"1908.08881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08881","created_at":"2026-07-05T03:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08881v1","created_at":"2026-07-05T03:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08881","created_at":"2026-07-05T03:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"QMHPM6EVTERU","created_at":"2026-07-05T03:54:53Z"},{"alias_kind":"pith_short_16","alias_value":"QMHPM6EVTERUX2QN","created_at":"2026-07-05T03:54:53Z"},{"alias_kind":"pith_short_8","alias_value":"QMHPM6EV","created_at":"2026-07-05T03:54:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QMHPM6EVTERUX2QNKXDDHFOKAS","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-23T15:52:19Z","cross_cats_sorted":["cs.CY","cs.DM","math.CO"],"title_canon_sha256":"2224865606671ee2bd1cbec63ad5b331fbc89ac09f2d3ef3cf8b17898d4a4ee0","abstract_canon_sha256":"d3d6fc30129931c1d7901184033eb99cd33b978ca97b5cff37df0e27ee8fa4be"},"schema_version":"1.0"},"canonical_sha256":"830ef6789599234bea0d55c63395ca048a0cb0b5ed787cf5c80ec01ddd0fe8b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:53.407897Z","signature_b64":"Aa1H3OlwNDdWwMpYncR/4kLAYGk0LzoqW5x0ck1llE9TaM67oZexwuloshhl44aYl/iu3bwUKSSedjOHC/17AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"830ef6789599234bea0d55c63395ca048a0cb0b5ed787cf5c80ec01ddd0fe8b1","last_reissued_at":"2026-07-05T03:54:53.407477Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:53.407477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08881","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-07-05T03:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+zGXJ2XYGs2qwkf5UIIg9IGbvzZ7n9iUc5xvzTOmokyDMSEzFFB9uJ25qUW05ZcCBTb5u6fmVrQUCCKdUYJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:35:59.521058Z"},"content_sha256":"78ecc86727691a107a2f9020dd1bc0c065dca47feca1dcb79ae00e72632c898f","schema_version":"1.0","event_id":"sha256:78ecc86727691a107a2f9020dd1bc0c065dca47feca1dcb79ae00e72632c898f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QMHPM6EVTERUX2QNKXDDHFOKAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity and Geometry of Sampling Connected Graph Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Daryl DeFord, Elle Najt, Justin Solomon","submitted_at":"2019-08-23T15:52:19Z","abstract_excerpt":"In this paper, we prove intractability results about sampling from the set of partitions of a planar graph into connected components. Our proofs are motivated by a technique introduced by Jerrum, Valiant, and Vazirani. Moreover, we use gadgets inspired by their technique to provide families of graphs where the \"flip walk\" Markov chain used in practice for this sampling task exhibits exponentially slow mixing. Supporting our theoretical results we present some empirical evidence demonstrating the slow mixing of the flip walk on grid graphs and on real data. Inspired by connections to the statis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08881","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08881/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HeG1/Pr+o/f+GDm+n1BHju8s8/e7d2iR0+GZqQcC3d70OCmszimT/xNYVsoFKlA/R1GU3cg6ScmtQskzj5koAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T04:35:59.521633Z"},"content_sha256":"f5bbecbc620f00f8c69c0a8cff57082afc2d6551259d0de1fa964df6db623730","schema_version":"1.0","event_id":"sha256:f5bbecbc620f00f8c69c0a8cff57082afc2d6551259d0de1fa964df6db623730"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QMHPM6EVTERUX2QNKXDDHFOKAS/bundle.json","state_url":"https://pith.science/pith/QMHPM6EVTERUX2QNKXDDHFOKAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QMHPM6EVTERUX2QNKXDDHFOKAS/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-08-16T04:35:59Z","links":{"resolver":"https://pith.science/pith/QMHPM6EVTERUX2QNKXDDHFOKAS","bundle":"https://pith.science/pith/QMHPM6EVTERUX2QNKXDDHFOKAS/bundle.json","state":"https://pith.science/pith/QMHPM6EVTERUX2QNKXDDHFOKAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QMHPM6EVTERUX2QNKXDDHFOKAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QMHPM6EVTERUX2QNKXDDHFOKAS","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":"d3d6fc30129931c1d7901184033eb99cd33b978ca97b5cff37df0e27ee8fa4be","cross_cats_sorted":["cs.CY","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-23T15:52:19Z","title_canon_sha256":"2224865606671ee2bd1cbec63ad5b331fbc89ac09f2d3ef3cf8b17898d4a4ee0"},"schema_version":"1.0","source":{"id":"1908.08881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08881","created_at":"2026-07-05T03:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08881v1","created_at":"2026-07-05T03:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08881","created_at":"2026-07-05T03:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"QMHPM6EVTERU","created_at":"2026-07-05T03:54:53Z"},{"alias_kind":"pith_short_16","alias_value":"QMHPM6EVTERUX2QN","created_at":"2026-07-05T03:54:53Z"},{"alias_kind":"pith_short_8","alias_value":"QMHPM6EV","created_at":"2026-07-05T03:54:53Z"}],"graph_snapshots":[{"event_id":"sha256:f5bbecbc620f00f8c69c0a8cff57082afc2d6551259d0de1fa964df6db623730","target":"graph","created_at":"2026-07-05T03:54:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.08881/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we prove intractability results about sampling from the set of partitions of a planar graph into connected components. Our proofs are motivated by a technique introduced by Jerrum, Valiant, and Vazirani. Moreover, we use gadgets inspired by their technique to provide families of graphs where the \"flip walk\" Markov chain used in practice for this sampling task exhibits exponentially slow mixing. Supporting our theoretical results we present some empirical evidence demonstrating the slow mixing of the flip walk on grid graphs and on real data. Inspired by connections to the statis","authors_text":"Daryl DeFord, Elle Najt, Justin Solomon","cross_cats":["cs.CY","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-23T15:52:19Z","title":"Complexity and Geometry of Sampling Connected Graph Partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08881","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:78ecc86727691a107a2f9020dd1bc0c065dca47feca1dcb79ae00e72632c898f","target":"record","created_at":"2026-07-05T03:54:53Z","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":"d3d6fc30129931c1d7901184033eb99cd33b978ca97b5cff37df0e27ee8fa4be","cross_cats_sorted":["cs.CY","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-08-23T15:52:19Z","title_canon_sha256":"2224865606671ee2bd1cbec63ad5b331fbc89ac09f2d3ef3cf8b17898d4a4ee0"},"schema_version":"1.0","source":{"id":"1908.08881","kind":"arxiv","version":1}},"canonical_sha256":"830ef6789599234bea0d55c63395ca048a0cb0b5ed787cf5c80ec01ddd0fe8b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"830ef6789599234bea0d55c63395ca048a0cb0b5ed787cf5c80ec01ddd0fe8b1","first_computed_at":"2026-07-05T03:54:53.407477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:54:53.407477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Aa1H3OlwNDdWwMpYncR/4kLAYGk0LzoqW5x0ck1llE9TaM67oZexwuloshhl44aYl/iu3bwUKSSedjOHC/17AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:54:53.407897Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78ecc86727691a107a2f9020dd1bc0c065dca47feca1dcb79ae00e72632c898f","sha256:f5bbecbc620f00f8c69c0a8cff57082afc2d6551259d0de1fa964df6db623730"],"state_sha256":"5d5ed9b6e750dde0ebd661ec48f0b4e7db5902c8370a50eb6f297e79a2583b4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qedHv8FOBjLWSncmoM0G735GTsVvjeBy/gWZvdmFUHNtjZsfKR+47CjAxdFTTznZIKE1Y69opCvVHQaglofFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T04:35:59.526084Z","bundle_sha256":"37ed6b75adcc08f2315122c614c5f8425e5833601cf54f850586a8dcd048c682"}}