{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BQCUPSMIVRME7UYA46NP2Q6TT4","short_pith_number":"pith:BQCUPSMI","schema_version":"1.0","canonical_sha256":"0c0547c988ac584fd300e79afd43d39f3dfde0ceac06a8d53fb156be011a3d5e","source":{"kind":"arxiv","id":"2505.04549","version":1},"attestation_state":"computed","paper":{"title":"Fast Pattern Matching with Epsilon Transitions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicola Cotumaccio","submitted_at":"2025-05-07T16:31:21Z","abstract_excerpt":"In the String Matching in Labeled Graphs (SMLG) problem, we need to determine whether a pattern string appears on a given labeled graph or a given automaton. Under the Orthogonal Vectors hypothesis, the SMLG problem cannot be solved in subquadratic time [ICALP 2019]. In typical bioinformatics applications, pattern matching algorithms should be both fast and space-efficient, so we need to determine useful classes of graphs on which the SLMG problem can be solved efficiently.\n  In this paper, we improve on a recent result [STACS 2024] that shows how to solve the SMLG problem in linear time on th"},"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":"2505.04549","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-07T16:31:21Z","cross_cats_sorted":[],"title_canon_sha256":"7af617875f7e6c49951eaaa291bcf08898901b5e369c0963879d899068cb9724","abstract_canon_sha256":"5f04f19cadde360e605ea026c3f9484b9b40a912098a438022a03c6edab9c144"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:03.270909Z","signature_b64":"8YONHM43sAz0F/1is5y0tIQyCCYDIGxB3RlcXzLAHB1sBa/lCXspqh0KbO1soK7s7kKiZYrLM4slglUv+eeADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c0547c988ac584fd300e79afd43d39f3dfde0ceac06a8d53fb156be011a3d5e","last_reissued_at":"2026-07-05T11:48:03.270329Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:03.270329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Pattern Matching with Epsilon Transitions","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicola Cotumaccio","submitted_at":"2025-05-07T16:31:21Z","abstract_excerpt":"In the String Matching in Labeled Graphs (SMLG) problem, we need to determine whether a pattern string appears on a given labeled graph or a given automaton. Under the Orthogonal Vectors hypothesis, the SMLG problem cannot be solved in subquadratic time [ICALP 2019]. In typical bioinformatics applications, pattern matching algorithms should be both fast and space-efficient, so we need to determine useful classes of graphs on which the SLMG problem can be solved efficiently.\n  In this paper, we improve on a recent result [STACS 2024] that shows how to solve the SMLG problem in linear time on th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04549","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.04549/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.04549","created_at":"2026-07-05T11:48:03.270414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.04549v1","created_at":"2026-07-05T11:48:03.270414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04549","created_at":"2026-07-05T11:48:03.270414+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQCUPSMIVRME","created_at":"2026-07-05T11:48:03.270414+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQCUPSMIVRME7UYA","created_at":"2026-07-05T11:48:03.270414+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQCUPSMI","created_at":"2026-07-05T11:48:03.270414+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/BQCUPSMIVRME7UYA46NP2Q6TT4","json":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4.json","graph_json":"https://pith.science/api/pith-number/BQCUPSMIVRME7UYA46NP2Q6TT4/graph.json","events_json":"https://pith.science/api/pith-number/BQCUPSMIVRME7UYA46NP2Q6TT4/events.json","paper":"https://pith.science/paper/BQCUPSMI"},"agent_actions":{"view_html":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4","download_json":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4.json","view_paper":"https://pith.science/paper/BQCUPSMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.04549&json=true","fetch_graph":"https://pith.science/api/pith-number/BQCUPSMIVRME7UYA46NP2Q6TT4/graph.json","fetch_events":"https://pith.science/api/pith-number/BQCUPSMIVRME7UYA46NP2Q6TT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/action/storage_attestation","attest_author":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/action/author_attestation","sign_citation":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/action/citation_signature","submit_replication":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/action/replication_record"}},"created_at":"2026-07-05T11:48:03.270414+00:00","updated_at":"2026-07-05T11:48:03.270414+00:00"}