{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MA3P5QGW3GFJG6AJLLHVF5AP2N","short_pith_number":"pith:MA3P5QGW","schema_version":"1.0","canonical_sha256":"6036fec0d6d98a9378095acf52f40fd370c653443d68459a4a0f415c885353b7","source":{"kind":"arxiv","id":"1706.09174","version":1},"attestation_state":"computed","paper":{"title":"Efficient Online Timed Pattern Matching by Automata-Based Skipping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Ichiro Hasuo, Kohei Suenaga, Masaki Waga","submitted_at":"2017-06-28T08:58:49Z","abstract_excerpt":"The timed pattern matching problem is an actively studied topic because of its relevance in monitoring of real-time systems. There one is given a log $w$ and a specification $\\mathcal{A}$ (given by a timed word and a timed automaton in this paper), and one wishes to return the set of intervals for which the log $w$, when restricted to the interval, satisfies the specification $\\mathcal{A}$. In our previous work we presented an efficient timed pattern matching algorithm: it adopts a skipping mechanism inspired by the classic Boyer--Moore (BM) string matching algorithm. In this work we tackle 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":"1706.09174","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-06-28T08:58:49Z","cross_cats_sorted":[],"title_canon_sha256":"745ce44a44c21a2b31188619328e7506b42a711ca01ce8070e30f50601a43d23","abstract_canon_sha256":"74aee254654a237fef34eb8dbe8bae61f1bbce2c9efa48b0ee03f6732a4a5546"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:49.866103Z","signature_b64":"EkQcwjWCkZKtccVJUC31pk9zj7cTgqmbKRj0KUU4097/bpEmq7d1Dp4ciYsU3Ff9boIaWse4P8jbz/qBqJh5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6036fec0d6d98a9378095acf52f40fd370c653443d68459a4a0f415c885353b7","last_reissued_at":"2026-05-18T00:02:49.865604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:49.865604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Online Timed Pattern Matching by Automata-Based Skipping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Ichiro Hasuo, Kohei Suenaga, Masaki Waga","submitted_at":"2017-06-28T08:58:49Z","abstract_excerpt":"The timed pattern matching problem is an actively studied topic because of its relevance in monitoring of real-time systems. There one is given a log $w$ and a specification $\\mathcal{A}$ (given by a timed word and a timed automaton in this paper), and one wishes to return the set of intervals for which the log $w$, when restricted to the interval, satisfies the specification $\\mathcal{A}$. In our previous work we presented an efficient timed pattern matching algorithm: it adopts a skipping mechanism inspired by the classic Boyer--Moore (BM) string matching algorithm. In this work we tackle th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09174","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":"1706.09174","created_at":"2026-05-18T00:02:49.865678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09174v1","created_at":"2026-05-18T00:02:49.865678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09174","created_at":"2026-05-18T00:02:49.865678+00:00"},{"alias_kind":"pith_short_12","alias_value":"MA3P5QGW3GFJ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MA3P5QGW3GFJG6AJ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MA3P5QGW","created_at":"2026-05-18T12:31:31.346846+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/MA3P5QGW3GFJG6AJLLHVF5AP2N","json":"https://pith.science/pith/MA3P5QGW3GFJG6AJLLHVF5AP2N.json","graph_json":"https://pith.science/api/pith-number/MA3P5QGW3GFJG6AJLLHVF5AP2N/graph.json","events_json":"https://pith.science/api/pith-number/MA3P5QGW3GFJG6AJLLHVF5AP2N/events.json","paper":"https://pith.science/paper/MA3P5QGW"},"agent_actions":{"view_html":"https://pith.science/pith/MA3P5QGW3GFJG6AJLLHVF5AP2N","download_json":"https://pith.science/pith/MA3P5QGW3GFJG6AJLLHVF5AP2N.json","view_paper":"https://pith.science/paper/MA3P5QGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09174&json=true","fetch_graph":"https://pith.science/api/pith-number/MA3P5QGW3GFJG6AJLLHVF5AP2N/graph.json","fetch_events":"https://pith.science/api/pith-number/MA3P5QGW3GFJG6AJLLHVF5AP2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MA3P5QGW3GFJG6AJLLHVF5AP2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MA3P5QGW3GFJG6AJLLHVF5AP2N/action/storage_attestation","attest_author":"https://pith.science/pith/MA3P5QGW3GFJG6AJLLHVF5AP2N/action/author_attestation","sign_citation":"https://pith.science/pith/MA3P5QGW3GFJG6AJLLHVF5AP2N/action/citation_signature","submit_replication":"https://pith.science/pith/MA3P5QGW3GFJG6AJLLHVF5AP2N/action/replication_record"}},"created_at":"2026-05-18T00:02:49.865678+00:00","updated_at":"2026-05-18T00:02:49.865678+00:00"}