{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2FEAFXLJ7NMC64KXDH5DGCNJQ3","short_pith_number":"pith:2FEAFXLJ","schema_version":"1.0","canonical_sha256":"d14802dd69fb582f715719fa3309a986d93095adb42566ae61dba38f371fc4d1","source":{"kind":"arxiv","id":"1511.08431","version":2},"attestation_state":"computed","paper":{"title":"On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gabriele Fici, Jakub Radoszewski, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2015-11-26T15:55:50Z","abstract_excerpt":"We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings $S$ is sought containing as a factor every string of $S$ or its reversal. We call this problem Shortest Common Superstring with Reversals (SCS-R). This problem has been introduced by Jiang et al., who designed a greedy-like algorithm with length approximation ratio $4$. In this paper, we show that a natural adaptation of the classical greedy algorithm for SCS has (optimal) compression ratio $\\frac12$, i.e., the sum of the overlaps in the output string is at"},"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":"1511.08431","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-26T15:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"7bcce64da0b297126009bf1f5018a84f2f0e344d6deb4072427e06129c97d2bd","abstract_canon_sha256":"5cf9d59f29c2d25538c8e31a5fa3b06cde44743309a21f48672874afa2b2fb2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:11.004954Z","signature_b64":"96U4XT9Vlq2udW297qVI3qt8FQwXNs1qMJCuQC2lbX2M0E/bKq4QHTRf1+iCuKDEqfW+ObhwUBg0nBNR9XaeDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d14802dd69fb582f715719fa3309a986d93095adb42566ae61dba38f371fc4d1","last_reissued_at":"2026-05-18T01:25:11.004422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:11.004422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gabriele Fici, Jakub Radoszewski, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2015-11-26T15:55:50Z","abstract_excerpt":"We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings $S$ is sought containing as a factor every string of $S$ or its reversal. We call this problem Shortest Common Superstring with Reversals (SCS-R). This problem has been introduced by Jiang et al., who designed a greedy-like algorithm with length approximation ratio $4$. In this paper, we show that a natural adaptation of the classical greedy algorithm for SCS has (optimal) compression ratio $\\frac12$, i.e., the sum of the overlaps in the output string is at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08431","kind":"arxiv","version":2},"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":"1511.08431","created_at":"2026-05-18T01:25:11.004532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08431v2","created_at":"2026-05-18T01:25:11.004532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08431","created_at":"2026-05-18T01:25:11.004532+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FEAFXLJ7NMC","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FEAFXLJ7NMC64KX","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FEAFXLJ","created_at":"2026-05-18T12:28:59.999130+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/2FEAFXLJ7NMC64KXDH5DGCNJQ3","json":"https://pith.science/pith/2FEAFXLJ7NMC64KXDH5DGCNJQ3.json","graph_json":"https://pith.science/api/pith-number/2FEAFXLJ7NMC64KXDH5DGCNJQ3/graph.json","events_json":"https://pith.science/api/pith-number/2FEAFXLJ7NMC64KXDH5DGCNJQ3/events.json","paper":"https://pith.science/paper/2FEAFXLJ"},"agent_actions":{"view_html":"https://pith.science/pith/2FEAFXLJ7NMC64KXDH5DGCNJQ3","download_json":"https://pith.science/pith/2FEAFXLJ7NMC64KXDH5DGCNJQ3.json","view_paper":"https://pith.science/paper/2FEAFXLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08431&json=true","fetch_graph":"https://pith.science/api/pith-number/2FEAFXLJ7NMC64KXDH5DGCNJQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/2FEAFXLJ7NMC64KXDH5DGCNJQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FEAFXLJ7NMC64KXDH5DGCNJQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FEAFXLJ7NMC64KXDH5DGCNJQ3/action/storage_attestation","attest_author":"https://pith.science/pith/2FEAFXLJ7NMC64KXDH5DGCNJQ3/action/author_attestation","sign_citation":"https://pith.science/pith/2FEAFXLJ7NMC64KXDH5DGCNJQ3/action/citation_signature","submit_replication":"https://pith.science/pith/2FEAFXLJ7NMC64KXDH5DGCNJQ3/action/replication_record"}},"created_at":"2026-05-18T01:25:11.004532+00:00","updated_at":"2026-05-18T01:25:11.004532+00:00"}