{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4FRAEU7FGMQMR2TMFQEIPNSWWN","short_pith_number":"pith:4FRAEU7F","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"},"canonical_sha256":"e1620253e53320c8ea6c2c0887b656b35037ca6ba067dda8f76519468df69707","source":{"kind":"arxiv","id":"1307.4468","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4468","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4468v1","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4468","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"pith_short_12","alias_value":"4FRAEU7FGMQM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4FRAEU7FGMQMR2TM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4FRAEU7F","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4FRAEU7FGMQMR2TMFQEIPNSWWN","target":"record","payload":{"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"},"canonical_sha256":"e1620253e53320c8ea6c2c0887b656b35037ca6ba067dda8f76519468df69707","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"},"source_kind":"arxiv","source_id":"1307.4468","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:18:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0a4e75bssBwaeVVtr8p9lb8RPJDeymqza2HDMcH64kY8J2sfFK0OmeyRiqiEB8RhkwDpKL97eVzXloWfPASEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:32:10.922807Z"},"content_sha256":"f96b62b770751056c46b87818c8fc4de8f4588cc3a0fd4f8c48dc9662a1a61c6","schema_version":"1.0","event_id":"sha256:f96b62b770751056c46b87818c8fc4de8f4588cc3a0fd4f8c48dc9662a1a61c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4FRAEU7FGMQMR2TMFQEIPNSWWN","target":"graph","payload":{"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"},"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:18:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SIa2xIf7uot3lVXd03cije8PZ9YovpX580qLO/CCq+KUkwK7yEZR+cP5pY2Ha3TCPijz7N8SIua/Lo8eR2XkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:32:10.923162Z"},"content_sha256":"f72c0eb64debdaf0b91ebee61cb1dae597d4ae389c0ec5d334d2a37fa2a47544","schema_version":"1.0","event_id":"sha256:f72c0eb64debdaf0b91ebee61cb1dae597d4ae389c0ec5d334d2a37fa2a47544"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/bundle.json","state_url":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/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-26T14:32:10Z","links":{"resolver":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN","bundle":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/bundle.json","state":"https://pith.science/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4FRAEU7FGMQMR2TMFQEIPNSWWN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4FRAEU7FGMQMR2TMFQEIPNSWWN","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":"3a4dd928bbbe03a72259faa798c8e7ea739d7c82ed87561218fc84819c65abe6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-07-17T01:41:36Z","title_canon_sha256":"f27b1107f3be3cab40ddddea2f767094f4dc0d5184c41ba0214ead2b4383daa4"},"schema_version":"1.0","source":{"id":"1307.4468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4468","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4468v1","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4468","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"pith_short_12","alias_value":"4FRAEU7FGMQM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4FRAEU7FGMQMR2TM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4FRAEU7F","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:f72c0eb64debdaf0b91ebee61cb1dae597d4ae389c0ec5d334d2a37fa2a47544","target":"graph","created_at":"2026-05-18T03:18: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Mark Reynolds (The University of Western Australia)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-07-17T01:41:36Z","title":"A Faster Tableau for CTL*"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4468","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:f96b62b770751056c46b87818c8fc4de8f4588cc3a0fd4f8c48dc9662a1a61c6","target":"record","created_at":"2026-05-18T03:18: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":"3a4dd928bbbe03a72259faa798c8e7ea739d7c82ed87561218fc84819c65abe6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-07-17T01:41:36Z","title_canon_sha256":"f27b1107f3be3cab40ddddea2f767094f4dc0d5184c41ba0214ead2b4383daa4"},"schema_version":"1.0","source":{"id":"1307.4468","kind":"arxiv","version":1}},"canonical_sha256":"e1620253e53320c8ea6c2c0887b656b35037ca6ba067dda8f76519468df69707","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1620253e53320c8ea6c2c0887b656b35037ca6ba067dda8f76519468df69707","first_computed_at":"2026-05-18T03:18:17.891520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:17.891520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"400/OhnGVdoT5Poh0LWy9crSAhKubv5m/3FS29kOL0EQ6WcHgmky4cZcSazUwbLeR09b2A7wYh0Qb36/6vaSCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:17.891934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f96b62b770751056c46b87818c8fc4de8f4588cc3a0fd4f8c48dc9662a1a61c6","sha256:f72c0eb64debdaf0b91ebee61cb1dae597d4ae389c0ec5d334d2a37fa2a47544"],"state_sha256":"8ee0ed2855d1eff95820593d2831ad0e3b2b32f394d4ce559002de997f41206f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHWhSWaemtXNuvffsIojlYthVFexGAGugDYwcQCeDIhpRX4envCuIk/VEvE5jqzvP4Iu11E8n5BcGzZdAnDcBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:32:10.925436Z","bundle_sha256":"b880fa0988bfaa6902feb25a44b7e6d694c5c8c15176187eaa1ae2ffb7caaae7"}}