{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QOTC7V2XPR6SIB2C76XOJQQFQR","short_pith_number":"pith:QOTC7V2X","canonical_record":{"source":{"id":"2605.20531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T22:08:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7829dcb3446db5fa98a6adde46c9ba18055a6f9b3a92b09a4c1a76c351af52fc","abstract_canon_sha256":"efd60109ad2f9861c6351a83f3afb4e8451c9b36de5bd6ab7eac4addc028d1c6"},"schema_version":"1.0"},"canonical_sha256":"83a62fd7577c7d240742ffaee4c205845082f4e12be98c0927cf9accb7f7d5ff","source":{"kind":"arxiv","id":"2605.20531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20531","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20531v1","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20531","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"QOTC7V2XPR6S","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_16","alias_value":"QOTC7V2XPR6SIB2C","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_8","alias_value":"QOTC7V2X","created_at":"2026-05-21T01:04:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QOTC7V2XPR6SIB2C76XOJQQFQR","target":"record","payload":{"canonical_record":{"source":{"id":"2605.20531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T22:08:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7829dcb3446db5fa98a6adde46c9ba18055a6f9b3a92b09a4c1a76c351af52fc","abstract_canon_sha256":"efd60109ad2f9861c6351a83f3afb4e8451c9b36de5bd6ab7eac4addc028d1c6"},"schema_version":"1.0"},"canonical_sha256":"83a62fd7577c7d240742ffaee4c205845082f4e12be98c0927cf9accb7f7d5ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:41.259659Z","signature_b64":"c4JurHv7pYN9mCctKVDSN3oL6HOiQyKbypW6BBDr/SGer6WHMHdnyU6gd7e6T3zIhXO5ycefi/y6sDyQGna0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83a62fd7577c7d240742ffaee4c205845082f4e12be98c0927cf9accb7f7d5ff","last_reissued_at":"2026-05-21T01:04:41.259132Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:41.259132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.20531","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-05-21T01:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwinVQ6LC3Z+UretpWgGMmvUyHmsHRSZgBE5x1ijFPqVvJfvwIkkugQWUcPceeFnTKVsJwgxLY4QJ/KuAbYNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:30:09.497425Z"},"content_sha256":"d968dfa13db481848202662e213a0437e08798cdd47c051288775843174d4e3b","schema_version":"1.0","event_id":"sha256:d968dfa13db481848202662e213a0437e08798cdd47c051288775843174d4e3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QOTC7V2XPR6SIB2C76XOJQQFQR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pseudo-Formalization for Automatic Proof Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.LO","authors_text":"Kaiyue Wen, Luke Bailey, Mohammed Abouzaid, Slim Barkallah, Tengyu Ma","submitted_at":"2026-05-19T22:08:51Z","abstract_excerpt":"Reliable verification of proofs remains a bottleneck for training and evaluating AI systems on hard mathematical reasoning. Fully formal proofs, in languages like Lean, are easy to verify because they are unambiguous and modular. Most proofs, particularly those written by AI systems, have neither property, and translating them into formal languages remains challenging in many frontier math settings. We propose Pseudo-Formalization (PF), a proof format that captures the modularity and precision of formal proofs while retaining the flexibility of natural language. A Pseudo-Formal proof is decomp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20531","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/2605.20531/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-05-21T01:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MdNMD7I7VNbS3kNA64XbXhMvwcpWkDSqIXyOXUKF/uLPlEgHyxZHA8hL5/ZqVaKyTmpTYy8iPbFj7qzsbluCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T19:30:09.497822Z"},"content_sha256":"7922c32ce82ff4f6e6e88a09c2ea3af2e21c2acb50e84b5648813f6ce583c747","schema_version":"1.0","event_id":"sha256:7922c32ce82ff4f6e6e88a09c2ea3af2e21c2acb50e84b5648813f6ce583c747"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOTC7V2XPR6SIB2C76XOJQQFQR/bundle.json","state_url":"https://pith.science/pith/QOTC7V2XPR6SIB2C76XOJQQFQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOTC7V2XPR6SIB2C76XOJQQFQR/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-05-22T19:30:09Z","links":{"resolver":"https://pith.science/pith/QOTC7V2XPR6SIB2C76XOJQQFQR","bundle":"https://pith.science/pith/QOTC7V2XPR6SIB2C76XOJQQFQR/bundle.json","state":"https://pith.science/pith/QOTC7V2XPR6SIB2C76XOJQQFQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOTC7V2XPR6SIB2C76XOJQQFQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QOTC7V2XPR6SIB2C76XOJQQFQR","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":"efd60109ad2f9861c6351a83f3afb4e8451c9b36de5bd6ab7eac4addc028d1c6","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T22:08:51Z","title_canon_sha256":"7829dcb3446db5fa98a6adde46c9ba18055a6f9b3a92b09a4c1a76c351af52fc"},"schema_version":"1.0","source":{"id":"2605.20531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20531","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20531v1","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20531","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"QOTC7V2XPR6S","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_16","alias_value":"QOTC7V2XPR6SIB2C","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_8","alias_value":"QOTC7V2X","created_at":"2026-05-21T01:04:41Z"}],"graph_snapshots":[{"event_id":"sha256:7922c32ce82ff4f6e6e88a09c2ea3af2e21c2acb50e84b5648813f6ce583c747","target":"graph","created_at":"2026-05-21T01:04:41Z","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/2605.20531/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reliable verification of proofs remains a bottleneck for training and evaluating AI systems on hard mathematical reasoning. Fully formal proofs, in languages like Lean, are easy to verify because they are unambiguous and modular. Most proofs, particularly those written by AI systems, have neither property, and translating them into formal languages remains challenging in many frontier math settings. We propose Pseudo-Formalization (PF), a proof format that captures the modularity and precision of formal proofs while retaining the flexibility of natural language. A Pseudo-Formal proof is decomp","authors_text":"Kaiyue Wen, Luke Bailey, Mohammed Abouzaid, Slim Barkallah, Tengyu Ma","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T22:08:51Z","title":"Pseudo-Formalization for Automatic Proof Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20531","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:d968dfa13db481848202662e213a0437e08798cdd47c051288775843174d4e3b","target":"record","created_at":"2026-05-21T01:04:41Z","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":"efd60109ad2f9861c6351a83f3afb4e8451c9b36de5bd6ab7eac4addc028d1c6","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T22:08:51Z","title_canon_sha256":"7829dcb3446db5fa98a6adde46c9ba18055a6f9b3a92b09a4c1a76c351af52fc"},"schema_version":"1.0","source":{"id":"2605.20531","kind":"arxiv","version":1}},"canonical_sha256":"83a62fd7577c7d240742ffaee4c205845082f4e12be98c0927cf9accb7f7d5ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83a62fd7577c7d240742ffaee4c205845082f4e12be98c0927cf9accb7f7d5ff","first_computed_at":"2026-05-21T01:04:41.259132Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:41.259132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c4JurHv7pYN9mCctKVDSN3oL6HOiQyKbypW6BBDr/SGer6WHMHdnyU6gd7e6T3zIhXO5ycefi/y6sDyQGna0BQ==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:41.259659Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d968dfa13db481848202662e213a0437e08798cdd47c051288775843174d4e3b","sha256:7922c32ce82ff4f6e6e88a09c2ea3af2e21c2acb50e84b5648813f6ce583c747"],"state_sha256":"50f503b94a9be7765e6f9c720b045c00cd6771ba911200c28f7deaca27544532"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9VlTcBKWDKYpIC61Ak743Wc1E4ZetzkO0dg7bWRClvJTIz/JOXzvnCr6/Mb/fLcYDLZD5pKuXII85FSPRj/bDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T19:30:09.499922Z","bundle_sha256":"2de0aa9966a86ee384ca6d694c1ade9cf283b11712ecf540a1c628ed14c85a1a"}}