{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:V7AMCI5TP2FJTCYMP6YOTWZDV4","short_pith_number":"pith:V7AMCI5T","schema_version":"1.0","canonical_sha256":"afc0c123b37e8a998b0c7fb0e9db23af08e6d2595ff27376dd973dbe340d0311","source":{"kind":"arxiv","id":"2409.09054","version":1},"attestation_state":"computed","paper":{"title":"Evaluating the Performance of Large Language Models in Competitive Programming: A Multi-Year, Multi-Grade Analysis","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.PL"],"primary_cat":"cs.SE","authors_text":"Adrian Catalin Badea, Adrian Marius Dumitran, Stefan-Gabriel Muscalu","submitted_at":"2024-08-31T10:39:54Z","abstract_excerpt":"This study explores the performance of large language models (LLMs) in solving competitive programming problems from the Romanian Informatics Olympiad at the county level. Romania, a leading nation in computer science competitions, provides an ideal environment for evaluating LLM capabilities due to its rich history and stringent competition standards. We collected and analyzed a dataset comprising 304 challenges from 2002 to 2023, focusing on solutions written by LLMs in C++ and Python for these problems. Our primary goal is to understand why LLMs perform well or poorly on different tasks. We"},"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.09054","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.SE","submitted_at":"2024-08-31T10:39:54Z","cross_cats_sorted":["cs.AI","cs.PL"],"title_canon_sha256":"8f16ee93abf92b24095bc90c519362e74ba12306df94d76fcd4e18e62e53f391","abstract_canon_sha256":"4cd315d00f58d4fabb8be9af7fbb5c65dab6b79e3ba668196bf645b55d14c65a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:04.248796Z","signature_b64":"hfj/2g5EFHNejTbmG/WFLEEWjvi0yF+OJubOp8bS5o5EvV1PdgavXdt13UtX0/UQrDJmPqTGyl8k03NBXvvIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afc0c123b37e8a998b0c7fb0e9db23af08e6d2595ff27376dd973dbe340d0311","last_reissued_at":"2026-07-05T09:07:04.248293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:04.248293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating the Performance of Large Language Models in Competitive Programming: A Multi-Year, Multi-Grade Analysis","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.PL"],"primary_cat":"cs.SE","authors_text":"Adrian Catalin Badea, Adrian Marius Dumitran, Stefan-Gabriel Muscalu","submitted_at":"2024-08-31T10:39:54Z","abstract_excerpt":"This study explores the performance of large language models (LLMs) in solving competitive programming problems from the Romanian Informatics Olympiad at the county level. Romania, a leading nation in computer science competitions, provides an ideal environment for evaluating LLM capabilities due to its rich history and stringent competition standards. We collected and analyzed a dataset comprising 304 challenges from 2002 to 2023, focusing on solutions written by LLMs in C++ and Python for these problems. Our primary goal is to understand why LLMs perform well or poorly on different tasks. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.09054","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.09054/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.09054","created_at":"2026-07-05T09:07:04.248368+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.09054v1","created_at":"2026-07-05T09:07:04.248368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09054","created_at":"2026-07-05T09:07:04.248368+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7AMCI5TP2FJ","created_at":"2026-07-05T09:07:04.248368+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7AMCI5TP2FJTCYM","created_at":"2026-07-05T09:07:04.248368+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7AMCI5T","created_at":"2026-07-05T09:07:04.248368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04965","citing_title":"From Struggle (06-2024) to Mastery (02-2025) LLMs Conquer Advanced Algorithm Exams and Pave the Way for Editorial Generation","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V7AMCI5TP2FJTCYMP6YOTWZDV4","json":"https://pith.science/pith/V7AMCI5TP2FJTCYMP6YOTWZDV4.json","graph_json":"https://pith.science/api/pith-number/V7AMCI5TP2FJTCYMP6YOTWZDV4/graph.json","events_json":"https://pith.science/api/pith-number/V7AMCI5TP2FJTCYMP6YOTWZDV4/events.json","paper":"https://pith.science/paper/V7AMCI5T"},"agent_actions":{"view_html":"https://pith.science/pith/V7AMCI5TP2FJTCYMP6YOTWZDV4","download_json":"https://pith.science/pith/V7AMCI5TP2FJTCYMP6YOTWZDV4.json","view_paper":"https://pith.science/paper/V7AMCI5T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.09054&json=true","fetch_graph":"https://pith.science/api/pith-number/V7AMCI5TP2FJTCYMP6YOTWZDV4/graph.json","fetch_events":"https://pith.science/api/pith-number/V7AMCI5TP2FJTCYMP6YOTWZDV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7AMCI5TP2FJTCYMP6YOTWZDV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7AMCI5TP2FJTCYMP6YOTWZDV4/action/storage_attestation","attest_author":"https://pith.science/pith/V7AMCI5TP2FJTCYMP6YOTWZDV4/action/author_attestation","sign_citation":"https://pith.science/pith/V7AMCI5TP2FJTCYMP6YOTWZDV4/action/citation_signature","submit_replication":"https://pith.science/pith/V7AMCI5TP2FJTCYMP6YOTWZDV4/action/replication_record"}},"created_at":"2026-07-05T09:07:04.248368+00:00","updated_at":"2026-07-05T09:07:04.248368+00:00"}