{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:W6M62745DUGNIPMLFQUJIUHTX4","short_pith_number":"pith:W6M62745","canonical_record":{"source":{"id":"1205.6787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-30T19:44:17Z","cross_cats_sorted":[],"title_canon_sha256":"656eaff5bc9409e2305a542e64dcc269375b4d38e359109a5dea3c62404f0374","abstract_canon_sha256":"ec1fce99d1d40d7eeb6b7ef2f601a2be8af228ccb3ce3afa232bb0bd6720376a"},"schema_version":"1.0"},"canonical_sha256":"b799ed7f9d1d0cd43d8b2c289450f3bf2feb8acf7c07378c2ab176cb25725a94","source":{"kind":"arxiv","id":"1205.6787","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6787","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6787v1","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6787","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"pith_short_12","alias_value":"W6M62745DUGN","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W6M62745DUGNIPML","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W6M62745","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:W6M62745DUGNIPMLFQUJIUHTX4","target":"record","payload":{"canonical_record":{"source":{"id":"1205.6787","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-30T19:44:17Z","cross_cats_sorted":[],"title_canon_sha256":"656eaff5bc9409e2305a542e64dcc269375b4d38e359109a5dea3c62404f0374","abstract_canon_sha256":"ec1fce99d1d40d7eeb6b7ef2f601a2be8af228ccb3ce3afa232bb0bd6720376a"},"schema_version":"1.0"},"canonical_sha256":"b799ed7f9d1d0cd43d8b2c289450f3bf2feb8acf7c07378c2ab176cb25725a94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:35.868820Z","signature_b64":"JvYmwF7IfwGM00iMTbjSE2CjYEhJEIts58MDjLoM7LxzHB33O0H9hAI7sCzPKM+Sz4Was3RqonS9W7Q5Qwj7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b799ed7f9d1d0cd43d8b2c289450f3bf2feb8acf7c07378c2ab176cb25725a94","last_reissued_at":"2026-05-18T00:59:35.868024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:35.868024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.6787","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-18T00:59:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61WnUF3gT5rSW9cuimme5EnVCn6oj3yHSQ8LuJ0G8VeHoCnhP+ToRK5XPDtBYNGvjxpoBEpk0YL7AiE0gMn7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:33:20.444734Z"},"content_sha256":"75dc74b9304b8498638f2417b0156f049e6be641acf824a292d41e5cc6c6ce82","schema_version":"1.0","event_id":"sha256:75dc74b9304b8498638f2417b0156f049e6be641acf824a292d41e5cc6c6ce82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:W6M62745DUGNIPMLFQUJIUHTX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lyndon Words and Short Superstrings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Mucha","submitted_at":"2012-05-30T19:44:17Z","abstract_excerpt":"In the Shortest-Superstring problem, we are given a set of strings S and want to find a string that contains all strings in S as substrings and has minimum length. This is a classical problem in approximation and the best known approximation factor is 2 1/2, given by Sweedyk in 1999. Since then no improvement has been made, howerever two other approaches yielding a 2 1/2-approximation algorithms have been proposed by Kaplan et al. and recently by Paluch et al., both based on a reduction to maximum asymmetric TSP path (Max-ATSP-Path) and structural results of Breslauer et al.\n  In this paper we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6787","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-18T00:59:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7FoiIGNBFyKjklCtniesZSedC34tltnF//+cwwxoa+BaY4Pc/+s1iH1DFV6jyFJCLtpjubaht7FjT1HaHPQSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:33:20.445472Z"},"content_sha256":"94778b63cf2000f75c4c41b17b77cde37b320f7d824d2df84aea6d890ac98b46","schema_version":"1.0","event_id":"sha256:94778b63cf2000f75c4c41b17b77cde37b320f7d824d2df84aea6d890ac98b46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W6M62745DUGNIPMLFQUJIUHTX4/bundle.json","state_url":"https://pith.science/pith/W6M62745DUGNIPMLFQUJIUHTX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W6M62745DUGNIPMLFQUJIUHTX4/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-06-10T23:33:20Z","links":{"resolver":"https://pith.science/pith/W6M62745DUGNIPMLFQUJIUHTX4","bundle":"https://pith.science/pith/W6M62745DUGNIPMLFQUJIUHTX4/bundle.json","state":"https://pith.science/pith/W6M62745DUGNIPMLFQUJIUHTX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W6M62745DUGNIPMLFQUJIUHTX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:W6M62745DUGNIPMLFQUJIUHTX4","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":"ec1fce99d1d40d7eeb6b7ef2f601a2be8af228ccb3ce3afa232bb0bd6720376a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-30T19:44:17Z","title_canon_sha256":"656eaff5bc9409e2305a542e64dcc269375b4d38e359109a5dea3c62404f0374"},"schema_version":"1.0","source":{"id":"1205.6787","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6787","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6787v1","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6787","created_at":"2026-05-18T00:59:35Z"},{"alias_kind":"pith_short_12","alias_value":"W6M62745DUGN","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W6M62745DUGNIPML","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W6M62745","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:94778b63cf2000f75c4c41b17b77cde37b320f7d824d2df84aea6d890ac98b46","target":"graph","created_at":"2026-05-18T00:59:35Z","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 the Shortest-Superstring problem, we are given a set of strings S and want to find a string that contains all strings in S as substrings and has minimum length. This is a classical problem in approximation and the best known approximation factor is 2 1/2, given by Sweedyk in 1999. Since then no improvement has been made, howerever two other approaches yielding a 2 1/2-approximation algorithms have been proposed by Kaplan et al. and recently by Paluch et al., both based on a reduction to maximum asymmetric TSP path (Max-ATSP-Path) and structural results of Breslauer et al.\n  In this paper we","authors_text":"Marcin Mucha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-30T19:44:17Z","title":"Lyndon Words and Short Superstrings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6787","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:75dc74b9304b8498638f2417b0156f049e6be641acf824a292d41e5cc6c6ce82","target":"record","created_at":"2026-05-18T00:59:35Z","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":"ec1fce99d1d40d7eeb6b7ef2f601a2be8af228ccb3ce3afa232bb0bd6720376a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-05-30T19:44:17Z","title_canon_sha256":"656eaff5bc9409e2305a542e64dcc269375b4d38e359109a5dea3c62404f0374"},"schema_version":"1.0","source":{"id":"1205.6787","kind":"arxiv","version":1}},"canonical_sha256":"b799ed7f9d1d0cd43d8b2c289450f3bf2feb8acf7c07378c2ab176cb25725a94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b799ed7f9d1d0cd43d8b2c289450f3bf2feb8acf7c07378c2ab176cb25725a94","first_computed_at":"2026-05-18T00:59:35.868024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:35.868024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JvYmwF7IfwGM00iMTbjSE2CjYEhJEIts58MDjLoM7LxzHB33O0H9hAI7sCzPKM+Sz4Was3RqonS9W7Q5Qwj7DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:35.868820Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.6787","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75dc74b9304b8498638f2417b0156f049e6be641acf824a292d41e5cc6c6ce82","sha256:94778b63cf2000f75c4c41b17b77cde37b320f7d824d2df84aea6d890ac98b46"],"state_sha256":"7023f77265d63009f2b71e148eeb3b696c2a2824c98b49e0fd108a469fb1186a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HZC2Z/9uJAhSv8WUxsdFv3AE5C+3+xElwQiMbQpd5D9/rJTk01sB1P6klIuc7tXb8SpCUrrmMK2EtFPTRvovAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:33:20.449382Z","bundle_sha256":"0ca3db8106c4b71f0d2055146efc81fef2407dcc9f7337f2bf1624acfafb6cdc"}}