{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VOOMLAMR2N4ZMKOHG5VHQWKERN","short_pith_number":"pith:VOOMLAMR","canonical_record":{"source":{"id":"1710.03357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-10T00:05:21Z","cross_cats_sorted":[],"title_canon_sha256":"88ee96c1304b247944df355df04286a253a084e61716e5be4c4fd3a56508c7a5","abstract_canon_sha256":"801a163c8df0366e10ebde514134466a7761d879eea1a8c9b421b09a01599b9c"},"schema_version":"1.0"},"canonical_sha256":"ab9cc58191d3799629c7376a7859448b75683273c7b4b4a6bf0d3d983baeb127","source":{"kind":"arxiv","id":"1710.03357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03357","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03357v1","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03357","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"VOOMLAMR2N4Z","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VOOMLAMR2N4ZMKOH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VOOMLAMR","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VOOMLAMR2N4ZMKOHG5VHQWKERN","target":"record","payload":{"canonical_record":{"source":{"id":"1710.03357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-10T00:05:21Z","cross_cats_sorted":[],"title_canon_sha256":"88ee96c1304b247944df355df04286a253a084e61716e5be4c4fd3a56508c7a5","abstract_canon_sha256":"801a163c8df0366e10ebde514134466a7761d879eea1a8c9b421b09a01599b9c"},"schema_version":"1.0"},"canonical_sha256":"ab9cc58191d3799629c7376a7859448b75683273c7b4b4a6bf0d3d983baeb127","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:12.252886Z","signature_b64":"d9SKGmzRceOT5C69Q1F9r2Gh5norvqA/hAsy19+jan62ah3f3W3nAtNR4ktFZPBNFKJAolwcTL5itRIn/1Y6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab9cc58191d3799629c7376a7859448b75683273c7b4b4a6bf0d3d983baeb127","last_reissued_at":"2026-05-18T00:33:12.252238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:12.252238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.03357","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-18T00:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvAVBOAC8lG7eiX0jQTY2cam1z0oxgAl1iquP+mclUIydT1VcBR29lqbq0GSk2QpIZntX7BTFVkbi16xlx3XAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:25:04.357761Z"},"content_sha256":"0d534a1d9b657ca1008ad83a31cef8a1e5babcedca34fac8845e55e4fc815952","schema_version":"1.0","event_id":"sha256:0d534a1d9b657ca1008ad83a31cef8a1e5babcedca34fac8845e55e4fc815952"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VOOMLAMR2N4ZMKOHG5VHQWKERN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proofs as Relational Invariants of Synthesized Execution Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Caleb Voss, David Heath, William Harris","submitted_at":"2017-10-10T00:05:21Z","abstract_excerpt":"The automatic verification of programs that maintain unbounded low-level data structures is a critical and open problem. Analyzers and verifiers developed in previous work can synthesize invariants that only describe data structures of heavily restricted forms, or require an analyst to provide predicates over program data and structure that are used in a synthesized proof of correctness.\n  In this work, we introduce a novel automatic safety verifier of programs that maintain low-level data structures, named LTTP. LTTP synthesizes proofs of program safety represented as a grammar of a given pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03357","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":""},"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-18T00:33:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8nAEiebNa1Y9gmTK4/Yfj+AQA8lQ73Dlm7G3xmHPUNfe1qTpj0vSdxgwhuGCRkXPu/fRd77b3vBtYf8uRvvkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:25:04.358110Z"},"content_sha256":"129175ed6c58c448d0175973cd20fd230cb207c19b6a2bd99fb4360799340535","schema_version":"1.0","event_id":"sha256:129175ed6c58c448d0175973cd20fd230cb207c19b6a2bd99fb4360799340535"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VOOMLAMR2N4ZMKOHG5VHQWKERN/bundle.json","state_url":"https://pith.science/pith/VOOMLAMR2N4ZMKOHG5VHQWKERN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VOOMLAMR2N4ZMKOHG5VHQWKERN/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-06-03T19:25:04Z","links":{"resolver":"https://pith.science/pith/VOOMLAMR2N4ZMKOHG5VHQWKERN","bundle":"https://pith.science/pith/VOOMLAMR2N4ZMKOHG5VHQWKERN/bundle.json","state":"https://pith.science/pith/VOOMLAMR2N4ZMKOHG5VHQWKERN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VOOMLAMR2N4ZMKOHG5VHQWKERN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VOOMLAMR2N4ZMKOHG5VHQWKERN","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":"801a163c8df0366e10ebde514134466a7761d879eea1a8c9b421b09a01599b9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-10T00:05:21Z","title_canon_sha256":"88ee96c1304b247944df355df04286a253a084e61716e5be4c4fd3a56508c7a5"},"schema_version":"1.0","source":{"id":"1710.03357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.03357","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"arxiv_version","alias_value":"1710.03357v1","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.03357","created_at":"2026-05-18T00:33:12Z"},{"alias_kind":"pith_short_12","alias_value":"VOOMLAMR2N4Z","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VOOMLAMR2N4ZMKOH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VOOMLAMR","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:129175ed6c58c448d0175973cd20fd230cb207c19b6a2bd99fb4360799340535","target":"graph","created_at":"2026-05-18T00:33:12Z","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"},"paper":{"abstract_excerpt":"The automatic verification of programs that maintain unbounded low-level data structures is a critical and open problem. Analyzers and verifiers developed in previous work can synthesize invariants that only describe data structures of heavily restricted forms, or require an analyst to provide predicates over program data and structure that are used in a synthesized proof of correctness.\n  In this work, we introduce a novel automatic safety verifier of programs that maintain low-level data structures, named LTTP. LTTP synthesizes proofs of program safety represented as a grammar of a given pro","authors_text":"Caleb Voss, David Heath, William Harris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-10T00:05:21Z","title":"Proofs as Relational Invariants of Synthesized Execution Grammars"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.03357","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:0d534a1d9b657ca1008ad83a31cef8a1e5babcedca34fac8845e55e4fc815952","target":"record","created_at":"2026-05-18T00:33:12Z","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":"801a163c8df0366e10ebde514134466a7761d879eea1a8c9b421b09a01599b9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-10T00:05:21Z","title_canon_sha256":"88ee96c1304b247944df355df04286a253a084e61716e5be4c4fd3a56508c7a5"},"schema_version":"1.0","source":{"id":"1710.03357","kind":"arxiv","version":1}},"canonical_sha256":"ab9cc58191d3799629c7376a7859448b75683273c7b4b4a6bf0d3d983baeb127","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab9cc58191d3799629c7376a7859448b75683273c7b4b4a6bf0d3d983baeb127","first_computed_at":"2026-05-18T00:33:12.252238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:12.252238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d9SKGmzRceOT5C69Q1F9r2Gh5norvqA/hAsy19+jan62ah3f3W3nAtNR4ktFZPBNFKJAolwcTL5itRIn/1Y6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:12.252886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.03357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d534a1d9b657ca1008ad83a31cef8a1e5babcedca34fac8845e55e4fc815952","sha256:129175ed6c58c448d0175973cd20fd230cb207c19b6a2bd99fb4360799340535"],"state_sha256":"bb44dc5d6498d4279005ffb6f3c52cf9fbc0c6d3dee9e97c6471f07c50163842"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YE+SBTJui+Qn9qvb0QlyLVzgONDHaInZtskcClPDl/ksRdDQF7hJMCHMmfy30rPW+/lOP97YXC/U66ikF9eGDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:25:04.360062Z","bundle_sha256":"31157a36c99f91879ed298596e2fe6145aea4640118f2563f69868d567081c18"}}