{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GIKNCCLIP6SI5ZNGMCAEB7N5ZG","short_pith_number":"pith:GIKNCCLI","canonical_record":{"source":{"id":"2504.17444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-04-24T11:13:54Z","cross_cats_sorted":[],"title_canon_sha256":"ef0f50f00e1c8b31f9770d506b6f9de5144e298f13ce9961023b8a6314cc685f","abstract_canon_sha256":"44b1849200a7a2276ed49524ef7da5eee00400f30cacb078474d4f888d255449"},"schema_version":"1.0"},"canonical_sha256":"3214d109687fa48ee5a6608040fdbdc98828461bb8c1afd4b3662ba547a934b6","source":{"kind":"arxiv","id":"2504.17444","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.17444","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"2504.17444v2","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17444","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"GIKNCCLIP6SI","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"pith_short_16","alias_value":"GIKNCCLIP6SI5ZNG","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"pith_short_8","alias_value":"GIKNCCLI","created_at":"2026-07-05T11:56:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GIKNCCLIP6SI5ZNGMCAEB7N5ZG","target":"record","payload":{"canonical_record":{"source":{"id":"2504.17444","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-04-24T11:13:54Z","cross_cats_sorted":[],"title_canon_sha256":"ef0f50f00e1c8b31f9770d506b6f9de5144e298f13ce9961023b8a6314cc685f","abstract_canon_sha256":"44b1849200a7a2276ed49524ef7da5eee00400f30cacb078474d4f888d255449"},"schema_version":"1.0"},"canonical_sha256":"3214d109687fa48ee5a6608040fdbdc98828461bb8c1afd4b3662ba547a934b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:56.418244Z","signature_b64":"4UU1XwJ/AOcocePSMKabcKEMLZ+rvsKREziQ9tcYucWNUd/B7AXd7WJk5A7qW5sWFeADVOUZX09WfdklwYA6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3214d109687fa48ee5a6608040fdbdc98828461bb8c1afd4b3662ba547a934b6","last_reissued_at":"2026-07-05T11:56:56.417685Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:56.417685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.17444","source_version":2,"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-05T11:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69y96KNSujbdZbCD6QLDZ+pVLjbH7ls4rFvke8oW50AdC3dc1XwPwTbRqpJpXoBZbKWQwtli7ZbEU2WipvFXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T13:55:12.996689Z"},"content_sha256":"e461193274f6451f30164d9353d94afc43f8797bdbddeea1350da70bad309e82","schema_version":"1.0","event_id":"sha256:e461193274f6451f30164d9353d94afc43f8797bdbddeea1350da70bad309e82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GIKNCCLIP6SI5ZNGMCAEB7N5ZG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Encode the $\\forall\\exists$ Relational Hoare Logic into Standard Hoare Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Qinxiang Cao, Shushu Wu, Xiwei Wu","submitted_at":"2025-04-24T11:13:54Z","abstract_excerpt":"Verifying a real-world program's functional correctness can be decomposed into (1) a refinement proof showing that the program implements a more abstract high-level program and (2) an algorithm correctness proof at the high level. Relational Hoare logic serves as a powerful tool to establish refinement but often necessitates formalization beyond standard Hoare logic. Particularly in the nondeterministic setting, the $\\forall\\exists$ relational Hoare logic is required. Existing approaches encode this logic into a Hoare logic with ghost states and invariants, yet these extensions significantly i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17444","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.17444/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-05T11:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wXcuiPEIUqbCPXJgYLaJ33WdFCVgwHHtGXP5p2w2969T4cWfhYdLQ8rIBjfRUJOnzr6dLUtevIU9k1Pug0C6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T13:55:12.997273Z"},"content_sha256":"299784405e9ed1f66b1887e821763c8b37b8416c39e3c70580116ec6245190bd","schema_version":"1.0","event_id":"sha256:299784405e9ed1f66b1887e821763c8b37b8416c39e3c70580116ec6245190bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIKNCCLIP6SI5ZNGMCAEB7N5ZG/bundle.json","state_url":"https://pith.science/pith/GIKNCCLIP6SI5ZNGMCAEB7N5ZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIKNCCLIP6SI5ZNGMCAEB7N5ZG/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-18T13:55:12Z","links":{"resolver":"https://pith.science/pith/GIKNCCLIP6SI5ZNGMCAEB7N5ZG","bundle":"https://pith.science/pith/GIKNCCLIP6SI5ZNGMCAEB7N5ZG/bundle.json","state":"https://pith.science/pith/GIKNCCLIP6SI5ZNGMCAEB7N5ZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIKNCCLIP6SI5ZNGMCAEB7N5ZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GIKNCCLIP6SI5ZNGMCAEB7N5ZG","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":"44b1849200a7a2276ed49524ef7da5eee00400f30cacb078474d4f888d255449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-04-24T11:13:54Z","title_canon_sha256":"ef0f50f00e1c8b31f9770d506b6f9de5144e298f13ce9961023b8a6314cc685f"},"schema_version":"1.0","source":{"id":"2504.17444","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.17444","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"2504.17444v2","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17444","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"GIKNCCLIP6SI","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"pith_short_16","alias_value":"GIKNCCLIP6SI5ZNG","created_at":"2026-07-05T11:56:56Z"},{"alias_kind":"pith_short_8","alias_value":"GIKNCCLI","created_at":"2026-07-05T11:56:56Z"}],"graph_snapshots":[{"event_id":"sha256:299784405e9ed1f66b1887e821763c8b37b8416c39e3c70580116ec6245190bd","target":"graph","created_at":"2026-07-05T11:56:56Z","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/2504.17444/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Verifying a real-world program's functional correctness can be decomposed into (1) a refinement proof showing that the program implements a more abstract high-level program and (2) an algorithm correctness proof at the high level. Relational Hoare logic serves as a powerful tool to establish refinement but often necessitates formalization beyond standard Hoare logic. Particularly in the nondeterministic setting, the $\\forall\\exists$ relational Hoare logic is required. Existing approaches encode this logic into a Hoare logic with ghost states and invariants, yet these extensions significantly i","authors_text":"Qinxiang Cao, Shushu Wu, Xiwei Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-04-24T11:13:54Z","title":"Encode the $\\forall\\exists$ Relational Hoare Logic into Standard Hoare Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17444","kind":"arxiv","version":2},"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:e461193274f6451f30164d9353d94afc43f8797bdbddeea1350da70bad309e82","target":"record","created_at":"2026-07-05T11:56:56Z","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":"44b1849200a7a2276ed49524ef7da5eee00400f30cacb078474d4f888d255449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-04-24T11:13:54Z","title_canon_sha256":"ef0f50f00e1c8b31f9770d506b6f9de5144e298f13ce9961023b8a6314cc685f"},"schema_version":"1.0","source":{"id":"2504.17444","kind":"arxiv","version":2}},"canonical_sha256":"3214d109687fa48ee5a6608040fdbdc98828461bb8c1afd4b3662ba547a934b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3214d109687fa48ee5a6608040fdbdc98828461bb8c1afd4b3662ba547a934b6","first_computed_at":"2026-07-05T11:56:56.417685Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:56:56.417685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4UU1XwJ/AOcocePSMKabcKEMLZ+rvsKREziQ9tcYucWNUd/B7AXd7WJk5A7qW5sWFeADVOUZX09WfdklwYA6Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T11:56:56.418244Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.17444","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e461193274f6451f30164d9353d94afc43f8797bdbddeea1350da70bad309e82","sha256:299784405e9ed1f66b1887e821763c8b37b8416c39e3c70580116ec6245190bd"],"state_sha256":"47131bfcc598c602412b924ac59fb1a68b2bb44ad06654a7ac5ccc5e7d639b91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G11w4+tRU21b/IM8Su8FEVvolpkbAhshuzq726zMrj9qkruTdtIxH+mZlx/VxpZYEDhwwcQZyx+FLZdUtmo4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T13:55:13.001383Z","bundle_sha256":"00beba2e92492a21f3c8b32bc4c683c6941d8b6c44a1d88e382a3928dbad4235"}}