{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WH4HEWQF4BR3CC5BWTAPDEJ2BQ","short_pith_number":"pith:WH4HEWQF","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"},"canonical_sha256":"b1f8725a05e063b10ba1b4c0f1913a0c12135de6081d8c800591c2c7ea865301","source":{"kind":"arxiv","id":"1110.0892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0892","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0892v1","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0892","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"WH4HEWQF4BR3","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WH4HEWQF4BR3CC5B","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WH4HEWQF","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WH4HEWQF4BR3CC5BWTAPDEJ2BQ","target":"record","payload":{"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"},"canonical_sha256":"b1f8725a05e063b10ba1b4c0f1913a0c12135de6081d8c800591c2c7ea865301","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"},"source_kind":"arxiv","source_id":"1110.0892","source_version":1,"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":"us4G0g9rYYFkRTIxPIEUxzss0+9tZ8YozjgjLlWdU7o9MXj21rAWvb2H5bdkKHUJTAyGKURsyZOh00o4CL+tDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:32:37.583501Z"},"content_sha256":"d095260b9a1d69bc68558aeb07f1f47afe9f70430b8a8003ce197c7691981494","schema_version":"1.0","event_id":"sha256:d095260b9a1d69bc68558aeb07f1f47afe9f70430b8a8003ce197c7691981494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WH4HEWQF4BR3CC5BWTAPDEJ2BQ","target":"graph","payload":{"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"},"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":"XG4mE3Fy4IMfrKPGsuEYb5JbRNT0dMh+FGPsNaUhyXfneaueJgvnxVyumPXFhT34M+W/9/E2iSORC6ENL+UeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:32:37.584145Z"},"content_sha256":"19bb9f251000769da1ec2cd658d63ef1f66ddb76426c8639a7d116db52442dd9","schema_version":"1.0","event_id":"sha256:19bb9f251000769da1ec2cd658d63ef1f66ddb76426c8639a7d116db52442dd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/bundle.json","state_url":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/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-21T15:32:37Z","links":{"resolver":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ","bundle":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/bundle.json","state":"https://pith.science/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WH4HEWQF4BR3CC5BWTAPDEJ2BQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WH4HEWQF4BR3CC5BWTAPDEJ2BQ","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":"2ec2f2612d890d70b6a3a56f35c7b8e073463b4e1d6b5f26a2be762b20dd7e65","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-05T04:12:09Z","title_canon_sha256":"70ec4446a3f34871803ad563bbea0ba7bfbeef7806e3146803f4f72ec6801408"},"schema_version":"1.0","source":{"id":"1110.0892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0892","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0892v1","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0892","created_at":"2026-05-18T04:11:40Z"},{"alias_kind":"pith_short_12","alias_value":"WH4HEWQF4BR3","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WH4HEWQF4BR3CC5B","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WH4HEWQF","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:19bb9f251000769da1ec2cd658d63ef1f66ddb76426c8639a7d116db52442dd9","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":"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 ","authors_text":"N. S. Narayanaswamy, Swapnoneel Roy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-05T04:12:09Z","title":"On Approximability of Block Sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0892","kind":"arxiv","version":1},"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:d095260b9a1d69bc68558aeb07f1f47afe9f70430b8a8003ce197c7691981494","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":"2ec2f2612d890d70b6a3a56f35c7b8e073463b4e1d6b5f26a2be762b20dd7e65","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-10-05T04:12:09Z","title_canon_sha256":"70ec4446a3f34871803ad563bbea0ba7bfbeef7806e3146803f4f72ec6801408"},"schema_version":"1.0","source":{"id":"1110.0892","kind":"arxiv","version":1}},"canonical_sha256":"b1f8725a05e063b10ba1b4c0f1913a0c12135de6081d8c800591c2c7ea865301","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1f8725a05e063b10ba1b4c0f1913a0c12135de6081d8c800591c2c7ea865301","first_computed_at":"2026-05-18T04:11:40.226504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:40.226504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I2nL9jOM0STP4pJIVNdrdMF2BPkbnFMclk/KrfnvO9gV20Y+hD6daw+BQsaDfhfWZCYjZ1CS4AiM8LbVTQ7EAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:40.227176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d095260b9a1d69bc68558aeb07f1f47afe9f70430b8a8003ce197c7691981494","sha256:19bb9f251000769da1ec2cd658d63ef1f66ddb76426c8639a7d116db52442dd9"],"state_sha256":"60f9eb47894465c25204fcc3ed3bd7fd20cbeae9e2b528495e5e444216f0fd3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uS76M3Ev1zBUlGQ7JuPB9VIouZUDS2ZuNW3005jtewJ+cqsEHvWFYRBNlnm972q77UxHWQrtk2zgRJYz7J0eBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:32:37.587547Z","bundle_sha256":"8e9765ccce9e2df0e341b1f938404c06f0844e7ddb7e3b605a2dd64569c01864"}}