{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XRNMO5ODX44PO7OPVWUU5WCHVH","short_pith_number":"pith:XRNMO5OD","canonical_record":{"source":{"id":"1506.04559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T11:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"3515f9867f2192078e64ce346962281131eb485be3d15049dbe3764406b00c94","abstract_canon_sha256":"1416031ad1ef866457e630e97a1998d2e7059430592eed8480f06039a45a16b7"},"schema_version":"1.0"},"canonical_sha256":"bc5ac775c3bf38f77dcfada94ed847a9cdb9b69ef4a7101732c16fe8f03355f4","source":{"kind":"arxiv","id":"1506.04559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04559","created_at":"2026-05-18T01:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04559v1","created_at":"2026-05-18T01:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04559","created_at":"2026-05-18T01:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"XRNMO5ODX44P","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XRNMO5ODX44PO7OP","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XRNMO5OD","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XRNMO5ODX44PO7OPVWUU5WCHVH","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T11:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"3515f9867f2192078e64ce346962281131eb485be3d15049dbe3764406b00c94","abstract_canon_sha256":"1416031ad1ef866457e630e97a1998d2e7059430592eed8480f06039a45a16b7"},"schema_version":"1.0"},"canonical_sha256":"bc5ac775c3bf38f77dcfada94ed847a9cdb9b69ef4a7101732c16fe8f03355f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:30.898166Z","signature_b64":"qmILoxDYZxy+kqgcHvgMJiFhEXopCQQ0qtH0Scyw6ur+9TCMGt/3KJNhoOthUmtRYCukC4LeWTmNCiXZP8I7Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc5ac775c3bf38f77dcfada94ed847a9cdb9b69ef4a7101732c16fe8f03355f4","last_reissued_at":"2026-05-18T01:49:30.897605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:30.897605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04559","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:49:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b887RA4qIu664Y4Ng9In/8SUu/PX1KLI+lq73lxPWeRebcSld1/HptPIgbsm6r6TfJM4jt268xWuplKKlsnmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:36:54.323349Z"},"content_sha256":"4ce375b4280bcb87a73b1e60037bfbcce70c86102aa2d12800063a5967464614","schema_version":"1.0","event_id":"sha256:4ce375b4280bcb87a73b1e60037bfbcce70c86102aa2d12800063a5967464614"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XRNMO5ODX44PO7OPVWUU5WCHVH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear Algorithm for Conservative Degenerate Pattern Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Fatima Vayani, Manal Mohamed, Maxime Crochemore, Ritu Kundu","submitted_at":"2015-06-15T11:45:53Z","abstract_excerpt":"A degenerate symbol x* over an alphabet A is a non-empty subset of A, and a sequence of such symbols is a degenerate string. A degenerate string is said to be conservative if its number of non-solid symbols is upper-bounded by a fixed positive constant k. We consider here the matching problem of conservative degenerate strings and present the first linear-time algorithm that can find, for given degenerate strings P* and T* of total length n containing k non-solid symbols in total, the occurrences of P* in T* in O(nk) time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04559","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:49:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bNyirEo8yeKizn0F6ovGMHjOxy/Y6qmQ6uyJSdD/vNtrXt9lveAPmxIAQBhkRD+W+LP6oiRTTHr5QyLrHAaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:36:54.323993Z"},"content_sha256":"28a0299f99642c397888ead747bd799e4221d308df48d57d21a69d33abef4107","schema_version":"1.0","event_id":"sha256:28a0299f99642c397888ead747bd799e4221d308df48d57d21a69d33abef4107"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/bundle.json","state_url":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/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-02T11:36:54Z","links":{"resolver":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH","bundle":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/bundle.json","state":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XRNMO5ODX44PO7OPVWUU5WCHVH","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":"1416031ad1ef866457e630e97a1998d2e7059430592eed8480f06039a45a16b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T11:45:53Z","title_canon_sha256":"3515f9867f2192078e64ce346962281131eb485be3d15049dbe3764406b00c94"},"schema_version":"1.0","source":{"id":"1506.04559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04559","created_at":"2026-05-18T01:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04559v1","created_at":"2026-05-18T01:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04559","created_at":"2026-05-18T01:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"XRNMO5ODX44P","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XRNMO5ODX44PO7OP","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XRNMO5OD","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:28a0299f99642c397888ead747bd799e4221d308df48d57d21a69d33abef4107","target":"graph","created_at":"2026-05-18T01:49:30Z","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":"A degenerate symbol x* over an alphabet A is a non-empty subset of A, and a sequence of such symbols is a degenerate string. A degenerate string is said to be conservative if its number of non-solid symbols is upper-bounded by a fixed positive constant k. We consider here the matching problem of conservative degenerate strings and present the first linear-time algorithm that can find, for given degenerate strings P* and T* of total length n containing k non-solid symbols in total, the occurrences of P* in T* in O(nk) time.","authors_text":"Costas S. Iliopoulos, Fatima Vayani, Manal Mohamed, Maxime Crochemore, Ritu Kundu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T11:45:53Z","title":"Linear Algorithm for Conservative Degenerate Pattern Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04559","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:4ce375b4280bcb87a73b1e60037bfbcce70c86102aa2d12800063a5967464614","target":"record","created_at":"2026-05-18T01:49:30Z","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":"1416031ad1ef866457e630e97a1998d2e7059430592eed8480f06039a45a16b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T11:45:53Z","title_canon_sha256":"3515f9867f2192078e64ce346962281131eb485be3d15049dbe3764406b00c94"},"schema_version":"1.0","source":{"id":"1506.04559","kind":"arxiv","version":1}},"canonical_sha256":"bc5ac775c3bf38f77dcfada94ed847a9cdb9b69ef4a7101732c16fe8f03355f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc5ac775c3bf38f77dcfada94ed847a9cdb9b69ef4a7101732c16fe8f03355f4","first_computed_at":"2026-05-18T01:49:30.897605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:49:30.897605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qmILoxDYZxy+kqgcHvgMJiFhEXopCQQ0qtH0Scyw6ur+9TCMGt/3KJNhoOthUmtRYCukC4LeWTmNCiXZP8I7Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:49:30.898166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ce375b4280bcb87a73b1e60037bfbcce70c86102aa2d12800063a5967464614","sha256:28a0299f99642c397888ead747bd799e4221d308df48d57d21a69d33abef4107"],"state_sha256":"2c3d66dfd4b0da80ddf68a4523b24b9c8bb5ec0a75a702cc1c568c653aee3f8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2elI7M7c2ObhDLLgueWVH5JhxSRgF0yT/Uce8jfeVF24mJkiTmTR4IPykp5LASS0Mzfc8JpR2IWIf5WZMF/8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:36:54.328104Z","bundle_sha256":"0432000f48ce9f77f9312c40af64c9c702b01bc5db67675bb76bc57853c7a121"}}