{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:45EPXYCLQI5GFKYKLICSRL7QXZ","short_pith_number":"pith:45EPXYCL","schema_version":"1.0","canonical_sha256":"e748fbe04b823a62ab0a5a0528aff0be462de6b3e7ae0b1beda088e23fa2dc99","source":{"kind":"arxiv","id":"1906.04897","version":1},"attestation_state":"computed","paper":{"title":"Prefix Block-Interchanges on Binary and Ternary Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Md. Khaledur Rahman, M. Sohel Rahman","submitted_at":"2019-05-20T01:53:05Z","abstract_excerpt":"The genome rearrangement problem computes the minimum number of operations that are required to sort all elements of a permutation. A block-interchange operation exchanges two blocks of a permutation which are not necessarily adjacent and in a prefix block-interchange, one block is always the prefix of that permutation. In this paper, we focus on applying prefix block-interchanges on binary and ternary strings. We present upper bounds to group and sort a given binary/ternary string. We also provide upper bounds for a different version of the block-interchange operation which we refer to as the"},"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":"1906.04897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-20T01:53:05Z","cross_cats_sorted":[],"title_canon_sha256":"7d02f39e0627fbd02f1df5c2966c4a69f4a227db67aa202fcdb9e0dfd48d5565","abstract_canon_sha256":"335189e237c0d28e44198bce00b6c2b9fa1bad3814460e9eebdfd9b77b7e19e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:30.193181Z","signature_b64":"vOfDsLDbO0DhRnrYYEALVsukuRDfdRhOpm1QnLlpQqwbIkG1Vk6xmOxLRv34AfusVdZMo8KgST/bnNW1DcK9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e748fbe04b823a62ab0a5a0528aff0be462de6b3e7ae0b1beda088e23fa2dc99","last_reissued_at":"2026-05-17T23:43:30.192656Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:30.192656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prefix Block-Interchanges on Binary and Ternary Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Md. Khaledur Rahman, M. Sohel Rahman","submitted_at":"2019-05-20T01:53:05Z","abstract_excerpt":"The genome rearrangement problem computes the minimum number of operations that are required to sort all elements of a permutation. A block-interchange operation exchanges two blocks of a permutation which are not necessarily adjacent and in a prefix block-interchange, one block is always the prefix of that permutation. In this paper, we focus on applying prefix block-interchanges on binary and ternary strings. We present upper bounds to group and sort a given binary/ternary string. We also provide upper bounds for a different version of the block-interchange operation which we refer to as the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04897","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":"1906.04897","created_at":"2026-05-17T23:43:30.192747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.04897v1","created_at":"2026-05-17T23:43:30.192747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04897","created_at":"2026-05-17T23:43:30.192747+00:00"},{"alias_kind":"pith_short_12","alias_value":"45EPXYCLQI5G","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"45EPXYCLQI5GFKYK","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"45EPXYCL","created_at":"2026-05-18T12:33:10.108867+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/45EPXYCLQI5GFKYKLICSRL7QXZ","json":"https://pith.science/pith/45EPXYCLQI5GFKYKLICSRL7QXZ.json","graph_json":"https://pith.science/api/pith-number/45EPXYCLQI5GFKYKLICSRL7QXZ/graph.json","events_json":"https://pith.science/api/pith-number/45EPXYCLQI5GFKYKLICSRL7QXZ/events.json","paper":"https://pith.science/paper/45EPXYCL"},"agent_actions":{"view_html":"https://pith.science/pith/45EPXYCLQI5GFKYKLICSRL7QXZ","download_json":"https://pith.science/pith/45EPXYCLQI5GFKYKLICSRL7QXZ.json","view_paper":"https://pith.science/paper/45EPXYCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.04897&json=true","fetch_graph":"https://pith.science/api/pith-number/45EPXYCLQI5GFKYKLICSRL7QXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/45EPXYCLQI5GFKYKLICSRL7QXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45EPXYCLQI5GFKYKLICSRL7QXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45EPXYCLQI5GFKYKLICSRL7QXZ/action/storage_attestation","attest_author":"https://pith.science/pith/45EPXYCLQI5GFKYKLICSRL7QXZ/action/author_attestation","sign_citation":"https://pith.science/pith/45EPXYCLQI5GFKYKLICSRL7QXZ/action/citation_signature","submit_replication":"https://pith.science/pith/45EPXYCLQI5GFKYKLICSRL7QXZ/action/replication_record"}},"created_at":"2026-05-17T23:43:30.192747+00:00","updated_at":"2026-05-17T23:43:30.192747+00:00"}