{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T57H53N6ZEMTGQEIREBGW5RKEW","short_pith_number":"pith:T57H53N6","schema_version":"1.0","canonical_sha256":"9f7e7eedbec91933408889026b762a25bc1d2bd12afeb7ff59e3ff6dd0852cf5","source":{"kind":"arxiv","id":"1602.08648","version":1},"attestation_state":"computed","paper":{"title":"Approximation hardness of Shortest Common Superstring variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.CC","authors_text":"Y. William Yu","submitted_at":"2016-02-27T23:21:55Z","abstract_excerpt":"The shortest common superstring (SCS) problem has been studied at great length because of its connections to the de novo assembly problem in computational genomics. The base problem is APX-complete, but several generalizations of the problem have also been studied. In particular, previous results include that SCS with Negative strings (SCSN) is in Log-APX (though there is no known hardness result) and SCS with Wildcards (SCSW) is Poly-APX-hard. Here, we prove two new hardness results: (1) SCSN is Log-APX-hard (and therefore Log-APX-complete) by a reduction from Minimum Set Cover and (2) SCS wi"},"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":"1602.08648","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-27T23:21:55Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"31dd8ab4a2fd51c059072f2ecd1e1c577a98e77d77df45fd7e1aee1e533dbea4","abstract_canon_sha256":"e5d43acff9ed62be0a0f655630d423de6b86fa0d3ae4af21f52097f30b6908f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:52.309383Z","signature_b64":"Zopf5coy63DE9qflwcVhu+t3wCCeK9x5TgaooaJDWBnAgwtgGQef/8RdCTzfu+8l/AePBxdS+w/jnGsuFHXzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f7e7eedbec91933408889026b762a25bc1d2bd12afeb7ff59e3ff6dd0852cf5","last_reissued_at":"2026-05-18T01:19:52.308724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:52.308724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation hardness of Shortest Common Superstring variants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.CC","authors_text":"Y. William Yu","submitted_at":"2016-02-27T23:21:55Z","abstract_excerpt":"The shortest common superstring (SCS) problem has been studied at great length because of its connections to the de novo assembly problem in computational genomics. The base problem is APX-complete, but several generalizations of the problem have also been studied. In particular, previous results include that SCS with Negative strings (SCSN) is in Log-APX (though there is no known hardness result) and SCS with Wildcards (SCSW) is Poly-APX-hard. Here, we prove two new hardness results: (1) SCSN is Log-APX-hard (and therefore Log-APX-complete) by a reduction from Minimum Set Cover and (2) SCS wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08648","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":"1602.08648","created_at":"2026-05-18T01:19:52.308843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08648v1","created_at":"2026-05-18T01:19:52.308843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08648","created_at":"2026-05-18T01:19:52.308843+00:00"},{"alias_kind":"pith_short_12","alias_value":"T57H53N6ZEMT","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T57H53N6ZEMTGQEI","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T57H53N6","created_at":"2026-05-18T12:30:44.179134+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/T57H53N6ZEMTGQEIREBGW5RKEW","json":"https://pith.science/pith/T57H53N6ZEMTGQEIREBGW5RKEW.json","graph_json":"https://pith.science/api/pith-number/T57H53N6ZEMTGQEIREBGW5RKEW/graph.json","events_json":"https://pith.science/api/pith-number/T57H53N6ZEMTGQEIREBGW5RKEW/events.json","paper":"https://pith.science/paper/T57H53N6"},"agent_actions":{"view_html":"https://pith.science/pith/T57H53N6ZEMTGQEIREBGW5RKEW","download_json":"https://pith.science/pith/T57H53N6ZEMTGQEIREBGW5RKEW.json","view_paper":"https://pith.science/paper/T57H53N6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08648&json=true","fetch_graph":"https://pith.science/api/pith-number/T57H53N6ZEMTGQEIREBGW5RKEW/graph.json","fetch_events":"https://pith.science/api/pith-number/T57H53N6ZEMTGQEIREBGW5RKEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T57H53N6ZEMTGQEIREBGW5RKEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T57H53N6ZEMTGQEIREBGW5RKEW/action/storage_attestation","attest_author":"https://pith.science/pith/T57H53N6ZEMTGQEIREBGW5RKEW/action/author_attestation","sign_citation":"https://pith.science/pith/T57H53N6ZEMTGQEIREBGW5RKEW/action/citation_signature","submit_replication":"https://pith.science/pith/T57H53N6ZEMTGQEIREBGW5RKEW/action/replication_record"}},"created_at":"2026-05-18T01:19:52.308843+00:00","updated_at":"2026-05-18T01:19:52.308843+00:00"}