{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RGJQKBZVSSIHWA6ARRE4K4TDVN","short_pith_number":"pith:RGJQKBZV","schema_version":"1.0","canonical_sha256":"899305073594907b03c08c49c57263ab76e657d262128b00dc7463bdd390c448","source":{"kind":"arxiv","id":"2302.06881","version":2},"attestation_state":"computed","paper":{"title":"simpleKT: A Simple But Tough-to-Beat Baseline for Knowledge Tracing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiahao Chen, Qiongqiong Liu, Shuyan Huang, Weiqi Luo, Zitao Liu","submitted_at":"2023-02-14T08:09:09Z","abstract_excerpt":"Knowledge tracing (KT) is the problem of predicting students' future performance based on their historical interactions with intelligent tutoring systems. Recently, many works present lots of special methods for applying deep neural networks to KT from different perspectives like model architecture, adversarial augmentation and etc., which make the overall algorithm and system become more and more complex. Furthermore, due to the lack of standardized evaluation protocol \\citep{liu2022pykt}, there is no widely agreed KT baselines and published experimental comparisons become inconsistent and se"},"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":"2302.06881","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-14T08:09:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a04113217d1b4a16caee1581df6fba8137fecd5e3489bdc1eaff2e0a1af1b6a8","abstract_canon_sha256":"88e1f6ced877b0cb918673398aad5f62ba89f026fd896524e0c12cb4634120bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:44:52.784224Z","signature_b64":"rKhbyy22Lid9ThyIMxOtu6s77UN/dY5lvbT1WdUHHGM4Xjwp6FpwNvYXzqdFSKQ3YK65SPAdode3UZaH4fP/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"899305073594907b03c08c49c57263ab76e657d262128b00dc7463bdd390c448","last_reissued_at":"2026-07-05T05:44:52.783719Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:44:52.783719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"simpleKT: A Simple But Tough-to-Beat Baseline for Knowledge Tracing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiahao Chen, Qiongqiong Liu, Shuyan Huang, Weiqi Luo, Zitao Liu","submitted_at":"2023-02-14T08:09:09Z","abstract_excerpt":"Knowledge tracing (KT) is the problem of predicting students' future performance based on their historical interactions with intelligent tutoring systems. Recently, many works present lots of special methods for applying deep neural networks to KT from different perspectives like model architecture, adversarial augmentation and etc., which make the overall algorithm and system become more and more complex. Furthermore, due to the lack of standardized evaluation protocol \\citep{liu2022pykt}, there is no widely agreed KT baselines and published experimental comparisons become inconsistent and se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.06881","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.06881/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":"2302.06881","created_at":"2026-07-05T05:44:52.783777+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.06881v2","created_at":"2026-07-05T05:44:52.783777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.06881","created_at":"2026-07-05T05:44:52.783777+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGJQKBZVSSIH","created_at":"2026-07-05T05:44:52.783777+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGJQKBZVSSIHWA6A","created_at":"2026-07-05T05:44:52.783777+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGJQKBZV","created_at":"2026-07-05T05:44:52.783777+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.17036","citing_title":"LiveGraph: Active-Structure Neural Re-ranking for Exercise Recommendation","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09369","citing_title":"Explainable Knowledge Tracing via Probabilistic Embeddings and Pattern-based Reasoning","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01484","citing_title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGJQKBZVSSIHWA6ARRE4K4TDVN","json":"https://pith.science/pith/RGJQKBZVSSIHWA6ARRE4K4TDVN.json","graph_json":"https://pith.science/api/pith-number/RGJQKBZVSSIHWA6ARRE4K4TDVN/graph.json","events_json":"https://pith.science/api/pith-number/RGJQKBZVSSIHWA6ARRE4K4TDVN/events.json","paper":"https://pith.science/paper/RGJQKBZV"},"agent_actions":{"view_html":"https://pith.science/pith/RGJQKBZVSSIHWA6ARRE4K4TDVN","download_json":"https://pith.science/pith/RGJQKBZVSSIHWA6ARRE4K4TDVN.json","view_paper":"https://pith.science/paper/RGJQKBZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.06881&json=true","fetch_graph":"https://pith.science/api/pith-number/RGJQKBZVSSIHWA6ARRE4K4TDVN/graph.json","fetch_events":"https://pith.science/api/pith-number/RGJQKBZVSSIHWA6ARRE4K4TDVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGJQKBZVSSIHWA6ARRE4K4TDVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGJQKBZVSSIHWA6ARRE4K4TDVN/action/storage_attestation","attest_author":"https://pith.science/pith/RGJQKBZVSSIHWA6ARRE4K4TDVN/action/author_attestation","sign_citation":"https://pith.science/pith/RGJQKBZVSSIHWA6ARRE4K4TDVN/action/citation_signature","submit_replication":"https://pith.science/pith/RGJQKBZVSSIHWA6ARRE4K4TDVN/action/replication_record"}},"created_at":"2026-07-05T05:44:52.783777+00:00","updated_at":"2026-07-05T05:44:52.783777+00:00"}