{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:MB5FMFNOCTGVSPUCVLCWX4AOEX","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":"420cf3f2093d613cde33fa15c70dbe8e1f4a32e3292111018d652e712a168a6a","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2007-04-30T13:09:20Z","title_canon_sha256":"558663969a96e9824fe364fdf99585884400d236abbfd94befe502b05d4e9108"},"schema_version":"1.0","source":{"id":"0704.3931","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0704.3931","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"arxiv_version","alias_value":"0704.3931v2","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.3931","created_at":"2026-05-18T01:37:42Z"},{"alias_kind":"pith_short_12","alias_value":"MB5FMFNOCTGV","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"MB5FMFNOCTGVSPUC","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"MB5FMFNO","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:db8ebfb1a5a90cc32769974639646e850aa6e7eb4ae5eaeecac3b707dd1f0998","target":"graph","created_at":"2026-05-18T01:37:42Z","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":"Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \\lambda-calculus and the modal \\lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of programs that are not expressible in the modal \\lambda-calculus.\n  This paper provides complexity results for its model checking problem. In particular we consider those fragments of HFL built by using only types of bounded order k and arity m. We establish k-fold exponential time completeness for model checking each such fragment. For the upper bound we use","authors_text":"Martin Lange, Rafal Somla, Roland Axelsson","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2007-04-30T13:09:20Z","title":"The Complexity of Model Checking Higher-Order Fixpoint Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.3931","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:6406cb34b05275ed1ce7e750e4216cdffe355c38094649a9e4f21db515b73809","target":"record","created_at":"2026-05-18T01:37:42Z","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":"420cf3f2093d613cde33fa15c70dbe8e1f4a32e3292111018d652e712a168a6a","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2007-04-30T13:09:20Z","title_canon_sha256":"558663969a96e9824fe364fdf99585884400d236abbfd94befe502b05d4e9108"},"schema_version":"1.0","source":{"id":"0704.3931","kind":"arxiv","version":2}},"canonical_sha256":"607a5615ae14cd593e82aac56bf00e25f686d60172893395b02de9a366f6ea37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"607a5615ae14cd593e82aac56bf00e25f686d60172893395b02de9a366f6ea37","first_computed_at":"2026-05-18T01:37:42.766632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:42.766632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W9tUKaEVAMi7+IAOftQKhub0RxgvOyMkU8wLgMsDR6VEOHUB17K6F7fX1tlaVYabQLSpfNTUpUiCaiLYyFn8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:42.767250Z","signed_message":"canonical_sha256_bytes"},"source_id":"0704.3931","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6406cb34b05275ed1ce7e750e4216cdffe355c38094649a9e4f21db515b73809","sha256:db8ebfb1a5a90cc32769974639646e850aa6e7eb4ae5eaeecac3b707dd1f0998"],"state_sha256":"e19e7aa2daeaaa223378512a33bc50cff53863edb71843175e35da69fc127101"}