{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KWJ27AXDUQXVC6D4ZZUMV6PGNQ","short_pith_number":"pith:KWJ27AXD","canonical_record":{"source":{"id":"1102.3245","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-16T05:45:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3258f901d3a7eb03ec22409e8deab09d14bbb97cc3984853e22f9cb2ce1c3347","abstract_canon_sha256":"7de5622c10df823f105dbcf617c8c9dadf46e2e4bd3f181f1930088020eb8833"},"schema_version":"1.0"},"canonical_sha256":"5593af82e3a42f51787cce68caf9e66c01113c8e7f7f71f9a3e30497836d40a7","source":{"kind":"arxiv","id":"1102.3245","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3245","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3245v5","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3245","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"KWJ27AXDUQXV","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KWJ27AXDUQXVC6D4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KWJ27AXD","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KWJ27AXDUQXVC6D4ZZUMV6PGNQ","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3245","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-16T05:45:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3258f901d3a7eb03ec22409e8deab09d14bbb97cc3984853e22f9cb2ce1c3347","abstract_canon_sha256":"7de5622c10df823f105dbcf617c8c9dadf46e2e4bd3f181f1930088020eb8833"},"schema_version":"1.0"},"canonical_sha256":"5593af82e3a42f51787cce68caf9e66c01113c8e7f7f71f9a3e30497836d40a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:40.689939Z","signature_b64":"+/BTw4XxafgfH37bE/rJoElYTTrzhe24Z7G0z8NP4p5UQ9DghQSkR0k0Z/cJF+tUi9EBz9DMGvhPOSBFdu9jDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5593af82e3a42f51787cce68caf9e66c01113c8e7f7f71f9a3e30497836d40a7","last_reissued_at":"2026-05-18T04:11:40.689293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:40.689293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3245","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oNWDtwnke9L8fYeagGhwCApiv54HHdR2CFdi3qj6vqDPSo9PCQ7JE8l0E9NNOvbgdMejUWj/QEXlzCTzWPFZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:10.481281Z"},"content_sha256":"8f07ce86791da030a611d68256331258b042600cb05377c4a9324ed008a2e256","schema_version":"1.0","event_id":"sha256:8f07ce86791da030a611d68256331258b042600cb05377c4a9324ed008a2e256"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KWJ27AXDUQXVC6D4ZZUMV6PGNQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Sorting by Bounded Block Interchanges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Swapnoneel Roy","submitted_at":"2011-02-16T05:45:04Z","abstract_excerpt":"In this work, we consider a restricted case of the well studied Sorting by Block Interchanges problem. We put an upper bound k on the length of the blocks (substrings) to be interchanged at each step. We call the problem Sorting by k-Block Interchanges. We show the problem to be NP-Hard for k=1. The problem is easy for k=n-1, where n is the length of the permutation (the unbounded case). Sorting by Block Interchanges is a very important and widely studied problem with applications in comparative genomics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3245","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:11:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1zPL/x8/K7Pp2KDLMXMzSGMlcYzcpCUdE4huvrkVzj+QFbKGgvc5Rsea4KCBvCB1stIy8Q3Z1OMgvwBEq6T/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:03:10.481938Z"},"content_sha256":"62c9cc9400113b2925820cefe78501ba6a99a898909cfb84d4664b204d16a7f7","schema_version":"1.0","event_id":"sha256:62c9cc9400113b2925820cefe78501ba6a99a898909cfb84d4664b204d16a7f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KWJ27AXDUQXVC6D4ZZUMV6PGNQ/bundle.json","state_url":"https://pith.science/pith/KWJ27AXDUQXVC6D4ZZUMV6PGNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KWJ27AXDUQXVC6D4ZZUMV6PGNQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T20:03:10Z","links":{"resolver":"https://pith.science/pith/KWJ27AXDUQXVC6D4ZZUMV6PGNQ","bundle":"https://pith.science/pith/KWJ27AXDUQXVC6D4ZZUMV6PGNQ/bundle.json","state":"https://pith.science/pith/KWJ27AXDUQXVC6D4ZZUMV6PGNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KWJ27AXDUQXVC6D4ZZUMV6PGNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KWJ27AXDUQXVC6D4ZZUMV6PGNQ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7de5622c10df823f105dbcf617c8c9dadf46e2e4bd3f181f1930088020eb8833","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-16T05:45:04Z","title_canon_sha256":"3258f901d3a7eb03ec22409e8deab09d14bbb97cc3984853e22f9cb2ce1c3347"},"schema_version":"1.0","source":{"id":"1102.3245","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3245","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3245v5","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3245","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"KWJ27AXDUQXV","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KWJ27AXDUQXVC6D4","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KWJ27AXD","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:62c9cc9400113b2925820cefe78501ba6a99a898909cfb84d4664b204d16a7f7","target":"graph","created_at":"2026-05-18T04:11:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this work, we consider a restricted case of the well studied Sorting by Block Interchanges problem. We put an upper bound k on the length of the blocks (substrings) to be interchanged at each step. We call the problem Sorting by k-Block Interchanges. We show the problem to be NP-Hard for k=1. The problem is easy for k=n-1, where n is the length of the permutation (the unbounded case). Sorting by Block Interchanges is a very important and widely studied problem with applications in comparative genomics.","authors_text":"Swapnoneel Roy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-16T05:45:04Z","title":"On Sorting by Bounded Block Interchanges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3245","kind":"arxiv","version":5},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8f07ce86791da030a611d68256331258b042600cb05377c4a9324ed008a2e256","target":"record","created_at":"2026-05-18T04:11:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7de5622c10df823f105dbcf617c8c9dadf46e2e4bd3f181f1930088020eb8833","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-02-16T05:45:04Z","title_canon_sha256":"3258f901d3a7eb03ec22409e8deab09d14bbb97cc3984853e22f9cb2ce1c3347"},"schema_version":"1.0","source":{"id":"1102.3245","kind":"arxiv","version":5}},"canonical_sha256":"5593af82e3a42f51787cce68caf9e66c01113c8e7f7f71f9a3e30497836d40a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5593af82e3a42f51787cce68caf9e66c01113c8e7f7f71f9a3e30497836d40a7","first_computed_at":"2026-05-18T04:11:40.689293Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:40.689293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+/BTw4XxafgfH37bE/rJoElYTTrzhe24Z7G0z8NP4p5UQ9DghQSkR0k0Z/cJF+tUi9EBz9DMGvhPOSBFdu9jDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:40.689939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3245","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f07ce86791da030a611d68256331258b042600cb05377c4a9324ed008a2e256","sha256:62c9cc9400113b2925820cefe78501ba6a99a898909cfb84d4664b204d16a7f7"],"state_sha256":"a712cfcc20c54d7868fdd915f655b6b96f8f19a6e6698b3469fd2e5350610976"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XEW9Se7+MXlup09+cm7hkTNng01gIP8Sm5rBM7jBmmgvGjCvEg3yTLOMQlg+sz9NerGltyD5b2akdeawytEmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:03:10.486065Z","bundle_sha256":"ed8fecb987be358ca70742b0e527a09a001badc4efe73fde83203e901ccede7d"}}