{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QIMLKLBSXVQTJH76HLB7WIUBLR","short_pith_number":"pith:QIMLKLBS","schema_version":"1.0","canonical_sha256":"8218b52c32bd61349ffe3ac3fb22815c773c86301f910f14b27506caae6cae96","source":{"kind":"arxiv","id":"1411.2239","version":1},"attestation_state":"computed","paper":{"title":"Accelerated Runtime Verification of LTL Specifications with Counting Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Borzoo Bonakdarpour, Ramy Medhat, Sebastian Fischmeister, Yogi Joshi","submitted_at":"2014-11-09T14:35:48Z","abstract_excerpt":"Runtime verification is an effective automated method for specification-based offline testing and analysis as well as online monitoring of complex systems. The specification language is often a variant of regular expressions or a popular temporal logic, such as LTL. This paper presents a novel and efficient parallel algorithm for verifying a more expressive version of LTL specifications that incorporates counting semantics, where nested quantifiers can be subject to numerical constraints. Such constraints are useful in evaluating thresholds (e.g., expected uptime of a web server). The signific"},"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":"1411.2239","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-09T14:35:48Z","cross_cats_sorted":[],"title_canon_sha256":"795b3ca6ec617dbcf137aca3abc5113de5497eafa45f9fa3bb712b4e3c08de3b","abstract_canon_sha256":"e6dcb0314e39a72f213d7f9f47134221b4f4879296c007efc5897df568ef368a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:08.061123Z","signature_b64":"kXr2vSxMTzG0a6izbQEXNJAy0UkX2RZQBblK0AqZXnPg9BVQyqXyLb/h7tAXGuQ3JeS7YG32mo8Hd7E8lYRYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8218b52c32bd61349ffe3ac3fb22815c773c86301f910f14b27506caae6cae96","last_reissued_at":"2026-05-18T02:38:08.060757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:08.060757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Runtime Verification of LTL Specifications with Counting Semantics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Borzoo Bonakdarpour, Ramy Medhat, Sebastian Fischmeister, Yogi Joshi","submitted_at":"2014-11-09T14:35:48Z","abstract_excerpt":"Runtime verification is an effective automated method for specification-based offline testing and analysis as well as online monitoring of complex systems. The specification language is often a variant of regular expressions or a popular temporal logic, such as LTL. This paper presents a novel and efficient parallel algorithm for verifying a more expressive version of LTL specifications that incorporates counting semantics, where nested quantifiers can be subject to numerical constraints. Such constraints are useful in evaluating thresholds (e.g., expected uptime of a web server). The signific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2239","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":"1411.2239","created_at":"2026-05-18T02:38:08.060812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2239v1","created_at":"2026-05-18T02:38:08.060812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2239","created_at":"2026-05-18T02:38:08.060812+00:00"},{"alias_kind":"pith_short_12","alias_value":"QIMLKLBSXVQT","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QIMLKLBSXVQTJH76","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QIMLKLBS","created_at":"2026-05-18T12:28:46.137349+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/QIMLKLBSXVQTJH76HLB7WIUBLR","json":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR.json","graph_json":"https://pith.science/api/pith-number/QIMLKLBSXVQTJH76HLB7WIUBLR/graph.json","events_json":"https://pith.science/api/pith-number/QIMLKLBSXVQTJH76HLB7WIUBLR/events.json","paper":"https://pith.science/paper/QIMLKLBS"},"agent_actions":{"view_html":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR","download_json":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR.json","view_paper":"https://pith.science/paper/QIMLKLBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2239&json=true","fetch_graph":"https://pith.science/api/pith-number/QIMLKLBSXVQTJH76HLB7WIUBLR/graph.json","fetch_events":"https://pith.science/api/pith-number/QIMLKLBSXVQTJH76HLB7WIUBLR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/action/storage_attestation","attest_author":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/action/author_attestation","sign_citation":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/action/citation_signature","submit_replication":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/action/replication_record"}},"created_at":"2026-05-18T02:38:08.060812+00:00","updated_at":"2026-05-18T02:38:08.060812+00:00"}