{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MBTVMKSUYFX3GO5UMLM665YOWA","short_pith_number":"pith:MBTVMKSU","canonical_record":{"source":{"id":"1111.5442","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-23T10:00:50Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"08e368e6103f11cf64b4d968ec5d72e84753308722787fdd90888f2e5ca898a9","abstract_canon_sha256":"7b7234d4f13e675c9c814d7429ec7b2f940887f9d1c91fef0e03069c3c737feb"},"schema_version":"1.0"},"canonical_sha256":"6067562a54c16fb33bb462d9ef770eb017c6f62f0d45f14350c77b7c17a67414","source":{"kind":"arxiv","id":"1111.5442","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5442","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5442v3","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5442","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"MBTVMKSUYFX3","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MBTVMKSUYFX3GO5U","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MBTVMKSU","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MBTVMKSUYFX3GO5UMLM665YOWA","target":"record","payload":{"canonical_record":{"source":{"id":"1111.5442","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-23T10:00:50Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"08e368e6103f11cf64b4d968ec5d72e84753308722787fdd90888f2e5ca898a9","abstract_canon_sha256":"7b7234d4f13e675c9c814d7429ec7b2f940887f9d1c91fef0e03069c3c737feb"},"schema_version":"1.0"},"canonical_sha256":"6067562a54c16fb33bb462d9ef770eb017c6f62f0d45f14350c77b7c17a67414","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:01.305722Z","signature_b64":"phTpCfzN/mSnYMFi3pgdPOCuDwq84vwZICOyqpmaPonw4eKKa1fiQQfczPZ5haA76ImRCubiCzu9Cim3cvxCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6067562a54c16fb33bb462d9ef770eb017c6f62f0d45f14350c77b7c17a67414","last_reissued_at":"2026-05-18T03:47:01.305069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:01.305069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.5442","source_version":3,"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-18T03:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lM5eIQ0edIvK7IErB8Xz0hX/kn3hRrOMWBl9wTWPLnvhYli3YiLa5RUUQP6NeKbYOrBDXMoRgykPXTNPO2cqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:47:06.912245Z"},"content_sha256":"935e09ae029f9dfd937d4f8929117ca05c16bee35081a7ca72eff403b822f896","schema_version":"1.0","event_id":"sha256:935e09ae029f9dfd937d4f8929117ca05c16bee35081a7ca72eff403b822f896"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MBTVMKSUYFX3GO5UMLM665YOWA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Lower Bounds for the Shortest Superstring and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CC","authors_text":"Marek Karpinski, Richard Schmied","submitted_at":"2011-11-23T10:00:50Z","abstract_excerpt":"We study the approximation hardness of the Shortest Superstring, the Maximal Compression and the Maximum Asymmetric Traveling Salesperson (MAX-ATSP) problem. We introduce a new reduction method that produces strongly restricted instances of the Shortest Superstring problem, in which the maximal orbit size is eight (with no character appearing more than eight times) and all given strings having length four. Based on this reduction method, we are able to improve the best up to now known approximation lower bound for the Shortest Superstring problem and the Maximal Compression problem by an order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5442","kind":"arxiv","version":3},"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-18T03:47:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAV1mabK2y61hEVODLz3IGfMNG3JeD4Z7mvdZQT/EW5ERjBSi0Z56KwEaKKV+tcFRfxOsD4KEsYNIHYFwFHQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:47:06.912630Z"},"content_sha256":"faa689e9aaf817ae4bb39a5bc2742c403bd6495caae257abfad2e22441d1d6d9","schema_version":"1.0","event_id":"sha256:faa689e9aaf817ae4bb39a5bc2742c403bd6495caae257abfad2e22441d1d6d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBTVMKSUYFX3GO5UMLM665YOWA/bundle.json","state_url":"https://pith.science/pith/MBTVMKSUYFX3GO5UMLM665YOWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBTVMKSUYFX3GO5UMLM665YOWA/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-28T15:47:06Z","links":{"resolver":"https://pith.science/pith/MBTVMKSUYFX3GO5UMLM665YOWA","bundle":"https://pith.science/pith/MBTVMKSUYFX3GO5UMLM665YOWA/bundle.json","state":"https://pith.science/pith/MBTVMKSUYFX3GO5UMLM665YOWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBTVMKSUYFX3GO5UMLM665YOWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MBTVMKSUYFX3GO5UMLM665YOWA","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":"7b7234d4f13e675c9c814d7429ec7b2f940887f9d1c91fef0e03069c3c737feb","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-23T10:00:50Z","title_canon_sha256":"08e368e6103f11cf64b4d968ec5d72e84753308722787fdd90888f2e5ca898a9"},"schema_version":"1.0","source":{"id":"1111.5442","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.5442","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"arxiv_version","alias_value":"1111.5442v3","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5442","created_at":"2026-05-18T03:47:01Z"},{"alias_kind":"pith_short_12","alias_value":"MBTVMKSUYFX3","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MBTVMKSUYFX3GO5U","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MBTVMKSU","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:faa689e9aaf817ae4bb39a5bc2742c403bd6495caae257abfad2e22441d1d6d9","target":"graph","created_at":"2026-05-18T03:47:01Z","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":"We study the approximation hardness of the Shortest Superstring, the Maximal Compression and the Maximum Asymmetric Traveling Salesperson (MAX-ATSP) problem. We introduce a new reduction method that produces strongly restricted instances of the Shortest Superstring problem, in which the maximal orbit size is eight (with no character appearing more than eight times) and all given strings having length four. Based on this reduction method, we are able to improve the best up to now known approximation lower bound for the Shortest Superstring problem and the Maximal Compression problem by an order","authors_text":"Marek Karpinski, Richard Schmied","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-23T10:00:50Z","title":"Improved Lower Bounds for the Shortest Superstring and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5442","kind":"arxiv","version":3},"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:935e09ae029f9dfd937d4f8929117ca05c16bee35081a7ca72eff403b822f896","target":"record","created_at":"2026-05-18T03:47:01Z","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":"7b7234d4f13e675c9c814d7429ec7b2f940887f9d1c91fef0e03069c3c737feb","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-23T10:00:50Z","title_canon_sha256":"08e368e6103f11cf64b4d968ec5d72e84753308722787fdd90888f2e5ca898a9"},"schema_version":"1.0","source":{"id":"1111.5442","kind":"arxiv","version":3}},"canonical_sha256":"6067562a54c16fb33bb462d9ef770eb017c6f62f0d45f14350c77b7c17a67414","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6067562a54c16fb33bb462d9ef770eb017c6f62f0d45f14350c77b7c17a67414","first_computed_at":"2026-05-18T03:47:01.305069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:47:01.305069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"phTpCfzN/mSnYMFi3pgdPOCuDwq84vwZICOyqpmaPonw4eKKa1fiQQfczPZ5haA76ImRCubiCzu9Cim3cvxCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:47:01.305722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.5442","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:935e09ae029f9dfd937d4f8929117ca05c16bee35081a7ca72eff403b822f896","sha256:faa689e9aaf817ae4bb39a5bc2742c403bd6495caae257abfad2e22441d1d6d9"],"state_sha256":"66fd112813276ff34908e8d356e13173200adaac526186473456ee89b4dcd67e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uA+6GcvVRKwW5eD5jqCbaxW2liZU00Fb7BI9BCPnnfzDwFBEkmftGzaOS3QaG9AgesF+U7nSp6OuYj+HpjEKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:47:06.914568Z","bundle_sha256":"6472b5a4096be16ee964290b95686b9ed16e39e8d373bfdc9ff62b1bfdf1d752"}}