{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XRNMO5ODX44PO7OPVWUU5WCHVH","short_pith_number":"pith:XRNMO5OD","schema_version":"1.0","canonical_sha256":"bc5ac775c3bf38f77dcfada94ed847a9cdb9b69ef4a7101732c16fe8f03355f4","source":{"kind":"arxiv","id":"1506.04559","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.04559","created_at":"2026-05-18T01:49:30.897683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04559v1","created_at":"2026-05-18T01:49:30.897683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04559","created_at":"2026-05-18T01:49:30.897683+00:00"},{"alias_kind":"pith_short_12","alias_value":"XRNMO5ODX44P","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XRNMO5ODX44PO7OP","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XRNMO5OD","created_at":"2026-05-18T12:29:50.041715+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/XRNMO5ODX44PO7OPVWUU5WCHVH","json":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH.json","graph_json":"https://pith.science/api/pith-number/XRNMO5ODX44PO7OPVWUU5WCHVH/graph.json","events_json":"https://pith.science/api/pith-number/XRNMO5ODX44PO7OPVWUU5WCHVH/events.json","paper":"https://pith.science/paper/XRNMO5OD"},"agent_actions":{"view_html":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH","download_json":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH.json","view_paper":"https://pith.science/paper/XRNMO5OD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04559&json=true","fetch_graph":"https://pith.science/api/pith-number/XRNMO5ODX44PO7OPVWUU5WCHVH/graph.json","fetch_events":"https://pith.science/api/pith-number/XRNMO5ODX44PO7OPVWUU5WCHVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/action/storage_attestation","attest_author":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/action/author_attestation","sign_citation":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/action/citation_signature","submit_replication":"https://pith.science/pith/XRNMO5ODX44PO7OPVWUU5WCHVH/action/replication_record"}},"created_at":"2026-05-18T01:49:30.897683+00:00","updated_at":"2026-05-18T01:49:30.897683+00:00"}