{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TPHAY62EFA6RZ4BS5GYHFJAR2Z","short_pith_number":"pith:TPHAY62E","canonical_record":{"source":{"id":"1805.00060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-30T19:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"73d2cf709219b82c2ca6da503a36431b89b8a935b0f5cb929864281c35d4535e","abstract_canon_sha256":"c40661ce83f4d4e9a51a459eed7e48540c15f5f044f4de3083be7172f1e2dfe4"},"schema_version":"1.0"},"canonical_sha256":"9bce0c7b44283d1cf032e9b072a411d65d10b2bf1af7056cebcfd8b2573a2441","source":{"kind":"arxiv","id":"1805.00060","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00060","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00060v1","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00060","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"TPHAY62EFA6R","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TPHAY62EFA6RZ4BS","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TPHAY62E","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TPHAY62EFA6RZ4BS5GYHFJAR2Z","target":"record","payload":{"canonical_record":{"source":{"id":"1805.00060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-30T19:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"73d2cf709219b82c2ca6da503a36431b89b8a935b0f5cb929864281c35d4535e","abstract_canon_sha256":"c40661ce83f4d4e9a51a459eed7e48540c15f5f044f4de3083be7172f1e2dfe4"},"schema_version":"1.0"},"canonical_sha256":"9bce0c7b44283d1cf032e9b072a411d65d10b2bf1af7056cebcfd8b2573a2441","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:10.656768Z","signature_b64":"LihALjgBrZS9EuA9kC3+D+owPggPFDAaK6u3Zdd7i0p0B/rqcglBs8QmuLygZ8m7Wh7qR/3HD8W7r5A+NTA5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bce0c7b44283d1cf032e9b072a411d65d10b2bf1af7056cebcfd8b2573a2441","last_reissued_at":"2026-05-18T00:17:10.656026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:10.656026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.00060","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:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xm6ljfhpm6sgARs1GJ403wIk3d0yRYfe2V4ChC9sqT6/tggCRcbch2g+4bdLfpaSewNFNWpCXwpaaZfV7SkGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:20:38.914167Z"},"content_sha256":"da612e50a978f0ae92a9495bc4e9e2e4f7c2cb1bf68e05120c6cfc05b295e40d","schema_version":"1.0","event_id":"sha256:da612e50a978f0ae92a9495bc4e9e2e4f7c2cb1bf68e05120c6cfc05b295e40d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TPHAY62EFA6RZ4BS5GYHFJAR2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On improving the approximation ratio of the r-shortest common superstring problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marie Gasparoux, Mathieu Raffinot, Raluca Uricaru, Tristan Braquelaire","submitted_at":"2018-04-30T19:00:22Z","abstract_excerpt":"The Shortest Common Superstring problem (SCS) consists, for a set of strings S = {s_1,...,s_n}, in finding a minimum length string that contains all s_i, 1<= i <= n, as substrings. While a 2+11/30 approximation ratio algorithm has recently been published, the general objective is now to break the conceptual lower bound barrier of 2. This paper is a step ahead in this direction. Here we focus on a particular instance of the SCS problem, meaning the r-SCS problem, which requires all input strings to be of the same length, r. Golonev et al. proved an approximation ratio which is better than the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00060","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:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOY4XdMBDW9g/d7mmGbLUxPGonfw09yYAypS760rF697No9iRY3TDEMs9WDLDLLFms/DOO9Gf6yynug4O5ywDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:20:38.914835Z"},"content_sha256":"897021d69a1f5eb9cc61d71f21beb7db2a3e323fb1c322e119510a81025c3cc6","schema_version":"1.0","event_id":"sha256:897021d69a1f5eb9cc61d71f21beb7db2a3e323fb1c322e119510a81025c3cc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/bundle.json","state_url":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/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-27T00:20:38Z","links":{"resolver":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z","bundle":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/bundle.json","state":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TPHAY62EFA6RZ4BS5GYHFJAR2Z","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":"c40661ce83f4d4e9a51a459eed7e48540c15f5f044f4de3083be7172f1e2dfe4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-30T19:00:22Z","title_canon_sha256":"73d2cf709219b82c2ca6da503a36431b89b8a935b0f5cb929864281c35d4535e"},"schema_version":"1.0","source":{"id":"1805.00060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00060","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00060v1","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00060","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"TPHAY62EFA6R","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TPHAY62EFA6RZ4BS","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TPHAY62E","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:897021d69a1f5eb9cc61d71f21beb7db2a3e323fb1c322e119510a81025c3cc6","target":"graph","created_at":"2026-05-18T00:17:10Z","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 Common Superstring problem (SCS) consists, for a set of strings S = {s_1,...,s_n}, in finding a minimum length string that contains all s_i, 1<= i <= n, as substrings. While a 2+11/30 approximation ratio algorithm has recently been published, the general objective is now to break the conceptual lower bound barrier of 2. This paper is a step ahead in this direction. Here we focus on a particular instance of the SCS problem, meaning the r-SCS problem, which requires all input strings to be of the same length, r. Golonev et al. proved an approximation ratio which is better than the g","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.DS","submitted_at":"2018-04-30T19:00:22Z","title":"On improving the approximation ratio of the r-shortest common superstring problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00060","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:da612e50a978f0ae92a9495bc4e9e2e4f7c2cb1bf68e05120c6cfc05b295e40d","target":"record","created_at":"2026-05-18T00:17:10Z","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":"c40661ce83f4d4e9a51a459eed7e48540c15f5f044f4de3083be7172f1e2dfe4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-30T19:00:22Z","title_canon_sha256":"73d2cf709219b82c2ca6da503a36431b89b8a935b0f5cb929864281c35d4535e"},"schema_version":"1.0","source":{"id":"1805.00060","kind":"arxiv","version":1}},"canonical_sha256":"9bce0c7b44283d1cf032e9b072a411d65d10b2bf1af7056cebcfd8b2573a2441","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bce0c7b44283d1cf032e9b072a411d65d10b2bf1af7056cebcfd8b2573a2441","first_computed_at":"2026-05-18T00:17:10.656026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:10.656026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LihALjgBrZS9EuA9kC3+D+owPggPFDAaK6u3Zdd7i0p0B/rqcglBs8QmuLygZ8m7Wh7qR/3HD8W7r5A+NTA5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:10.656768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da612e50a978f0ae92a9495bc4e9e2e4f7c2cb1bf68e05120c6cfc05b295e40d","sha256:897021d69a1f5eb9cc61d71f21beb7db2a3e323fb1c322e119510a81025c3cc6"],"state_sha256":"eb386d3a9f898c7056be0ee5cd513d5415946ed49e2e6656002fa328026a0171"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFQH0zXG1Ddia39VQZwoon4Il6Xd+NcytFOR9Nj3x84tdzRFR622FOWxdy3GLOgSBrneXhq8pLqJNdAPDAPqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:20:38.918138Z","bundle_sha256":"0dc964b8b07fbdab423ff35495ef4a912859ff56007b1bb1aac3f0e394a22fea"}}