{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:JG5TAM7SL2DZ3T5S7RF2BHN5VP","short_pith_number":"pith:JG5TAM7S","schema_version":"1.0","canonical_sha256":"49bb3033f25e879dcfb2fc4ba09dbdabd1e79c1f45311a179e4aeb2e74dd823d","source":{"kind":"arxiv","id":"cs/9605105","version":1},"attestation_state":"computed","paper":{"title":"A Formal Framework for Speedup Learning from Problems and Solutions","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"B. K. Natarajan, P. Tadepalli","submitted_at":"1996-05-01T00:00:00Z","abstract_excerpt":"Speedup learning seeks to improve the computational efficiency of problem solving with experience. In this paper, we develop a formal framework for learning efficient problem solving from random problems and their solutions. We apply this framework to two different representations of learned knowledge, namely control rules and macro-operators, and prove theorems that identify sufficient conditions for learning in each representation. Our proofs are constructive in that they are accompanied with learning algorithms. Our framework captures both empirical and explanation-based speedup learning in"},"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/9605105","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"1996-05-01T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"64c9b7e8ba3580b50e66412d86037ee4d19f152639862dcc070d7a3617656422","abstract_canon_sha256":"b53aaa11fa7a26ec7a570a8ba7c4dae46d78fc259be97ccdce61373570fa97de"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:36.684962Z","signature_b64":"ErDImdvcueaZ60AJ23xtwh/J5dg79zPhgnrnU+hkyLNPO/wg5EOOhHhHFAVm8PUaSO1n5Ebv5DQ7JRZrq8M4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49bb3033f25e879dcfb2fc4ba09dbdabd1e79c1f45311a179e4aeb2e74dd823d","last_reissued_at":"2026-05-18T02:37:36.684566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:36.684566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Formal Framework for Speedup Learning from Problems and Solutions","license":"","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"B. K. Natarajan, P. Tadepalli","submitted_at":"1996-05-01T00:00:00Z","abstract_excerpt":"Speedup learning seeks to improve the computational efficiency of problem solving with experience. In this paper, we develop a formal framework for learning efficient problem solving from random problems and their solutions. We apply this framework to two different representations of learned knowledge, namely control rules and macro-operators, and prove theorems that identify sufficient conditions for learning in each representation. Our proofs are constructive in that they are accompanied with learning algorithms. Our framework captures both empirical and explanation-based speedup learning in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9605105","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/9605105","created_at":"2026-05-18T02:37:36.684622+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9605105v1","created_at":"2026-05-18T02:37:36.684622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9605105","created_at":"2026-05-18T02:37:36.684622+00:00"},{"alias_kind":"pith_short_12","alias_value":"JG5TAM7SL2DZ","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_16","alias_value":"JG5TAM7SL2DZ3T5S","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_8","alias_value":"JG5TAM7S","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/JG5TAM7SL2DZ3T5S7RF2BHN5VP","json":"https://pith.science/pith/JG5TAM7SL2DZ3T5S7RF2BHN5VP.json","graph_json":"https://pith.science/api/pith-number/JG5TAM7SL2DZ3T5S7RF2BHN5VP/graph.json","events_json":"https://pith.science/api/pith-number/JG5TAM7SL2DZ3T5S7RF2BHN5VP/events.json","paper":"https://pith.science/paper/JG5TAM7S"},"agent_actions":{"view_html":"https://pith.science/pith/JG5TAM7SL2DZ3T5S7RF2BHN5VP","download_json":"https://pith.science/pith/JG5TAM7SL2DZ3T5S7RF2BHN5VP.json","view_paper":"https://pith.science/paper/JG5TAM7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9605105&json=true","fetch_graph":"https://pith.science/api/pith-number/JG5TAM7SL2DZ3T5S7RF2BHN5VP/graph.json","fetch_events":"https://pith.science/api/pith-number/JG5TAM7SL2DZ3T5S7RF2BHN5VP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JG5TAM7SL2DZ3T5S7RF2BHN5VP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JG5TAM7SL2DZ3T5S7RF2BHN5VP/action/storage_attestation","attest_author":"https://pith.science/pith/JG5TAM7SL2DZ3T5S7RF2BHN5VP/action/author_attestation","sign_citation":"https://pith.science/pith/JG5TAM7SL2DZ3T5S7RF2BHN5VP/action/citation_signature","submit_replication":"https://pith.science/pith/JG5TAM7SL2DZ3T5S7RF2BHN5VP/action/replication_record"}},"created_at":"2026-05-18T02:37:36.684622+00:00","updated_at":"2026-05-18T02:37:36.684622+00:00"}