{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:H7ZURZNWYAJUR2ZHVXMYA4WBYQ","short_pith_number":"pith:H7ZURZNW","schema_version":"1.0","canonical_sha256":"3ff348e5b6c01348eb27add98072c1c40d5162fd782c75128f370b7cb1fc650f","source":{"kind":"arxiv","id":"2206.04883","version":2},"attestation_state":"computed","paper":{"title":"On the Complexity of Sampling Redistricting Plans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Moses Charikar, Paul Liu, Thuy-Duong Vuong, Tianyu Liu","submitted_at":"2022-06-10T05:35:28Z","abstract_excerpt":"A crucial task in the political redistricting problem is to sample redistricting plans i.e. a partitioning of the graph of census blocks into districts.\n  We show that Recombination [DeFord-Duchin-Solomon'21]-a popular Markov chain to sample redistricting plans-is exponentially slow mixing on simple subgraph of $\\mathbb{Z}_2.$ We show an alternative way to sample balance, compact and contiguous redistricting plans using a \"relaxed\" version of ReCom and rejection sampling."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2206.04883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-06-10T05:35:28Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"8c379bfb2b090f572afb7d9005c75ba47bd057ac10d805e05d175da34dd29c14","abstract_canon_sha256":"9de7a303e23a48767b6de89732ca844d749b2b8661e3ca8717571cdae0216ce4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:04:41.477988Z","signature_b64":"RVrs4dpz0jyohlrYfa+eYK3GkQuHzwT10Z3JX6Y4e8fV2gsXWpWVKuNY7pqXUAl/wiCzqU1MJJx4hNLKjMBSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ff348e5b6c01348eb27add98072c1c40d5162fd782c75128f370b7cb1fc650f","last_reissued_at":"2026-07-05T07:04:41.477542Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:04:41.477542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Sampling Redistricting Plans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Moses Charikar, Paul Liu, Thuy-Duong Vuong, Tianyu Liu","submitted_at":"2022-06-10T05:35:28Z","abstract_excerpt":"A crucial task in the political redistricting problem is to sample redistricting plans i.e. a partitioning of the graph of census blocks into districts.\n  We show that Recombination [DeFord-Duchin-Solomon'21]-a popular Markov chain to sample redistricting plans-is exponentially slow mixing on simple subgraph of $\\mathbb{Z}_2.$ We show an alternative way to sample balance, compact and contiguous redistricting plans using a \"relaxed\" version of ReCom and rejection sampling."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.04883","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.04883/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2206.04883","created_at":"2026-07-05T07:04:41.477596+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.04883v2","created_at":"2026-07-05T07:04:41.477596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.04883","created_at":"2026-07-05T07:04:41.477596+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7ZURZNWYAJU","created_at":"2026-07-05T07:04:41.477596+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7ZURZNWYAJUR2ZH","created_at":"2026-07-05T07:04:41.477596+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7ZURZNW","created_at":"2026-07-05T07:04:41.477596+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2508.11130","citing_title":"Sampling Tree-Weighted Partitions Without Sampling Trees","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04960","citing_title":"Census Dual Graphs: Properties and Random Graph Models","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H7ZURZNWYAJUR2ZHVXMYA4WBYQ","json":"https://pith.science/pith/H7ZURZNWYAJUR2ZHVXMYA4WBYQ.json","graph_json":"https://pith.science/api/pith-number/H7ZURZNWYAJUR2ZHVXMYA4WBYQ/graph.json","events_json":"https://pith.science/api/pith-number/H7ZURZNWYAJUR2ZHVXMYA4WBYQ/events.json","paper":"https://pith.science/paper/H7ZURZNW"},"agent_actions":{"view_html":"https://pith.science/pith/H7ZURZNWYAJUR2ZHVXMYA4WBYQ","download_json":"https://pith.science/pith/H7ZURZNWYAJUR2ZHVXMYA4WBYQ.json","view_paper":"https://pith.science/paper/H7ZURZNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.04883&json=true","fetch_graph":"https://pith.science/api/pith-number/H7ZURZNWYAJUR2ZHVXMYA4WBYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/H7ZURZNWYAJUR2ZHVXMYA4WBYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7ZURZNWYAJUR2ZHVXMYA4WBYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7ZURZNWYAJUR2ZHVXMYA4WBYQ/action/storage_attestation","attest_author":"https://pith.science/pith/H7ZURZNWYAJUR2ZHVXMYA4WBYQ/action/author_attestation","sign_citation":"https://pith.science/pith/H7ZURZNWYAJUR2ZHVXMYA4WBYQ/action/citation_signature","submit_replication":"https://pith.science/pith/H7ZURZNWYAJUR2ZHVXMYA4WBYQ/action/replication_record"}},"created_at":"2026-07-05T07:04:41.477596+00:00","updated_at":"2026-07-05T07:04:41.477596+00:00"}