{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5ZZIEL2HCHH7MUQT4L2NWWPVST","short_pith_number":"pith:5ZZIEL2H","canonical_record":{"source":{"id":"1809.03101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-10T02:33:19Z","cross_cats_sorted":[],"title_canon_sha256":"e340c22bbad1aba06aa7f6ecaa9c39cb11e859437d8e98befab2acf1c6c88fee","abstract_canon_sha256":"d786f4b04328cf8606eb499d409c5b89a4484892f4d34a5a768b0e2c469c39d8"},"schema_version":"1.0"},"canonical_sha256":"ee72822f4711cff65213e2f4db59f594e26d5409c17cd938d98d531e808d4797","source":{"kind":"arxiv","id":"1809.03101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03101","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03101v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03101","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"5ZZIEL2HCHH7","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5ZZIEL2HCHH7MUQT","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5ZZIEL2H","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5ZZIEL2HCHH7MUQT4L2NWWPVST","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-10T02:33:19Z","cross_cats_sorted":[],"title_canon_sha256":"e340c22bbad1aba06aa7f6ecaa9c39cb11e859437d8e98befab2acf1c6c88fee","abstract_canon_sha256":"d786f4b04328cf8606eb499d409c5b89a4484892f4d34a5a768b0e2c469c39d8"},"schema_version":"1.0"},"canonical_sha256":"ee72822f4711cff65213e2f4db59f594e26d5409c17cd938d98d531e808d4797","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:10.022723Z","signature_b64":"BSVbhK7LZe3u1Q1lrl7WqlRxaUEEXm4WSLnGvhkn1v1+h/e1T5iCdiceRviyanSJSaZktg1g8CMttfUyQzSqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee72822f4711cff65213e2f4db59f594e26d5409c17cd938d98d531e808d4797","last_reissued_at":"2026-05-18T00:06:10.022108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:10.022108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03101","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-18T00:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bOuukgPOzzQBemmob8OfNyCx7SK/n/C+ngm04b2IYDVZ2gOjRvwQvCx36jkCG2Jgzh2xa+U44ntUU13ar4oDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:03:19.540580Z"},"content_sha256":"67ceb0376360fc828b8f82d886d8939c6e207378cd140461cdb5ab88d1575698","schema_version":"1.0","event_id":"sha256:67ceb0376360fc828b8f82d886d8939c6e207378cd140461cdb5ab88d1575698"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5ZZIEL2HCHH7MUQT4L2NWWPVST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One-Pass and Tree-Shaped Tableau Systems for TPTL and TPTLb+Past","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Angelo Montanari (University of Udine, Italy), Luca Geatti (University of Udine, Mark Reynolds (University of Western Australia), Nicola Gigante (University of Udine","submitted_at":"2018-09-10T02:33:19Z","abstract_excerpt":"In this paper, we propose a novel one-pass and tree-shaped tableau method for Timed Propositional Temporal Logic and for a bounded variant of its extension with past operators. Timed Propositional Temporal Logic (TPTL) is a real-time temporal logic, with an EXPSPACE-complete satisfiability problem, which has been successfully applied to the verification of real-time systems. In contrast to LTL, adding past operators to TPTL makes the satisfiability problem for the resulting logic  (TPTL+P) non-elementary. In this paper, we devise a one-pass and tree-shaped tableau for both TPTL and bounded TPT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03101","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-18T00:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0rEFpUbTpv6jpXXYqIoqU2rJY2nEOK240Fa4DUfEjZ/9iGhATc3Ibb05D7ITvh9FeTiVmRS7AQNqVUZvQTK6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:03:19.541122Z"},"content_sha256":"e9ca3ca156dddcd52120083dabeef54f0d80f2ff3c7c01b33a2e5f6904720496","schema_version":"1.0","event_id":"sha256:e9ca3ca156dddcd52120083dabeef54f0d80f2ff3c7c01b33a2e5f6904720496"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZZIEL2HCHH7MUQT4L2NWWPVST/bundle.json","state_url":"https://pith.science/pith/5ZZIEL2HCHH7MUQT4L2NWWPVST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZZIEL2HCHH7MUQT4L2NWWPVST/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-05T11:03:19Z","links":{"resolver":"https://pith.science/pith/5ZZIEL2HCHH7MUQT4L2NWWPVST","bundle":"https://pith.science/pith/5ZZIEL2HCHH7MUQT4L2NWWPVST/bundle.json","state":"https://pith.science/pith/5ZZIEL2HCHH7MUQT4L2NWWPVST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZZIEL2HCHH7MUQT4L2NWWPVST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5ZZIEL2HCHH7MUQT4L2NWWPVST","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":"d786f4b04328cf8606eb499d409c5b89a4484892f4d34a5a768b0e2c469c39d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-10T02:33:19Z","title_canon_sha256":"e340c22bbad1aba06aa7f6ecaa9c39cb11e859437d8e98befab2acf1c6c88fee"},"schema_version":"1.0","source":{"id":"1809.03101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03101","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03101v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03101","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"5ZZIEL2HCHH7","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5ZZIEL2HCHH7MUQT","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5ZZIEL2H","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:e9ca3ca156dddcd52120083dabeef54f0d80f2ff3c7c01b33a2e5f6904720496","target":"graph","created_at":"2026-05-18T00:06:10Z","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":"In this paper, we propose a novel one-pass and tree-shaped tableau method for Timed Propositional Temporal Logic and for a bounded variant of its extension with past operators. Timed Propositional Temporal Logic (TPTL) is a real-time temporal logic, with an EXPSPACE-complete satisfiability problem, which has been successfully applied to the verification of real-time systems. In contrast to LTL, adding past operators to TPTL makes the satisfiability problem for the resulting logic  (TPTL+P) non-elementary. In this paper, we devise a one-pass and tree-shaped tableau for both TPTL and bounded TPT","authors_text":"Angelo Montanari (University of Udine, Italy), Luca Geatti (University of Udine, Mark Reynolds (University of Western Australia), Nicola Gigante (University of Udine","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-10T02:33:19Z","title":"One-Pass and Tree-Shaped Tableau Systems for TPTL and TPTLb+Past"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03101","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:67ceb0376360fc828b8f82d886d8939c6e207378cd140461cdb5ab88d1575698","target":"record","created_at":"2026-05-18T00:06:10Z","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":"d786f4b04328cf8606eb499d409c5b89a4484892f4d34a5a768b0e2c469c39d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-10T02:33:19Z","title_canon_sha256":"e340c22bbad1aba06aa7f6ecaa9c39cb11e859437d8e98befab2acf1c6c88fee"},"schema_version":"1.0","source":{"id":"1809.03101","kind":"arxiv","version":1}},"canonical_sha256":"ee72822f4711cff65213e2f4db59f594e26d5409c17cd938d98d531e808d4797","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee72822f4711cff65213e2f4db59f594e26d5409c17cd938d98d531e808d4797","first_computed_at":"2026-05-18T00:06:10.022108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:10.022108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BSVbhK7LZe3u1Q1lrl7WqlRxaUEEXm4WSLnGvhkn1v1+h/e1T5iCdiceRviyanSJSaZktg1g8CMttfUyQzSqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:10.022723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67ceb0376360fc828b8f82d886d8939c6e207378cd140461cdb5ab88d1575698","sha256:e9ca3ca156dddcd52120083dabeef54f0d80f2ff3c7c01b33a2e5f6904720496"],"state_sha256":"d3a26b05a03acd7b31cdb6cf23f9df51c992cb5c574f4cbc5209e3310152ee88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3eT/AUt3G+mOtjRIBJjVge2qZO6ygtG4epQaBtKl5eIGQzQLqvbRsK70Js8OXo06OsQOQywkjaFsBaM3wY8EDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:03:19.543722Z","bundle_sha256":"be932c30c839606845a70a3925f1189757281416f2aff37e771b1207dcdb4448"}}