{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1995:IUWYGNCQWX6TQNRT6P5SYXHH4M","short_pith_number":"pith:IUWYGNCQ","canonical_record":{"source":{"id":"cs/9505105","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"1995-05-01T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"0118c6733229aacee98baa0974bcc3ee663c4061ef36e950994b284720775ffa","abstract_canon_sha256":"bc57b57fac5422ed95b162f231c6f7cc4c7a72ee21d83090ff39e1beac5c646a"},"schema_version":"1.0"},"canonical_sha256":"452d833450b5fd383633f3fb2c5ce7e3157357a3a1f51a74bb1f11302f96c761","source":{"kind":"arxiv","id":"cs/9505105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9505105","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9505105v1","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9505105","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"IUWYGNCQWX6T","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"IUWYGNCQWX6TQNRT","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"IUWYGNCQ","created_at":"2026-05-18T12:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1995:IUWYGNCQWX6TQNRT6P5SYXHH4M","target":"record","payload":{"canonical_record":{"source":{"id":"cs/9505105","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"1995-05-01T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"0118c6733229aacee98baa0974bcc3ee663c4061ef36e950994b284720775ffa","abstract_canon_sha256":"bc57b57fac5422ed95b162f231c6f7cc4c7a72ee21d83090ff39e1beac5c646a"},"schema_version":"1.0"},"canonical_sha256":"452d833450b5fd383633f3fb2c5ce7e3157357a3a1f51a74bb1f11302f96c761","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:36.797232Z","signature_b64":"GlX9b1lKPDrsJzFL6L0VGT+rfJ1TB9CWbqd9ZYumC8Kpt36zAiYqUceg0sfQ5F0MO5g4OUwR3OrvH+JLpf0tAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"452d833450b5fd383633f3fb2c5ce7e3157357a3a1f51a74bb1f11302f96c761","last_reissued_at":"2026-05-18T02:37:36.796777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:36.796777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/9505105","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-18T02:37:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1F4v8AiMa8L+nsji49HC+OSSmr5iWphhKzjTfw9glW0sn6dlYMZ4/7Vg+uWNfHot/J+M2AwSPUrEDPmcPSZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:01:21.235727Z"},"content_sha256":"7470780d1c697246b81144ca27d142e60e592ebae3f3826c09591e1e617d45ad","schema_version":"1.0","event_id":"sha256:7470780d1c697246b81144ca27d142e60e592ebae3f3826c09591e1e617d45ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1995:IUWYGNCQWX6TQNRT6P5SYXHH4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pac-learning Recursive Logic Programs: Negative Results","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"W. W. Cohen","submitted_at":"1995-05-01T00:00:00Z","abstract_excerpt":"In a companion paper it was shown that the class of constant-depth determinate k-ary recursive clauses is efficiently learnable. In this paper we present negative results showing that any natural generalization of this class is hard to learn in Valiant's model of pac-learnability. In particular, we show that the following program classes are cryptographically hard to learn: programs with an unbounded number of constant-depth linear recursive clauses; programs with one constant-depth determinate clause containing an unbounded number of recursive calls; and programs with one linear recursive cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9505105","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-18T02:37:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MR6ZKYBG0APBFMNRMyVY/eKiu+a3Tc24/jdrFIt3CmsTaTMbvBABng5DUp4ed0wqb4IWhF1CYFpdgX8FkrWaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T19:01:21.236069Z"},"content_sha256":"fb7a60931451fcee52e80f540661e1948b6d27705d09d9a3c92b47b5fb4210df","schema_version":"1.0","event_id":"sha256:fb7a60931451fcee52e80f540661e1948b6d27705d09d9a3c92b47b5fb4210df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/bundle.json","state_url":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/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-27T19:01:21Z","links":{"resolver":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M","bundle":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/bundle.json","state":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1995:IUWYGNCQWX6TQNRT6P5SYXHH4M","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":"bc57b57fac5422ed95b162f231c6f7cc4c7a72ee21d83090ff39e1beac5c646a","cross_cats_sorted":[],"license":"","primary_cat":"cs.AI","submitted_at":"1995-05-01T00:00:00Z","title_canon_sha256":"0118c6733229aacee98baa0974bcc3ee663c4061ef36e950994b284720775ffa"},"schema_version":"1.0","source":{"id":"cs/9505105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9505105","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9505105v1","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9505105","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"IUWYGNCQWX6T","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"IUWYGNCQWX6TQNRT","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"IUWYGNCQ","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:fb7a60931451fcee52e80f540661e1948b6d27705d09d9a3c92b47b5fb4210df","target":"graph","created_at":"2026-05-18T02:37:36Z","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":"In a companion paper it was shown that the class of constant-depth determinate k-ary recursive clauses is efficiently learnable. In this paper we present negative results showing that any natural generalization of this class is hard to learn in Valiant's model of pac-learnability. In particular, we show that the following program classes are cryptographically hard to learn: programs with an unbounded number of constant-depth linear recursive clauses; programs with one constant-depth determinate clause containing an unbounded number of recursive calls; and programs with one linear recursive cla","authors_text":"W. W. Cohen","cross_cats":[],"headline":"","license":"","primary_cat":"cs.AI","submitted_at":"1995-05-01T00:00:00Z","title":"Pac-learning Recursive Logic Programs: Negative Results"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9505105","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:7470780d1c697246b81144ca27d142e60e592ebae3f3826c09591e1e617d45ad","target":"record","created_at":"2026-05-18T02:37:36Z","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":"bc57b57fac5422ed95b162f231c6f7cc4c7a72ee21d83090ff39e1beac5c646a","cross_cats_sorted":[],"license":"","primary_cat":"cs.AI","submitted_at":"1995-05-01T00:00:00Z","title_canon_sha256":"0118c6733229aacee98baa0974bcc3ee663c4061ef36e950994b284720775ffa"},"schema_version":"1.0","source":{"id":"cs/9505105","kind":"arxiv","version":1}},"canonical_sha256":"452d833450b5fd383633f3fb2c5ce7e3157357a3a1f51a74bb1f11302f96c761","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"452d833450b5fd383633f3fb2c5ce7e3157357a3a1f51a74bb1f11302f96c761","first_computed_at":"2026-05-18T02:37:36.796777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:36.796777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GlX9b1lKPDrsJzFL6L0VGT+rfJ1TB9CWbqd9ZYumC8Kpt36zAiYqUceg0sfQ5F0MO5g4OUwR3OrvH+JLpf0tAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:36.797232Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/9505105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7470780d1c697246b81144ca27d142e60e592ebae3f3826c09591e1e617d45ad","sha256:fb7a60931451fcee52e80f540661e1948b6d27705d09d9a3c92b47b5fb4210df"],"state_sha256":"f9f10b47d01887c2b15a6ea52595e519c6a9fa8507e3bd3dda740510fb453657"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+vTCdubiymnXj+tcRS6zXLHm6Jq3R98NVBve5TEyaLJKvGaUMXJcH5SzLhAlhCGae7gj6N7/KcjbWIchtC6BBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T19:01:21.238017Z","bundle_sha256":"0b5a6ad31802a15adfb64e64aa4ccfb9848da5169ad7515fd74c3f4a74a77c80"}}