{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WZH3HJTYJNPX42W3OWYUBRKMSO","short_pith_number":"pith:WZH3HJTY","canonical_record":{"source":{"id":"1507.06944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-24T18:20:20Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"2874b7de721ac93d113d3f98010fc4dabe260d61ed6dcaa083a01bba70845015","abstract_canon_sha256":"06ea4413aa32a8f55972a03d3a8f6d836184239d06484677af2f81786ad1b0f5"},"schema_version":"1.0"},"canonical_sha256":"b64fb3a6784b5f7e6adb75b140c54c9398a479f6e6020592e701d949b626ba3c","source":{"kind":"arxiv","id":"1507.06944","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06944","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06944v1","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06944","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"WZH3HJTYJNPX","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WZH3HJTYJNPX42W3","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WZH3HJTY","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WZH3HJTYJNPX42W3OWYUBRKMSO","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-24T18:20:20Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"2874b7de721ac93d113d3f98010fc4dabe260d61ed6dcaa083a01bba70845015","abstract_canon_sha256":"06ea4413aa32a8f55972a03d3a8f6d836184239d06484677af2f81786ad1b0f5"},"schema_version":"1.0"},"canonical_sha256":"b64fb3a6784b5f7e6adb75b140c54c9398a479f6e6020592e701d949b626ba3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:21.606854Z","signature_b64":"Mks72Y+BOuoQcGv6Vnc2o+0Yz4/MVgATy3tC8CqQxuenbtJ0hCu8YrtMC7HYE+iDRN4wpDeWrr+mPDepMNbZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b64fb3a6784b5f7e6adb75b140c54c9398a479f6e6020592e701d949b626ba3c","last_reissued_at":"2026-05-18T01:36:21.606215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:21.606215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06944","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-18T01:36:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ua7VO6ilqmR0s+vFCgWjtLsVIG1FEcAOTWYBqVqq0YpoI2mRMdwLOBwevOOErM4T0aobIlH7qyoKdEvfld+IBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:51:37.952628Z"},"content_sha256":"b7bfd3e38189cf3597cd1a31d8e678e2b8f367931dd2e56af198d5e8eb9721b2","schema_version":"1.0","event_id":"sha256:b7bfd3e38189cf3597cd1a31d8e678e2b8f367931dd2e56af198d5e8eb9721b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WZH3HJTYJNPX42W3OWYUBRKMSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Paul Tarau","submitted_at":"2015-07-24T18:20:20Z","abstract_excerpt":"With sound unification, Definite Clause Grammars and compact expression of combinatorial generation algorithms, logic programming is shown to conveniently host a declarative playground where interesting properties and behaviors emerge from the interaction of heterogenous but deeply connected computational objects.\n  Compact combinatorial generation algorithms are given for several families of lambda terms, including open, closed, simply typed and linear terms as well as type inference and normal order reduction algorithms. We describe a Prolog-based combined lambda term generator and type-infe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06944","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-18T01:36:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFQmr9pGNWUAoF2tJYOBA+uX3XdFdz4kExUOUwfIAs8Ca5TFC9+OkoNRorwlKobwAqbBPAdNiKoGrUEYPoeVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:51:37.952974Z"},"content_sha256":"7b6771fb32fa3ce858621dcda72bbf3cb36c67c93bf36d608c0a6239f83559e8","schema_version":"1.0","event_id":"sha256:7b6771fb32fa3ce858621dcda72bbf3cb36c67c93bf36d608c0a6239f83559e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZH3HJTYJNPX42W3OWYUBRKMSO/bundle.json","state_url":"https://pith.science/pith/WZH3HJTYJNPX42W3OWYUBRKMSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZH3HJTYJNPX42W3OWYUBRKMSO/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-25T10:51:37Z","links":{"resolver":"https://pith.science/pith/WZH3HJTYJNPX42W3OWYUBRKMSO","bundle":"https://pith.science/pith/WZH3HJTYJNPX42W3OWYUBRKMSO/bundle.json","state":"https://pith.science/pith/WZH3HJTYJNPX42W3OWYUBRKMSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZH3HJTYJNPX42W3OWYUBRKMSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WZH3HJTYJNPX42W3OWYUBRKMSO","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":"06ea4413aa32a8f55972a03d3a8f6d836184239d06484677af2f81786ad1b0f5","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-24T18:20:20Z","title_canon_sha256":"2874b7de721ac93d113d3f98010fc4dabe260d61ed6dcaa083a01bba70845015"},"schema_version":"1.0","source":{"id":"1507.06944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06944","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06944v1","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06944","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"WZH3HJTYJNPX","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WZH3HJTYJNPX42W3","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WZH3HJTY","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:7b6771fb32fa3ce858621dcda72bbf3cb36c67c93bf36d608c0a6239f83559e8","target":"graph","created_at":"2026-05-18T01:36:21Z","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":"With sound unification, Definite Clause Grammars and compact expression of combinatorial generation algorithms, logic programming is shown to conveniently host a declarative playground where interesting properties and behaviors emerge from the interaction of heterogenous but deeply connected computational objects.\n  Compact combinatorial generation algorithms are given for several families of lambda terms, including open, closed, simply typed and linear terms as well as type inference and normal order reduction algorithms. We describe a Prolog-based combined lambda term generator and type-infe","authors_text":"Paul Tarau","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-24T18:20:20Z","title":"A Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06944","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:b7bfd3e38189cf3597cd1a31d8e678e2b8f367931dd2e56af198d5e8eb9721b2","target":"record","created_at":"2026-05-18T01:36:21Z","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":"06ea4413aa32a8f55972a03d3a8f6d836184239d06484677af2f81786ad1b0f5","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-07-24T18:20:20Z","title_canon_sha256":"2874b7de721ac93d113d3f98010fc4dabe260d61ed6dcaa083a01bba70845015"},"schema_version":"1.0","source":{"id":"1507.06944","kind":"arxiv","version":1}},"canonical_sha256":"b64fb3a6784b5f7e6adb75b140c54c9398a479f6e6020592e701d949b626ba3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b64fb3a6784b5f7e6adb75b140c54c9398a479f6e6020592e701d949b626ba3c","first_computed_at":"2026-05-18T01:36:21.606215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:21.606215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mks72Y+BOuoQcGv6Vnc2o+0Yz4/MVgATy3tC8CqQxuenbtJ0hCu8YrtMC7HYE+iDRN4wpDeWrr+mPDepMNbZBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:21.606854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7bfd3e38189cf3597cd1a31d8e678e2b8f367931dd2e56af198d5e8eb9721b2","sha256:7b6771fb32fa3ce858621dcda72bbf3cb36c67c93bf36d608c0a6239f83559e8"],"state_sha256":"693830a4a09575abf0834cb44a4a9fd32b938f9cc4dd932f045c1ca9e5d03337"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QAdcP2djs679hlh98Dj90xXHd4IXbWtDrRUn6YaXYZeA+IGQdq/Q0fdcVGbR2sWYfBXm1xRQXb/jWTVWPdqtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:51:37.954909Z","bundle_sha256":"092e16e2c0ae212615c87b09b9f6d252220b80bd0008394fada6a7113f0c4e09"}}