{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1995:4JGWNEPCQPGAZILV3ATNBDW4WG","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":"ba6cd4026ffb69cf876ded93f761ee8cee4f49854762e129f180df5bad4ed858","cross_cats_sorted":[],"license":"","primary_cat":"cs.AI","submitted_at":"1995-05-01T00:00:00Z","title_canon_sha256":"49d5ee7b0ac08969c73315da0768168618a3865a14cd5eade304b437d88dad71"},"schema_version":"1.0","source":{"id":"cs/9505104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9505104","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9505104v1","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9505104","created_at":"2026-05-18T02:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"4JGWNEPCQPGA","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"4JGWNEPCQPGAZILV","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"4JGWNEPC","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:d8c6260dc5b5fb4a950b58cc2d13990cf75e53762dc5008691c8a3ba5fbf518d","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":"We present algorithms that learn certain classes of function-free recursive logic programs in polynomial time from equivalence queries. In particular, we show that a single k-ary recursive constant-depth determinate clause is learnable. Two-clause programs consisting of one learnable recursive clause and one constant-depth determinate non-recursive clause are also learnable, if an additional ``basecase'' oracle is assumed. These results immediately imply the pac-learnability of these classes. Although these classes of learnable recursive programs are very constrained, it is shown in a companio","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: Efficient Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9505104","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:5893cf66a04d5c6a6b4f8cf2865763978b648f00ff6d4e9bf0bd16c1c8bc5399","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":"ba6cd4026ffb69cf876ded93f761ee8cee4f49854762e129f180df5bad4ed858","cross_cats_sorted":[],"license":"","primary_cat":"cs.AI","submitted_at":"1995-05-01T00:00:00Z","title_canon_sha256":"49d5ee7b0ac08969c73315da0768168618a3865a14cd5eade304b437d88dad71"},"schema_version":"1.0","source":{"id":"cs/9505104","kind":"arxiv","version":1}},"canonical_sha256":"e24d6691e283cc0ca175d826d08edcb1a43ec86000a2e3640d8f2a06d47f6cdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e24d6691e283cc0ca175d826d08edcb1a43ec86000a2e3640d8f2a06d47f6cdd","first_computed_at":"2026-05-18T02:37:36.803207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:36.803207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hosPVm+nomtQnO6a9uX2FcoBq5KiKMzvbq6Vl2EEgnYAIKPobA8lYjfdSFTz/rpS0AOpM2XV3FsrIYsOAyJ7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:36.803711Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/9505104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5893cf66a04d5c6a6b4f8cf2865763978b648f00ff6d4e9bf0bd16c1c8bc5399","sha256:d8c6260dc5b5fb4a950b58cc2d13990cf75e53762dc5008691c8a3ba5fbf518d"],"state_sha256":"5d906da3309197812da61f5dc3bce2cb1bd949e73c8e9291c4bdf34870c7bf9c"}