{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WOOEWLTPT7SL4GC2O7VJBQ33R5","short_pith_number":"pith:WOOEWLTP","canonical_record":{"source":{"id":"1304.7209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-26T15:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"4e5ebf9b5f41cc0525489d88529a938f4d4c54860f713b173c213feba9084638","abstract_canon_sha256":"c15d4b4119615644cf98bfa99b2b0aa2b3f27da2af103b3892200e4ca0201954"},"schema_version":"1.0"},"canonical_sha256":"b39c4b2e6f9fe4be185a77ea90c37b8f74a15901676a103fc88b82a96f68d15d","source":{"kind":"arxiv","id":"1304.7209","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7209","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7209v1","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7209","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"WOOEWLTPT7SL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WOOEWLTPT7SL4GC2","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WOOEWLTP","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WOOEWLTPT7SL4GC2O7VJBQ33R5","target":"record","payload":{"canonical_record":{"source":{"id":"1304.7209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-26T15:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"4e5ebf9b5f41cc0525489d88529a938f4d4c54860f713b173c213feba9084638","abstract_canon_sha256":"c15d4b4119615644cf98bfa99b2b0aa2b3f27da2af103b3892200e4ca0201954"},"schema_version":"1.0"},"canonical_sha256":"b39c4b2e6f9fe4be185a77ea90c37b8f74a15901676a103fc88b82a96f68d15d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.297898Z","signature_b64":"7BB6IPNzor527wG1E1Xgtm8RqYGwzbOrA53XWHf5fsVRH9YKZ6yYFvIqFjWPUXP0xsJ0JcYD0VWitet716d1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b39c4b2e6f9fe4be185a77ea90c37b8f74a15901676a103fc88b82a96f68d15d","last_reissued_at":"2026-05-18T03:27:02.297233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.297233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.7209","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-18T03:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSGfEfa69Mn5Le93JwK/CjTPu/HtwLBab7FhSoxonAyyzPcIccxZxnwY3xBotcKyabpwlIL8aMhMkbuRqm6YBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:15:43.795918Z"},"content_sha256":"f261078ec2ce7a44feab91f4c976ff9db38e77a32794d9748aad9fcf5324a961","schema_version":"1.0","event_id":"sha256:f261078ec2ce7a44feab91f4c976ff9db38e77a32794d9748aad9fcf5324a961"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WOOEWLTPT7SL4GC2O7VJBQ33R5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded Model Checking of an MITL Fragment for Timed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ilkka Niemel\\\"a, Roland Kindermann, Tommi Junttila","submitted_at":"2013-04-26T15:52:38Z","abstract_excerpt":"Timed automata (TAs) are a common formalism for modeling timed systems. Bounded model checking (BMC) is a verification method that searches for runs violating a property using a SAT or SMT solver. MITL is a real-time extension of the linear time logic LTL. Originally, MITL was defined for traces of non-overlapping time intervals rather than the \"super-dense\" time traces allowing for intervals overlapping in single points that are employed by the nowadays common semantics of timed automata. In this paper we extend the semantics of a fragment of MITL to super-dense time traces and devise a bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7209","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-18T03:27:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1f1jkZuH0fecXthuhunWWovGawhs0LfSE4C4N4qu9dcRnM+sdNyzHVsFBSIlXrKXn5XFeLbFCGtU/c1XowJ7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:15:43.796397Z"},"content_sha256":"0f27d438591e3ea7c592514cb439468674f88cfb699d2583cfaaaa1697f46ccc","schema_version":"1.0","event_id":"sha256:0f27d438591e3ea7c592514cb439468674f88cfb699d2583cfaaaa1697f46ccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/bundle.json","state_url":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/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-06-24T06:15:43Z","links":{"resolver":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5","bundle":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/bundle.json","state":"https://pith.science/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOOEWLTPT7SL4GC2O7VJBQ33R5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WOOEWLTPT7SL4GC2O7VJBQ33R5","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":"c15d4b4119615644cf98bfa99b2b0aa2b3f27da2af103b3892200e4ca0201954","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-26T15:52:38Z","title_canon_sha256":"4e5ebf9b5f41cc0525489d88529a938f4d4c54860f713b173c213feba9084638"},"schema_version":"1.0","source":{"id":"1304.7209","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7209","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7209v1","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7209","created_at":"2026-05-18T03:27:02Z"},{"alias_kind":"pith_short_12","alias_value":"WOOEWLTPT7SL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WOOEWLTPT7SL4GC2","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WOOEWLTP","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:0f27d438591e3ea7c592514cb439468674f88cfb699d2583cfaaaa1697f46ccc","target":"graph","created_at":"2026-05-18T03:27:02Z","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":"Timed automata (TAs) are a common formalism for modeling timed systems. Bounded model checking (BMC) is a verification method that searches for runs violating a property using a SAT or SMT solver. MITL is a real-time extension of the linear time logic LTL. Originally, MITL was defined for traces of non-overlapping time intervals rather than the \"super-dense\" time traces allowing for intervals overlapping in single points that are employed by the nowadays common semantics of timed automata. In this paper we extend the semantics of a fragment of MITL to super-dense time traces and devise a bound","authors_text":"Ilkka Niemel\\\"a, Roland Kindermann, Tommi Junttila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-26T15:52:38Z","title":"Bounded Model Checking of an MITL Fragment for Timed Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7209","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:f261078ec2ce7a44feab91f4c976ff9db38e77a32794d9748aad9fcf5324a961","target":"record","created_at":"2026-05-18T03:27:02Z","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":"c15d4b4119615644cf98bfa99b2b0aa2b3f27da2af103b3892200e4ca0201954","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-26T15:52:38Z","title_canon_sha256":"4e5ebf9b5f41cc0525489d88529a938f4d4c54860f713b173c213feba9084638"},"schema_version":"1.0","source":{"id":"1304.7209","kind":"arxiv","version":1}},"canonical_sha256":"b39c4b2e6f9fe4be185a77ea90c37b8f74a15901676a103fc88b82a96f68d15d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b39c4b2e6f9fe4be185a77ea90c37b8f74a15901676a103fc88b82a96f68d15d","first_computed_at":"2026-05-18T03:27:02.297233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:02.297233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7BB6IPNzor527wG1E1Xgtm8RqYGwzbOrA53XWHf5fsVRH9YKZ6yYFvIqFjWPUXP0xsJ0JcYD0VWitet716d1Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:02.297898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7209","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f261078ec2ce7a44feab91f4c976ff9db38e77a32794d9748aad9fcf5324a961","sha256:0f27d438591e3ea7c592514cb439468674f88cfb699d2583cfaaaa1697f46ccc"],"state_sha256":"066fc46aad6ee8cd9d1a703f80ec98cf58aed7829601dec595ecb1f278e779ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7v41++f3tLVTGstZ6U3uIjotapdhkaBaxiWCoSCuUXEUZwZBNZUf/Kd53Hnd+icoo1CwSaOPuSmjeGvn8iJeBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:15:43.798934Z","bundle_sha256":"61be58d9ee1825d3d7eb2b46d3e0777d876d5d8930ff9ad02660242532547a62"}}