{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VLQNIOZ6DD6S2TVZJMKQ3TSC77","short_pith_number":"pith:VLQNIOZ6","schema_version":"1.0","canonical_sha256":"aae0d43b3e18fd2d4eb94b150dce42ffc06e91d7dccda042f6ce36c1e7fde683","source":{"kind":"arxiv","id":"1603.04402","version":1},"attestation_state":"computed","paper":{"title":"Controlling Search in Very large Commonsense Knowledge Bases: A Machine Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abhishek Sharma, Keith Goolsbey, Michael Witbrock","submitted_at":"2016-03-14T19:20:36Z","abstract_excerpt":"Very large commonsense knowledge bases (KBs) often have thousands to millions of axioms, of which relatively few are relevant for answering any given query. A large number of irrelevant axioms can easily overwhelm resolution-based theorem provers. Therefore, methods that help the reasoner identify useful inference paths form an essential part of large-scale reasoning systems. In this paper, we describe two ordering heuristics for optimization of reasoning in such systems. First, we discuss how decision trees can be used to select inference steps that are more likely to succeed. Second, we iden"},"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":"1603.04402","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-03-14T19:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"dd15c46919ac124b87d31a711b087822b3bf881f7c0d3cc1df1e638249d05be8","abstract_canon_sha256":"175ea08030a142b9fe40b2c69158b90bec699d17b1a955d26e17f7d0a9e85876"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:06.830257Z","signature_b64":"Ha4J1BwtvU/JTTARcj7PZE34+qbYMUqau6Nwq7oeE7OTmjCWiUJ1eGKgoJQuCPnONrxmUcksy0KJXZEPom+2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aae0d43b3e18fd2d4eb94b150dce42ffc06e91d7dccda042f6ce36c1e7fde683","last_reissued_at":"2026-05-18T01:19:06.829671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:06.829671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Controlling Search in Very large Commonsense Knowledge Bases: A Machine Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abhishek Sharma, Keith Goolsbey, Michael Witbrock","submitted_at":"2016-03-14T19:20:36Z","abstract_excerpt":"Very large commonsense knowledge bases (KBs) often have thousands to millions of axioms, of which relatively few are relevant for answering any given query. A large number of irrelevant axioms can easily overwhelm resolution-based theorem provers. Therefore, methods that help the reasoner identify useful inference paths form an essential part of large-scale reasoning systems. In this paper, we describe two ordering heuristics for optimization of reasoning in such systems. First, we discuss how decision trees can be used to select inference steps that are more likely to succeed. Second, we iden"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04402","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":"1603.04402","created_at":"2026-05-18T01:19:06.829755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04402v1","created_at":"2026-05-18T01:19:06.829755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04402","created_at":"2026-05-18T01:19:06.829755+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLQNIOZ6DD6S","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLQNIOZ6DD6S2TVZ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLQNIOZ6","created_at":"2026-05-18T12:30:48.956258+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/VLQNIOZ6DD6S2TVZJMKQ3TSC77","json":"https://pith.science/pith/VLQNIOZ6DD6S2TVZJMKQ3TSC77.json","graph_json":"https://pith.science/api/pith-number/VLQNIOZ6DD6S2TVZJMKQ3TSC77/graph.json","events_json":"https://pith.science/api/pith-number/VLQNIOZ6DD6S2TVZJMKQ3TSC77/events.json","paper":"https://pith.science/paper/VLQNIOZ6"},"agent_actions":{"view_html":"https://pith.science/pith/VLQNIOZ6DD6S2TVZJMKQ3TSC77","download_json":"https://pith.science/pith/VLQNIOZ6DD6S2TVZJMKQ3TSC77.json","view_paper":"https://pith.science/paper/VLQNIOZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04402&json=true","fetch_graph":"https://pith.science/api/pith-number/VLQNIOZ6DD6S2TVZJMKQ3TSC77/graph.json","fetch_events":"https://pith.science/api/pith-number/VLQNIOZ6DD6S2TVZJMKQ3TSC77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLQNIOZ6DD6S2TVZJMKQ3TSC77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLQNIOZ6DD6S2TVZJMKQ3TSC77/action/storage_attestation","attest_author":"https://pith.science/pith/VLQNIOZ6DD6S2TVZJMKQ3TSC77/action/author_attestation","sign_citation":"https://pith.science/pith/VLQNIOZ6DD6S2TVZJMKQ3TSC77/action/citation_signature","submit_replication":"https://pith.science/pith/VLQNIOZ6DD6S2TVZJMKQ3TSC77/action/replication_record"}},"created_at":"2026-05-18T01:19:06.829755+00:00","updated_at":"2026-05-18T01:19:06.829755+00:00"}