{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MDS5PWCQRUFZJTEPD4MBJ4MPD2","short_pith_number":"pith:MDS5PWCQ","schema_version":"1.0","canonical_sha256":"60e5d7d8508d0b94cc8f1f1814f18f1e9fa8b9ab04caf44c8885fb0cef25d8ff","source":{"kind":"arxiv","id":"1804.03237","version":1},"attestation_state":"computed","paper":{"title":"A Counting Semantics for Monitoring LTL Specifications over Finite Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Dejan Nickovic, Ezio Bartocci, Franz Roeck, Roderick Bloem","submitted_at":"2018-04-09T20:57:35Z","abstract_excerpt":"We consider the problem of monitoring a Linear Time Logic (LTL) specification that is defined on infinite paths, over finite traces. For example, we may need to draw a verdict on whether the system satisfies or violates the property \"p holds infinitely often.\" The problem is that there is always a continuation of a finite trace that satisfies the property and a different continuation that violates it.\n  We propose a two-step approach to address this problem. First, we introduce a counting semantics that computes the number of steps to witness the satisfaction or violation of a formula for each"},"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":"1804.03237","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-09T20:57:35Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"3ffd0b8ac6cdebeea7efee90b696f4ec3d8e4729e4272bf2341e8dc6501b0c68","abstract_canon_sha256":"7d6d6003ccf73a86e9df01e9b4757f71d11751365ee2ee673c30e242790672ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:56.582544Z","signature_b64":"YJOOP7IE1dPkXeCCHC88VRvDoJB9Jt2SB7oZpc66fEYKh0EiKQ4UuV1BEt9PMP5vqHL+PM72TWHQoGkuUuMWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60e5d7d8508d0b94cc8f1f1814f18f1e9fa8b9ab04caf44c8885fb0cef25d8ff","last_reissued_at":"2026-05-18T00:18:56.582078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:56.582078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Counting Semantics for Monitoring LTL Specifications over Finite Traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Dejan Nickovic, Ezio Bartocci, Franz Roeck, Roderick Bloem","submitted_at":"2018-04-09T20:57:35Z","abstract_excerpt":"We consider the problem of monitoring a Linear Time Logic (LTL) specification that is defined on infinite paths, over finite traces. For example, we may need to draw a verdict on whether the system satisfies or violates the property \"p holds infinitely often.\" The problem is that there is always a continuation of a finite trace that satisfies the property and a different continuation that violates it.\n  We propose a two-step approach to address this problem. First, we introduce a counting semantics that computes the number of steps to witness the satisfaction or violation of a formula for each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03237","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":"1804.03237","created_at":"2026-05-18T00:18:56.582155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03237v1","created_at":"2026-05-18T00:18:56.582155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03237","created_at":"2026-05-18T00:18:56.582155+00:00"},{"alias_kind":"pith_short_12","alias_value":"MDS5PWCQRUFZ","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MDS5PWCQRUFZJTEP","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MDS5PWCQ","created_at":"2026-05-18T12:32:37.024351+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/MDS5PWCQRUFZJTEPD4MBJ4MPD2","json":"https://pith.science/pith/MDS5PWCQRUFZJTEPD4MBJ4MPD2.json","graph_json":"https://pith.science/api/pith-number/MDS5PWCQRUFZJTEPD4MBJ4MPD2/graph.json","events_json":"https://pith.science/api/pith-number/MDS5PWCQRUFZJTEPD4MBJ4MPD2/events.json","paper":"https://pith.science/paper/MDS5PWCQ"},"agent_actions":{"view_html":"https://pith.science/pith/MDS5PWCQRUFZJTEPD4MBJ4MPD2","download_json":"https://pith.science/pith/MDS5PWCQRUFZJTEPD4MBJ4MPD2.json","view_paper":"https://pith.science/paper/MDS5PWCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03237&json=true","fetch_graph":"https://pith.science/api/pith-number/MDS5PWCQRUFZJTEPD4MBJ4MPD2/graph.json","fetch_events":"https://pith.science/api/pith-number/MDS5PWCQRUFZJTEPD4MBJ4MPD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MDS5PWCQRUFZJTEPD4MBJ4MPD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MDS5PWCQRUFZJTEPD4MBJ4MPD2/action/storage_attestation","attest_author":"https://pith.science/pith/MDS5PWCQRUFZJTEPD4MBJ4MPD2/action/author_attestation","sign_citation":"https://pith.science/pith/MDS5PWCQRUFZJTEPD4MBJ4MPD2/action/citation_signature","submit_replication":"https://pith.science/pith/MDS5PWCQRUFZJTEPD4MBJ4MPD2/action/replication_record"}},"created_at":"2026-05-18T00:18:56.582155+00:00","updated_at":"2026-05-18T00:18:56.582155+00:00"}