{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XKJBVHHAWXIMXZGTCTWKUJSLRQ","short_pith_number":"pith:XKJBVHHA","schema_version":"1.0","canonical_sha256":"ba921a9ce0b5d0cbe4d314ecaa264b8c0a7c07a04e9c72364698d0ccb796d943","source":{"kind":"arxiv","id":"1610.04388","version":2},"attestation_state":"computed","paper":{"title":"The First-Order Logic of Hyperproperties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.LO"],"primary_cat":"cs.LO","authors_text":"Bernd Finkbeiner, Martin Zimmermann","submitted_at":"2016-10-14T10:07:47Z","abstract_excerpt":"We investigate the logical foundations of hyperproperties. Hyperproperties generalize trace properties, which are sets of traces, to sets of sets of traces. The most prominent application of hyperproperties is information flow security: information flow policies characterize the secrecy and integrity of a system by comparing two or more execution traces, for example by comparing the observations made by an external observer on execution traces that result from different values of a secret variable. In this paper, we establish the first connection between temporal logics for hyperproperties and"},"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":"1610.04388","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-10-14T10:07:47Z","cross_cats_sorted":["cs.CR","math.LO"],"title_canon_sha256":"15f36bb04d25dffe646f76211f64a04ebfe048be2623e7577f8f46477eb6e492","abstract_canon_sha256":"80a1be62fdb9f6968f085f6eed0464277de631fa94c6921428de0549d5d472ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:12.051568Z","signature_b64":"61hUyHZP9CqyIe8rDkDQ9t9j6hCdLR9JQtyqqPNT9KxWC8cSBLTLgEg9Sk7pe3Op6uoV0lsSBxYKBi4/akxwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba921a9ce0b5d0cbe4d314ecaa264b8c0a7c07a04e9c72364698d0ccb796d943","last_reissued_at":"2026-05-18T00:53:12.051114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:12.051114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The First-Order Logic of Hyperproperties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.LO"],"primary_cat":"cs.LO","authors_text":"Bernd Finkbeiner, Martin Zimmermann","submitted_at":"2016-10-14T10:07:47Z","abstract_excerpt":"We investigate the logical foundations of hyperproperties. Hyperproperties generalize trace properties, which are sets of traces, to sets of sets of traces. The most prominent application of hyperproperties is information flow security: information flow policies characterize the secrecy and integrity of a system by comparing two or more execution traces, for example by comparing the observations made by an external observer on execution traces that result from different values of a secret variable. In this paper, we establish the first connection between temporal logics for hyperproperties and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04388","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":"1610.04388","created_at":"2026-05-18T00:53:12.051185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04388v2","created_at":"2026-05-18T00:53:12.051185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04388","created_at":"2026-05-18T00:53:12.051185+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKJBVHHAWXIM","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKJBVHHAWXIMXZGT","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKJBVHHA","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.28429","citing_title":"An Algebraic Framework for Quantitative Semantics of Spatio-Temporal Logic with Graph Operators","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XKJBVHHAWXIMXZGTCTWKUJSLRQ","json":"https://pith.science/pith/XKJBVHHAWXIMXZGTCTWKUJSLRQ.json","graph_json":"https://pith.science/api/pith-number/XKJBVHHAWXIMXZGTCTWKUJSLRQ/graph.json","events_json":"https://pith.science/api/pith-number/XKJBVHHAWXIMXZGTCTWKUJSLRQ/events.json","paper":"https://pith.science/paper/XKJBVHHA"},"agent_actions":{"view_html":"https://pith.science/pith/XKJBVHHAWXIMXZGTCTWKUJSLRQ","download_json":"https://pith.science/pith/XKJBVHHAWXIMXZGTCTWKUJSLRQ.json","view_paper":"https://pith.science/paper/XKJBVHHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04388&json=true","fetch_graph":"https://pith.science/api/pith-number/XKJBVHHAWXIMXZGTCTWKUJSLRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XKJBVHHAWXIMXZGTCTWKUJSLRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKJBVHHAWXIMXZGTCTWKUJSLRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKJBVHHAWXIMXZGTCTWKUJSLRQ/action/storage_attestation","attest_author":"https://pith.science/pith/XKJBVHHAWXIMXZGTCTWKUJSLRQ/action/author_attestation","sign_citation":"https://pith.science/pith/XKJBVHHAWXIMXZGTCTWKUJSLRQ/action/citation_signature","submit_replication":"https://pith.science/pith/XKJBVHHAWXIMXZGTCTWKUJSLRQ/action/replication_record"}},"created_at":"2026-05-18T00:53:12.051185+00:00","updated_at":"2026-05-18T00:53:12.051185+00:00"}