{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LU4ZMDK26ZU24K46VUOS4XXL6M","short_pith_number":"pith:LU4ZMDK2","canonical_record":{"source":{"id":"1607.04908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-17T19:30:40Z","cross_cats_sorted":[],"title_canon_sha256":"6dbb5285d00fabb79a114fd8b800f048613d158f28ffa996df1778e97d219aaa","abstract_canon_sha256":"7d937630523d77c7dd9991d63ce2857280ef24c5816f02f32eb72ea001fd20ff"},"schema_version":"1.0"},"canonical_sha256":"5d39960d5af669ae2b9ead1d2e5eebf30a57721a18d0daed7139f5a154d802f2","source":{"kind":"arxiv","id":"1607.04908","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04908","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04908v1","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04908","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"LU4ZMDK26ZU2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LU4ZMDK26ZU24K46","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LU4ZMDK2","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LU4ZMDK26ZU24K46VUOS4XXL6M","target":"record","payload":{"canonical_record":{"source":{"id":"1607.04908","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-17T19:30:40Z","cross_cats_sorted":[],"title_canon_sha256":"6dbb5285d00fabb79a114fd8b800f048613d158f28ffa996df1778e97d219aaa","abstract_canon_sha256":"7d937630523d77c7dd9991d63ce2857280ef24c5816f02f32eb72ea001fd20ff"},"schema_version":"1.0"},"canonical_sha256":"5d39960d5af669ae2b9ead1d2e5eebf30a57721a18d0daed7139f5a154d802f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:56.388762Z","signature_b64":"10RS9kSAYmJHtl7lrCn5wG4lnnJpeNz18q3ZWNFBCawnUcpgUSYfWbiYMQTsFIbOJj/g20hqwIHsLNO+XCIuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d39960d5af669ae2b9ead1d2e5eebf30a57721a18d0daed7139f5a154d802f2","last_reissued_at":"2026-05-18T01:10:56.388198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:56.388198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.04908","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:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4jarqVaU/uG0lfxn9cleAsRvJ38oKsC/LBDZw8omGdDTZ4BPho+9qsGcQzz5rDxN7c7tsEIf/8IvFDWR4xitBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:47.280825Z"},"content_sha256":"8ce1ba7b335742b7df68e9a3bcfb11987b9f5ea0d45246e7d56c75653de75a72","schema_version":"1.0","event_id":"sha256:8ce1ba7b335742b7df68e9a3bcfb11987b9f5ea0d45246e7d56c75653de75a72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LU4ZMDK26ZU24K46VUOS4XXL6M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the likelihood of normalisation in combinatory logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Katarzyna Grygiel, Maciej Bendkowski, Marek Zaionc","submitted_at":"2016-07-17T19:30:40Z","abstract_excerpt":"We present a quantitative basis-independent analysis of combinatory logic. Using a general argument regarding plane binary trees with labelled leaves, we generalise the results of David et al. and Bendkowski et al. to all Turing-complete combinator bases proving, inter alia, that asymptotically almost no combinator is strongly normalising nor typeable. We exploit the structure of recently discovered normal-order reduction grammars showing that for each positive $n$, the set of $\\mathbf{S} \\mathbf{K}$-combinators reducing in $n$ normal-order reduction steps has positive asymptotic density in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04908","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:10:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C3BQVeln8ZNVBWESLi1i0JG9l2a2nIBUIiHwH8Bi/pfOGfvufESrNmpeO8y9XS+iVv86U4tXH8aEiLt5H9I1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:47.281570Z"},"content_sha256":"68805bbfd8f12bd0d8eec6f39202cc7031683deb0fdc0d379f510cfd0f9f76c5","schema_version":"1.0","event_id":"sha256:68805bbfd8f12bd0d8eec6f39202cc7031683deb0fdc0d379f510cfd0f9f76c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LU4ZMDK26ZU24K46VUOS4XXL6M/bundle.json","state_url":"https://pith.science/pith/LU4ZMDK26ZU24K46VUOS4XXL6M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LU4ZMDK26ZU24K46VUOS4XXL6M/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-11T22:08:47Z","links":{"resolver":"https://pith.science/pith/LU4ZMDK26ZU24K46VUOS4XXL6M","bundle":"https://pith.science/pith/LU4ZMDK26ZU24K46VUOS4XXL6M/bundle.json","state":"https://pith.science/pith/LU4ZMDK26ZU24K46VUOS4XXL6M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LU4ZMDK26ZU24K46VUOS4XXL6M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LU4ZMDK26ZU24K46VUOS4XXL6M","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":"7d937630523d77c7dd9991d63ce2857280ef24c5816f02f32eb72ea001fd20ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-17T19:30:40Z","title_canon_sha256":"6dbb5285d00fabb79a114fd8b800f048613d158f28ffa996df1778e97d219aaa"},"schema_version":"1.0","source":{"id":"1607.04908","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04908","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04908v1","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04908","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"LU4ZMDK26ZU2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LU4ZMDK26ZU24K46","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LU4ZMDK2","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:68805bbfd8f12bd0d8eec6f39202cc7031683deb0fdc0d379f510cfd0f9f76c5","target":"graph","created_at":"2026-05-18T01:10:56Z","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 quantitative basis-independent analysis of combinatory logic. Using a general argument regarding plane binary trees with labelled leaves, we generalise the results of David et al. and Bendkowski et al. to all Turing-complete combinator bases proving, inter alia, that asymptotically almost no combinator is strongly normalising nor typeable. We exploit the structure of recently discovered normal-order reduction grammars showing that for each positive $n$, the set of $\\mathbf{S} \\mathbf{K}$-combinators reducing in $n$ normal-order reduction steps has positive asymptotic density in th","authors_text":"Katarzyna Grygiel, Maciej Bendkowski, Marek Zaionc","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-17T19:30:40Z","title":"On the likelihood of normalisation in combinatory logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04908","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:8ce1ba7b335742b7df68e9a3bcfb11987b9f5ea0d45246e7d56c75653de75a72","target":"record","created_at":"2026-05-18T01:10:56Z","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":"7d937630523d77c7dd9991d63ce2857280ef24c5816f02f32eb72ea001fd20ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-07-17T19:30:40Z","title_canon_sha256":"6dbb5285d00fabb79a114fd8b800f048613d158f28ffa996df1778e97d219aaa"},"schema_version":"1.0","source":{"id":"1607.04908","kind":"arxiv","version":1}},"canonical_sha256":"5d39960d5af669ae2b9ead1d2e5eebf30a57721a18d0daed7139f5a154d802f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d39960d5af669ae2b9ead1d2e5eebf30a57721a18d0daed7139f5a154d802f2","first_computed_at":"2026-05-18T01:10:56.388198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:56.388198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"10RS9kSAYmJHtl7lrCn5wG4lnnJpeNz18q3ZWNFBCawnUcpgUSYfWbiYMQTsFIbOJj/g20hqwIHsLNO+XCIuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:56.388762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04908","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ce1ba7b335742b7df68e9a3bcfb11987b9f5ea0d45246e7d56c75653de75a72","sha256:68805bbfd8f12bd0d8eec6f39202cc7031683deb0fdc0d379f510cfd0f9f76c5"],"state_sha256":"7baaf333777cf0c86128155596a9e9d7fa88ddf2d600a3c6764a7386180385a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q1HGdlcRV26sPjaLz55B9BU1ZIIzSJuDrN4qmfCuhOoZ7FgPRGmh79uqy4W9S8TgcriPcByLmRrDcSd5XLJGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:08:47.285500Z","bundle_sha256":"63d44fcda95676dc4b698b8fa746187e233daade8da9829ea541d3b167382545"}}