{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ALUVCFJDC2FYAKXEZZFJXLXFT7","short_pith_number":"pith:ALUVCFJD","schema_version":"1.0","canonical_sha256":"02e9511523168b802ae4ce4a9baee59ff38045c4f151a8ddfa6ebcfee38f46a2","source":{"kind":"arxiv","id":"2409.05824","version":1},"attestation_state":"computed","paper":{"title":"Are Large Language Models a Threat to Programming Platforms? An Exploratory Study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Banani Roy, Md Mustakim Billah, Palash Ranjan Roy, Zadia Codabux","submitted_at":"2024-09-09T17:30:20Z","abstract_excerpt":"Competitive programming platforms like LeetCode, Codeforces, and HackerRank evaluate programming skills, often used by recruiters for screening. With the rise of advanced Large Language Models (LLMs) such as ChatGPT, Gemini, and Meta AI, their problem-solving ability on these platforms needs assessment. This study explores LLMs' ability to tackle diverse programming challenges across platforms with varying difficulty, offering insights into their real-time and offline performance and comparing them with human programmers.\n  We tested 98 problems from LeetCode, 126 from Codeforces, covering 15 "},"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":"2409.05824","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2024-09-09T17:30:20Z","cross_cats_sorted":[],"title_canon_sha256":"1afb8d3d15f5b1731b0b6ac3bac287cf02de48b442f6eccbb652c8cf58ecf680","abstract_canon_sha256":"07e8dc605c274fb989706b58938549949b12077f54f8cfd560d7e1979b4260c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:54.636916Z","signature_b64":"YVoLmGf0jz+YxRFfEn1QrfE9LDWPASaiRNxvVD0da7pC5rMPRTAIpL/I3Lks4wSabxIYdAprC46OmrQPBuePCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02e9511523168b802ae4ce4a9baee59ff38045c4f151a8ddfa6ebcfee38f46a2","last_reissued_at":"2026-07-05T09:04:54.636537Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:54.636537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Are Large Language Models a Threat to Programming Platforms? An Exploratory Study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Banani Roy, Md Mustakim Billah, Palash Ranjan Roy, Zadia Codabux","submitted_at":"2024-09-09T17:30:20Z","abstract_excerpt":"Competitive programming platforms like LeetCode, Codeforces, and HackerRank evaluate programming skills, often used by recruiters for screening. With the rise of advanced Large Language Models (LLMs) such as ChatGPT, Gemini, and Meta AI, their problem-solving ability on these platforms needs assessment. This study explores LLMs' ability to tackle diverse programming challenges across platforms with varying difficulty, offering insights into their real-time and offline performance and comparing them with human programmers.\n  We tested 98 problems from LeetCode, 126 from Codeforces, covering 15 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.05824","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/2409.05824/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":"2409.05824","created_at":"2026-07-05T09:04:54.636593+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.05824v1","created_at":"2026-07-05T09:04:54.636593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.05824","created_at":"2026-07-05T09:04:54.636593+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALUVCFJDC2FY","created_at":"2026-07-05T09:04:54.636593+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALUVCFJDC2FYAKXE","created_at":"2026-07-05T09:04:54.636593+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALUVCFJD","created_at":"2026-07-05T09:04:54.636593+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.12644","citing_title":"CodeXEmbed: A Generalist Embedding Model Family for Multiligual and Multi-task Code Retrieval","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ALUVCFJDC2FYAKXEZZFJXLXFT7","json":"https://pith.science/pith/ALUVCFJDC2FYAKXEZZFJXLXFT7.json","graph_json":"https://pith.science/api/pith-number/ALUVCFJDC2FYAKXEZZFJXLXFT7/graph.json","events_json":"https://pith.science/api/pith-number/ALUVCFJDC2FYAKXEZZFJXLXFT7/events.json","paper":"https://pith.science/paper/ALUVCFJD"},"agent_actions":{"view_html":"https://pith.science/pith/ALUVCFJDC2FYAKXEZZFJXLXFT7","download_json":"https://pith.science/pith/ALUVCFJDC2FYAKXEZZFJXLXFT7.json","view_paper":"https://pith.science/paper/ALUVCFJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.05824&json=true","fetch_graph":"https://pith.science/api/pith-number/ALUVCFJDC2FYAKXEZZFJXLXFT7/graph.json","fetch_events":"https://pith.science/api/pith-number/ALUVCFJDC2FYAKXEZZFJXLXFT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALUVCFJDC2FYAKXEZZFJXLXFT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALUVCFJDC2FYAKXEZZFJXLXFT7/action/storage_attestation","attest_author":"https://pith.science/pith/ALUVCFJDC2FYAKXEZZFJXLXFT7/action/author_attestation","sign_citation":"https://pith.science/pith/ALUVCFJDC2FYAKXEZZFJXLXFT7/action/citation_signature","submit_replication":"https://pith.science/pith/ALUVCFJDC2FYAKXEZZFJXLXFT7/action/replication_record"}},"created_at":"2026-07-05T09:04:54.636593+00:00","updated_at":"2026-07-05T09:04:54.636593+00:00"}