{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:DV23ZOKEQEP2TCVHPB3OY3YTND","short_pith_number":"pith:DV23ZOKE","schema_version":"1.0","canonical_sha256":"1d75bcb944811fa98aa77876ec6f1368f9d54c90ed386b5a3d8e7f95fd2f69c4","source":{"kind":"arxiv","id":"2210.02428","version":3},"attestation_state":"computed","paper":{"title":"Gradual C0: Symbolic Execution for Gradual Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Conrad Zimmerman, \\'Eric Tanter, Hemant Gouni, Ian McCormack, Jacob Gorenburg, Jan-Paul Ramos-D\\'avila, Jenna DiVincenzo, Jonathan Aldrich, Joshua Sunshine, Mona Zhang","submitted_at":"2022-10-05T17:48:14Z","abstract_excerpt":"Current static verification techniques support a wide range of programs. However, such techniques only support complete and detailed specifications, which places an undue burden on users. To solve this problem, prior work proposed gradual verification, which handles complete, partial, or missing specifications by soundly combining static and dynamic checking. Gradual verification has also been extended to programs that manipulate recursive, mutable data structures on the heap. Unfortunately, this extension does not reward users with decreased dynamic checking as specifications are refined. In "},"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":"2210.02428","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-10-05T17:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"3d990a49a90f445361ec53320d78cfa388a411e581f79c514406bc345d916af5","abstract_canon_sha256":"a7dfe405f49f8c3988f0973e11227ffcef4780df4fb044cb5e36b6842a270729"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:35.462089Z","signature_b64":"DSCvkaqbWDzNOUPvUj3pSVczfcknQfoiMGmTQtYPc5O6jMMO3FhAmSkRHB84s1CJ+/n1aH/csVJ9f5IWD5OWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d75bcb944811fa98aa77876ec6f1368f9d54c90ed386b5a3d8e7f95fd2f69c4","last_reissued_at":"2026-07-05T07:35:35.461557Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:35.461557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradual C0: Symbolic Execution for Gradual Verification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Conrad Zimmerman, \\'Eric Tanter, Hemant Gouni, Ian McCormack, Jacob Gorenburg, Jan-Paul Ramos-D\\'avila, Jenna DiVincenzo, Jonathan Aldrich, Joshua Sunshine, Mona Zhang","submitted_at":"2022-10-05T17:48:14Z","abstract_excerpt":"Current static verification techniques support a wide range of programs. However, such techniques only support complete and detailed specifications, which places an undue burden on users. To solve this problem, prior work proposed gradual verification, which handles complete, partial, or missing specifications by soundly combining static and dynamic checking. Gradual verification has also been extended to programs that manipulate recursive, mutable data structures on the heap. Unfortunately, this extension does not reward users with decreased dynamic checking as specifications are refined. In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.02428","kind":"arxiv","version":3},"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/2210.02428/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":"2210.02428","created_at":"2026-07-05T07:35:35.461623+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.02428v3","created_at":"2026-07-05T07:35:35.461623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.02428","created_at":"2026-07-05T07:35:35.461623+00:00"},{"alias_kind":"pith_short_12","alias_value":"DV23ZOKEQEP2","created_at":"2026-07-05T07:35:35.461623+00:00"},{"alias_kind":"pith_short_16","alias_value":"DV23ZOKEQEP2TCVH","created_at":"2026-07-05T07:35:35.461623+00:00"},{"alias_kind":"pith_short_8","alias_value":"DV23ZOKE","created_at":"2026-07-05T07:35:35.461623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.13533","citing_title":"Increasing the Expressiveness of a Gradual Verifier","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DV23ZOKEQEP2TCVHPB3OY3YTND","json":"https://pith.science/pith/DV23ZOKEQEP2TCVHPB3OY3YTND.json","graph_json":"https://pith.science/api/pith-number/DV23ZOKEQEP2TCVHPB3OY3YTND/graph.json","events_json":"https://pith.science/api/pith-number/DV23ZOKEQEP2TCVHPB3OY3YTND/events.json","paper":"https://pith.science/paper/DV23ZOKE"},"agent_actions":{"view_html":"https://pith.science/pith/DV23ZOKEQEP2TCVHPB3OY3YTND","download_json":"https://pith.science/pith/DV23ZOKEQEP2TCVHPB3OY3YTND.json","view_paper":"https://pith.science/paper/DV23ZOKE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.02428&json=true","fetch_graph":"https://pith.science/api/pith-number/DV23ZOKEQEP2TCVHPB3OY3YTND/graph.json","fetch_events":"https://pith.science/api/pith-number/DV23ZOKEQEP2TCVHPB3OY3YTND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DV23ZOKEQEP2TCVHPB3OY3YTND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DV23ZOKEQEP2TCVHPB3OY3YTND/action/storage_attestation","attest_author":"https://pith.science/pith/DV23ZOKEQEP2TCVHPB3OY3YTND/action/author_attestation","sign_citation":"https://pith.science/pith/DV23ZOKEQEP2TCVHPB3OY3YTND/action/citation_signature","submit_replication":"https://pith.science/pith/DV23ZOKEQEP2TCVHPB3OY3YTND/action/replication_record"}},"created_at":"2026-07-05T07:35:35.461623+00:00","updated_at":"2026-07-05T07:35:35.461623+00:00"}