{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ACSZT5YKM4TDL5QJDP5W5QZJG7","short_pith_number":"pith:ACSZT5YK","schema_version":"1.0","canonical_sha256":"00a599f70a672635f6091bfb6ec32937da150e9d897207b2d7403af548a3ad2c","source":{"kind":"arxiv","id":"2301.10037","version":4},"attestation_state":"computed","paper":{"title":"Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (extended version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Peter M\\\"uller, Thibault Dardinier","submitted_at":"2023-01-24T14:26:02Z","abstract_excerpt":"Hoare logics are proof systems that allow one to formally establish properties of computer programs. Traditional Hoare logics prove properties of individual program executions (such as functional correctness). Hoare logic has been generalized to prove also properties of multiple executions of a program (so-called hyperproperties, such as determinism or non-interference). These program logics prove the absence of (bad combinations of) executions. On the other hand, program logics similar to Hoare logic have been proposed to disprove program properties (e.g., Incorrectness Logic), by proving the"},"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":"2301.10037","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-01-24T14:26:02Z","cross_cats_sorted":[],"title_canon_sha256":"241cd8cc2476389017320acb8d0b84dae51e8092dba81e5b9b147ad6209a6d90","abstract_canon_sha256":"50bf99214b2851f16c71d7350f49d1ec0e07e7473496b14c1bef9552ccd8e77a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:06:39.475990Z","signature_b64":"uxi23QlCfHWapuu9bpcpSIY54XkaA5pn0VIpzw9A2f02riiAF0bE22MZ9428AFS71kT9R9igD7JyvytNmYrJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00a599f70a672635f6091bfb6ec32937da150e9d897207b2d7403af548a3ad2c","last_reissued_at":"2026-07-05T08:06:39.475505Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:06:39.475505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (extended version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Peter M\\\"uller, Thibault Dardinier","submitted_at":"2023-01-24T14:26:02Z","abstract_excerpt":"Hoare logics are proof systems that allow one to formally establish properties of computer programs. Traditional Hoare logics prove properties of individual program executions (such as functional correctness). Hoare logic has been generalized to prove also properties of multiple executions of a program (so-called hyperproperties, such as determinism or non-interference). These program logics prove the absence of (bad combinations of) executions. On the other hand, program logics similar to Hoare logic have been proposed to disprove program properties (e.g., Incorrectness Logic), by proving the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10037","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.10037/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2301.10037","created_at":"2026-07-05T08:06:39.475557+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.10037v4","created_at":"2026-07-05T08:06:39.475557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10037","created_at":"2026-07-05T08:06:39.475557+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACSZT5YKM4TD","created_at":"2026-07-05T08:06:39.475557+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACSZT5YKM4TDL5QJ","created_at":"2026-07-05T08:06:39.475557+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACSZT5YK","created_at":"2026-07-05T08:06:39.475557+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.28551","citing_title":"Formalization of security","ref_index":100,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7","json":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7.json","graph_json":"https://pith.science/api/pith-number/ACSZT5YKM4TDL5QJDP5W5QZJG7/graph.json","events_json":"https://pith.science/api/pith-number/ACSZT5YKM4TDL5QJDP5W5QZJG7/events.json","paper":"https://pith.science/paper/ACSZT5YK"},"agent_actions":{"view_html":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7","download_json":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7.json","view_paper":"https://pith.science/paper/ACSZT5YK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.10037&json=true","fetch_graph":"https://pith.science/api/pith-number/ACSZT5YKM4TDL5QJDP5W5QZJG7/graph.json","fetch_events":"https://pith.science/api/pith-number/ACSZT5YKM4TDL5QJDP5W5QZJG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/action/storage_attestation","attest_author":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/action/author_attestation","sign_citation":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/action/citation_signature","submit_replication":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/action/replication_record"}},"created_at":"2026-07-05T08:06:39.475557+00:00","updated_at":"2026-07-05T08:06:39.475557+00:00"}