{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6H7Q55LAQ7UYI4BHGIIAF3KWO6","short_pith_number":"pith:6H7Q55LA","schema_version":"1.0","canonical_sha256":"f1ff0ef56087e9847027321002ed56779857f41851adc6b87e6e7ff5b847c3de","source":{"kind":"arxiv","id":"2305.01851","version":4},"attestation_state":"computed","paper":{"title":"Complexity and Enumeration in Models of Genome Rearrangement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"q-bio.GN","authors_text":"Alexander Wiedemann, Elizabeth Matson, Garner Cochran, Grace Stadnyk, Heather Smith Blake, Inne Singgih, Lora Bailey, Michael Levet, Nathan Fox, Reem Mahmoud, Xinyi Wang","submitted_at":"2023-05-03T01:52:17Z","abstract_excerpt":"In this paper, we examine the computational complexity of enumeration in certain genome rearrangement models. We first show that the Pairwise Rearrangement problem in the Single Cut-and-Join model (Bergeron, Medvedev, & Stoye, J. Comput. Biol. 2010) is $\\#\\textsf{P}$-complete under polynomial-time Turing reductions. Next, we show that in the Single Cut or Join model (Feijao & Meidanis, IEEE ACM Trans. Comp. Biol. Bioinf. 2011), the problem of enumerating all medians ($\\#$Median) is logspace-computable ($\\textsf{FL}$), improving upon the previous polynomial-time ($\\textsf{FP}$) bound of Mikl\\'o"},"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":"2305.01851","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"q-bio.GN","submitted_at":"2023-05-03T01:52:17Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"7a84804585eed462d8b28d1051edf6c5156aaa29903643c3ebe757b8ca05deaf","abstract_canon_sha256":"a46d73f81cf54dcd031ae8acad1d6439e1348b34bfabbd2b9cfec654f19856dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:12:22.613538Z","signature_b64":"sye+w45WORVyxffdY3dzjDsCc1DMnMgfOoPSHYKMZp/9Mck9UQHhvTdUAyQfP8dA50Olguya7383HfJWOXGSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1ff0ef56087e9847027321002ed56779857f41851adc6b87e6e7ff5b847c3de","last_reissued_at":"2026-07-05T09:12:22.613061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:12:22.613061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity and Enumeration in Models of Genome Rearrangement","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"q-bio.GN","authors_text":"Alexander Wiedemann, Elizabeth Matson, Garner Cochran, Grace Stadnyk, Heather Smith Blake, Inne Singgih, Lora Bailey, Michael Levet, Nathan Fox, Reem Mahmoud, Xinyi Wang","submitted_at":"2023-05-03T01:52:17Z","abstract_excerpt":"In this paper, we examine the computational complexity of enumeration in certain genome rearrangement models. We first show that the Pairwise Rearrangement problem in the Single Cut-and-Join model (Bergeron, Medvedev, & Stoye, J. Comput. Biol. 2010) is $\\#\\textsf{P}$-complete under polynomial-time Turing reductions. Next, we show that in the Single Cut or Join model (Feijao & Meidanis, IEEE ACM Trans. Comp. Biol. Bioinf. 2011), the problem of enumerating all medians ($\\#$Median) is logspace-computable ($\\textsf{FL}$), improving upon the previous polynomial-time ($\\textsf{FP}$) bound of Mikl\\'o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01851","kind":"arxiv","version":4},"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/2305.01851/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":"2305.01851","created_at":"2026-07-05T09:12:22.613116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.01851v4","created_at":"2026-07-05T09:12:22.613116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01851","created_at":"2026-07-05T09:12:22.613116+00:00"},{"alias_kind":"pith_short_12","alias_value":"6H7Q55LAQ7UY","created_at":"2026-07-05T09:12:22.613116+00:00"},{"alias_kind":"pith_short_16","alias_value":"6H7Q55LAQ7UYI4BH","created_at":"2026-07-05T09:12:22.613116+00:00"},{"alias_kind":"pith_short_8","alias_value":"6H7Q55LA","created_at":"2026-07-05T09:12:22.613116+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/6H7Q55LAQ7UYI4BHGIIAF3KWO6","json":"https://pith.science/pith/6H7Q55LAQ7UYI4BHGIIAF3KWO6.json","graph_json":"https://pith.science/api/pith-number/6H7Q55LAQ7UYI4BHGIIAF3KWO6/graph.json","events_json":"https://pith.science/api/pith-number/6H7Q55LAQ7UYI4BHGIIAF3KWO6/events.json","paper":"https://pith.science/paper/6H7Q55LA"},"agent_actions":{"view_html":"https://pith.science/pith/6H7Q55LAQ7UYI4BHGIIAF3KWO6","download_json":"https://pith.science/pith/6H7Q55LAQ7UYI4BHGIIAF3KWO6.json","view_paper":"https://pith.science/paper/6H7Q55LA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.01851&json=true","fetch_graph":"https://pith.science/api/pith-number/6H7Q55LAQ7UYI4BHGIIAF3KWO6/graph.json","fetch_events":"https://pith.science/api/pith-number/6H7Q55LAQ7UYI4BHGIIAF3KWO6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6H7Q55LAQ7UYI4BHGIIAF3KWO6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6H7Q55LAQ7UYI4BHGIIAF3KWO6/action/storage_attestation","attest_author":"https://pith.science/pith/6H7Q55LAQ7UYI4BHGIIAF3KWO6/action/author_attestation","sign_citation":"https://pith.science/pith/6H7Q55LAQ7UYI4BHGIIAF3KWO6/action/citation_signature","submit_replication":"https://pith.science/pith/6H7Q55LAQ7UYI4BHGIIAF3KWO6/action/replication_record"}},"created_at":"2026-07-05T09:12:22.613116+00:00","updated_at":"2026-07-05T09:12:22.613116+00:00"}