{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1995:IUWYGNCQWX6TQNRT6P5SYXHH4M","short_pith_number":"pith:IUWYGNCQ","schema_version":"1.0","canonical_sha256":"452d833450b5fd383633f3fb2c5ce7e3157357a3a1f51a74bb1f11302f96c761","source":{"kind":"arxiv","id":"cs/9505105","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/9505105","created_at":"2026-05-18T02:37:36.796847+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9505105v1","created_at":"2026-05-18T02:37:36.796847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9505105","created_at":"2026-05-18T02:37:36.796847+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUWYGNCQWX6T","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUWYGNCQWX6TQNRT","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUWYGNCQ","created_at":"2026-05-18T12:25:47.700082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M","json":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M.json","graph_json":"https://pith.science/api/pith-number/IUWYGNCQWX6TQNRT6P5SYXHH4M/graph.json","events_json":"https://pith.science/api/pith-number/IUWYGNCQWX6TQNRT6P5SYXHH4M/events.json","paper":"https://pith.science/paper/IUWYGNCQ"},"agent_actions":{"view_html":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M","download_json":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M.json","view_paper":"https://pith.science/paper/IUWYGNCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9505105&json=true","fetch_graph":"https://pith.science/api/pith-number/IUWYGNCQWX6TQNRT6P5SYXHH4M/graph.json","fetch_events":"https://pith.science/api/pith-number/IUWYGNCQWX6TQNRT6P5SYXHH4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/action/storage_attestation","attest_author":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/action/author_attestation","sign_citation":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/action/citation_signature","submit_replication":"https://pith.science/pith/IUWYGNCQWX6TQNRT6P5SYXHH4M/action/replication_record"}},"created_at":"2026-05-18T02:37:36.796847+00:00","updated_at":"2026-05-18T02:37:36.796847+00:00"}