{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IGVLSCP75WBR7BABPR2GVMARMT","short_pith_number":"pith:IGVLSCP7","schema_version":"1.0","canonical_sha256":"41aab909ffed831f84017c746ab01164f1d5bf772c9ddf4b3da818323398c228","source":{"kind":"arxiv","id":"2508.02733","version":1},"attestation_state":"computed","paper":{"title":"What's in a Proof? Analyzing Expert Proof-Writing Processes in F* and Verus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.SE","authors_text":"Gabriel Ebner, Md Rakib Hossain Misu, Rijul Jain, Sarah Fakhoury, Shan Lu, Shraddha Barke","submitted_at":"2025-08-01T22:16:30Z","abstract_excerpt":"Proof-oriented programming languages (POPLs) empower developers to write code alongside formal correctness proofs, providing formal guarantees that the code adheres to specified requirements. Despite their powerful capabilities, POPLs present a steep learning curve and have not yet been adopted by the broader software community. The lack of understanding about the proof-development process and how expert proof developers interact with POPLs has hindered the advancement of effective proof engineering and the development of proof-synthesis models/tools.\n  In this work, we conduct a user study, i"},"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":"2508.02733","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-08-01T22:16:30Z","cross_cats_sorted":["cs.HC"],"title_canon_sha256":"b8c8439a5ab07fc4c722597dec7c0edf0d0535ed96700c51ee013893d35f954a","abstract_canon_sha256":"c4f43139e440a5887019d9ef94fc48936f2e3dc30bcd8c0e0e240a87f79f8e12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:29.969633Z","signature_b64":"b/Tq9+0NM5WS9z1Gpbb+CZd5YCxEU+Y0m04LGFxMWKTWrj6xhwqI62fXZIIwPI3ANi4cowGAEHEyrDb1oQJjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41aab909ffed831f84017c746ab01164f1d5bf772c9ddf4b3da818323398c228","last_reissued_at":"2026-07-05T11:48:29.969151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:29.969151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"What's in a Proof? Analyzing Expert Proof-Writing Processes in F* and Verus","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.SE","authors_text":"Gabriel Ebner, Md Rakib Hossain Misu, Rijul Jain, Sarah Fakhoury, Shan Lu, Shraddha Barke","submitted_at":"2025-08-01T22:16:30Z","abstract_excerpt":"Proof-oriented programming languages (POPLs) empower developers to write code alongside formal correctness proofs, providing formal guarantees that the code adheres to specified requirements. Despite their powerful capabilities, POPLs present a steep learning curve and have not yet been adopted by the broader software community. The lack of understanding about the proof-development process and how expert proof developers interact with POPLs has hindered the advancement of effective proof engineering and the development of proof-synthesis models/tools.\n  In this work, we conduct a user study, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.02733","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/2508.02733/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":"2508.02733","created_at":"2026-07-05T11:48:29.969199+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.02733v1","created_at":"2026-07-05T11:48:29.969199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.02733","created_at":"2026-07-05T11:48:29.969199+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGVLSCP75WBR","created_at":"2026-07-05T11:48:29.969199+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGVLSCP75WBR7BAB","created_at":"2026-07-05T11:48:29.969199+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGVLSCP7","created_at":"2026-07-05T11:48:29.969199+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30914","citing_title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","ref_index":70,"is_internal_anchor":false},{"citing_arxiv_id":"2512.18436","citing_title":"VeruSAGE: A Study of Agent-Based Verification for Rust Systems","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGVLSCP75WBR7BABPR2GVMARMT","json":"https://pith.science/pith/IGVLSCP75WBR7BABPR2GVMARMT.json","graph_json":"https://pith.science/api/pith-number/IGVLSCP75WBR7BABPR2GVMARMT/graph.json","events_json":"https://pith.science/api/pith-number/IGVLSCP75WBR7BABPR2GVMARMT/events.json","paper":"https://pith.science/paper/IGVLSCP7"},"agent_actions":{"view_html":"https://pith.science/pith/IGVLSCP75WBR7BABPR2GVMARMT","download_json":"https://pith.science/pith/IGVLSCP75WBR7BABPR2GVMARMT.json","view_paper":"https://pith.science/paper/IGVLSCP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.02733&json=true","fetch_graph":"https://pith.science/api/pith-number/IGVLSCP75WBR7BABPR2GVMARMT/graph.json","fetch_events":"https://pith.science/api/pith-number/IGVLSCP75WBR7BABPR2GVMARMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGVLSCP75WBR7BABPR2GVMARMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGVLSCP75WBR7BABPR2GVMARMT/action/storage_attestation","attest_author":"https://pith.science/pith/IGVLSCP75WBR7BABPR2GVMARMT/action/author_attestation","sign_citation":"https://pith.science/pith/IGVLSCP75WBR7BABPR2GVMARMT/action/citation_signature","submit_replication":"https://pith.science/pith/IGVLSCP75WBR7BABPR2GVMARMT/action/replication_record"}},"created_at":"2026-07-05T11:48:29.969199+00:00","updated_at":"2026-07-05T11:48:29.969199+00:00"}