{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4FRAEU7FGMQMR2TMFQEIPNSWWN","short_pith_number":"pith:4FRAEU7F","schema_version":"1.0","canonical_sha256":"e1620253e53320c8ea6c2c0887b656b35037ca6ba067dda8f76519468df69707","source":{"kind":"arxiv","id":"1307.4468","version":1},"attestation_state":"computed","paper":{"title":"A Faster Tableau for CTL*","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mark Reynolds (The University of Western Australia)","submitted_at":"2013-07-17T01:41:36Z","abstract_excerpt":"There have been several recent suggestions for tableau systems for deciding satisfiability in the practically important branching time temporal logic known as CTL*. In this paper we present a streamlined and more traditional tableau approach built upon the author's earlier theoretical work.\n  Soundness and completeness results are proved. A prototype implementation demonstrates the significantly improved performance of the new approach on a range of test formulas. We also see that it compares favourably  to state of the art, game and automata based decision procedures."},"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":"1307.4468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-07-17T01:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"f27b1107f3be3cab40ddddea2f767094f4dc0d5184c41ba0214ead2b4383daa4","abstract_canon_sha256":"3a4dd928bbbe03a72259faa798c8e7ea739d7c82ed87561218fc84819c65abe6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:17.891934Z","signature_b64":"400/OhnGVdoT5Poh0LWy9crSAhKubv5m/3FS29kOL0EQ6WcHgmky4cZcSazUwbLeR09b2A7wYh0Qb36/6vaSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1620253e53320c8ea6c2c0887b656b35037ca6ba067dda8f76519468df69707","last_reissued_at":"2026-05-18T03:18:17.891520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:17.891520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Tableau for CTL*","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mark Reynolds (The University of Western Australia)","submitted_at":"2013-07-17T01:41:36Z","abstract_excerpt":"There have been several recent suggestions for tableau systems for deciding satisfiability in the practically important branching time temporal logic known as CTL*. In this paper we present a streamlined and more traditional tableau approach built upon the author's earlier theoretical work.\n  Soundness and completeness results are proved. A prototype implementation demonstrates the significantly improved performance of the new approach on a range of test formulas. We also see that it compares favourably  to state of the art, game and automata based decision procedures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4468","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":"1307.4468","created_at":"2026-05-18T03:18:17.891577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4468v1","created_at":"2026-05-18T03:18:17.891577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4468","created_at":"2026-05-18T03:18:17.891577+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FRAEU7FGMQM","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FRAEU7FGMQMR2TM","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FRAEU7F","created_at":"2026-05-18T12:27:34.582898+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/4FRAEU7FGMQMR2TMFQEIPNSWWN","json":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN.json","graph_json":"https://pith.science/api/pith-number/4FRAEU7FGMQMR2TMFQEIPNSWWN/graph.json","events_json":"https://pith.science/api/pith-number/4FRAEU7FGMQMR2TMFQEIPNSWWN/events.json","paper":"https://pith.science/paper/4FRAEU7F"},"agent_actions":{"view_html":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN","download_json":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN.json","view_paper":"https://pith.science/paper/4FRAEU7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4468&json=true","fetch_graph":"https://pith.science/api/pith-number/4FRAEU7FGMQMR2TMFQEIPNSWWN/graph.json","fetch_events":"https://pith.science/api/pith-number/4FRAEU7FGMQMR2TMFQEIPNSWWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/action/storage_attestation","attest_author":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/action/author_attestation","sign_citation":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/action/citation_signature","submit_replication":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/action/replication_record"}},"created_at":"2026-05-18T03:18:17.891577+00:00","updated_at":"2026-05-18T03:18:17.891577+00:00"}