{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZQP5KARDUYK7A5RNWVEKMVHSG6","short_pith_number":"pith:ZQP5KARD","schema_version":"1.0","canonical_sha256":"cc1fd50223a615f0762db548a654f237978cd1d37cf316fc7563593b52b4736e","source":{"kind":"arxiv","id":"2402.01942","version":5},"attestation_state":"computed","paper":{"title":"Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"q-bio.GN","authors_text":"Alexander Wiedemann, Garner Cochran, Grace Stadnyk, Heather Smith Blake, Inne Singgih, Lora Bailey, Michael Levet, Nathan Fox, Reem Mahmoud","submitted_at":"2024-02-02T22:36:21Z","abstract_excerpt":"Genome rearrangement is a common model for molecular evolution. In this paper, we consider the Pairwise Rearrangement problem, which takes as input two genomes and asks for the number of minimum-length sequences of permissible operations transforming the first genome into the second. In the Single Cut-and-Join model (Bergeron, Medvedev, & Stoye, J. Comput. Biol. 2010), Pairwise Rearrangement is $\\#\\textsf{P}$-complete (Bailey, et. al., COCOON 2023), which implies that exact sampling is intractable. In order to cope with this intractability, we investigate the parameterized complexity of this p"},"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":"2402.01942","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.GN","submitted_at":"2024-02-02T22:36:21Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"a76157a42b2c6c18664b4915d66f932e254ec8fb5c2314547d630b98e2214019","abstract_canon_sha256":"63f720622aa12eb4b3b798846ddf7caf746a0d56bda3c36688f290cbd7b7dd91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:30.924108Z","signature_b64":"tG+1AJn2fyJi/Ioeg8+UAml2qpnzIvlTIAvTJhBu+lByoLKYHO6sehviyLbYKWvouHdwpo8OdJIxsFqidGJ6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc1fd50223a615f0762db548a654f237978cd1d37cf316fc7563593b52b4736e","last_reissued_at":"2026-07-05T11:11:30.923521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:30.923521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"q-bio.GN","authors_text":"Alexander Wiedemann, Garner Cochran, Grace Stadnyk, Heather Smith Blake, Inne Singgih, Lora Bailey, Michael Levet, Nathan Fox, Reem Mahmoud","submitted_at":"2024-02-02T22:36:21Z","abstract_excerpt":"Genome rearrangement is a common model for molecular evolution. In this paper, we consider the Pairwise Rearrangement problem, which takes as input two genomes and asks for the number of minimum-length sequences of permissible operations transforming the first genome into the second. In the Single Cut-and-Join model (Bergeron, Medvedev, & Stoye, J. Comput. Biol. 2010), Pairwise Rearrangement is $\\#\\textsf{P}$-complete (Bailey, et. al., COCOON 2023), which implies that exact sampling is intractable. In order to cope with this intractability, we investigate the parameterized complexity of this p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.01942","kind":"arxiv","version":5},"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/2402.01942/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":"2402.01942","created_at":"2026-07-05T11:11:30.923590+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.01942v5","created_at":"2026-07-05T11:11:30.923590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.01942","created_at":"2026-07-05T11:11:30.923590+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQP5KARDUYK7","created_at":"2026-07-05T11:11:30.923590+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQP5KARDUYK7A5RN","created_at":"2026-07-05T11:11:30.923590+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQP5KARD","created_at":"2026-07-05T11:11:30.923590+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/ZQP5KARDUYK7A5RNWVEKMVHSG6","json":"https://pith.science/pith/ZQP5KARDUYK7A5RNWVEKMVHSG6.json","graph_json":"https://pith.science/api/pith-number/ZQP5KARDUYK7A5RNWVEKMVHSG6/graph.json","events_json":"https://pith.science/api/pith-number/ZQP5KARDUYK7A5RNWVEKMVHSG6/events.json","paper":"https://pith.science/paper/ZQP5KARD"},"agent_actions":{"view_html":"https://pith.science/pith/ZQP5KARDUYK7A5RNWVEKMVHSG6","download_json":"https://pith.science/pith/ZQP5KARDUYK7A5RNWVEKMVHSG6.json","view_paper":"https://pith.science/paper/ZQP5KARD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.01942&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQP5KARDUYK7A5RNWVEKMVHSG6/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQP5KARDUYK7A5RNWVEKMVHSG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQP5KARDUYK7A5RNWVEKMVHSG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQP5KARDUYK7A5RNWVEKMVHSG6/action/storage_attestation","attest_author":"https://pith.science/pith/ZQP5KARDUYK7A5RNWVEKMVHSG6/action/author_attestation","sign_citation":"https://pith.science/pith/ZQP5KARDUYK7A5RNWVEKMVHSG6/action/citation_signature","submit_replication":"https://pith.science/pith/ZQP5KARDUYK7A5RNWVEKMVHSG6/action/replication_record"}},"created_at":"2026-07-05T11:11:30.923590+00:00","updated_at":"2026-07-05T11:11:30.923590+00:00"}