{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VQFMOY3PXMPOL75P4L7MLPFENS","short_pith_number":"pith:VQFMOY3P","schema_version":"1.0","canonical_sha256":"ac0ac7636fbb1ee5ffafe2fec5bca46c829c8960fcda712fe96fc99a38c33c38","source":{"kind":"arxiv","id":"2206.03545","version":1},"attestation_state":"computed","paper":{"title":"Code-DKT: A Code-based Knowledge Tracing Model for Programming Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CY"],"primary_cat":"cs.SE","authors_text":"Min Chi, Thomas Price, Tiffany Barnes, Yang Shi","submitted_at":"2022-06-07T19:29:44Z","abstract_excerpt":"Knowledge tracing (KT) models are a popular approach for predicting students' future performance at practice problems using their prior attempts. Though many innovations have been made in KT, most models including the state-of-the-art Deep KT (DKT) mainly leverage each student's response either as correct or incorrect, ignoring its content. In this work, we propose Code-based Deep Knowledge Tracing (Code-DKT), a model that uses an attention mechanism to automatically extract and select domain-specific code features to extend DKT. We compared the effectiveness of Code-DKT against Bayesian and D"},"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":"2206.03545","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-06-07T19:29:44Z","cross_cats_sorted":["cs.AI","cs.CY"],"title_canon_sha256":"1f95068fd7c64e15ce4306a4d573c9e4919ba1f6510b52361b08e2714283ef1f","abstract_canon_sha256":"348a4cf4ba3c5cc427593f280a2c353421fe01048b6df63365460f37bc3876e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:10.444715Z","signature_b64":"vgakVLjNSn5dt7Ggx3SqfW3qO1uex4ooz0rdizi7nS1rmpnoXYd++GzFbjD36oeJpvuCIQkxy61/8+nD3w9eCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac0ac7636fbb1ee5ffafe2fec5bca46c829c8960fcda712fe96fc99a38c33c38","last_reissued_at":"2026-07-05T04:30:10.444295Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:10.444295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Code-DKT: A Code-based Knowledge Tracing Model for Programming Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CY"],"primary_cat":"cs.SE","authors_text":"Min Chi, Thomas Price, Tiffany Barnes, Yang Shi","submitted_at":"2022-06-07T19:29:44Z","abstract_excerpt":"Knowledge tracing (KT) models are a popular approach for predicting students' future performance at practice problems using their prior attempts. Though many innovations have been made in KT, most models including the state-of-the-art Deep KT (DKT) mainly leverage each student's response either as correct or incorrect, ignoring its content. In this work, we propose Code-based Deep Knowledge Tracing (Code-DKT), a model that uses an attention mechanism to automatically extract and select domain-specific code features to extend DKT. We compared the effectiveness of Code-DKT against Bayesian and D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03545","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.03545/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2206.03545","created_at":"2026-07-05T04:30:10.444364+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.03545v1","created_at":"2026-07-05T04:30:10.444364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03545","created_at":"2026-07-05T04:30:10.444364+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQFMOY3PXMPO","created_at":"2026-07-05T04:30:10.444364+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQFMOY3PXMPOL75P","created_at":"2026-07-05T04:30:10.444364+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQFMOY3P","created_at":"2026-07-05T04:30:10.444364+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11107","citing_title":"Denoising Programming Knowledge Tracing with a Code Graph-based Tuning Adaptor","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQFMOY3PXMPOL75P4L7MLPFENS","json":"https://pith.science/pith/VQFMOY3PXMPOL75P4L7MLPFENS.json","graph_json":"https://pith.science/api/pith-number/VQFMOY3PXMPOL75P4L7MLPFENS/graph.json","events_json":"https://pith.science/api/pith-number/VQFMOY3PXMPOL75P4L7MLPFENS/events.json","paper":"https://pith.science/paper/VQFMOY3P"},"agent_actions":{"view_html":"https://pith.science/pith/VQFMOY3PXMPOL75P4L7MLPFENS","download_json":"https://pith.science/pith/VQFMOY3PXMPOL75P4L7MLPFENS.json","view_paper":"https://pith.science/paper/VQFMOY3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.03545&json=true","fetch_graph":"https://pith.science/api/pith-number/VQFMOY3PXMPOL75P4L7MLPFENS/graph.json","fetch_events":"https://pith.science/api/pith-number/VQFMOY3PXMPOL75P4L7MLPFENS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQFMOY3PXMPOL75P4L7MLPFENS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQFMOY3PXMPOL75P4L7MLPFENS/action/storage_attestation","attest_author":"https://pith.science/pith/VQFMOY3PXMPOL75P4L7MLPFENS/action/author_attestation","sign_citation":"https://pith.science/pith/VQFMOY3PXMPOL75P4L7MLPFENS/action/citation_signature","submit_replication":"https://pith.science/pith/VQFMOY3PXMPOL75P4L7MLPFENS/action/replication_record"}},"created_at":"2026-07-05T04:30:10.444364+00:00","updated_at":"2026-07-05T04:30:10.444364+00:00"}