{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/tipsc-tips-and-corrections-for-programming","title":"TipsC: Tips and Corrections for programming MOOCs","arxiv_id":"1804.00373","date":"2018-04-02","proceeding":null,"authors":["Saksham Sharma","Pallav Agarwal","Parv Mor","Amey Karkare"],"abstract":"With the widespread adoption of MOOCs in academic institutions, it has become\nimperative to come up with better techniques to solve the tutoring and grading\nproblems posed by programming courses. Programming being the new 'writing', it\nbecomes a challenge to ensure that a large section of the society is exposed to\nprogramming. Due to the gradient in learning abilities of students, the course\ninstructor must ensure that everyone can cope up with the material, and receive\nadequate help in completing assignments while learning along the way. We\nintroduce TipsC for this task. By analyzing a large number of correct\nsubmissions, TipsC can search for correct codes resembling a given incorrect\nsolution. Without revealing the actual code, TipsC then suggests changes in the\nincorrect code to help the student fix logical runtime errors. In addition,\nthis also serves as a cluster visualization tool for the instructor, revealing\ndifferent patterns in user submissions. We evaluated the effectiveness of\nTipsC's clustering algorithm on data collected from previous offerings of an\nintroductory programming course conducted at IIT Kanpur where the grades were\ngiven by human TAs. The results show the weighted average variance of marks for\nclusters when similar submissions are grouped together is 47% less compared to\nthe case when all programs are grouped together.","url_abs":"http://arxiv.org/abs/1804.00373v1","url_pdf":"http://arxiv.org/pdf/1804.00373v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"tipsc-tips-and-corrections-for-programming","repo_url":"https://github.com/HexFlow/tipsy","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"HexFlow/tipsy","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"aa9bd45007399b998aa202f201fa97a7e5306b44a3bf709a08034b3c235d2087","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}