{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TPHAY62EFA6RZ4BS5GYHFJAR2Z","short_pith_number":"pith:TPHAY62E","schema_version":"1.0","canonical_sha256":"9bce0c7b44283d1cf032e9b072a411d65d10b2bf1af7056cebcfd8b2573a2441","source":{"kind":"arxiv","id":"1805.00060","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.00060","created_at":"2026-05-18T00:17:10.656155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00060v1","created_at":"2026-05-18T00:17:10.656155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00060","created_at":"2026-05-18T00:17:10.656155+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPHAY62EFA6R","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPHAY62EFA6RZ4BS","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPHAY62E","created_at":"2026-05-18T12:32:53.628368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z","json":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z.json","graph_json":"https://pith.science/api/pith-number/TPHAY62EFA6RZ4BS5GYHFJAR2Z/graph.json","events_json":"https://pith.science/api/pith-number/TPHAY62EFA6RZ4BS5GYHFJAR2Z/events.json","paper":"https://pith.science/paper/TPHAY62E"},"agent_actions":{"view_html":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z","download_json":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z.json","view_paper":"https://pith.science/paper/TPHAY62E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00060&json=true","fetch_graph":"https://pith.science/api/pith-number/TPHAY62EFA6RZ4BS5GYHFJAR2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/TPHAY62EFA6RZ4BS5GYHFJAR2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/action/storage_attestation","attest_author":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/action/author_attestation","sign_citation":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/action/citation_signature","submit_replication":"https://pith.science/pith/TPHAY62EFA6RZ4BS5GYHFJAR2Z/action/replication_record"}},"created_at":"2026-05-18T00:17:10.656155+00:00","updated_at":"2026-05-18T00:17:10.656155+00:00"}