{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QKRM6EBCYIJD3AKZOU232TF26T","short_pith_number":"pith:QKRM6EBC","canonical_record":{"source":{"id":"1605.05542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-18T12:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"98bb83fcc238aee8529d29082159e7b9b10ad66b5ab1a93a1e99636beebb0095","abstract_canon_sha256":"bbbbbc152fd1ae52edd803a4ad3854efa5b031a7805adf697211d8cc2b048722"},"schema_version":"1.0"},"canonical_sha256":"82a2cf1022c2123d81597535bd4cbaf4f8fe6a85204fb748d4160da129b0d097","source":{"kind":"arxiv","id":"1605.05542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05542","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05542v1","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05542","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"QKRM6EBCYIJD","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKRM6EBCYIJD3AKZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKRM6EBC","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QKRM6EBCYIJD3AKZOU232TF26T","target":"record","payload":{"canonical_record":{"source":{"id":"1605.05542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-18T12:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"98bb83fcc238aee8529d29082159e7b9b10ad66b5ab1a93a1e99636beebb0095","abstract_canon_sha256":"bbbbbc152fd1ae52edd803a4ad3854efa5b031a7805adf697211d8cc2b048722"},"schema_version":"1.0"},"canonical_sha256":"82a2cf1022c2123d81597535bd4cbaf4f8fe6a85204fb748d4160da129b0d097","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:34.654238Z","signature_b64":"inZ4j7HV8vdR/QSpevwN6mQRhzfofgE6JBsNVquDQVPScTxTTklKeU7quafjh8IAC+fWLF4NeJUJC5DM/UFZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82a2cf1022c2123d81597535bd4cbaf4f8fe6a85204fb748d4160da129b0d097","last_reissued_at":"2026-05-18T01:14:34.653590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:34.653590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.05542","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-18T01:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBBKwRqmGf+n8/b+2PLiyERbHWX20HIsR+MoktdsXL2jnY5nGmmoy9v6TIZh7QW/Cz/W5m46fGz3fqEHMQlaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:05:02.860158Z"},"content_sha256":"6bcb0bbfe2867d0519471e44493c6bf67fc6c2fc4922294e50044d0cb35a3d4d","schema_version":"1.0","event_id":"sha256:6bcb0bbfe2867d0519471e44493c6bf67fc6c2fc4922294e50044d0cb35a3d4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QKRM6EBCYIJD3AKZOU232TF26T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the shortest common superstring of NGS reads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru, Tristan Braquelaire","submitted_at":"2016-05-18T12:11:17Z","abstract_excerpt":"The Shortest Superstring Problem (SSP) consists, for a set of strings S = {s_1,...,s_n}, to find a minimum length string that contains all s_i, 1 <= i <= k, as substrings. This problem is proved to be NP-Complete and APX-hard. Guaranteed approximation algorithms have been proposed, the current best ratio being 2+11/23, which has been achieved following a long and difficult quest. However, SSP is highly used in practice on next generation sequencing (NGS) data, which plays an increasingly important role in sequencing. In this note, we show that the SSP approximation ratio can be improved on NGS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05542","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-18T01:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CoZDuHkIQdo9W73d5ZAyVewLSD6/So8uDY1oxitaVY3dqCgUh8I4eCZJcSu4a/IReItMyymbH6lKmB/zk+WAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:05:02.860891Z"},"content_sha256":"f7fc062327a4c3c26b07e810695bc032e7eec648a3a9890a8d5e0d931a2157ce","schema_version":"1.0","event_id":"sha256:f7fc062327a4c3c26b07e810695bc032e7eec648a3a9890a8d5e0d931a2157ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKRM6EBCYIJD3AKZOU232TF26T/bundle.json","state_url":"https://pith.science/pith/QKRM6EBCYIJD3AKZOU232TF26T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKRM6EBCYIJD3AKZOU232TF26T/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-27T07:05:02Z","links":{"resolver":"https://pith.science/pith/QKRM6EBCYIJD3AKZOU232TF26T","bundle":"https://pith.science/pith/QKRM6EBCYIJD3AKZOU232TF26T/bundle.json","state":"https://pith.science/pith/QKRM6EBCYIJD3AKZOU232TF26T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKRM6EBCYIJD3AKZOU232TF26T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QKRM6EBCYIJD3AKZOU232TF26T","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":"bbbbbc152fd1ae52edd803a4ad3854efa5b031a7805adf697211d8cc2b048722","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-18T12:11:17Z","title_canon_sha256":"98bb83fcc238aee8529d29082159e7b9b10ad66b5ab1a93a1e99636beebb0095"},"schema_version":"1.0","source":{"id":"1605.05542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.05542","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"1605.05542v1","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05542","created_at":"2026-05-18T01:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"QKRM6EBCYIJD","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QKRM6EBCYIJD3AKZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QKRM6EBC","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:f7fc062327a4c3c26b07e810695bc032e7eec648a3a9890a8d5e0d931a2157ce","target":"graph","created_at":"2026-05-18T01:14:34Z","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":"The Shortest Superstring Problem (SSP) consists, for a set of strings S = {s_1,...,s_n}, to find a minimum length string that contains all s_i, 1 <= i <= k, as substrings. This problem is proved to be NP-Complete and APX-hard. Guaranteed approximation algorithms have been proposed, the current best ratio being 2+11/23, which has been achieved following a long and difficult quest. However, SSP is highly used in practice on next generation sequencing (NGS) data, which plays an increasingly important role in sequencing. In this note, we show that the SSP approximation ratio can be improved on NGS","authors_text":"Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru, Tristan Braquelaire","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-18T12:11:17Z","title":"A note on the shortest common superstring of NGS reads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05542","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:6bcb0bbfe2867d0519471e44493c6bf67fc6c2fc4922294e50044d0cb35a3d4d","target":"record","created_at":"2026-05-18T01:14:34Z","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":"bbbbbc152fd1ae52edd803a4ad3854efa5b031a7805adf697211d8cc2b048722","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-05-18T12:11:17Z","title_canon_sha256":"98bb83fcc238aee8529d29082159e7b9b10ad66b5ab1a93a1e99636beebb0095"},"schema_version":"1.0","source":{"id":"1605.05542","kind":"arxiv","version":1}},"canonical_sha256":"82a2cf1022c2123d81597535bd4cbaf4f8fe6a85204fb748d4160da129b0d097","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82a2cf1022c2123d81597535bd4cbaf4f8fe6a85204fb748d4160da129b0d097","first_computed_at":"2026-05-18T01:14:34.653590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:34.653590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"inZ4j7HV8vdR/QSpevwN6mQRhzfofgE6JBsNVquDQVPScTxTTklKeU7quafjh8IAC+fWLF4NeJUJC5DM/UFZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:34.654238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.05542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bcb0bbfe2867d0519471e44493c6bf67fc6c2fc4922294e50044d0cb35a3d4d","sha256:f7fc062327a4c3c26b07e810695bc032e7eec648a3a9890a8d5e0d931a2157ce"],"state_sha256":"16036066aea4521e56133998e2a0691a126b1561d9bcec13b82141b6ed5bae0d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NA66WHTy/gC72V5tpYyYQNeIQRSVCW4fXxJsPCRCw6ir+afQhHmveiRmK9k3+Vek+tiSSUUGSycMsdNym3kxBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:05:02.865036Z","bundle_sha256":"0090f952c8d05acf7d4ac415b742cfff0ac11d4cdeccf8bbd134908043ac1c73"}}