{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OV24VICUMNP2SPFRGPGD5T5FLK","short_pith_number":"pith:OV24VICU","canonical_record":{"source":{"id":"2507.13533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-07-17T20:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"716af5950e7aad3dfef9b730a6367e72b14ca56c89866c676f2951f3ab68dcdb","abstract_canon_sha256":"1ecf35dcf44dbee1fd356a7007b523d211426366756103dbbde51551e0af6712"},"schema_version":"1.0"},"canonical_sha256":"7575caa054635fa93cb133cc3ecfa55a81ebd2886264fa3191388fb7ae13b73c","source":{"kind":"arxiv","id":"2507.13533","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13533","created_at":"2026-07-05T11:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13533v1","created_at":"2026-07-05T11:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13533","created_at":"2026-07-05T11:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"OV24VICUMNP2","created_at":"2026-07-05T11:39:18Z"},{"alias_kind":"pith_short_16","alias_value":"OV24VICUMNP2SPFR","created_at":"2026-07-05T11:39:18Z"},{"alias_kind":"pith_short_8","alias_value":"OV24VICU","created_at":"2026-07-05T11:39:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OV24VICUMNP2SPFRGPGD5T5FLK","target":"record","payload":{"canonical_record":{"source":{"id":"2507.13533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-07-17T20:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"716af5950e7aad3dfef9b730a6367e72b14ca56c89866c676f2951f3ab68dcdb","abstract_canon_sha256":"1ecf35dcf44dbee1fd356a7007b523d211426366756103dbbde51551e0af6712"},"schema_version":"1.0"},"canonical_sha256":"7575caa054635fa93cb133cc3ecfa55a81ebd2886264fa3191388fb7ae13b73c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:39:18.834742Z","signature_b64":"of71sTk7N7bcrFdHU/Ne2cUfEzXg02gKlOQVFxhvPoEF4B8hoEM8cnMU5wqACe+eZsmCd+/MbkQUbM4J6oOvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7575caa054635fa93cb133cc3ecfa55a81ebd2886264fa3191388fb7ae13b73c","last_reissued_at":"2026-07-05T11:39:18.834364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:39:18.834364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.13533","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-05T11:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eChCbq8zX+gTgPcuVoQ6uMnepDhjox4uJEcqE9sWUS3WTDzRloNMBnxbOlNrLm8tQ0Rv64EnB1XShfewmlzQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:50:30.092170Z"},"content_sha256":"3f31281a8bec617098e035bae3ae4b71cd2678733daa4569fd9b26587767028d","schema_version":"1.0","event_id":"sha256:3f31281a8bec617098e035bae3ae4b71cd2678733daa4569fd9b26587767028d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OV24VICUMNP2SPFRGPGD5T5FLK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Increasing the Expressiveness of a Gradual Verifier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Priyam Gupta","submitted_at":"2025-07-17T20:50:52Z","abstract_excerpt":"Static verification provides strong correctness guarantees for code; however, fully specifying programs for static verification is a complex, burdensome process for users. Gradual verification was introduced to make this process easier by supporting the verification of partially specified programs. The only currently working gradual verifier, Gradual C0, successfully verifies heap manipulating programs, but lacks expressiveness in its specification language. This paper describes the design and implementation of an extension to Gradual C0 that supports unfolding expressions, which allow more in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13533","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/2507.13533/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-05T11:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMw5f5EekzeKcPlGQ+WSa6vyQ5muw4IlG7b2//vV4uvdPwtOSmX1Wc0h1Z5B/QtKZrZIUE23BV9U7oc9/b9sBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:50:30.093021Z"},"content_sha256":"d0a20407a73d2daf5de77c883c4b5546e5d688fd407ebd9ea7ed823802b25c2f","schema_version":"1.0","event_id":"sha256:d0a20407a73d2daf5de77c883c4b5546e5d688fd407ebd9ea7ed823802b25c2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OV24VICUMNP2SPFRGPGD5T5FLK/bundle.json","state_url":"https://pith.science/pith/OV24VICUMNP2SPFRGPGD5T5FLK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OV24VICUMNP2SPFRGPGD5T5FLK/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-09T07:50:30Z","links":{"resolver":"https://pith.science/pith/OV24VICUMNP2SPFRGPGD5T5FLK","bundle":"https://pith.science/pith/OV24VICUMNP2SPFRGPGD5T5FLK/bundle.json","state":"https://pith.science/pith/OV24VICUMNP2SPFRGPGD5T5FLK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OV24VICUMNP2SPFRGPGD5T5FLK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OV24VICUMNP2SPFRGPGD5T5FLK","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":"1ecf35dcf44dbee1fd356a7007b523d211426366756103dbbde51551e0af6712","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-07-17T20:50:52Z","title_canon_sha256":"716af5950e7aad3dfef9b730a6367e72b14ca56c89866c676f2951f3ab68dcdb"},"schema_version":"1.0","source":{"id":"2507.13533","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.13533","created_at":"2026-07-05T11:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2507.13533v1","created_at":"2026-07-05T11:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13533","created_at":"2026-07-05T11:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"OV24VICUMNP2","created_at":"2026-07-05T11:39:18Z"},{"alias_kind":"pith_short_16","alias_value":"OV24VICUMNP2SPFR","created_at":"2026-07-05T11:39:18Z"},{"alias_kind":"pith_short_8","alias_value":"OV24VICU","created_at":"2026-07-05T11:39:18Z"}],"graph_snapshots":[{"event_id":"sha256:d0a20407a73d2daf5de77c883c4b5546e5d688fd407ebd9ea7ed823802b25c2f","target":"graph","created_at":"2026-07-05T11:39:18Z","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/2507.13533/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Static verification provides strong correctness guarantees for code; however, fully specifying programs for static verification is a complex, burdensome process for users. Gradual verification was introduced to make this process easier by supporting the verification of partially specified programs. The only currently working gradual verifier, Gradual C0, successfully verifies heap manipulating programs, but lacks expressiveness in its specification language. This paper describes the design and implementation of an extension to Gradual C0 that supports unfolding expressions, which allow more in","authors_text":"Priyam Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-07-17T20:50:52Z","title":"Increasing the Expressiveness of a Gradual Verifier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13533","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:3f31281a8bec617098e035bae3ae4b71cd2678733daa4569fd9b26587767028d","target":"record","created_at":"2026-07-05T11:39:18Z","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":"1ecf35dcf44dbee1fd356a7007b523d211426366756103dbbde51551e0af6712","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-07-17T20:50:52Z","title_canon_sha256":"716af5950e7aad3dfef9b730a6367e72b14ca56c89866c676f2951f3ab68dcdb"},"schema_version":"1.0","source":{"id":"2507.13533","kind":"arxiv","version":1}},"canonical_sha256":"7575caa054635fa93cb133cc3ecfa55a81ebd2886264fa3191388fb7ae13b73c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7575caa054635fa93cb133cc3ecfa55a81ebd2886264fa3191388fb7ae13b73c","first_computed_at":"2026-07-05T11:39:18.834364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:39:18.834364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"of71sTk7N7bcrFdHU/Ne2cUfEzXg02gKlOQVFxhvPoEF4B8hoEM8cnMU5wqACe+eZsmCd+/MbkQUbM4J6oOvBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:39:18.834742Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.13533","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f31281a8bec617098e035bae3ae4b71cd2678733daa4569fd9b26587767028d","sha256:d0a20407a73d2daf5de77c883c4b5546e5d688fd407ebd9ea7ed823802b25c2f"],"state_sha256":"e16c35b860b45120622aaf857f57006dadc0ce76e94ad86879d56b8266b43143"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhdolztO46i0S1hz3dNJ26NmMwAk4vrgIBv/xq3e9ul5ir6RgwG8hWquwXLP5239X+aaX8wwiUtAPzt4msUDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T07:50:30.097938Z","bundle_sha256":"140349fbbfeb49d9546631577b4e823b182348e1f41b32cd378d2a2fc521f330"}}