{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:BN2RVNMWBW5OMEJIG2SEAN7TCB","short_pith_number":"pith:BN2RVNMW","schema_version":"1.0","canonical_sha256":"0b751ab5960dbae6112836a44037f3106dc1e3be3f486fdf454b2cdeaec41189","source":{"kind":"arxiv","id":"1011.1157","version":1},"attestation_state":"computed","paper":{"title":"Sorting by Transpositions is Difficult","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Guillaume Fertin, Irena Rusu, Laurent Bulteau","submitted_at":"2010-11-04T13:41:12Z","abstract_excerpt":"In comparative genomics, a transposition is an operation that exchanges two consecutive sequences of genes in a genome. The transposition distance, that is, the minimum number of transpositions needed to transform a genome into another, is, according to numerous studies, a relevant evolutionary distance. The problem of computing this distance when genomes are represented by permutations, called the Sorting by Transpositions problem, has been introduced by Bafna and Pevzner in 1995. It has naturally been the focus of a number of studies, but the computational complexity of this problem has rema"},"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":"1011.1157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-04T13:41:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"31c9d41b49e85fcf3156c88bbf0590e113da29f090f99cc92c1d595ca2e9f119","abstract_canon_sha256":"0507a4bcc334179665dd5499d4e44640050dea86e1114601357a2514f5003da3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:18.723576Z","signature_b64":"Tvv+OxYaOyYj8XIzhKQSkvggPi90+IMVYb/CIGSBaLgkxDG7SQlpS00bvtYhKoxHbMMF7kuOE4H/emhZZxBLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b751ab5960dbae6112836a44037f3106dc1e3be3f486fdf454b2cdeaec41189","last_reissued_at":"2026-05-18T03:46:18.722991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:18.722991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorting by Transpositions is Difficult","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Guillaume Fertin, Irena Rusu, Laurent Bulteau","submitted_at":"2010-11-04T13:41:12Z","abstract_excerpt":"In comparative genomics, a transposition is an operation that exchanges two consecutive sequences of genes in a genome. The transposition distance, that is, the minimum number of transpositions needed to transform a genome into another, is, according to numerous studies, a relevant evolutionary distance. The problem of computing this distance when genomes are represented by permutations, called the Sorting by Transpositions problem, has been introduced by Bafna and Pevzner in 1995. It has naturally been the focus of a number of studies, but the computational complexity of this problem has rema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1157","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":""},"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":"1011.1157","created_at":"2026-05-18T03:46:18.723055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1157v1","created_at":"2026-05-18T03:46:18.723055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1157","created_at":"2026-05-18T03:46:18.723055+00:00"},{"alias_kind":"pith_short_12","alias_value":"BN2RVNMWBW5O","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BN2RVNMWBW5OMEJI","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BN2RVNMW","created_at":"2026-05-18T12:26:05.355336+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/BN2RVNMWBW5OMEJIG2SEAN7TCB","json":"https://pith.science/pith/BN2RVNMWBW5OMEJIG2SEAN7TCB.json","graph_json":"https://pith.science/api/pith-number/BN2RVNMWBW5OMEJIG2SEAN7TCB/graph.json","events_json":"https://pith.science/api/pith-number/BN2RVNMWBW5OMEJIG2SEAN7TCB/events.json","paper":"https://pith.science/paper/BN2RVNMW"},"agent_actions":{"view_html":"https://pith.science/pith/BN2RVNMWBW5OMEJIG2SEAN7TCB","download_json":"https://pith.science/pith/BN2RVNMWBW5OMEJIG2SEAN7TCB.json","view_paper":"https://pith.science/paper/BN2RVNMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1157&json=true","fetch_graph":"https://pith.science/api/pith-number/BN2RVNMWBW5OMEJIG2SEAN7TCB/graph.json","fetch_events":"https://pith.science/api/pith-number/BN2RVNMWBW5OMEJIG2SEAN7TCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BN2RVNMWBW5OMEJIG2SEAN7TCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BN2RVNMWBW5OMEJIG2SEAN7TCB/action/storage_attestation","attest_author":"https://pith.science/pith/BN2RVNMWBW5OMEJIG2SEAN7TCB/action/author_attestation","sign_citation":"https://pith.science/pith/BN2RVNMWBW5OMEJIG2SEAN7TCB/action/citation_signature","submit_replication":"https://pith.science/pith/BN2RVNMWBW5OMEJIG2SEAN7TCB/action/replication_record"}},"created_at":"2026-05-18T03:46:18.723055+00:00","updated_at":"2026-05-18T03:46:18.723055+00:00"}