{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QLYIRHZ2YS7U3BHVW2J3XDDDN2","short_pith_number":"pith:QLYIRHZ2","schema_version":"1.0","canonical_sha256":"82f0889f3ac4bf4d84f5b693bb8c636e946327bb879dd105a02bbc2a04b35691","source":{"kind":"arxiv","id":"1306.5678","version":2},"attestation_state":"computed","paper":{"title":"A Temporal Logic of Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LO","authors_text":"Kristopher K. Micinski, Masoud Koleini, Michael R. Clarkson","submitted_at":"2013-06-24T17:17:29Z","abstract_excerpt":"A new logic for verification of security policies is proposed. The logic, HyperLTL, extends linear-time temporal logic (LTL) with connectives for explicit and simultaneous quantification over multiple execution paths, thereby enabling HyperLTL to express information-flow security policies that LTL cannot. A model-checking algorithm for a fragment of HyperLTL is given, and the algorithm is implemented in a prototype model checker. The class of security policies expressible in HyperLTL is characterized by an arithmetic hierarchy of hyperproperties."},"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":"1306.5678","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-06-24T17:17:29Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"496cd89773a25a96ded614874c5e2082e57e3d08fc9ab45ce6d426ee3308b4d6","abstract_canon_sha256":"35984e39440922f717f79b487fe55bdd13fa9acdedfb3c6ce3784c32823c053b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:00.890975Z","signature_b64":"lRZFEvwrgwU5n/oyeUaEVy3TCcOCwxUMZcPpH/0nn59GoP+Je8+AnYhQG75VPdHbe/1MQWVZwmxHO0cmeUsWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82f0889f3ac4bf4d84f5b693bb8c636e946327bb879dd105a02bbc2a04b35691","last_reissued_at":"2026-05-18T03:19:00.890359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:00.890359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Temporal Logic of Security","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.LO","authors_text":"Kristopher K. Micinski, Masoud Koleini, Michael R. Clarkson","submitted_at":"2013-06-24T17:17:29Z","abstract_excerpt":"A new logic for verification of security policies is proposed. The logic, HyperLTL, extends linear-time temporal logic (LTL) with connectives for explicit and simultaneous quantification over multiple execution paths, thereby enabling HyperLTL to express information-flow security policies that LTL cannot. A model-checking algorithm for a fragment of HyperLTL is given, and the algorithm is implemented in a prototype model checker. The class of security policies expressible in HyperLTL is characterized by an arithmetic hierarchy of hyperproperties."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5678","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":"1306.5678","created_at":"2026-05-18T03:19:00.890437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5678v2","created_at":"2026-05-18T03:19:00.890437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5678","created_at":"2026-05-18T03:19:00.890437+00:00"},{"alias_kind":"pith_short_12","alias_value":"QLYIRHZ2YS7U","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QLYIRHZ2YS7U3BHV","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QLYIRHZ2","created_at":"2026-05-18T12:27:57.521954+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/QLYIRHZ2YS7U3BHVW2J3XDDDN2","json":"https://pith.science/pith/QLYIRHZ2YS7U3BHVW2J3XDDDN2.json","graph_json":"https://pith.science/api/pith-number/QLYIRHZ2YS7U3BHVW2J3XDDDN2/graph.json","events_json":"https://pith.science/api/pith-number/QLYIRHZ2YS7U3BHVW2J3XDDDN2/events.json","paper":"https://pith.science/paper/QLYIRHZ2"},"agent_actions":{"view_html":"https://pith.science/pith/QLYIRHZ2YS7U3BHVW2J3XDDDN2","download_json":"https://pith.science/pith/QLYIRHZ2YS7U3BHVW2J3XDDDN2.json","view_paper":"https://pith.science/paper/QLYIRHZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5678&json=true","fetch_graph":"https://pith.science/api/pith-number/QLYIRHZ2YS7U3BHVW2J3XDDDN2/graph.json","fetch_events":"https://pith.science/api/pith-number/QLYIRHZ2YS7U3BHVW2J3XDDDN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QLYIRHZ2YS7U3BHVW2J3XDDDN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QLYIRHZ2YS7U3BHVW2J3XDDDN2/action/storage_attestation","attest_author":"https://pith.science/pith/QLYIRHZ2YS7U3BHVW2J3XDDDN2/action/author_attestation","sign_citation":"https://pith.science/pith/QLYIRHZ2YS7U3BHVW2J3XDDDN2/action/citation_signature","submit_replication":"https://pith.science/pith/QLYIRHZ2YS7U3BHVW2J3XDDDN2/action/replication_record"}},"created_at":"2026-05-18T03:19:00.890437+00:00","updated_at":"2026-05-18T03:19:00.890437+00:00"}