{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GG65HLCNCXX3NSXQHGDWALKCFP","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":"15e071518eee9a9b550433561b4c6d5248bcc51a57fd61b8ae2272da3372c435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T15:29:38Z","title_canon_sha256":"5d6781b8196e41305117858b976c459279fca5882bb88ddd78b986a43d9783e4"},"schema_version":"1.0","source":{"id":"2605.13668","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13668","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13668v1","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13668","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"GG65HLCNCXX3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GG65HLCNCXX3NSXQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GG65HLCN","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:56b4c6574b264f172110b5f05606e5097c1e37b82b22c4543d1bff51ede504fb","target":"graph","created_at":"2026-05-18T02:44:17Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A shared directed acyclic graph reuses intermediate results when monitoring multiple past-time LTL and MTL properties at once."}],"snapshot_sha256":"55ecf098daf80ffd34af4af9b3b6b660961c7a03355f8cfa2a18ed836c605cc6"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ar{\\i}n\\c{c} Demir, Dogan Ulus","cross_cats":[],"headline":"A shared directed acyclic graph reuses intermediate results when monitoring multiple past-time LTL and MTL properties at once.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T15:29:38Z","title":"Multi-Property Temporal Logic Monitoring"},"references":{"count":26,"internal_anchors":1,"resolved_work":26,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"The temporal logic of programs,","work_id":"da85a58b-dc14-4658-83aa-e6a0423ea269","year":1977},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Specifying real-time properties with metric temporal logic,","work_id":"2a114d8b-823a-4b23-b5d3-53dcecaaa6cc","year":1990},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Online monitoring of metric temporal logic using sequential networks,","work_id":"6473fb53-a7b6-4d02-ad92-c05f9195bc0d","year":2026},{"cited_arxiv_id":"2604.22384","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Reelay: Online Temporal Logic Monitoring Framework","work_id":"f66956cf-b3bd-445d-881e-3ee3c9a48e49","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Parsing gigabytes of JSON per second,","work_id":"f62ed5d2-136b-49e4-905d-381259b9bd05","year":2019}],"snapshot_sha256":"eafa988af1738a9c954c2dce675dc9ff2c7de0ff3c8d9b49cbfd4b2efc23ef86"},"source":{"id":"2605.13668","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:49:10.603610Z","id":"69a8a8e9-c1ca-464a-a8fa-b721a62ef4e1","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"A shared directed acyclic graph reuses intermediate results when monitoring multiple past-time LTL and MTL properties at once.","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.","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."}},"verdict_id":"69a8a8e9-c1ca-464a-a8fa-b721a62ef4e1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:37ffb85f2d80d420c2da6f6f30f42b7f25281db29c60dda151c3385384e54150","target":"record","created_at":"2026-05-18T02:44:17Z","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":"15e071518eee9a9b550433561b4c6d5248bcc51a57fd61b8ae2272da3372c435","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-13T15:29:38Z","title_canon_sha256":"5d6781b8196e41305117858b976c459279fca5882bb88ddd78b986a43d9783e4"},"schema_version":"1.0","source":{"id":"2605.13668","kind":"arxiv","version":1}},"canonical_sha256":"31bdd3ac4d15efb6caf03987602d422be481099dbc534d64f7691d3c220674f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31bdd3ac4d15efb6caf03987602d422be481099dbc534d64f7691d3c220674f6","first_computed_at":"2026-05-18T02:44:17.215177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:17.215177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G1n69Om8AlGQaJK5qyCMSkkQBaf7TkJOi9FRxkTDou9XfXe6lRe6q7cQHeUhrwmS33m4EkRTsAc8hK2AbfuIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:17.215707Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13668","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37ffb85f2d80d420c2da6f6f30f42b7f25281db29c60dda151c3385384e54150","sha256:56b4c6574b264f172110b5f05606e5097c1e37b82b22c4543d1bff51ede504fb"],"state_sha256":"0ce73e2e396dfdbe1d0a71cb762a10d098ce2f39fcc1367943551b48872fefaa"}