{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZQYLXBEQE5YELP3BF4TZN5Q3JP","short_pith_number":"pith:ZQYLXBEQ","canonical_record":{"source":{"id":"1502.01461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-05T08:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"a47bbc922979fe506fe4db4295afdce30977498e6173dc4ffa4c8731ef4819de","abstract_canon_sha256":"d4646a2ea904c18f5e16e7585b486ccf68a18015b7e9ca0082aaa23abb3c5720"},"schema_version":"1.0"},"canonical_sha256":"cc30bb8490277045bf612f2796f61b4bd4f6ee9fc0428dde2f84b70d3ee00d20","source":{"kind":"arxiv","id":"1502.01461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01461","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01461v1","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01461","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZQYLXBEQE5YE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZQYLXBEQE5YELP3B","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZQYLXBEQ","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZQYLXBEQE5YELP3BF4TZN5Q3JP","target":"record","payload":{"canonical_record":{"source":{"id":"1502.01461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-05T08:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"a47bbc922979fe506fe4db4295afdce30977498e6173dc4ffa4c8731ef4819de","abstract_canon_sha256":"d4646a2ea904c18f5e16e7585b486ccf68a18015b7e9ca0082aaa23abb3c5720"},"schema_version":"1.0"},"canonical_sha256":"cc30bb8490277045bf612f2796f61b4bd4f6ee9fc0428dde2f84b70d3ee00d20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:51.989938Z","signature_b64":"579oBwXVle/MsiSbKrhSB3qhIOUqlW0ZEClJsNeE4gOdfUhQBCUz/MQEsIenFseo1q4PINJR+bTIhLfkwS90CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc30bb8490277045bf612f2796f61b4bd4f6ee9fc0428dde2f84b70d3ee00d20","last_reissued_at":"2026-05-18T02:27:51.989505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:51.989505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.01461","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-18T02:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4Tgl1r64Y6NE4x0PiQdsac+af2KBkVFAiKQ/DiqyH5cNXxVHzQR8GhNxKyrjx7dCmBg4HzynjZz2q6KMicpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:46:33.216664Z"},"content_sha256":"31573ab80d77325fa92d3709430c01517adbf9a4abdcbfddfc481ed7de7c4f11","schema_version":"1.0","event_id":"sha256:31573ab80d77325fa92d3709430c01517adbf9a4abdcbfddfc481ed7de7c4f11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZQYLXBEQE5YELP3BF4TZN5Q3JP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Superstring Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander S. Kulikov, Fedor V. Fomin, Ivan Bliznets, Nikolay Karpov, Petr A. Golovach, Saket Saurabh","submitted_at":"2015-02-05T08:52:44Z","abstract_excerpt":"In the Shortest Superstring problem we are given a set of strings $S=\\{s_1, \\ldots, s_n\\}$ and integer $\\ell$ and the question is to decide whether there is a superstring $s$ of length at most $\\ell$ containing all strings of $S$ as substrings. We obtain several parameterized algorithms and complexity results for this problem.\n  In particular, we give an algorithm which in time $2^{O(k)} \\operatorname{poly}(n)$ finds a superstring of length at most $\\ell$ containing at least $k$ strings of $S$. We complement this by the lower bound showing that such a parameterization does not admit a polynomi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01461","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-18T02:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dGGFoVuUvcFkCtfuO90pk2zcD8htY29U5eC4z/vjrCyzE6UbEPoa3MO4PHuWQCKaa3hk5ZU0ycTX8exoIRARAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:46:33.217007Z"},"content_sha256":"377c177efa926de1c5f80369401a89f6cefc311d23e032013ec38960c94671ce","schema_version":"1.0","event_id":"sha256:377c177efa926de1c5f80369401a89f6cefc311d23e032013ec38960c94671ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQYLXBEQE5YELP3BF4TZN5Q3JP/bundle.json","state_url":"https://pith.science/pith/ZQYLXBEQE5YELP3BF4TZN5Q3JP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQYLXBEQE5YELP3BF4TZN5Q3JP/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-03T01:46:33Z","links":{"resolver":"https://pith.science/pith/ZQYLXBEQE5YELP3BF4TZN5Q3JP","bundle":"https://pith.science/pith/ZQYLXBEQE5YELP3BF4TZN5Q3JP/bundle.json","state":"https://pith.science/pith/ZQYLXBEQE5YELP3BF4TZN5Q3JP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQYLXBEQE5YELP3BF4TZN5Q3JP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZQYLXBEQE5YELP3BF4TZN5Q3JP","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":"d4646a2ea904c18f5e16e7585b486ccf68a18015b7e9ca0082aaa23abb3c5720","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-05T08:52:44Z","title_canon_sha256":"a47bbc922979fe506fe4db4295afdce30977498e6173dc4ffa4c8731ef4819de"},"schema_version":"1.0","source":{"id":"1502.01461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.01461","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"1502.01461v1","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.01461","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZQYLXBEQE5YE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZQYLXBEQE5YELP3B","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZQYLXBEQ","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:377c177efa926de1c5f80369401a89f6cefc311d23e032013ec38960c94671ce","target":"graph","created_at":"2026-05-18T02:27:51Z","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=\\{s_1, \\ldots, s_n\\}$ and integer $\\ell$ and the question is to decide whether there is a superstring $s$ of length at most $\\ell$ containing all strings of $S$ as substrings. We obtain several parameterized algorithms and complexity results for this problem.\n  In particular, we give an algorithm which in time $2^{O(k)} \\operatorname{poly}(n)$ finds a superstring of length at most $\\ell$ containing at least $k$ strings of $S$. We complement this by the lower bound showing that such a parameterization does not admit a polynomi","authors_text":"Alexander S. Kulikov, Fedor V. Fomin, Ivan Bliznets, Nikolay Karpov, Petr A. Golovach, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-05T08:52:44Z","title":"Parameterized Complexity of Superstring Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.01461","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:31573ab80d77325fa92d3709430c01517adbf9a4abdcbfddfc481ed7de7c4f11","target":"record","created_at":"2026-05-18T02:27:51Z","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":"d4646a2ea904c18f5e16e7585b486ccf68a18015b7e9ca0082aaa23abb3c5720","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-05T08:52:44Z","title_canon_sha256":"a47bbc922979fe506fe4db4295afdce30977498e6173dc4ffa4c8731ef4819de"},"schema_version":"1.0","source":{"id":"1502.01461","kind":"arxiv","version":1}},"canonical_sha256":"cc30bb8490277045bf612f2796f61b4bd4f6ee9fc0428dde2f84b70d3ee00d20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc30bb8490277045bf612f2796f61b4bd4f6ee9fc0428dde2f84b70d3ee00d20","first_computed_at":"2026-05-18T02:27:51.989505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:51.989505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"579oBwXVle/MsiSbKrhSB3qhIOUqlW0ZEClJsNeE4gOdfUhQBCUz/MQEsIenFseo1q4PINJR+bTIhLfkwS90CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:51.989938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.01461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31573ab80d77325fa92d3709430c01517adbf9a4abdcbfddfc481ed7de7c4f11","sha256:377c177efa926de1c5f80369401a89f6cefc311d23e032013ec38960c94671ce"],"state_sha256":"b44b0f3f5d28324799fa76145c812771695fb9ae13da117e5456dfd2e510d9fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VCaK2Lipd2lnoloRNH0PC5uP/a4l2C9mOGp70b6FvveX5KTTd/idaQGeay5NDxRoYx1Akdm18OG0I7+idypJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:46:33.219091Z","bundle_sha256":"1bbe3c6e62bfbd24a8878d5ca9a6b39dd53e80cdfffd15a56c10045b7eda7bab"}}