{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QA4WXKUVCW25F3BWVSVTRSEMS7","short_pith_number":"pith:QA4WXKUV","canonical_record":{"source":{"id":"1406.2824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-06-11T08:46:13Z","cross_cats_sorted":[],"title_canon_sha256":"88b481e7a8e4108224daaf723adbe6433980a22af56c8fb90e2c5a5642f97b78","abstract_canon_sha256":"640fef41e9c609cb4e17f15917104a79c8bd373c7595edff303ec275548b17bb"},"schema_version":"1.0"},"canonical_sha256":"80396baa9515b5d2ec36acab38c88c97c0207fe6fa42fd298b9019e5500908eb","source":{"kind":"arxiv","id":"1406.2824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2824","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2824v1","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2824","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"QA4WXKUVCW25","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QA4WXKUVCW25F3BW","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QA4WXKUV","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QA4WXKUVCW25F3BWVSVTRSEMS7","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-06-11T08:46:13Z","cross_cats_sorted":[],"title_canon_sha256":"88b481e7a8e4108224daaf723adbe6433980a22af56c8fb90e2c5a5642f97b78","abstract_canon_sha256":"640fef41e9c609cb4e17f15917104a79c8bd373c7595edff303ec275548b17bb"},"schema_version":"1.0"},"canonical_sha256":"80396baa9515b5d2ec36acab38c88c97c0207fe6fa42fd298b9019e5500908eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:54.973408Z","signature_b64":"1pumtzYfR6z49xcI6kVI+2CMPyi/0YvOgEPNoOPYA/CDRfrwWq3Q+oZw737UaSHxvWO6hrmlqDAjLZc625I9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80396baa9515b5d2ec36acab38c88c97c0207fe6fa42fd298b9019e5500908eb","last_reissued_at":"2026-05-18T02:49:54.972827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:54.972827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2824","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-18T02:49:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxDt9K4Ax9/9gYMTQQVNsa/uYALwJ/zqtLDoISyKJ41JuabyW3gN4mIgUY7nfzArVJkwhdOQUpuN2H+p5zgYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:44:21.948855Z"},"content_sha256":"d989eb6bab276176dfacf1b922d37c9aa8c236df619315ce1533bbecb42e7478","schema_version":"1.0","event_id":"sha256:d989eb6bab276176dfacf1b922d37c9aa8c236df619315ce1533bbecb42e7478"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QA4WXKUVCW25F3BWVSVTRSEMS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some Ideas for Program Verifier Tactics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Gudmund Grov","submitted_at":"2014-06-11T08:46:13Z","abstract_excerpt":"A program verifier is a tool that can be used to verify that a \"contract\" for a program holds - i.e. given a precondition the program guarantees that a given postcondition holds - by only working at the level of the annotated program. An alternative approach is to use an interactive theorem prover, which enables users to encode common proof patterns as special programs called \"tactics\". This offers more flexibility than program verifiers, but at the expense of skills required by the user. Here, we add such flexibility to program verifiers by developing \"tactics\" as a form of program refactorin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2824","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-18T02:49:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NI6iahiw/H5PPQ8KRGBriV56vnFN/p58qNUA9Lt9EyXKAmMsvfGqlpVpicGan/QMYhL3kybxVjGJJ5dmnLKYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:44:21.949229Z"},"content_sha256":"c5c40b08a6237b1aed85ba00dcd74115cfa3ca1a299bf0558a9ac7583b5060e8","schema_version":"1.0","event_id":"sha256:c5c40b08a6237b1aed85ba00dcd74115cfa3ca1a299bf0558a9ac7583b5060e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QA4WXKUVCW25F3BWVSVTRSEMS7/bundle.json","state_url":"https://pith.science/pith/QA4WXKUVCW25F3BWVSVTRSEMS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QA4WXKUVCW25F3BWVSVTRSEMS7/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-01T14:44:21Z","links":{"resolver":"https://pith.science/pith/QA4WXKUVCW25F3BWVSVTRSEMS7","bundle":"https://pith.science/pith/QA4WXKUVCW25F3BWVSVTRSEMS7/bundle.json","state":"https://pith.science/pith/QA4WXKUVCW25F3BWVSVTRSEMS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QA4WXKUVCW25F3BWVSVTRSEMS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QA4WXKUVCW25F3BWVSVTRSEMS7","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":"640fef41e9c609cb4e17f15917104a79c8bd373c7595edff303ec275548b17bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-06-11T08:46:13Z","title_canon_sha256":"88b481e7a8e4108224daaf723adbe6433980a22af56c8fb90e2c5a5642f97b78"},"schema_version":"1.0","source":{"id":"1406.2824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2824","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2824v1","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2824","created_at":"2026-05-18T02:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"QA4WXKUVCW25","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"QA4WXKUVCW25F3BW","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"QA4WXKUV","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:c5c40b08a6237b1aed85ba00dcd74115cfa3ca1a299bf0558a9ac7583b5060e8","target":"graph","created_at":"2026-05-18T02:49:54Z","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":"A program verifier is a tool that can be used to verify that a \"contract\" for a program holds - i.e. given a precondition the program guarantees that a given postcondition holds - by only working at the level of the annotated program. An alternative approach is to use an interactive theorem prover, which enables users to encode common proof patterns as special programs called \"tactics\". This offers more flexibility than program verifiers, but at the expense of skills required by the user. Here, we add such flexibility to program verifiers by developing \"tactics\" as a form of program refactorin","authors_text":"Gudmund Grov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-06-11T08:46:13Z","title":"Some Ideas for Program Verifier Tactics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2824","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:d989eb6bab276176dfacf1b922d37c9aa8c236df619315ce1533bbecb42e7478","target":"record","created_at":"2026-05-18T02:49:54Z","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":"640fef41e9c609cb4e17f15917104a79c8bd373c7595edff303ec275548b17bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2014-06-11T08:46:13Z","title_canon_sha256":"88b481e7a8e4108224daaf723adbe6433980a22af56c8fb90e2c5a5642f97b78"},"schema_version":"1.0","source":{"id":"1406.2824","kind":"arxiv","version":1}},"canonical_sha256":"80396baa9515b5d2ec36acab38c88c97c0207fe6fa42fd298b9019e5500908eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80396baa9515b5d2ec36acab38c88c97c0207fe6fa42fd298b9019e5500908eb","first_computed_at":"2026-05-18T02:49:54.972827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:54.972827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1pumtzYfR6z49xcI6kVI+2CMPyi/0YvOgEPNoOPYA/CDRfrwWq3Q+oZw737UaSHxvWO6hrmlqDAjLZc625I9Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:54.973408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d989eb6bab276176dfacf1b922d37c9aa8c236df619315ce1533bbecb42e7478","sha256:c5c40b08a6237b1aed85ba00dcd74115cfa3ca1a299bf0558a9ac7583b5060e8"],"state_sha256":"eae89844ed6b6158dd8136275fa5a1abdc3995868e4508637c1f1286e80eed20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqc6vXGzmK1Ib1ilyeTaLWCBP4tTwdz5MGgoErl3U0dHzxoI1PnbK+ZLghRrlmTjl5CsLo08r1yo31IJVPNeCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:44:21.951406Z","bundle_sha256":"681b3b716023a5eb1f6e511669229a34ae9b985d264160e9585b008ab054ee4a"}}