{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BT65ZRRSTJVIGRVLQF5RFY5SND","short_pith_number":"pith:BT65ZRRS","schema_version":"1.0","canonical_sha256":"0cfddcc6329a6a8346ab817b12e3b268d0ced493f4eb5cc45407bc5db0f32e72","source":{"kind":"arxiv","id":"1902.10765","version":2},"attestation_state":"computed","paper":{"title":"Reconfiguration of Connected Graph Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Christopher Meierfrankenfeld, Csaba D. T\\'oth, Diane L. Souvaine, Hugo A. Akitaya, Matias Korman, Matthew D. Jones, Michael J. Munje, Michael Thramann","submitted_at":"2019-02-27T20:18:23Z","abstract_excerpt":"Motivated by recent computational models for redistricting and detection of gerrymandering, we study the following problem on graph partitions. Given a graph $G$ and an integer $k\\geq 1$, a $k$-district map of $G$ is a partition of $V(G)$ into $k$ nonempty subsets, called districts, each of which induces a connected subgraph of $G$. A switch is an operation that modifies a $k$-district map by reassigning a subset of vertices from one district to an adjacent district; a 1-switch is a switch that moves a single vertex. We study the connectivity of the configuration space of all $k$-district maps"},"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":"1902.10765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-02-27T20:18:23Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"ba3829050b6aafbc03c3945a912826af8186ec5acfb9ddbe88a1d67ecbc69feb","abstract_canon_sha256":"9d6a1016c401cdf94703dc2b9c97404ede8709e51faf04533838deb20afb3407"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:55.635760Z","signature_b64":"nutQ4quRQjJ/DS9GDIyBLHx/85l2v5JnfNN3c/b78S1P36I0UMSwZO49ajCxWtc+hILvZhRtGEhDbAIW3wpsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cfddcc6329a6a8346ab817b12e3b268d0ced493f4eb5cc45407bc5db0f32e72","last_reissued_at":"2026-07-05T02:52:55.635353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:55.635353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reconfiguration of Connected Graph Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Christopher Meierfrankenfeld, Csaba D. T\\'oth, Diane L. Souvaine, Hugo A. Akitaya, Matias Korman, Matthew D. Jones, Michael J. Munje, Michael Thramann","submitted_at":"2019-02-27T20:18:23Z","abstract_excerpt":"Motivated by recent computational models for redistricting and detection of gerrymandering, we study the following problem on graph partitions. Given a graph $G$ and an integer $k\\geq 1$, a $k$-district map of $G$ is a partition of $V(G)$ into $k$ nonempty subsets, called districts, each of which induces a connected subgraph of $G$. A switch is an operation that modifies a $k$-district map by reassigning a subset of vertices from one district to an adjacent district; a 1-switch is a switch that moves a single vertex. We study the connectivity of the configuration space of all $k$-district maps"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10765","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/1902.10765/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":"1902.10765","created_at":"2026-07-05T02:52:55.635405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10765v2","created_at":"2026-07-05T02:52:55.635405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10765","created_at":"2026-07-05T02:52:55.635405+00:00"},{"alias_kind":"pith_short_12","alias_value":"BT65ZRRSTJVI","created_at":"2026-07-05T02:52:55.635405+00:00"},{"alias_kind":"pith_short_16","alias_value":"BT65ZRRSTJVIGRVL","created_at":"2026-07-05T02:52:55.635405+00:00"},{"alias_kind":"pith_short_8","alias_value":"BT65ZRRS","created_at":"2026-07-05T02:52:55.635405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08881","citing_title":"Complexity and Geometry of Sampling Connected Graph Partitions","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BT65ZRRSTJVIGRVLQF5RFY5SND","json":"https://pith.science/pith/BT65ZRRSTJVIGRVLQF5RFY5SND.json","graph_json":"https://pith.science/api/pith-number/BT65ZRRSTJVIGRVLQF5RFY5SND/graph.json","events_json":"https://pith.science/api/pith-number/BT65ZRRSTJVIGRVLQF5RFY5SND/events.json","paper":"https://pith.science/paper/BT65ZRRS"},"agent_actions":{"view_html":"https://pith.science/pith/BT65ZRRSTJVIGRVLQF5RFY5SND","download_json":"https://pith.science/pith/BT65ZRRSTJVIGRVLQF5RFY5SND.json","view_paper":"https://pith.science/paper/BT65ZRRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10765&json=true","fetch_graph":"https://pith.science/api/pith-number/BT65ZRRSTJVIGRVLQF5RFY5SND/graph.json","fetch_events":"https://pith.science/api/pith-number/BT65ZRRSTJVIGRVLQF5RFY5SND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BT65ZRRSTJVIGRVLQF5RFY5SND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BT65ZRRSTJVIGRVLQF5RFY5SND/action/storage_attestation","attest_author":"https://pith.science/pith/BT65ZRRSTJVIGRVLQF5RFY5SND/action/author_attestation","sign_citation":"https://pith.science/pith/BT65ZRRSTJVIGRVLQF5RFY5SND/action/citation_signature","submit_replication":"https://pith.science/pith/BT65ZRRSTJVIGRVLQF5RFY5SND/action/replication_record"}},"created_at":"2026-07-05T02:52:55.635405+00:00","updated_at":"2026-07-05T02:52:55.635405+00:00"}