{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LGEQZMRVYVOY5WIZMXNT5QGZ75","short_pith_number":"pith:LGEQZMRV","schema_version":"1.0","canonical_sha256":"59890cb235c55d8ed91965db3ec0d9ff6d397c5ab8b868335128c80cef41c1b8","source":{"kind":"arxiv","id":"1903.00830","version":2},"attestation_state":"computed","paper":{"title":"Predicting Algorithm Classes for Programming Word Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Aayush Naik, Manish Shrivastava, Rajas Vanjape, Vinayak Athavale","submitted_at":"2019-03-03T04:39:33Z","abstract_excerpt":"We introduce the task of algorithm class prediction for programming word problems. A programming word problem is a problem written in natural language, which can be solved using an algorithm or a program. We define classes of various programming word problems which correspond to the class of algorithms required to solve the problem. We present four new datasets for this task, two multiclass datasets with 550 and 1159 problems each and two multilabel datasets having 3737 and 3960 problems each. We pose the problem as a text classification problem and train neural network and non-neural network-"},"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":"1903.00830","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-03-03T04:39:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4458bf996e1bf33e2857f7dd46414889e711c5bda474d8b807acfe0ad2af0826","abstract_canon_sha256":"068770d9d671a46d40a6a1c6691cfa3c2ef8e2f0f037d4617f3f3ce8ae297dee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:27.035891Z","signature_b64":"OxCJWUI/r9piE63w6FRRtyswPvKZKSnHMZ/93dWLQYpLbsqBBMZQEv3iwGH6gRUjpJPhuIOrMQl5bnmP85j6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59890cb235c55d8ed91965db3ec0d9ff6d397c5ab8b868335128c80cef41c1b8","last_reissued_at":"2026-05-17T23:49:27.035362Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:27.035362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicting Algorithm Classes for Programming Word Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Aayush Naik, Manish Shrivastava, Rajas Vanjape, Vinayak Athavale","submitted_at":"2019-03-03T04:39:33Z","abstract_excerpt":"We introduce the task of algorithm class prediction for programming word problems. A programming word problem is a problem written in natural language, which can be solved using an algorithm or a program. We define classes of various programming word problems which correspond to the class of algorithms required to solve the problem. We present four new datasets for this task, two multiclass datasets with 550 and 1159 problems each and two multilabel datasets having 3737 and 3960 problems each. We pose the problem as a text classification problem and train neural network and non-neural network-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.00830","kind":"arxiv","version":2},"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":"1903.00830","created_at":"2026-05-17T23:49:27.035455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.00830v2","created_at":"2026-05-17T23:49:27.035455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.00830","created_at":"2026-05-17T23:49:27.035455+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGEQZMRVYVOY","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGEQZMRVYVOY5WIZ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGEQZMRV","created_at":"2026-05-18T12:33:21.387695+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/LGEQZMRVYVOY5WIZMXNT5QGZ75","json":"https://pith.science/pith/LGEQZMRVYVOY5WIZMXNT5QGZ75.json","graph_json":"https://pith.science/api/pith-number/LGEQZMRVYVOY5WIZMXNT5QGZ75/graph.json","events_json":"https://pith.science/api/pith-number/LGEQZMRVYVOY5WIZMXNT5QGZ75/events.json","paper":"https://pith.science/paper/LGEQZMRV"},"agent_actions":{"view_html":"https://pith.science/pith/LGEQZMRVYVOY5WIZMXNT5QGZ75","download_json":"https://pith.science/pith/LGEQZMRVYVOY5WIZMXNT5QGZ75.json","view_paper":"https://pith.science/paper/LGEQZMRV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.00830&json=true","fetch_graph":"https://pith.science/api/pith-number/LGEQZMRVYVOY5WIZMXNT5QGZ75/graph.json","fetch_events":"https://pith.science/api/pith-number/LGEQZMRVYVOY5WIZMXNT5QGZ75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGEQZMRVYVOY5WIZMXNT5QGZ75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGEQZMRVYVOY5WIZMXNT5QGZ75/action/storage_attestation","attest_author":"https://pith.science/pith/LGEQZMRVYVOY5WIZMXNT5QGZ75/action/author_attestation","sign_citation":"https://pith.science/pith/LGEQZMRVYVOY5WIZMXNT5QGZ75/action/citation_signature","submit_replication":"https://pith.science/pith/LGEQZMRVYVOY5WIZMXNT5QGZ75/action/replication_record"}},"created_at":"2026-05-17T23:49:27.035455+00:00","updated_at":"2026-05-17T23:49:27.035455+00:00"}