{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2FEAFXLJ7NMC64KXDH5DGCNJQ3","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":"5cf9d59f29c2d25538c8e31a5fa3b06cde44743309a21f48672874afa2b2fb2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-26T15:55:50Z","title_canon_sha256":"7bcce64da0b297126009bf1f5018a84f2f0e344d6deb4072427e06129c97d2bd"},"schema_version":"1.0","source":{"id":"1511.08431","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08431","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08431v2","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08431","created_at":"2026-05-18T01:25:11Z"},{"alias_kind":"pith_short_12","alias_value":"2FEAFXLJ7NMC","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2FEAFXLJ7NMC64KX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2FEAFXLJ","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:0982d78659e63b657209c6e57801d68192be5bb2304e2ef9c047571401ce35dc","target":"graph","created_at":"2026-05-18T01:25:11Z","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":"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","authors_text":"Gabriele Fici, Jakub Radoszewski, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-26T15:55:50Z","title":"On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08431","kind":"arxiv","version":2},"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:9018f1b7acda5f8a58f4e7b79a1d6f92f448c1094932a23b8f24f714b9e6cd64","target":"record","created_at":"2026-05-18T01:25:11Z","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":"5cf9d59f29c2d25538c8e31a5fa3b06cde44743309a21f48672874afa2b2fb2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-26T15:55:50Z","title_canon_sha256":"7bcce64da0b297126009bf1f5018a84f2f0e344d6deb4072427e06129c97d2bd"},"schema_version":"1.0","source":{"id":"1511.08431","kind":"arxiv","version":2}},"canonical_sha256":"d14802dd69fb582f715719fa3309a986d93095adb42566ae61dba38f371fc4d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d14802dd69fb582f715719fa3309a986d93095adb42566ae61dba38f371fc4d1","first_computed_at":"2026-05-18T01:25:11.004422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:11.004422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"96U4XT9Vlq2udW297qVI3qt8FQwXNs1qMJCuQC2lbX2M0E/bKq4QHTRf1+iCuKDEqfW+ObhwUBg0nBNR9XaeDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:11.004954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08431","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9018f1b7acda5f8a58f4e7b79a1d6f92f448c1094932a23b8f24f714b9e6cd64","sha256:0982d78659e63b657209c6e57801d68192be5bb2304e2ef9c047571401ce35dc"],"state_sha256":"14d6956bd1e1638bdb7397b0b0e73a98d080ed3d1388780f24fc4707810d712d"}