{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ACSZT5YKM4TDL5QJDP5W5QZJG7","short_pith_number":"pith:ACSZT5YK","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"},"canonical_sha256":"00a599f70a672635f6091bfb6ec32937da150e9d897207b2d7403af548a3ad2c","source":{"kind":"arxiv","id":"2301.10037","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10037","created_at":"2026-07-05T08:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10037v4","created_at":"2026-07-05T08:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10037","created_at":"2026-07-05T08:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"ACSZT5YKM4TD","created_at":"2026-07-05T08:06:39Z"},{"alias_kind":"pith_short_16","alias_value":"ACSZT5YKM4TDL5QJ","created_at":"2026-07-05T08:06:39Z"},{"alias_kind":"pith_short_8","alias_value":"ACSZT5YK","created_at":"2026-07-05T08:06:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ACSZT5YKM4TDL5QJDP5W5QZJG7","target":"record","payload":{"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"},"canonical_sha256":"00a599f70a672635f6091bfb6ec32937da150e9d897207b2d7403af548a3ad2c","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"},"source_kind":"arxiv","source_id":"2301.10037","source_version":4,"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-07-05T08:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4AB30SjQDkTXEww7aZrFKU6OjrhjGRexQ18k35MWqlLFI8hpuBtiDEI3JczAeVrhucOBXPRtuovUTff3d7apBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:01:44.247434Z"},"content_sha256":"cd2cc410ea8a83c85f1d61f699be972ae05dd0d93c181746c28187fca32f8f1a","schema_version":"1.0","event_id":"sha256:cd2cc410ea8a83c85f1d61f699be972ae05dd0d93c181746c28187fca32f8f1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ACSZT5YKM4TDL5QJDP5W5QZJG7","target":"graph","payload":{"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"},"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-07-05T08:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tvjPUKfJqOH/YpaqL13vZg//ra31c6N8v8rRz1gK+WnKfmDhJQ84UGFaQBcD+rXWh1aRJ/1ZcVetbx7VnYoJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:01:44.248298Z"},"content_sha256":"6d9ef8b361c31da4f6fb0830373dc54b98225e6b12ee6b3547da2743b406473e","schema_version":"1.0","event_id":"sha256:6d9ef8b361c31da4f6fb0830373dc54b98225e6b12ee6b3547da2743b406473e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/bundle.json","state_url":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/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-08-10T08:01:44Z","links":{"resolver":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7","bundle":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/bundle.json","state":"https://pith.science/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACSZT5YKM4TDL5QJDP5W5QZJG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ACSZT5YKM4TDL5QJDP5W5QZJG7","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":"50bf99214b2851f16c71d7350f49d1ec0e07e7473496b14c1bef9552ccd8e77a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-01-24T14:26:02Z","title_canon_sha256":"241cd8cc2476389017320acb8d0b84dae51e8092dba81e5b9b147ad6209a6d90"},"schema_version":"1.0","source":{"id":"2301.10037","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.10037","created_at":"2026-07-05T08:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"2301.10037v4","created_at":"2026-07-05T08:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.10037","created_at":"2026-07-05T08:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"ACSZT5YKM4TD","created_at":"2026-07-05T08:06:39Z"},{"alias_kind":"pith_short_16","alias_value":"ACSZT5YKM4TDL5QJ","created_at":"2026-07-05T08:06:39Z"},{"alias_kind":"pith_short_8","alias_value":"ACSZT5YK","created_at":"2026-07-05T08:06:39Z"}],"graph_snapshots":[{"event_id":"sha256:6d9ef8b361c31da4f6fb0830373dc54b98225e6b12ee6b3547da2743b406473e","target":"graph","created_at":"2026-07-05T08:06:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.10037/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Peter M\\\"uller, Thibault Dardinier","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-01-24T14:26:02Z","title":"Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (extended version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.10037","kind":"arxiv","version":4},"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:cd2cc410ea8a83c85f1d61f699be972ae05dd0d93c181746c28187fca32f8f1a","target":"record","created_at":"2026-07-05T08:06:39Z","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":"50bf99214b2851f16c71d7350f49d1ec0e07e7473496b14c1bef9552ccd8e77a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2023-01-24T14:26:02Z","title_canon_sha256":"241cd8cc2476389017320acb8d0b84dae51e8092dba81e5b9b147ad6209a6d90"},"schema_version":"1.0","source":{"id":"2301.10037","kind":"arxiv","version":4}},"canonical_sha256":"00a599f70a672635f6091bfb6ec32937da150e9d897207b2d7403af548a3ad2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00a599f70a672635f6091bfb6ec32937da150e9d897207b2d7403af548a3ad2c","first_computed_at":"2026-07-05T08:06:39.475505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:06:39.475505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uxi23QlCfHWapuu9bpcpSIY54XkaA5pn0VIpzw9A2f02riiAF0bE22MZ9428AFS71kT9R9igD7JyvytNmYrJAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:06:39.475990Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.10037","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd2cc410ea8a83c85f1d61f699be972ae05dd0d93c181746c28187fca32f8f1a","sha256:6d9ef8b361c31da4f6fb0830373dc54b98225e6b12ee6b3547da2743b406473e"],"state_sha256":"5e5080ea112b70445585d7d18b2b7c8094eb1f8eb9bae400c7ead0a1cdf1afaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sGyqMS9Twa4qV3Yz6fE90kJ7yZLNJ8imrmypkDUFxj72qJDz82bvpeqdAYw96hxHFXD5n7XE0OubPR4x17i0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T08:01:44.254828Z","bundle_sha256":"e7f0115585079b7a778cdb8e0be95f753aa671e5bcc8568ca72e3654c81bc81c"}}