{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:EG4U5TMAHIO3KN553M5AQOCQ5S","short_pith_number":"pith:EG4U5TMA","canonical_record":{"source":{"id":"1106.6342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-30T19:04:18Z","cross_cats_sorted":[],"title_canon_sha256":"5ae64295b19c9e3fef78f62aa75781229c931ced15aee04baa64a7b0876b42df","abstract_canon_sha256":"b078c3be8538398c4db1ee72d80097cb6dc1ad343128eb2025445761bc594f1f"},"schema_version":"1.0"},"canonical_sha256":"21b94ecd803a1db537bddb3a083850ec8a567d598dbe728e71c43bed4fbc57ec","source":{"kind":"arxiv","id":"1106.6342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.6342","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1106.6342v1","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.6342","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"EG4U5TMAHIO3","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EG4U5TMAHIO3KN55","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EG4U5TMA","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:EG4U5TMAHIO3KN553M5AQOCQ5S","target":"record","payload":{"canonical_record":{"source":{"id":"1106.6342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-30T19:04:18Z","cross_cats_sorted":[],"title_canon_sha256":"5ae64295b19c9e3fef78f62aa75781229c931ced15aee04baa64a7b0876b42df","abstract_canon_sha256":"b078c3be8538398c4db1ee72d80097cb6dc1ad343128eb2025445761bc594f1f"},"schema_version":"1.0"},"canonical_sha256":"21b94ecd803a1db537bddb3a083850ec8a567d598dbe728e71c43bed4fbc57ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:03.485896Z","signature_b64":"JrEnBgNocXp+dyZibqVpMI7rPTOVMr4nzJTmMGP15nJ2Jb5yJKg0WLc+JlVl3piEdOzLtbsjkjMLHljM8+5JAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21b94ecd803a1db537bddb3a083850ec8a567d598dbe728e71c43bed4fbc57ec","last_reissued_at":"2026-05-18T04:19:03.485162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:03.485162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.6342","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-18T04:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKkJTae7BfL7dHm+EuQxs+WAs6Tu+hgicYxipvmi4wauEvtcsFK0yzYlCG4/NZidONNuRxJraGZao33Ys0WAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:47:15.765659Z"},"content_sha256":"42a4528278da59eeb4949a041800a8659616acf855a37111a31e04bef011ec55","schema_version":"1.0","event_id":"sha256:42a4528278da59eeb4949a041800a8659616acf855a37111a31e04bef011ec55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:EG4U5TMAHIO3KN553M5AQOCQ5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratic-time Algorithm for the String Constrained LCS Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Deorowicz","submitted_at":"2011-06-30T19:04:18Z","abstract_excerpt":"The problem of finding a longest common subsequence of two main sequences with some constraint that must be a substring of the result (STR-IC-LCS) was formulated recently. It is a variant of the constrained longest common subsequence problem. As the known algorithms for the STR-IC-LCS problem are cubic-time, the presented quadratic-time algorithm is significantly faster."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.6342","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-18T04:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Q/RwBbuw7j6wLTYUHq8xD/m90Y8PHCBPf4c2/b7sQT5dPqVLqGWdjyIxOaDskL6kTw1f0f7DwDJRyyPNCVADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:47:15.766475Z"},"content_sha256":"5ee704f9c1f4328189fb9b9853aaf9d390f9c78e0c74be9ef5a3063c1cef9851","schema_version":"1.0","event_id":"sha256:5ee704f9c1f4328189fb9b9853aaf9d390f9c78e0c74be9ef5a3063c1cef9851"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EG4U5TMAHIO3KN553M5AQOCQ5S/bundle.json","state_url":"https://pith.science/pith/EG4U5TMAHIO3KN553M5AQOCQ5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EG4U5TMAHIO3KN553M5AQOCQ5S/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-06-09T06:47:15Z","links":{"resolver":"https://pith.science/pith/EG4U5TMAHIO3KN553M5AQOCQ5S","bundle":"https://pith.science/pith/EG4U5TMAHIO3KN553M5AQOCQ5S/bundle.json","state":"https://pith.science/pith/EG4U5TMAHIO3KN553M5AQOCQ5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EG4U5TMAHIO3KN553M5AQOCQ5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:EG4U5TMAHIO3KN553M5AQOCQ5S","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":"b078c3be8538398c4db1ee72d80097cb6dc1ad343128eb2025445761bc594f1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-30T19:04:18Z","title_canon_sha256":"5ae64295b19c9e3fef78f62aa75781229c931ced15aee04baa64a7b0876b42df"},"schema_version":"1.0","source":{"id":"1106.6342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.6342","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1106.6342v1","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.6342","created_at":"2026-05-18T04:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"EG4U5TMAHIO3","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"EG4U5TMAHIO3KN55","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"EG4U5TMA","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:5ee704f9c1f4328189fb9b9853aaf9d390f9c78e0c74be9ef5a3063c1cef9851","target":"graph","created_at":"2026-05-18T04:19:03Z","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":"The problem of finding a longest common subsequence of two main sequences with some constraint that must be a substring of the result (STR-IC-LCS) was formulated recently. It is a variant of the constrained longest common subsequence problem. As the known algorithms for the STR-IC-LCS problem are cubic-time, the presented quadratic-time algorithm is significantly faster.","authors_text":"Sebastian Deorowicz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-30T19:04:18Z","title":"Quadratic-time Algorithm for the String Constrained LCS Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.6342","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:42a4528278da59eeb4949a041800a8659616acf855a37111a31e04bef011ec55","target":"record","created_at":"2026-05-18T04:19:03Z","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":"b078c3be8538398c4db1ee72d80097cb6dc1ad343128eb2025445761bc594f1f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-30T19:04:18Z","title_canon_sha256":"5ae64295b19c9e3fef78f62aa75781229c931ced15aee04baa64a7b0876b42df"},"schema_version":"1.0","source":{"id":"1106.6342","kind":"arxiv","version":1}},"canonical_sha256":"21b94ecd803a1db537bddb3a083850ec8a567d598dbe728e71c43bed4fbc57ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21b94ecd803a1db537bddb3a083850ec8a567d598dbe728e71c43bed4fbc57ec","first_computed_at":"2026-05-18T04:19:03.485162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:03.485162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JrEnBgNocXp+dyZibqVpMI7rPTOVMr4nzJTmMGP15nJ2Jb5yJKg0WLc+JlVl3piEdOzLtbsjkjMLHljM8+5JAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:03.485896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.6342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42a4528278da59eeb4949a041800a8659616acf855a37111a31e04bef011ec55","sha256:5ee704f9c1f4328189fb9b9853aaf9d390f9c78e0c74be9ef5a3063c1cef9851"],"state_sha256":"3572edd8b8adae3aa6f4617ee69dfb137ca9b8398a50496e2f91cc7f9bb4bd62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2lowx1C81kpMomuCs+jy5Wu7mVU1p6FpdkDkTURfZY/30Lwvj2yN7rGCaWzWrSU7/j9NAfgnNduYNZGAxR0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:47:15.770985Z","bundle_sha256":"4f2b4c8080e00f7ee6e26181338e7f2c346027eac5d0c121f47a7301d69a8cdf"}}