{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GG65HLCNCXX3NSXQHGDWALKCFP","short_pith_number":"pith:GG65HLCN","schema_version":"1.0","canonical_sha256":"31bdd3ac4d15efb6caf03987602d422be481099dbc534d64f7691d3c220674f6","source":{"kind":"arxiv","id":"2605.13668","version":1},"attestation_state":"computed","paper":{"title":"Multi-Property Temporal Logic Monitoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A shared directed acyclic graph reuses intermediate results when monitoring multiple past-time LTL and MTL properties at once.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ar{\\i}n\\c{c} Demir, Dogan Ulus","submitted_at":"2026-05-13T15:29:38Z","abstract_excerpt":"Runtime verification enables checking temporal logic specifications over individual execution traces and offers a scalable alternative to exhaustive formal verification. In practice, systems must satisfy dozens to hundreds of temporal properties simultaneously; however, existing approaches monitor each property in isolation, resulting in redundant computation and limited scalability. In this work, we present an online multi-property monitoring framework that compiles past-time LTL and MTL specifications into a shared directed acyclic graph of subformulas with one output per property. Unlike pr"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13668","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T15:29:38Z","cross_cats_sorted":[],"title_canon_sha256":"5d6781b8196e41305117858b976c459279fca5882bb88ddd78b986a43d9783e4","abstract_canon_sha256":"15e071518eee9a9b550433561b4c6d5248bcc51a57fd61b8ae2272da3372c435"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:17.215707Z","signature_b64":"G1n69Om8AlGQaJK5qyCMSkkQBaf7TkJOi9FRxkTDou9XfXe6lRe6q7cQHeUhrwmS33m4EkRTsAc8hK2AbfuIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31bdd3ac4d15efb6caf03987602d422be481099dbc534d64f7691d3c220674f6","last_reissued_at":"2026-05-18T02:44:17.215177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:17.215177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Property Temporal Logic Monitoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A shared directed acyclic graph reuses intermediate results when monitoring multiple past-time LTL and MTL properties at once.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ar{\\i}n\\c{c} Demir, Dogan Ulus","submitted_at":"2026-05-13T15:29:38Z","abstract_excerpt":"Runtime verification enables checking temporal logic specifications over individual execution traces and offers a scalable alternative to exhaustive formal verification. In practice, systems must satisfy dozens to hundreds of temporal properties simultaneously; however, existing approaches monitor each property in isolation, resulting in redundant computation and limited scalability. In this work, we present an online multi-property monitoring framework that compiles past-time LTL and MTL specifications into a shared directed acyclic graph of subformulas with one output per property. Unlike pr"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"our method extends compositional sequential network-based temporal logic monitor construction to a shared setting, enabling reuse of intermediate results across properties while preserving their individual structure. Experimental results demonstrate per-property throughput improvements of 2x to 4.5x and 6x to 12x in multi-property configurations compared to conventional single-property monitoring.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That specifications in practice share enough subformulas for the shared DAG to deliver meaningful reuse, and that the arena-allocated double-buffered memory layout will maintain spatial locality and low overhead across diverse hardware and property sets without hidden costs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A shared DAG-based online monitor for multiple past-time LTL and MTL properties reuses subformula results via arena-allocated double-buffered memory to achieve 2x-12x per-property throughput gains over isolated monitors.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A shared directed acyclic graph reuses intermediate results when monitoring multiple past-time LTL and MTL properties at once.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"55ecf098daf80ffd34af4af9b3b6b660961c7a03355f8cfa2a18ed836c605cc6"},"source":{"id":"2605.13668","kind":"arxiv","version":1},"verdict":{"id":"69a8a8e9-c1ca-464a-a8fa-b721a62ef4e1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:49:10.603610Z","strongest_claim":"our method extends compositional sequential network-based temporal logic monitor construction to a shared setting, enabling reuse of intermediate results across properties while preserving their individual structure. Experimental results demonstrate per-property throughput improvements of 2x to 4.5x and 6x to 12x in multi-property configurations compared to conventional single-property monitoring.","one_line_summary":"A shared DAG-based online monitor for multiple past-time LTL and MTL properties reuses subformula results via arena-allocated double-buffered memory to achieve 2x-12x per-property throughput gains over isolated monitors.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That specifications in practice share enough subformulas for the shared DAG to deliver meaningful reuse, and that the arena-allocated double-buffered memory layout will maintain spatial locality and low overhead across diverse hardware and property sets without hidden costs.","pith_extraction_headline":"A shared directed acyclic graph reuses intermediate results when monitoring multiple past-time LTL and MTL properties at once."},"references":{"count":26,"sample":[{"doi":"","year":1977,"title":"The temporal logic of programs,","work_id":"da85a58b-dc14-4658-83aa-e6a0423ea269","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1990,"title":"Specifying real-time properties with metric temporal logic,","work_id":"2a114d8b-823a-4b23-b5d3-53dcecaaa6cc","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Online monitoring of metric temporal logic using sequential networks,","work_id":"6473fb53-a7b6-4d02-ad92-c05f9195bc0d","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Reelay: Online Temporal Logic Monitoring Framework","work_id":"f66956cf-b3bd-445d-881e-3ee3c9a48e49","ref_index":4,"cited_arxiv_id":"2604.22384","is_internal_anchor":true},{"doi":"","year":2019,"title":"Parsing gigabytes of JSON per second,","work_id":"f62ed5d2-136b-49e4-905d-381259b9bd05","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":26,"snapshot_sha256":"eafa988af1738a9c954c2dce675dc9ff2c7de0ff3c8d9b49cbfd4b2efc23ef86","internal_anchors":1},"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":"2605.13668","created_at":"2026-05-18T02:44:17.215260+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13668v1","created_at":"2026-05-18T02:44:17.215260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13668","created_at":"2026-05-18T02:44:17.215260+00:00"},{"alias_kind":"pith_short_12","alias_value":"GG65HLCNCXX3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"GG65HLCNCXX3NSXQ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"GG65HLCN","created_at":"2026-05-18T12:33:37.589309+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/GG65HLCNCXX3NSXQHGDWALKCFP","json":"https://pith.science/pith/GG65HLCNCXX3NSXQHGDWALKCFP.json","graph_json":"https://pith.science/api/pith-number/GG65HLCNCXX3NSXQHGDWALKCFP/graph.json","events_json":"https://pith.science/api/pith-number/GG65HLCNCXX3NSXQHGDWALKCFP/events.json","paper":"https://pith.science/paper/GG65HLCN"},"agent_actions":{"view_html":"https://pith.science/pith/GG65HLCNCXX3NSXQHGDWALKCFP","download_json":"https://pith.science/pith/GG65HLCNCXX3NSXQHGDWALKCFP.json","view_paper":"https://pith.science/paper/GG65HLCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13668&json=true","fetch_graph":"https://pith.science/api/pith-number/GG65HLCNCXX3NSXQHGDWALKCFP/graph.json","fetch_events":"https://pith.science/api/pith-number/GG65HLCNCXX3NSXQHGDWALKCFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GG65HLCNCXX3NSXQHGDWALKCFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GG65HLCNCXX3NSXQHGDWALKCFP/action/storage_attestation","attest_author":"https://pith.science/pith/GG65HLCNCXX3NSXQHGDWALKCFP/action/author_attestation","sign_citation":"https://pith.science/pith/GG65HLCNCXX3NSXQHGDWALKCFP/action/citation_signature","submit_replication":"https://pith.science/pith/GG65HLCNCXX3NSXQHGDWALKCFP/action/replication_record"}},"created_at":"2026-05-18T02:44:17.215260+00:00","updated_at":"2026-05-18T02:44:17.215260+00:00"}