{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q3J53IZP2XGEV3LFS64QTFYX3U","short_pith_number":"pith:Q3J53IZP","schema_version":"1.0","canonical_sha256":"86d3dda32fd5cc4aed6597b9099717dd30459e3698f30ae7ebf657b29d13106e","source":{"kind":"arxiv","id":"1703.00053","version":6},"attestation_state":"computed","paper":{"title":"Verified Low-Level Programming Embedded in F*","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.PL","authors_text":"Antoine Delignat-Lavaud, Aseem Rastogi, Catalin Hritcu, C\\'edric Fournet, Jean-Karim Zinzindohou\\'e, Jonathan Protzenko, Karthikeyan Bhargavan, Nikhil Swamy, Peng Wang, Santiago Zanella-B\\'eguelin, Tahina Ramananandro","submitted_at":"2017-02-28T20:53:33Z","abstract_excerpt":"We present Low*, a language for low-level programming and verification, and its application to high-assurance optimized cryptographic libraries. Low* is a shallow embedding of a small, sequential, well-behaved subset of C in F*, a dependently-typed variant of ML aimed at program verification. Departing from ML, Low* does not involve any garbage collection or implicit heap allocation; instead, it has a structured memory model \\`a la CompCert, and it provides the control required for writing efficient low-level security-critical code.\n  By virtue of typing, any Low* program is memory safe. In ad"},"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":"1703.00053","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2017-02-28T20:53:33Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"d82761486853d5f286898f4249500890533764e90ba8586c9df13a64b7cc05ee","abstract_canon_sha256":"e3e7111065ca0797f0644ebb4486f53dddae097f18ef7c7618e162256c9268b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:02:43.372852Z","signature_b64":"ZZ+BUhIdrr94JGnos+de7Na8Q8TzjTUnh+wKSoS8cAOt5wBjNJltXJ32iWqZFYP0HDrckQ1vF9DTp4Z0FSWrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86d3dda32fd5cc4aed6597b9099717dd30459e3698f30ae7ebf657b29d13106e","last_reissued_at":"2026-07-05T06:02:43.372511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:02:43.372511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Verified Low-Level Programming Embedded in F*","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.PL","authors_text":"Antoine Delignat-Lavaud, Aseem Rastogi, Catalin Hritcu, C\\'edric Fournet, Jean-Karim Zinzindohou\\'e, Jonathan Protzenko, Karthikeyan Bhargavan, Nikhil Swamy, Peng Wang, Santiago Zanella-B\\'eguelin, Tahina Ramananandro","submitted_at":"2017-02-28T20:53:33Z","abstract_excerpt":"We present Low*, a language for low-level programming and verification, and its application to high-assurance optimized cryptographic libraries. Low* is a shallow embedding of a small, sequential, well-behaved subset of C in F*, a dependently-typed variant of ML aimed at program verification. Departing from ML, Low* does not involve any garbage collection or implicit heap allocation; instead, it has a structured memory model \\`a la CompCert, and it provides the control required for writing efficient low-level security-critical code.\n  By virtue of typing, any Low* program is memory safe. In ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00053","kind":"arxiv","version":6},"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/1703.00053/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":"1703.00053","created_at":"2026-07-05T06:02:43.372566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00053v6","created_at":"2026-07-05T06:02:43.372566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00053","created_at":"2026-07-05T06:02:43.372566+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3J53IZP2XGE","created_at":"2026-07-05T06:02:43.372566+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3J53IZP2XGEV3LF","created_at":"2026-07-05T06:02:43.372566+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3J53IZP","created_at":"2026-07-05T06:02:43.372566+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q3J53IZP2XGEV3LFS64QTFYX3U","json":"https://pith.science/pith/Q3J53IZP2XGEV3LFS64QTFYX3U.json","graph_json":"https://pith.science/api/pith-number/Q3J53IZP2XGEV3LFS64QTFYX3U/graph.json","events_json":"https://pith.science/api/pith-number/Q3J53IZP2XGEV3LFS64QTFYX3U/events.json","paper":"https://pith.science/paper/Q3J53IZP"},"agent_actions":{"view_html":"https://pith.science/pith/Q3J53IZP2XGEV3LFS64QTFYX3U","download_json":"https://pith.science/pith/Q3J53IZP2XGEV3LFS64QTFYX3U.json","view_paper":"https://pith.science/paper/Q3J53IZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00053&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3J53IZP2XGEV3LFS64QTFYX3U/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3J53IZP2XGEV3LFS64QTFYX3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3J53IZP2XGEV3LFS64QTFYX3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3J53IZP2XGEV3LFS64QTFYX3U/action/storage_attestation","attest_author":"https://pith.science/pith/Q3J53IZP2XGEV3LFS64QTFYX3U/action/author_attestation","sign_citation":"https://pith.science/pith/Q3J53IZP2XGEV3LFS64QTFYX3U/action/citation_signature","submit_replication":"https://pith.science/pith/Q3J53IZP2XGEV3LFS64QTFYX3U/action/replication_record"}},"created_at":"2026-07-05T06:02:43.372566+00:00","updated_at":"2026-07-05T06:02:43.372566+00:00"}