{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:567EC5XTFNA2APWFVZTTOYLNGW","short_pith_number":"pith:567EC5XT","canonical_record":{"source":{"id":"1503.04320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-14T16:29:34Z","cross_cats_sorted":[],"title_canon_sha256":"96ca7138673112e5969e55f605a4600c3c6aeb597f61117ac12a777646e316d8","abstract_canon_sha256":"a7b18c9114f6c8677ffcc88398592cd49557e03835daa5b2390aca446f3d23f3"},"schema_version":"1.0"},"canonical_sha256":"efbe4176f32b41a03ec5ae6737616d35aef12aa9e4c2d6b193ed9a31a5ac76cb","source":{"kind":"arxiv","id":"1503.04320","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04320","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04320v2","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04320","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"567EC5XTFNA2","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"567EC5XTFNA2APWF","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"567EC5XT","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:567EC5XTFNA2APWFVZTTOYLNGW","target":"record","payload":{"canonical_record":{"source":{"id":"1503.04320","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-14T16:29:34Z","cross_cats_sorted":[],"title_canon_sha256":"96ca7138673112e5969e55f605a4600c3c6aeb597f61117ac12a777646e316d8","abstract_canon_sha256":"a7b18c9114f6c8677ffcc88398592cd49557e03835daa5b2390aca446f3d23f3"},"schema_version":"1.0"},"canonical_sha256":"efbe4176f32b41a03ec5ae6737616d35aef12aa9e4c2d6b193ed9a31a5ac76cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:10.862930Z","signature_b64":"2qKaHen3XEweL6vPnBQyBV4rqbIpKpuWnZW6UIeOyzCjNdavnncbHfyb//mt67pz+aDOI7ScbEkkfcbdZt8cBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efbe4176f32b41a03ec5ae6737616d35aef12aa9e4c2d6b193ed9a31a5ac76cb","last_reissued_at":"2026-05-18T00:53:10.862468Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:10.862468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.04320","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:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPzIUuYe0axfP5RAAr8/0KW0g9YtLps/2Hsq09/63f2Lwyrsv0oitFHMqU+nrdbS7Q1eEUlXtpHbbP6KCyG7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:26:32.768403Z"},"content_sha256":"f892ec9bb8a139c7398eb785c32408f9c02da9e5676c9860b2caa9af394effe8","schema_version":"1.0","event_id":"sha256:f892ec9bb8a139c7398eb785c32408f9c02da9e5676c9860b2caa9af394effe8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:567EC5XTFNA2APWFVZTTOYLNGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using models to model-check recursive schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Igor Walukiewicz (CNRS, LaBRI, Sylvain Salvati (INRIA, universit\\'e de Bordeaux)","submitted_at":"2015-03-14T16:29:34Z","abstract_excerpt":"We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivalent to schemes, we propose the use of a model of lambda-Y-calculus to discriminate the terms that satisfy a given property. If a model is finite in every type, this gives a decision procedure. We provide a construction of such a model for every property expressed by automata with trivial acceptance conditions and divergence testing. Such properties pose already interesting challenges for model construction. Moreover, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04320","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:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRt0X2W/AbTdvdcI1TNf/Pz7ZOTdOFXv352+wJFLNbCsvIvwTcs3f0pJigYhxc2KGTe0NqbQy0SVBwCsfmnCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:26:32.768754Z"},"content_sha256":"935303ddb8c5089bec5fb5daccd05d2d6e8b1ead43c11c27f782673732df6ff4","schema_version":"1.0","event_id":"sha256:935303ddb8c5089bec5fb5daccd05d2d6e8b1ead43c11c27f782673732df6ff4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW/bundle.json","state_url":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/567EC5XTFNA2APWFVZTTOYLNGW/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-24T13:26:32Z","links":{"resolver":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW","bundle":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW/bundle.json","state":"https://pith.science/pith/567EC5XTFNA2APWFVZTTOYLNGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/567EC5XTFNA2APWFVZTTOYLNGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:567EC5XTFNA2APWFVZTTOYLNGW","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":"a7b18c9114f6c8677ffcc88398592cd49557e03835daa5b2390aca446f3d23f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-14T16:29:34Z","title_canon_sha256":"96ca7138673112e5969e55f605a4600c3c6aeb597f61117ac12a777646e316d8"},"schema_version":"1.0","source":{"id":"1503.04320","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04320","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04320v2","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04320","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"567EC5XTFNA2","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"567EC5XTFNA2APWF","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"567EC5XT","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:935303ddb8c5089bec5fb5daccd05d2d6e8b1ead43c11c27f782673732df6ff4","target":"graph","created_at":"2026-05-18T00:53:10Z","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 propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivalent to schemes, we propose the use of a model of lambda-Y-calculus to discriminate the terms that satisfy a given property. If a model is finite in every type, this gives a decision procedure. We provide a construction of such a model for every property expressed by automata with trivial acceptance conditions and divergence testing. Such properties pose already interesting challenges for model construction. Moreover, ","authors_text":"Igor Walukiewicz (CNRS, LaBRI, Sylvain Salvati (INRIA, universit\\'e de Bordeaux)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-14T16:29:34Z","title":"Using models to model-check recursive schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04320","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:f892ec9bb8a139c7398eb785c32408f9c02da9e5676c9860b2caa9af394effe8","target":"record","created_at":"2026-05-18T00:53:10Z","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":"a7b18c9114f6c8677ffcc88398592cd49557e03835daa5b2390aca446f3d23f3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-03-14T16:29:34Z","title_canon_sha256":"96ca7138673112e5969e55f605a4600c3c6aeb597f61117ac12a777646e316d8"},"schema_version":"1.0","source":{"id":"1503.04320","kind":"arxiv","version":2}},"canonical_sha256":"efbe4176f32b41a03ec5ae6737616d35aef12aa9e4c2d6b193ed9a31a5ac76cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efbe4176f32b41a03ec5ae6737616d35aef12aa9e4c2d6b193ed9a31a5ac76cb","first_computed_at":"2026-05-18T00:53:10.862468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:10.862468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2qKaHen3XEweL6vPnBQyBV4rqbIpKpuWnZW6UIeOyzCjNdavnncbHfyb//mt67pz+aDOI7ScbEkkfcbdZt8cBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:10.862930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04320","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f892ec9bb8a139c7398eb785c32408f9c02da9e5676c9860b2caa9af394effe8","sha256:935303ddb8c5089bec5fb5daccd05d2d6e8b1ead43c11c27f782673732df6ff4"],"state_sha256":"1608d4b73a4c0ce28a8b17881d911ef3a71f7df58beaa83fad96f91e01e8c017"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xY2y9LTZp2pHyb5Iu/74//gduFhGJGOt34sT1/XuCqxLiv8hHBQs6U7y+fSGFFyNQQVV/QF4Q/zXxyG9z7mvBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:26:32.770709Z","bundle_sha256":"4ba7de9b1727e2a9e7cfb1e535ffacbc04f20befc9915e40c761cc7016210a84"}}