{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QIMLKLBSXVQTJH76HLB7WIUBLR","short_pith_number":"pith:QIMLKLBS","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"},"canonical_sha256":"8218b52c32bd61349ffe3ac3fb22815c773c86301f910f14b27506caae6cae96","source":{"kind":"arxiv","id":"1411.2239","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2239","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2239v1","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2239","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"QIMLKLBSXVQT","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QIMLKLBSXVQTJH76","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QIMLKLBS","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QIMLKLBSXVQTJH76HLB7WIUBLR","target":"record","payload":{"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"},"canonical_sha256":"8218b52c32bd61349ffe3ac3fb22815c773c86301f910f14b27506caae6cae96","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"},"source_kind":"arxiv","source_id":"1411.2239","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-05-18T02:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/GILp4hApToGQRZCvrIt2BhDhAdtGL59qZl0+3Io8UWEHObuyylBW3wB4wGt0n2MVCCgoVEa7yrkjjCBZMqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:19:13.358444Z"},"content_sha256":"4208e5590493f30bd61964f6ad468adfd493accdf7447d7cbb1aa2d3df802efb","schema_version":"1.0","event_id":"sha256:4208e5590493f30bd61964f6ad468adfd493accdf7447d7cbb1aa2d3df802efb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QIMLKLBSXVQTJH76HLB7WIUBLR","target":"graph","payload":{"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"},"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-05-18T02:38:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQ7p3N1O1K0IAiZ5kC6lmxbk7c0ISwxCfcDEYI1Cq2llLtMAxKqVvd9mcg0yaDHT8NhFSPOJQOMiTlfGSaMNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:19:13.358804Z"},"content_sha256":"d963b55e72244ec6437c48163e5a00512c69ffb1a1c6d7035bf80ab12375128d","schema_version":"1.0","event_id":"sha256:d963b55e72244ec6437c48163e5a00512c69ffb1a1c6d7035bf80ab12375128d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/bundle.json","state_url":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/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-05-31T08:19:13Z","links":{"resolver":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR","bundle":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/bundle.json","state":"https://pith.science/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIMLKLBSXVQTJH76HLB7WIUBLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QIMLKLBSXVQTJH76HLB7WIUBLR","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":"e6dcb0314e39a72f213d7f9f47134221b4f4879296c007efc5897df568ef368a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-09T14:35:48Z","title_canon_sha256":"795b3ca6ec617dbcf137aca3abc5113de5497eafa45f9fa3bb712b4e3c08de3b"},"schema_version":"1.0","source":{"id":"1411.2239","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.2239","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"arxiv_version","alias_value":"1411.2239v1","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2239","created_at":"2026-05-18T02:38:08Z"},{"alias_kind":"pith_short_12","alias_value":"QIMLKLBSXVQT","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QIMLKLBSXVQTJH76","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QIMLKLBS","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:d963b55e72244ec6437c48163e5a00512c69ffb1a1c6d7035bf80ab12375128d","target":"graph","created_at":"2026-05-18T02:38:08Z","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"},"paper":{"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","authors_text":"Borzoo Bonakdarpour, Ramy Medhat, Sebastian Fischmeister, Yogi Joshi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-09T14:35:48Z","title":"Accelerated Runtime Verification of LTL Specifications with Counting Semantics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2239","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:4208e5590493f30bd61964f6ad468adfd493accdf7447d7cbb1aa2d3df802efb","target":"record","created_at":"2026-05-18T02:38:08Z","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":"e6dcb0314e39a72f213d7f9f47134221b4f4879296c007efc5897df568ef368a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-09T14:35:48Z","title_canon_sha256":"795b3ca6ec617dbcf137aca3abc5113de5497eafa45f9fa3bb712b4e3c08de3b"},"schema_version":"1.0","source":{"id":"1411.2239","kind":"arxiv","version":1}},"canonical_sha256":"8218b52c32bd61349ffe3ac3fb22815c773c86301f910f14b27506caae6cae96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8218b52c32bd61349ffe3ac3fb22815c773c86301f910f14b27506caae6cae96","first_computed_at":"2026-05-18T02:38:08.060757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:08.060757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kXr2vSxMTzG0a6izbQEXNJAy0UkX2RZQBblK0AqZXnPg9BVQyqXyLb/h7tAXGuQ3JeS7YG32mo8Hd7E8lYRYCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:08.061123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.2239","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4208e5590493f30bd61964f6ad468adfd493accdf7447d7cbb1aa2d3df802efb","sha256:d963b55e72244ec6437c48163e5a00512c69ffb1a1c6d7035bf80ab12375128d"],"state_sha256":"1dabf6232a88a04e3535a9dfa9458290565523b009a488786eb5e348941449f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXUIqjenfztHjQDikEqL7bpRxovQq78QBI87UHPjXM+LNa/0SE7tr71zKH4VbT28Gjj+5TMIyDiDl7QHVMCqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:19:13.361143Z","bundle_sha256":"657c8d7e46cc9d49c3b67c25ffb940fa65d39f701ab778975840e7cd9d7b32de"}}