{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:BQCUPSMIVRME7UYA46NP2Q6TT4","short_pith_number":"pith:BQCUPSMI","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"},"canonical_sha256":"0c0547c988ac584fd300e79afd43d39f3dfde0ceac06a8d53fb156be011a3d5e","source":{"kind":"arxiv","id":"2505.04549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.04549","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.04549v1","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04549","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"BQCUPSMIVRME","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_16","alias_value":"BQCUPSMIVRME7UYA","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_8","alias_value":"BQCUPSMI","created_at":"2026-07-05T11:48:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:BQCUPSMIVRME7UYA46NP2Q6TT4","target":"record","payload":{"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"},"canonical_sha256":"0c0547c988ac584fd300e79afd43d39f3dfde0ceac06a8d53fb156be011a3d5e","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"},"source_kind":"arxiv","source_id":"2505.04549","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-07-05T11:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dEiBbjKmAb478euRIU3DB05/LaElmJJoZJQ6gKovHBSqNcp4IzcimIS5gUGs5jJPcDmyBf+ehHJZGP800LbQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:01:59.376724Z"},"content_sha256":"b81617544e5553b71a57294ce2059bca5eb871560009bdf597c980c192196795","schema_version":"1.0","event_id":"sha256:b81617544e5553b71a57294ce2059bca5eb871560009bdf597c980c192196795"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:BQCUPSMIVRME7UYA46NP2Q6TT4","target":"graph","payload":{"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"},"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-07-05T11:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SofDmVuJMhFDPa3yOpb8cu0rSAUZcS4xuKaFsfJo5F0pLOVLcJMhZAXyjgnJYAfiaLos+4LbNJvjiC+cZguPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T19:01:59.377087Z"},"content_sha256":"8641f2a583176bb9fb117017d2c4385ea663ab7f4f115a69361533fa1b03847f","schema_version":"1.0","event_id":"sha256:8641f2a583176bb9fb117017d2c4385ea663ab7f4f115a69361533fa1b03847f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/bundle.json","state_url":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/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-07-06T19:01:59Z","links":{"resolver":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4","bundle":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/bundle.json","state":"https://pith.science/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQCUPSMIVRME7UYA46NP2Q6TT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:BQCUPSMIVRME7UYA46NP2Q6TT4","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":"5f04f19cadde360e605ea026c3f9484b9b40a912098a438022a03c6edab9c144","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-07T16:31:21Z","title_canon_sha256":"7af617875f7e6c49951eaaa291bcf08898901b5e369c0963879d899068cb9724"},"schema_version":"1.0","source":{"id":"2505.04549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.04549","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"2505.04549v1","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.04549","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"BQCUPSMIVRME","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_16","alias_value":"BQCUPSMIVRME7UYA","created_at":"2026-07-05T11:48:03Z"},{"alias_kind":"pith_short_8","alias_value":"BQCUPSMI","created_at":"2026-07-05T11:48:03Z"}],"graph_snapshots":[{"event_id":"sha256:8641f2a583176bb9fb117017d2c4385ea663ab7f4f115a69361533fa1b03847f","target":"graph","created_at":"2026-07-05T11:48: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.04549/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Nicola Cotumaccio","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-07T16:31:21Z","title":"Fast Pattern Matching with Epsilon Transitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.04549","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:b81617544e5553b71a57294ce2059bca5eb871560009bdf597c980c192196795","target":"record","created_at":"2026-07-05T11:48: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":"5f04f19cadde360e605ea026c3f9484b9b40a912098a438022a03c6edab9c144","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-07T16:31:21Z","title_canon_sha256":"7af617875f7e6c49951eaaa291bcf08898901b5e369c0963879d899068cb9724"},"schema_version":"1.0","source":{"id":"2505.04549","kind":"arxiv","version":1}},"canonical_sha256":"0c0547c988ac584fd300e79afd43d39f3dfde0ceac06a8d53fb156be011a3d5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c0547c988ac584fd300e79afd43d39f3dfde0ceac06a8d53fb156be011a3d5e","first_computed_at":"2026-07-05T11:48:03.270329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:48:03.270329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8YONHM43sAz0F/1is5y0tIQyCCYDIGxB3RlcXzLAHB1sBa/lCXspqh0KbO1soK7s7kKiZYrLM4slglUv+eeADw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:48:03.270909Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.04549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b81617544e5553b71a57294ce2059bca5eb871560009bdf597c980c192196795","sha256:8641f2a583176bb9fb117017d2c4385ea663ab7f4f115a69361533fa1b03847f"],"state_sha256":"f8cdcb3ea66c9dc09773ba64ed20595fbdec8c57c888cf4bc9217ca10d9d2312"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oBKgYe87/+QaEZZEFV66IuAjwUOm3M4UcfgWntmw/u4E1Noh2bbdiIKZDerleaqIyFwsMJu9ALNjrsYvIHd/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T19:01:59.378977Z","bundle_sha256":"7bf764399575bdea095734fd50d64b3e032875680d042f1a3896ef7ae8333856"}}