{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FNRMH5WLDYQ656DESXRILJMZXZ","short_pith_number":"pith:FNRMH5WL","schema_version":"1.0","canonical_sha256":"2b62c3f6cb1e21eef86495e285a599be49edd20ef6a2e1876ce91ebc424f7068","source":{"kind":"arxiv","id":"2507.18668","version":1},"attestation_state":"computed","paper":{"title":"Efficient Knowledge Tracing Leveraging Higher-Order Information in Integrated Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Daehee Kim, Daeyoung Roh, Donghee Han, Keejun Han, MinJun Lee, Mun Yong Yi","submitted_at":"2025-07-24T06:12:43Z","abstract_excerpt":"The rise of online learning has led to the development of various knowledge tracing (KT) methods. However, existing methods have overlooked the problem of increasing computational cost when utilizing large graphs and long learning sequences. To address this issue, we introduce Dual Graph Attention-based Knowledge Tracing (DGAKT), a graph neural network model designed to leverage high-order information from subgraphs representing student-exercise-KC relationships. DGAKT incorporates a subgraph-based approach to enhance computational efficiency. By processing only relevant subgraphs for each tar"},"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":"2507.18668","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-24T06:12:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a8d06a7c26006de1dd42922d0d72525dec40252f519b06f1012647647b204fd0","abstract_canon_sha256":"cf8bc0f14ce98bdbc4ca2bf68daf599d6bac5427d634ed11f437e657e957bba6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:56.220280Z","signature_b64":"16LbqwGX8yzQR0nntWx5lnczG4e6aOk5t3KqmUppzG/HtXLDOxVOWGw7w4oVBJ58E9ppeE4C1+ZrsueKuhwNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b62c3f6cb1e21eef86495e285a599be49edd20ef6a2e1876ce91ebc424f7068","last_reissued_at":"2026-07-05T11:42:56.219906Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:56.219906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Knowledge Tracing Leveraging Higher-Order Information in Integrated Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Daehee Kim, Daeyoung Roh, Donghee Han, Keejun Han, MinJun Lee, Mun Yong Yi","submitted_at":"2025-07-24T06:12:43Z","abstract_excerpt":"The rise of online learning has led to the development of various knowledge tracing (KT) methods. However, existing methods have overlooked the problem of increasing computational cost when utilizing large graphs and long learning sequences. To address this issue, we introduce Dual Graph Attention-based Knowledge Tracing (DGAKT), a graph neural network model designed to leverage high-order information from subgraphs representing student-exercise-KC relationships. DGAKT incorporates a subgraph-based approach to enhance computational efficiency. By processing only relevant subgraphs for each tar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.18668","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/2507.18668/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":"2507.18668","created_at":"2026-07-05T11:42:56.219957+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.18668v1","created_at":"2026-07-05T11:42:56.219957+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.18668","created_at":"2026-07-05T11:42:56.219957+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNRMH5WLDYQ6","created_at":"2026-07-05T11:42:56.219957+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNRMH5WLDYQ656DE","created_at":"2026-07-05T11:42:56.219957+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNRMH5WL","created_at":"2026-07-05T11:42:56.219957+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/FNRMH5WLDYQ656DESXRILJMZXZ","json":"https://pith.science/pith/FNRMH5WLDYQ656DESXRILJMZXZ.json","graph_json":"https://pith.science/api/pith-number/FNRMH5WLDYQ656DESXRILJMZXZ/graph.json","events_json":"https://pith.science/api/pith-number/FNRMH5WLDYQ656DESXRILJMZXZ/events.json","paper":"https://pith.science/paper/FNRMH5WL"},"agent_actions":{"view_html":"https://pith.science/pith/FNRMH5WLDYQ656DESXRILJMZXZ","download_json":"https://pith.science/pith/FNRMH5WLDYQ656DESXRILJMZXZ.json","view_paper":"https://pith.science/paper/FNRMH5WL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.18668&json=true","fetch_graph":"https://pith.science/api/pith-number/FNRMH5WLDYQ656DESXRILJMZXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FNRMH5WLDYQ656DESXRILJMZXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNRMH5WLDYQ656DESXRILJMZXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNRMH5WLDYQ656DESXRILJMZXZ/action/storage_attestation","attest_author":"https://pith.science/pith/FNRMH5WLDYQ656DESXRILJMZXZ/action/author_attestation","sign_citation":"https://pith.science/pith/FNRMH5WLDYQ656DESXRILJMZXZ/action/citation_signature","submit_replication":"https://pith.science/pith/FNRMH5WLDYQ656DESXRILJMZXZ/action/replication_record"}},"created_at":"2026-07-05T11:42:56.219957+00:00","updated_at":"2026-07-05T11:42:56.219957+00:00"}