{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7XLTADOZ4W5R2POGFDYFZJY3O3","short_pith_number":"pith:7XLTADOZ","schema_version":"1.0","canonical_sha256":"fdd7300dd9e5bb1d3dc628f05ca71b76c330747ce52934282a145c603e5b4612","source":{"kind":"arxiv","id":"1401.4492","version":2},"attestation_state":"computed","paper":{"title":"Temporal Logics for Hyperproperties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bernd Finkbeiner, C\\'esar S\\'anchez, Kristopher K. Micinski, Markus N. Rabe, Masoud Koleini, Michael R. Clarkson","submitted_at":"2014-01-17T23:38:50Z","abstract_excerpt":"Two new logics for verification of hyperproperties are proposed. Hyperproperties characterize security policies, such as noninterference, as a property of sets of computation paths. Standard temporal logics such as LTL, CTL, and CTL* can refer only to a single path at a time, hence cannot express many hyperproperties of interest. The logics proposed here, HyperLTL and HyperCTL*, add explicit and simultaneous quantification over multiple paths to LTL and to CTL*. This kind of quantification enables expression of hyperproperties. A model checking algorithm for the proposed logics is given. For a"},"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":"1401.4492","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-17T23:38:50Z","cross_cats_sorted":[],"title_canon_sha256":"16b3f7760bf4f18178f830a40e085673efe9a9cb46cf4b023fa31ea570cd1ee6","abstract_canon_sha256":"129da982861932b8c72b59e80d0e66f7b7e39d86d203d4762cce44e1c7af43da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:34.988229Z","signature_b64":"wnwIIyp4ykUYnsgXoNxHlMQN9OQK+FDszQzkSeHYV9l+cSPtKTm2aiK6hQXonxDrjeOkao+LYdaBTbB45aRlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdd7300dd9e5bb1d3dc628f05ca71b76c330747ce52934282a145c603e5b4612","last_reissued_at":"2026-05-18T03:01:34.987792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:34.987792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Logics for Hyperproperties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bernd Finkbeiner, C\\'esar S\\'anchez, Kristopher K. Micinski, Markus N. Rabe, Masoud Koleini, Michael R. Clarkson","submitted_at":"2014-01-17T23:38:50Z","abstract_excerpt":"Two new logics for verification of hyperproperties are proposed. Hyperproperties characterize security policies, such as noninterference, as a property of sets of computation paths. Standard temporal logics such as LTL, CTL, and CTL* can refer only to a single path at a time, hence cannot express many hyperproperties of interest. The logics proposed here, HyperLTL and HyperCTL*, add explicit and simultaneous quantification over multiple paths to LTL and to CTL*. This kind of quantification enables expression of hyperproperties. A model checking algorithm for the proposed logics is given. For a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4492","kind":"arxiv","version":2},"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":"1401.4492","created_at":"2026-05-18T03:01:34.987866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4492v2","created_at":"2026-05-18T03:01:34.987866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4492","created_at":"2026-05-18T03:01:34.987866+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XLTADOZ4W5R","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XLTADOZ4W5R2POG","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XLTADOZ","created_at":"2026-05-18T12:28:19.803747+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/7XLTADOZ4W5R2POGFDYFZJY3O3","json":"https://pith.science/pith/7XLTADOZ4W5R2POGFDYFZJY3O3.json","graph_json":"https://pith.science/api/pith-number/7XLTADOZ4W5R2POGFDYFZJY3O3/graph.json","events_json":"https://pith.science/api/pith-number/7XLTADOZ4W5R2POGFDYFZJY3O3/events.json","paper":"https://pith.science/paper/7XLTADOZ"},"agent_actions":{"view_html":"https://pith.science/pith/7XLTADOZ4W5R2POGFDYFZJY3O3","download_json":"https://pith.science/pith/7XLTADOZ4W5R2POGFDYFZJY3O3.json","view_paper":"https://pith.science/paper/7XLTADOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4492&json=true","fetch_graph":"https://pith.science/api/pith-number/7XLTADOZ4W5R2POGFDYFZJY3O3/graph.json","fetch_events":"https://pith.science/api/pith-number/7XLTADOZ4W5R2POGFDYFZJY3O3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XLTADOZ4W5R2POGFDYFZJY3O3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XLTADOZ4W5R2POGFDYFZJY3O3/action/storage_attestation","attest_author":"https://pith.science/pith/7XLTADOZ4W5R2POGFDYFZJY3O3/action/author_attestation","sign_citation":"https://pith.science/pith/7XLTADOZ4W5R2POGFDYFZJY3O3/action/citation_signature","submit_replication":"https://pith.science/pith/7XLTADOZ4W5R2POGFDYFZJY3O3/action/replication_record"}},"created_at":"2026-05-18T03:01:34.987866+00:00","updated_at":"2026-05-18T03:01:34.987866+00:00"}