{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FUWCNAYC4WMDRUCG2W2RQRG6EF","short_pith_number":"pith:FUWCNAYC","canonical_record":{"source":{"id":"1410.7551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-28T08:38:46Z","cross_cats_sorted":[],"title_canon_sha256":"2888560b99cbb9e1aca82f3840ec0b64b93c450ce3f5dedcfa789a9f29d41822","abstract_canon_sha256":"807a14ada54df89114cc65c8b6b47dfb634be035617a54c1d7d6bb5daf30a5ce"},"schema_version":"1.0"},"canonical_sha256":"2d2c268302e59838d046d5b51844de2179c0f56a086666a7debfe7b98952e2f1","source":{"kind":"arxiv","id":"1410.7551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7551","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7551v1","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7551","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"FUWCNAYC4WMD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FUWCNAYC4WMDRUCG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FUWCNAYC","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FUWCNAYC4WMDRUCG2W2RQRG6EF","target":"record","payload":{"canonical_record":{"source":{"id":"1410.7551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-28T08:38:46Z","cross_cats_sorted":[],"title_canon_sha256":"2888560b99cbb9e1aca82f3840ec0b64b93c450ce3f5dedcfa789a9f29d41822","abstract_canon_sha256":"807a14ada54df89114cc65c8b6b47dfb634be035617a54c1d7d6bb5daf30a5ce"},"schema_version":"1.0"},"canonical_sha256":"2d2c268302e59838d046d5b51844de2179c0f56a086666a7debfe7b98952e2f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:10.052490Z","signature_b64":"nlIIar44em/NBcjln2dmJ/tDDjfJ0QraCrnP59gS1CrfpyjGdNBBjm4FFvYptEcRb+NBvkNMaELoK8+tGfXLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d2c268302e59838d046d5b51844de2179c0f56a086666a7debfe7b98952e2f1","last_reissued_at":"2026-05-18T02:39:10.051786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:10.051786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.7551","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-18T02:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zYhgYJWc8hQV+17l6xXtb/+L/gfaTn/pTC3mYpQQnb+n4Ng0bVWtD6yY9C19ui+w84OR3KGJdN4uGfWkOH6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:27:28.526612Z"},"content_sha256":"665e0cb2871a54bab03a957308681413cc334319682932e07cdd96cddcbed4b8","schema_version":"1.0","event_id":"sha256:665e0cb2871a54bab03a957308681413cc334319682932e07cdd96cddcbed4b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FUWCNAYC4WMDRUCG2W2RQRG6EF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Satisfiability and Model Checking of CTL* with Graded Path Modalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Aniello Murano, Benjamin Aminof, Sasha Rubin","submitted_at":"2014-10-28T08:38:46Z","abstract_excerpt":"Graded path modalities count the number of paths satisfying a property, and generalize the existential (E) and universal (A) path modalities of CTL*. The resulting logic is called GCTL*. We settle the complexity of satisfiability of GCTL*, i.e., 2ExpTime-Complete, and the complexity of the model checking problem for GCTL*, i.e., PSpace-Complete. The lower bounds already hold for CTL*, and so, using the automata-theoretic approach we supply the upper bounds. The significance of this work is two-fold: GCTL* is more expressive than CTL* at no extra cost in computational complexity, and GCTL* has "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7551","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-18T02:39:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E165rgJfEGR+NYM9kReeRQf6INmj4mu4XveD/iBMp/p4peeNoBDT+ZzdQtm+q7OPiG8v7hfzjGrHuvGP1z7vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:27:28.527391Z"},"content_sha256":"b8d52557429b501b2d87fc7000eeb0d89bcfbba7b3c9461aed3152c80fafcce5","schema_version":"1.0","event_id":"sha256:b8d52557429b501b2d87fc7000eeb0d89bcfbba7b3c9461aed3152c80fafcce5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUWCNAYC4WMDRUCG2W2RQRG6EF/bundle.json","state_url":"https://pith.science/pith/FUWCNAYC4WMDRUCG2W2RQRG6EF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUWCNAYC4WMDRUCG2W2RQRG6EF/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-01T01:27:28Z","links":{"resolver":"https://pith.science/pith/FUWCNAYC4WMDRUCG2W2RQRG6EF","bundle":"https://pith.science/pith/FUWCNAYC4WMDRUCG2W2RQRG6EF/bundle.json","state":"https://pith.science/pith/FUWCNAYC4WMDRUCG2W2RQRG6EF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUWCNAYC4WMDRUCG2W2RQRG6EF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FUWCNAYC4WMDRUCG2W2RQRG6EF","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":"807a14ada54df89114cc65c8b6b47dfb634be035617a54c1d7d6bb5daf30a5ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-28T08:38:46Z","title_canon_sha256":"2888560b99cbb9e1aca82f3840ec0b64b93c450ce3f5dedcfa789a9f29d41822"},"schema_version":"1.0","source":{"id":"1410.7551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7551","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7551v1","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7551","created_at":"2026-05-18T02:39:10Z"},{"alias_kind":"pith_short_12","alias_value":"FUWCNAYC4WMD","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FUWCNAYC4WMDRUCG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FUWCNAYC","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:b8d52557429b501b2d87fc7000eeb0d89bcfbba7b3c9461aed3152c80fafcce5","target":"graph","created_at":"2026-05-18T02:39: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":"Graded path modalities count the number of paths satisfying a property, and generalize the existential (E) and universal (A) path modalities of CTL*. The resulting logic is called GCTL*. We settle the complexity of satisfiability of GCTL*, i.e., 2ExpTime-Complete, and the complexity of the model checking problem for GCTL*, i.e., PSpace-Complete. The lower bounds already hold for CTL*, and so, using the automata-theoretic approach we supply the upper bounds. The significance of this work is two-fold: GCTL* is more expressive than CTL* at no extra cost in computational complexity, and GCTL* has ","authors_text":"Aniello Murano, Benjamin Aminof, Sasha Rubin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-28T08:38:46Z","title":"Satisfiability and Model Checking of CTL* with Graded Path Modalities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7551","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:665e0cb2871a54bab03a957308681413cc334319682932e07cdd96cddcbed4b8","target":"record","created_at":"2026-05-18T02:39: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":"807a14ada54df89114cc65c8b6b47dfb634be035617a54c1d7d6bb5daf30a5ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-28T08:38:46Z","title_canon_sha256":"2888560b99cbb9e1aca82f3840ec0b64b93c450ce3f5dedcfa789a9f29d41822"},"schema_version":"1.0","source":{"id":"1410.7551","kind":"arxiv","version":1}},"canonical_sha256":"2d2c268302e59838d046d5b51844de2179c0f56a086666a7debfe7b98952e2f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d2c268302e59838d046d5b51844de2179c0f56a086666a7debfe7b98952e2f1","first_computed_at":"2026-05-18T02:39:10.051786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:10.051786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nlIIar44em/NBcjln2dmJ/tDDjfJ0QraCrnP59gS1CrfpyjGdNBBjm4FFvYptEcRb+NBvkNMaELoK8+tGfXLCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:10.052490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:665e0cb2871a54bab03a957308681413cc334319682932e07cdd96cddcbed4b8","sha256:b8d52557429b501b2d87fc7000eeb0d89bcfbba7b3c9461aed3152c80fafcce5"],"state_sha256":"4c487da18c51286ea1d30b51cca510144b147eb50816c7ef75b6824f6067b98d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cR2MaYCzkXBtEMEI2s3k5Bzts6lIJCv44PouXWyoV4q6UXNhod1DmQnSOXTwgoCX7rzYNAlSDF+sz+T63W1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:27:28.531434Z","bundle_sha256":"f21002bf6829d414a37a64d62fdd0dd3ab6c13185d9628f568aad409f1b809c3"}}