{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KTYWHZL7TKUMJX5TC5IO74NGTN","short_pith_number":"pith:KTYWHZL7","canonical_record":{"source":{"id":"2607.26306","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-07-28T22:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"aad253c58347e8ab2f1b5932c9c669877a7bbe618053ae5b8fee481a266c15c6","abstract_canon_sha256":"2059e5756ef98e7c7d667319baf8ebee065556f1d0554f549c8c0a6bc5f65d75"},"schema_version":"1.0"},"canonical_sha256":"54f163e57f9aa8c4dfb31750eff1a69b7deee4be2ecea18524d58389ce5d43bc","source":{"kind":"arxiv","id":"2607.26306","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26306","created_at":"2026-07-30T01:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26306v1","created_at":"2026-07-30T01:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26306","created_at":"2026-07-30T01:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"KTYWHZL7TKUM","created_at":"2026-07-30T01:17:58Z"},{"alias_kind":"pith_short_16","alias_value":"KTYWHZL7TKUMJX5T","created_at":"2026-07-30T01:17:58Z"},{"alias_kind":"pith_short_8","alias_value":"KTYWHZL7","created_at":"2026-07-30T01:17:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KTYWHZL7TKUMJX5TC5IO74NGTN","target":"record","payload":{"canonical_record":{"source":{"id":"2607.26306","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-07-28T22:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"aad253c58347e8ab2f1b5932c9c669877a7bbe618053ae5b8fee481a266c15c6","abstract_canon_sha256":"2059e5756ef98e7c7d667319baf8ebee065556f1d0554f549c8c0a6bc5f65d75"},"schema_version":"1.0"},"canonical_sha256":"54f163e57f9aa8c4dfb31750eff1a69b7deee4be2ecea18524d58389ce5d43bc","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54f163e57f9aa8c4dfb31750eff1a69b7deee4be2ecea18524d58389ce5d43bc","last_reissued_at":"2026-07-30T01:17:58.307247Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:17:58.307247Z"},"source_kind":"arxiv","source_id":"2607.26306","source_version":1,"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-30T01:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odaV3Khok/EsjzrlLaMDInZsx9o/mieIILUrHHrt/lFRwyHdRBMPIpZzpbNM0c9tn3ffsOZWzBUwOqDJwxfvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:42:01.602641Z"},"content_sha256":"811b57513532810df6c126a5c47609b1d429b98885711d29d0f882c6bad504b7","schema_version":"1.0","event_id":"sha256:811b57513532810df6c126a5c47609b1d429b98885711d29d0f882c6bad504b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KTYWHZL7TKUMJX5TC5IO74NGTN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Foundational Refinement Proofs for Deployed Bytecode, at the Price of Tokens","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Lefteris Lazaropoulos, Zoe Paraskevopoulou","submitted_at":"2026-07-28T22:00:02Z","abstract_excerpt":"Relating low-level executable code to a high-level account of its behavior has been a central concern of programming-language research for decades. From formally verified compilers to translation validators, certifying compilers, and proof-carrying code, each approach chooses between laborious but foundational mechanized proofs and automation that costs completeness, generality, and an increased trusted base. Recently, large language models (LLMs) have begun to change the economics of formal verification. Agentic proof development is now capable of producing machine-checked proofs at a scale a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26306","kind":"arxiv","version":1},"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/2607.26306/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-30T01:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGwb1DApwioWzaNA9dqt4u379/GJvMshizwq9Km4iBwK76i/k10bQYEqqLBjKGqbvNoKVp+Nxy3Y/6S8QQSEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T07:42:01.603589Z"},"content_sha256":"8ea927f94832de6e115aceec73899ee943a5a8bcb7d8ba07f1a624f3bf693231","schema_version":"1.0","event_id":"sha256:8ea927f94832de6e115aceec73899ee943a5a8bcb7d8ba07f1a624f3bf693231"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KTYWHZL7TKUMJX5TC5IO74NGTN/bundle.json","state_url":"https://pith.science/pith/KTYWHZL7TKUMJX5TC5IO74NGTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KTYWHZL7TKUMJX5TC5IO74NGTN/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-04T07:42:01Z","links":{"resolver":"https://pith.science/pith/KTYWHZL7TKUMJX5TC5IO74NGTN","bundle":"https://pith.science/pith/KTYWHZL7TKUMJX5TC5IO74NGTN/bundle.json","state":"https://pith.science/pith/KTYWHZL7TKUMJX5TC5IO74NGTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KTYWHZL7TKUMJX5TC5IO74NGTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KTYWHZL7TKUMJX5TC5IO74NGTN","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":"2059e5756ef98e7c7d667319baf8ebee065556f1d0554f549c8c0a6bc5f65d75","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-07-28T22:00:02Z","title_canon_sha256":"aad253c58347e8ab2f1b5932c9c669877a7bbe618053ae5b8fee481a266c15c6"},"schema_version":"1.0","source":{"id":"2607.26306","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26306","created_at":"2026-07-30T01:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26306v1","created_at":"2026-07-30T01:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26306","created_at":"2026-07-30T01:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"KTYWHZL7TKUM","created_at":"2026-07-30T01:17:58Z"},{"alias_kind":"pith_short_16","alias_value":"KTYWHZL7TKUMJX5T","created_at":"2026-07-30T01:17:58Z"},{"alias_kind":"pith_short_8","alias_value":"KTYWHZL7","created_at":"2026-07-30T01:17:58Z"}],"graph_snapshots":[{"event_id":"sha256:8ea927f94832de6e115aceec73899ee943a5a8bcb7d8ba07f1a624f3bf693231","target":"graph","created_at":"2026-07-30T01:17:58Z","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/2607.26306/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Relating low-level executable code to a high-level account of its behavior has been a central concern of programming-language research for decades. From formally verified compilers to translation validators, certifying compilers, and proof-carrying code, each approach chooses between laborious but foundational mechanized proofs and automation that costs completeness, generality, and an increased trusted base. Recently, large language models (LLMs) have begun to change the economics of formal verification. Agentic proof development is now capable of producing machine-checked proofs at a scale a","authors_text":"Lefteris Lazaropoulos, Zoe Paraskevopoulou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-07-28T22:00:02Z","title":"Foundational Refinement Proofs for Deployed Bytecode, at the Price of Tokens"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26306","kind":"arxiv","version":1},"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:811b57513532810df6c126a5c47609b1d429b98885711d29d0f882c6bad504b7","target":"record","created_at":"2026-07-30T01:17:58Z","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":"2059e5756ef98e7c7d667319baf8ebee065556f1d0554f549c8c0a6bc5f65d75","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-07-28T22:00:02Z","title_canon_sha256":"aad253c58347e8ab2f1b5932c9c669877a7bbe618053ae5b8fee481a266c15c6"},"schema_version":"1.0","source":{"id":"2607.26306","kind":"arxiv","version":1}},"canonical_sha256":"54f163e57f9aa8c4dfb31750eff1a69b7deee4be2ecea18524d58389ce5d43bc","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54f163e57f9aa8c4dfb31750eff1a69b7deee4be2ecea18524d58389ce5d43bc","first_computed_at":"2026-07-30T01:17:58.307247Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:17:58.307247Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.26306","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:811b57513532810df6c126a5c47609b1d429b98885711d29d0f882c6bad504b7","sha256:8ea927f94832de6e115aceec73899ee943a5a8bcb7d8ba07f1a624f3bf693231"],"state_sha256":"ecf89374240807ecbbe033052912740a92151b3f379805560f14325edccfe6c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7B1/mkchVolPt7q+FU/T26iU0pBRJRjFLRq3ZBZPd/ddN8iSJi3HwH2YhFhzVTV/UqqYglUnepWoRuQYXWUnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T07:42:01.609151Z","bundle_sha256":"075205a7ec168629b1ad3174c230f045267666903f2d3903220f24e2d791a98b"}}