{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EH4WVKPAHF7ODGZRO56PNBWTA7","short_pith_number":"pith:EH4WVKPA","canonical_record":{"source":{"id":"1204.2768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-12T16:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"4b53f8f3ceedf20bb8d45b359fe21e820d05bc050218587714f0e0b7a3af4635","abstract_canon_sha256":"b33482e97f392959bdd6927a55f7871e700da3244eee9702e8b4005e4dd26151"},"schema_version":"1.0"},"canonical_sha256":"21f96aa9e0397ee19b31777cf686d307c5664193871394de907c469704a25173","source":{"kind":"arxiv","id":"1204.2768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2768","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2768v1","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2768","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"EH4WVKPAHF7O","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EH4WVKPAHF7ODGZR","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EH4WVKPA","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EH4WVKPAHF7ODGZRO56PNBWTA7","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-12T16:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"4b53f8f3ceedf20bb8d45b359fe21e820d05bc050218587714f0e0b7a3af4635","abstract_canon_sha256":"b33482e97f392959bdd6927a55f7871e700da3244eee9702e8b4005e4dd26151"},"schema_version":"1.0"},"canonical_sha256":"21f96aa9e0397ee19b31777cf686d307c5664193871394de907c469704a25173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:03.579411Z","signature_b64":"DeA+59d0Dg0DFYj8HPV32ZhFrgJlkuZrSmzxjo3Yfi5qS8O9AMJ1z8Ydrx9vneQhgroNojlVZtsl/FzAOmZvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21f96aa9e0397ee19b31777cf686d307c5664193871394de907c469704a25173","last_reissued_at":"2026-05-18T03:58:03.578961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:03.578961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2768","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-18T03:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnoyZwxw6BB69bmvzdRVWRd3aNqhfMVIqzq3hc4Im3bZVEQ56Kn5W7P7DuBFxzL6ovEuDCnz7dYYPF0siztsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:55:38.649718Z"},"content_sha256":"8980d5b5de73f787fd053a3049070ed66e54cf12457cdb9008e5c8c187268fb8","schema_version":"1.0","event_id":"sha256:8980d5b5de73f787fd053a3049070ed66e54cf12457cdb9008e5c8c187268fb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EH4WVKPAHF7ODGZRO56PNBWTA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Layered Fixed Point Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Flemming Nielson, Hanne Riis Nielson, Piotr Filipiuk","submitted_at":"2012-04-12T16:35:36Z","abstract_excerpt":"We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2768","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-18T03:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6W0OQPMBrWjZwEsjU1a7bhgowKic/NPc4bKjL0oztViBijoOXlN0rrjxPMnhIP2a9O3K81DLgikgas/WGppDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:55:38.650068Z"},"content_sha256":"584542d2514ab34337dec29fe068c5d9e4d4bce4c26935ee7f2519b05473e695","schema_version":"1.0","event_id":"sha256:584542d2514ab34337dec29fe068c5d9e4d4bce4c26935ee7f2519b05473e695"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EH4WVKPAHF7ODGZRO56PNBWTA7/bundle.json","state_url":"https://pith.science/pith/EH4WVKPAHF7ODGZRO56PNBWTA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EH4WVKPAHF7ODGZRO56PNBWTA7/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-05-31T06:55:38Z","links":{"resolver":"https://pith.science/pith/EH4WVKPAHF7ODGZRO56PNBWTA7","bundle":"https://pith.science/pith/EH4WVKPAHF7ODGZRO56PNBWTA7/bundle.json","state":"https://pith.science/pith/EH4WVKPAHF7ODGZRO56PNBWTA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EH4WVKPAHF7ODGZRO56PNBWTA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EH4WVKPAHF7ODGZRO56PNBWTA7","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":"b33482e97f392959bdd6927a55f7871e700da3244eee9702e8b4005e4dd26151","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-12T16:35:36Z","title_canon_sha256":"4b53f8f3ceedf20bb8d45b359fe21e820d05bc050218587714f0e0b7a3af4635"},"schema_version":"1.0","source":{"id":"1204.2768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2768","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2768v1","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2768","created_at":"2026-05-18T03:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"EH4WVKPAHF7O","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EH4WVKPAHF7ODGZR","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EH4WVKPA","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:584542d2514ab34337dec29fe068c5d9e4d4bce4c26935ee7f2519b05473e695","target":"graph","created_at":"2026-05-18T03:58:03Z","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":"We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases t","authors_text":"Flemming Nielson, Hanne Riis Nielson, Piotr Filipiuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-12T16:35:36Z","title":"Layered Fixed Point Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2768","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:8980d5b5de73f787fd053a3049070ed66e54cf12457cdb9008e5c8c187268fb8","target":"record","created_at":"2026-05-18T03:58:03Z","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":"b33482e97f392959bdd6927a55f7871e700da3244eee9702e8b4005e4dd26151","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-12T16:35:36Z","title_canon_sha256":"4b53f8f3ceedf20bb8d45b359fe21e820d05bc050218587714f0e0b7a3af4635"},"schema_version":"1.0","source":{"id":"1204.2768","kind":"arxiv","version":1}},"canonical_sha256":"21f96aa9e0397ee19b31777cf686d307c5664193871394de907c469704a25173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21f96aa9e0397ee19b31777cf686d307c5664193871394de907c469704a25173","first_computed_at":"2026-05-18T03:58:03.578961Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:03.578961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DeA+59d0Dg0DFYj8HPV32ZhFrgJlkuZrSmzxjo3Yfi5qS8O9AMJ1z8Ydrx9vneQhgroNojlVZtsl/FzAOmZvDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:03.579411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8980d5b5de73f787fd053a3049070ed66e54cf12457cdb9008e5c8c187268fb8","sha256:584542d2514ab34337dec29fe068c5d9e4d4bce4c26935ee7f2519b05473e695"],"state_sha256":"476558d5a4c186f720174d34551fb52120b7f8ed97e5b3c79b4a0efe85a89117"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tHd+F6ip/B8frlPepFkAMMLXrMpDceyhgpuQfJRb/Urow8YHPMkAh6fYjF31n5zVJzTD3/LrdiqWVxDh9z2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:55:38.652230Z","bundle_sha256":"e96f0378af463652192d33640a7c773659584fa910bb78a189327c89614bb465"}}