{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HSLAZANJQILQIAX6ALRXKQSY67","short_pith_number":"pith:HSLAZANJ","schema_version":"1.0","canonical_sha256":"3c960c81a982170402fe02e3754258f7c3b2db3a72e2690222f3c1c07c08ce1f","source":{"kind":"arxiv","id":"1911.05725","version":1},"attestation_state":"computed","paper":{"title":"Recombination: A family of Markov chains for redistricting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.CY","authors_text":"Daryl DeFord, Justin Solomon, Moon Duchin","submitted_at":"2019-10-31T23:28:39Z","abstract_excerpt":"Redistricting is the problem of partitioning a set of geographical units into a fixed number of districts, subject to a list of often-vague rules and priorities. In recent years, the use of randomized methods to sample from the vast space of districting plans has been gaining traction in courts of law for identifying partisan gerrymanders, and it is now emerging as a possible analytical tool for legislatures and independent commissions. In this paper, we set up redistricting as a graph partition problem and introduce a new family of Markov chains called Recombination (or ReCom) on the space of"},"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":"1911.05725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CY","submitted_at":"2019-10-31T23:28:39Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"8ba5c090f138d0801b6c3bac00e9b3947dbe63350d49216c8d176d89aba2f858","abstract_canon_sha256":"99e5cad7186c9da4916d261bb76fba800cffda7c16513fcf82fd4153e212aee6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:00.513381Z","signature_b64":"fZElUQiqcsGjHvZ3MUKgPReijOAWcebdJConds6hesA0zs5Pck02zNvrKoBjjP0HbW/ABhWJQxebeVcUFHvBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c960c81a982170402fe02e3754258f7c3b2db3a72e2690222f3c1c07c08ce1f","last_reissued_at":"2026-07-05T00:19:00.513019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:00.513019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recombination: A family of Markov chains for redistricting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.CY","authors_text":"Daryl DeFord, Justin Solomon, Moon Duchin","submitted_at":"2019-10-31T23:28:39Z","abstract_excerpt":"Redistricting is the problem of partitioning a set of geographical units into a fixed number of districts, subject to a list of often-vague rules and priorities. In recent years, the use of randomized methods to sample from the vast space of districting plans has been gaining traction in courts of law for identifying partisan gerrymanders, and it is now emerging as a possible analytical tool for legislatures and independent commissions. In this paper, we set up redistricting as a graph partition problem and introduce a new family of Markov chains called Recombination (or ReCom) on the space of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05725","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/1911.05725/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":"1911.05725","created_at":"2026-07-05T00:19:00.513074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.05725v1","created_at":"2026-07-05T00:19:00.513074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05725","created_at":"2026-07-05T00:19:00.513074+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSLAZANJQILQ","created_at":"2026-07-05T00:19:00.513074+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSLAZANJQILQIAX6","created_at":"2026-07-05T00:19:00.513074+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSLAZANJ","created_at":"2026-07-05T00:19:00.513074+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HSLAZANJQILQIAX6ALRXKQSY67","json":"https://pith.science/pith/HSLAZANJQILQIAX6ALRXKQSY67.json","graph_json":"https://pith.science/api/pith-number/HSLAZANJQILQIAX6ALRXKQSY67/graph.json","events_json":"https://pith.science/api/pith-number/HSLAZANJQILQIAX6ALRXKQSY67/events.json","paper":"https://pith.science/paper/HSLAZANJ"},"agent_actions":{"view_html":"https://pith.science/pith/HSLAZANJQILQIAX6ALRXKQSY67","download_json":"https://pith.science/pith/HSLAZANJQILQIAX6ALRXKQSY67.json","view_paper":"https://pith.science/paper/HSLAZANJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.05725&json=true","fetch_graph":"https://pith.science/api/pith-number/HSLAZANJQILQIAX6ALRXKQSY67/graph.json","fetch_events":"https://pith.science/api/pith-number/HSLAZANJQILQIAX6ALRXKQSY67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSLAZANJQILQIAX6ALRXKQSY67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSLAZANJQILQIAX6ALRXKQSY67/action/storage_attestation","attest_author":"https://pith.science/pith/HSLAZANJQILQIAX6ALRXKQSY67/action/author_attestation","sign_citation":"https://pith.science/pith/HSLAZANJQILQIAX6ALRXKQSY67/action/citation_signature","submit_replication":"https://pith.science/pith/HSLAZANJQILQIAX6ALRXKQSY67/action/replication_record"}},"created_at":"2026-07-05T00:19:00.513074+00:00","updated_at":"2026-07-05T00:19:00.513074+00:00"}