{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YJR6ZYZSJ6HJTHBGJEYHPI45Q4","short_pith_number":"pith:YJR6ZYZS","canonical_record":{"source":{"id":"1603.02457","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T10:19:06Z","cross_cats_sorted":[],"title_canon_sha256":"9f41dbf126c7be81c69461858f9789cfd09182c54199386fdb467c6e0fe7ee92","abstract_canon_sha256":"20ae065c577a8314aee606dd7e01672aba9569c1afef9c1d0ed62e0a606479e0"},"schema_version":"1.0"},"canonical_sha256":"c263ece3324f8e999c26493077a39d871ec1f610b4c194760ae2768224823ff8","source":{"kind":"arxiv","id":"1603.02457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02457","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02457v1","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02457","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"pith_short_12","alias_value":"YJR6ZYZSJ6HJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YJR6ZYZSJ6HJTHBG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YJR6ZYZS","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YJR6ZYZSJ6HJTHBGJEYHPI45Q4","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02457","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T10:19:06Z","cross_cats_sorted":[],"title_canon_sha256":"9f41dbf126c7be81c69461858f9789cfd09182c54199386fdb467c6e0fe7ee92","abstract_canon_sha256":"20ae065c577a8314aee606dd7e01672aba9569c1afef9c1d0ed62e0a606479e0"},"schema_version":"1.0"},"canonical_sha256":"c263ece3324f8e999c26493077a39d871ec1f610b4c194760ae2768224823ff8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:23.257209Z","signature_b64":"3raOnGlASiSpSwsYq9LrP0SFsn2XdWqJ6A1NX8di9rKJnEXAxyLGvUKNG2JdS0uunBrGjmJbKWbkrSKEIgadDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c263ece3324f8e999c26493077a39d871ec1f610b4c194760ae2768224823ff8","last_reissued_at":"2026-05-18T01:19:23.256589Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:23.256589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02457","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-18T01:19:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+7iYS9puVGtKRK9D4es2XZdPr+NYgxqmBAOA0+e6CqxHGtUmWBLvPZpeFZaabYIrZQje5pWX8Hhc6oa7j9kLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:46:18.575701Z"},"content_sha256":"206cceadb9b9831d3a1ed00603a94f43ea06c7b0229c0284f5445e6dbac3b86a","schema_version":"1.0","event_id":"sha256:206cceadb9b9831d3a1ed00603a94f43ea06c7b0229c0284f5445e6dbac3b86a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YJR6ZYZSJ6HJTHBGJEYHPI45Q4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Self-Reducibility and Reoptimization of Closest Substring Problem","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Henry Adorna, Jeffrey Aborot, Jhoirene Clemente","submitted_at":"2016-03-08T10:19:06Z","abstract_excerpt":"In this paper, we define the reoptimization variant of the closest substring problem (CSP) under sequence addition. We show that, even with the additional information we have about the problem instance, the problem of finding a closest substring is still NP-hard. We investigate the combinatorial property of optimization problems called self-reducibility. We show that problems that are polynomial-time reducible to self-reducible problems also exhibits the same property. We illustrate this in the context of CSP. We used the property to show that although we cannot improve the approximability of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02457","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-18T01:19:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/zgpAVqYGXuoAcRs5KO/MQftag0ivDaKUGzRTwXjnjL4rWMziXbsuIIcMLpM0q5g7yMwxpB7xPFf/T2fy1M7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:46:18.576119Z"},"content_sha256":"45e33916e67b3fd099950ee1787fc2ded7fd5f9b6aa0426a5312ff0e398e511c","schema_version":"1.0","event_id":"sha256:45e33916e67b3fd099950ee1787fc2ded7fd5f9b6aa0426a5312ff0e398e511c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YJR6ZYZSJ6HJTHBGJEYHPI45Q4/bundle.json","state_url":"https://pith.science/pith/YJR6ZYZSJ6HJTHBGJEYHPI45Q4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YJR6ZYZSJ6HJTHBGJEYHPI45Q4/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-26T19:46:18Z","links":{"resolver":"https://pith.science/pith/YJR6ZYZSJ6HJTHBGJEYHPI45Q4","bundle":"https://pith.science/pith/YJR6ZYZSJ6HJTHBGJEYHPI45Q4/bundle.json","state":"https://pith.science/pith/YJR6ZYZSJ6HJTHBGJEYHPI45Q4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YJR6ZYZSJ6HJTHBGJEYHPI45Q4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YJR6ZYZSJ6HJTHBGJEYHPI45Q4","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":"20ae065c577a8314aee606dd7e01672aba9569c1afef9c1d0ed62e0a606479e0","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T10:19:06Z","title_canon_sha256":"9f41dbf126c7be81c69461858f9789cfd09182c54199386fdb467c6e0fe7ee92"},"schema_version":"1.0","source":{"id":"1603.02457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02457","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02457v1","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02457","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"pith_short_12","alias_value":"YJR6ZYZSJ6HJ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YJR6ZYZSJ6HJTHBG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YJR6ZYZS","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:45e33916e67b3fd099950ee1787fc2ded7fd5f9b6aa0426a5312ff0e398e511c","target":"graph","created_at":"2026-05-18T01:19:23Z","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":"In this paper, we define the reoptimization variant of the closest substring problem (CSP) under sequence addition. We show that, even with the additional information we have about the problem instance, the problem of finding a closest substring is still NP-hard. We investigate the combinatorial property of optimization problems called self-reducibility. We show that problems that are polynomial-time reducible to self-reducible problems also exhibits the same property. We illustrate this in the context of CSP. We used the property to show that although we cannot improve the approximability of ","authors_text":"Henry Adorna, Jeffrey Aborot, Jhoirene Clemente","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T10:19:06Z","title":"On Self-Reducibility and Reoptimization of Closest Substring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02457","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:206cceadb9b9831d3a1ed00603a94f43ea06c7b0229c0284f5445e6dbac3b86a","target":"record","created_at":"2026-05-18T01:19:23Z","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":"20ae065c577a8314aee606dd7e01672aba9569c1afef9c1d0ed62e0a606479e0","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-08T10:19:06Z","title_canon_sha256":"9f41dbf126c7be81c69461858f9789cfd09182c54199386fdb467c6e0fe7ee92"},"schema_version":"1.0","source":{"id":"1603.02457","kind":"arxiv","version":1}},"canonical_sha256":"c263ece3324f8e999c26493077a39d871ec1f610b4c194760ae2768224823ff8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c263ece3324f8e999c26493077a39d871ec1f610b4c194760ae2768224823ff8","first_computed_at":"2026-05-18T01:19:23.256589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:23.256589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3raOnGlASiSpSwsYq9LrP0SFsn2XdWqJ6A1NX8di9rKJnEXAxyLGvUKNG2JdS0uunBrGjmJbKWbkrSKEIgadDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:23.257209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:206cceadb9b9831d3a1ed00603a94f43ea06c7b0229c0284f5445e6dbac3b86a","sha256:45e33916e67b3fd099950ee1787fc2ded7fd5f9b6aa0426a5312ff0e398e511c"],"state_sha256":"d15ea311915cfc4b1a3354eadf404daceebbce788a9bc14f5391b89172989a20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DIXAS9h7gUbgIxtT7kVUIxN0XkGFApQ/5e/2i/v3EwTtdVhJPCUZMCOMaSJ5e23aaXvPWeuezq+kmXH25hKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:46:18.578746Z","bundle_sha256":"968450678ae8f69f915ad9c742fdb60ee1dd77e17c9c99e00e0df3b6d0fce110"}}