{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WH4HEWQF4BR3CC5BWTAPDEJ2BQ","short_pith_number":"pith:WH4HEWQF","schema_version":"1.0","canonical_sha256":"b1f8725a05e063b10ba1b4c0f1913a0c12135de6081d8c800591c2c7ea865301","source":{"kind":"arxiv","id":"1110.0892","version":1},"attestation_state":"computed","paper":{"title":"On Approximability of Block Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"N. S. Narayanaswamy, Swapnoneel Roy","submitted_at":"2011-10-05T04:12:09Z","abstract_excerpt":"Block Sorting is a well studied problem, motivated by its applications in Optical Character Recognition (OCR), and Computational Biology. Block Sorting has been shown to be NP-Hard, and two separate polynomial time 2-approximation algorithms have been designed for the problem. But questions like whether a better approximation algorithm can be designed, and whether the problem is APX-Hard have been open for quite a while now.\n  In this work we answer the latter question by proving Block Sorting to be Max-SNP-Hard (APX-Hard). The APX-Hardness result is based on a linear reduction of Max-3SAT to "},"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":"1110.0892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-05T04:12:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"70ec4446a3f34871803ad563bbea0ba7bfbeef7806e3146803f4f72ec6801408","abstract_canon_sha256":"2ec2f2612d890d70b6a3a56f35c7b8e073463b4e1d6b5f26a2be762b20dd7e65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:40.227176Z","signature_b64":"I2nL9jOM0STP4pJIVNdrdMF2BPkbnFMclk/KrfnvO9gV20Y+hD6daw+BQsaDfhfWZCYjZ1CS4AiM8LbVTQ7EAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1f8725a05e063b10ba1b4c0f1913a0c12135de6081d8c800591c2c7ea865301","last_reissued_at":"2026-05-18T04:11:40.226504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:40.226504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Approximability of Block Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"N. S. Narayanaswamy, Swapnoneel Roy","submitted_at":"2011-10-05T04:12:09Z","abstract_excerpt":"Block Sorting is a well studied problem, motivated by its applications in Optical Character Recognition (OCR), and Computational Biology. Block Sorting has been shown to be NP-Hard, and two separate polynomial time 2-approximation algorithms have been designed for the problem. But questions like whether a better approximation algorithm can be designed, and whether the problem is APX-Hard have been open for quite a while now.\n  In this work we answer the latter question by proving Block Sorting to be Max-SNP-Hard (APX-Hard). The APX-Hardness result is based on a linear reduction of Max-3SAT to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0892","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":"1110.0892","created_at":"2026-05-18T04:11:40.226642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0892v1","created_at":"2026-05-18T04:11:40.226642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0892","created_at":"2026-05-18T04:11:40.226642+00:00"},{"alias_kind":"pith_short_12","alias_value":"WH4HEWQF4BR3","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WH4HEWQF4BR3CC5B","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WH4HEWQF","created_at":"2026-05-18T12:26:44.992195+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/WH4HEWQF4BR3CC5BWTAPDEJ2BQ","json":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ.json","graph_json":"https://pith.science/api/pith-number/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/graph.json","events_json":"https://pith.science/api/pith-number/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/events.json","paper":"https://pith.science/paper/WH4HEWQF"},"agent_actions":{"view_html":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ","download_json":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ.json","view_paper":"https://pith.science/paper/WH4HEWQF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0892&json=true","fetch_graph":"https://pith.science/api/pith-number/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/graph.json","fetch_events":"https://pith.science/api/pith-number/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/action/storage_attestation","attest_author":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/action/author_attestation","sign_citation":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/action/citation_signature","submit_replication":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/action/replication_record"}},"created_at":"2026-05-18T04:11:40.226642+00:00","updated_at":"2026-05-18T04:11:40.226642+00:00"}