{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3ETC3VCNNBRI3L64ZHIFCQ7H7Y","short_pith_number":"pith:3ETC3VCN","canonical_record":{"source":{"id":"1710.08614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-24T06:25:05Z","cross_cats_sorted":[],"title_canon_sha256":"66a6f549c571f50a43d75127b5541c52395b78ca6fd2019551de27f911460163","abstract_canon_sha256":"9498bdf13ef03982b68e79e0e1f11c8845831b5221056702e4d0936ee20d1a66"},"schema_version":"1.0"},"canonical_sha256":"d9262dd44d68628dafdcc9d05143e7fe2d7ec522bcd140e2281a2575c05946cc","source":{"kind":"arxiv","id":"1710.08614","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08614","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08614v2","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08614","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"pith_short_12","alias_value":"3ETC3VCNNBRI","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ETC3VCNNBRI3L64","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ETC3VCN","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3ETC3VCNNBRI3L64ZHIFCQ7H7Y","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08614","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-24T06:25:05Z","cross_cats_sorted":[],"title_canon_sha256":"66a6f549c571f50a43d75127b5541c52395b78ca6fd2019551de27f911460163","abstract_canon_sha256":"9498bdf13ef03982b68e79e0e1f11c8845831b5221056702e4d0936ee20d1a66"},"schema_version":"1.0"},"canonical_sha256":"d9262dd44d68628dafdcc9d05143e7fe2d7ec522bcd140e2281a2575c05946cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:20.618096Z","signature_b64":"l2OzpjIHF0Xvs0se49r0GNo1GKxEQRr08lRda3JlvfdNXUg3sd90R/1UtOkslMQqEb+Uq/QhZ+UoP7vxnWEdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9262dd44d68628dafdcc9d05143e7fe2d7ec522bcd140e2281a2575c05946cc","last_reissued_at":"2026-05-18T00:22:20.617550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:20.617550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08614","source_version":2,"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:22:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCQ+IIWB8l9uCwVWgClacZI8KHRcEjmSYmBFb5H18TC7YdTfNT7sFoM/p2FwYYMdB8mj7lgO2FcidjQV1yxbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:46:51.527283Z"},"content_sha256":"f766524e6ae97dd422790507b81cd9cd38f287a531dda9448a48f2500b829a2f","schema_version":"1.0","event_id":"sha256:f766524e6ae97dd422790507b81cd9cd38f287a531dda9448a48f2500b829a2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3ETC3VCNNBRI3L64ZHIFCQ7H7Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Higher-Order Program Verification via HFL Model Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Keiichi Watanabe, Naoki Kobayashi, Takeshi Tsukada","submitted_at":"2017-10-24T06:25:05Z","abstract_excerpt":"There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have not been well studied. In the present paper, we show that various verification problems for functional programs, including may/must-reachability, trace properties, and linear-time temporal properties (and their negations), can be naturally reduced to (extended) HFL model checking. The reductions yield a sound and complete logical characterization of those pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08614","kind":"arxiv","version":2},"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:22:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c0ZoLoSURIlSuU3eKZ5/bUskXd6aP7bwPqQ7i8yWdE3pmeytw/B+5Ym7r3jrheLid01jDHL7OK8k6v7laJW3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:46:51.527661Z"},"content_sha256":"7bef5db6857f000fb61050c4f23a0e56fe8d7e8164ad00d0c806b81b23d2dffe","schema_version":"1.0","event_id":"sha256:7bef5db6857f000fb61050c4f23a0e56fe8d7e8164ad00d0c806b81b23d2dffe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/bundle.json","state_url":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/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-04T02:46:51Z","links":{"resolver":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y","bundle":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/bundle.json","state":"https://pith.science/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ETC3VCNNBRI3L64ZHIFCQ7H7Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3ETC3VCNNBRI3L64ZHIFCQ7H7Y","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":"9498bdf13ef03982b68e79e0e1f11c8845831b5221056702e4d0936ee20d1a66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-24T06:25:05Z","title_canon_sha256":"66a6f549c571f50a43d75127b5541c52395b78ca6fd2019551de27f911460163"},"schema_version":"1.0","source":{"id":"1710.08614","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08614","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08614v2","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08614","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"pith_short_12","alias_value":"3ETC3VCNNBRI","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ETC3VCNNBRI3L64","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ETC3VCN","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:7bef5db6857f000fb61050c4f23a0e56fe8d7e8164ad00d0c806b81b23d2dffe","target":"graph","created_at":"2026-05-18T00:22:20Z","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":"There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have not been well studied. In the present paper, we show that various verification problems for functional programs, including may/must-reachability, trace properties, and linear-time temporal properties (and their negations), can be naturally reduced to (extended) HFL model checking. The reductions yield a sound and complete logical characterization of those pr","authors_text":"Keiichi Watanabe, Naoki Kobayashi, Takeshi Tsukada","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-24T06:25:05Z","title":"Higher-Order Program Verification via HFL Model Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08614","kind":"arxiv","version":2},"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:f766524e6ae97dd422790507b81cd9cd38f287a531dda9448a48f2500b829a2f","target":"record","created_at":"2026-05-18T00:22:20Z","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":"9498bdf13ef03982b68e79e0e1f11c8845831b5221056702e4d0936ee20d1a66","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-10-24T06:25:05Z","title_canon_sha256":"66a6f549c571f50a43d75127b5541c52395b78ca6fd2019551de27f911460163"},"schema_version":"1.0","source":{"id":"1710.08614","kind":"arxiv","version":2}},"canonical_sha256":"d9262dd44d68628dafdcc9d05143e7fe2d7ec522bcd140e2281a2575c05946cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9262dd44d68628dafdcc9d05143e7fe2d7ec522bcd140e2281a2575c05946cc","first_computed_at":"2026-05-18T00:22:20.617550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:20.617550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l2OzpjIHF0Xvs0se49r0GNo1GKxEQRr08lRda3JlvfdNXUg3sd90R/1UtOkslMQqEb+Uq/QhZ+UoP7vxnWEdDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:20.618096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08614","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f766524e6ae97dd422790507b81cd9cd38f287a531dda9448a48f2500b829a2f","sha256:7bef5db6857f000fb61050c4f23a0e56fe8d7e8164ad00d0c806b81b23d2dffe"],"state_sha256":"5eb7c7055aa036e7eff024e41e86c94e6c7715821bce82e3717914f8908a15bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0jEvvyoaZslaFxOI6AvOXtbaR6XW83JNGQmJiwg+1Up7RkMmutzkG1///tPMgdlEdwo9sXcJAcvI5TRGBWTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:46:51.529697Z","bundle_sha256":"070d8c253191f52e1ebee4773e85f7f6835f012b0858168a9c523f62fd0f11c9"}}