{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VZWNL7GY47CGYYAD6GCJGAC2AW","short_pith_number":"pith:VZWNL7GY","canonical_record":{"source":{"id":"2506.22954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-06-28T17:18:23Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"36ee1e16bfaaffe61b9d62b7f915b6759c05470051afb0ce18f75ec51cfe4da2","abstract_canon_sha256":"0e53b24a081148d2c13c1307c89ac8d621b7aa96545ad00be83b513a030478fe"},"schema_version":"1.0"},"canonical_sha256":"ae6cd5fcd8e7c46c6003f18493005a05b7c2fd8b1ed335dd989e53672e66fef3","source":{"kind":"arxiv","id":"2506.22954","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.22954","created_at":"2026-07-05T11:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"2506.22954v1","created_at":"2026-07-05T11:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22954","created_at":"2026-07-05T11:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"VZWNL7GY47CG","created_at":"2026-07-05T11:28:48Z"},{"alias_kind":"pith_short_16","alias_value":"VZWNL7GY47CGYYAD","created_at":"2026-07-05T11:28:48Z"},{"alias_kind":"pith_short_8","alias_value":"VZWNL7GY","created_at":"2026-07-05T11:28:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VZWNL7GY47CGYYAD6GCJGAC2AW","target":"record","payload":{"canonical_record":{"source":{"id":"2506.22954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-06-28T17:18:23Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"36ee1e16bfaaffe61b9d62b7f915b6759c05470051afb0ce18f75ec51cfe4da2","abstract_canon_sha256":"0e53b24a081148d2c13c1307c89ac8d621b7aa96545ad00be83b513a030478fe"},"schema_version":"1.0"},"canonical_sha256":"ae6cd5fcd8e7c46c6003f18493005a05b7c2fd8b1ed335dd989e53672e66fef3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:48.199054Z","signature_b64":"NrAPe5YM9aTCl3wcDB88VQogeZgRbycAM2TMPlrjPNAcG5Oztku6MSEmnQR7Z8+2PMudtyw5jReoHT9C0cjaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae6cd5fcd8e7c46c6003f18493005a05b7c2fd8b1ed335dd989e53672e66fef3","last_reissued_at":"2026-07-05T11:28:48.198559Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:48.198559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.22954","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"946kkVZSlCeVjtt1xjzAw8oDOAa4PKw3sUQwtpuq7BPTZiHP5ZzQAsp5uhjFDT1LpXyjSS3c9G7hWcsIMigfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:37:21.595377Z"},"content_sha256":"c1883ddf236352b2ea95091504c0a5c4fbca75d19ee15524db83060c34c8d263","schema_version":"1.0","event_id":"sha256:c1883ddf236352b2ea95091504c0a5c4fbca75d19ee15524db83060c34c8d263"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VZWNL7GY47CGYYAD6GCJGAC2AW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Evaluating and Improving Large Language Models for Competitive Program Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.SI","authors_text":"Cheng Yu, Menglin Zheng, Minnan Wei, Siyu Chen, Xiang Chen, Xiaolin Ju, Ziming Li, Ziyan Qu","submitted_at":"2025-06-28T17:18:23Z","abstract_excerpt":"Context: Due to the demand for strong algorithmic reasoning, complex logic implementation, and strict adherence to input/output formats and resource constraints, competitive programming generation by large language models (LLMs) is considered the most challenging problem in current LLM-based code generation. However, previous studies often evaluate LLMs using simple prompts and benchmark datasets prone to data leakage. Moreover, prior work has limited consideration of the diversity in algorithm types and difficulty levels. Objective: In this study, we aim to evaluate and improve LLMs in solvin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22954","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/2506.22954/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:28:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xeJi7hd2QMAuzdY6oRO5j9I+qqDruROyrJutRo61xNuzltKKiLzOTF+lNrpMba8GmjQ3taq0AfQ1MS5yk2abAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:37:21.595974Z"},"content_sha256":"931f4aa9e63f6a62f5c0aea037c7666e9a4ca571b05042ca22f5fab396d93f49","schema_version":"1.0","event_id":"sha256:931f4aa9e63f6a62f5c0aea037c7666e9a4ca571b05042ca22f5fab396d93f49"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZWNL7GY47CGYYAD6GCJGAC2AW/bundle.json","state_url":"https://pith.science/pith/VZWNL7GY47CGYYAD6GCJGAC2AW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZWNL7GY47CGYYAD6GCJGAC2AW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-07T05:37:21Z","links":{"resolver":"https://pith.science/pith/VZWNL7GY47CGYYAD6GCJGAC2AW","bundle":"https://pith.science/pith/VZWNL7GY47CGYYAD6GCJGAC2AW/bundle.json","state":"https://pith.science/pith/VZWNL7GY47CGYYAD6GCJGAC2AW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZWNL7GY47CGYYAD6GCJGAC2AW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VZWNL7GY47CGYYAD6GCJGAC2AW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0e53b24a081148d2c13c1307c89ac8d621b7aa96545ad00be83b513a030478fe","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-06-28T17:18:23Z","title_canon_sha256":"36ee1e16bfaaffe61b9d62b7f915b6759c05470051afb0ce18f75ec51cfe4da2"},"schema_version":"1.0","source":{"id":"2506.22954","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.22954","created_at":"2026-07-05T11:28:48Z"},{"alias_kind":"arxiv_version","alias_value":"2506.22954v1","created_at":"2026-07-05T11:28:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.22954","created_at":"2026-07-05T11:28:48Z"},{"alias_kind":"pith_short_12","alias_value":"VZWNL7GY47CG","created_at":"2026-07-05T11:28:48Z"},{"alias_kind":"pith_short_16","alias_value":"VZWNL7GY47CGYYAD","created_at":"2026-07-05T11:28:48Z"},{"alias_kind":"pith_short_8","alias_value":"VZWNL7GY","created_at":"2026-07-05T11:28:48Z"}],"graph_snapshots":[{"event_id":"sha256:931f4aa9e63f6a62f5c0aea037c7666e9a4ca571b05042ca22f5fab396d93f49","target":"graph","created_at":"2026-07-05T11:28:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.22954/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Context: Due to the demand for strong algorithmic reasoning, complex logic implementation, and strict adherence to input/output formats and resource constraints, competitive programming generation by large language models (LLMs) is considered the most challenging problem in current LLM-based code generation. However, previous studies often evaluate LLMs using simple prompts and benchmark datasets prone to data leakage. Moreover, prior work has limited consideration of the diversity in algorithm types and difficulty levels. Objective: In this study, we aim to evaluate and improve LLMs in solvin","authors_text":"Cheng Yu, Menglin Zheng, Minnan Wei, Siyu Chen, Xiang Chen, Xiaolin Ju, Ziming Li, Ziyan Qu","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-06-28T17:18:23Z","title":"Evaluating and Improving Large Language Models for Competitive Program Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.22954","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c1883ddf236352b2ea95091504c0a5c4fbca75d19ee15524db83060c34c8d263","target":"record","created_at":"2026-07-05T11:28:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0e53b24a081148d2c13c1307c89ac8d621b7aa96545ad00be83b513a030478fe","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-06-28T17:18:23Z","title_canon_sha256":"36ee1e16bfaaffe61b9d62b7f915b6759c05470051afb0ce18f75ec51cfe4da2"},"schema_version":"1.0","source":{"id":"2506.22954","kind":"arxiv","version":1}},"canonical_sha256":"ae6cd5fcd8e7c46c6003f18493005a05b7c2fd8b1ed335dd989e53672e66fef3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae6cd5fcd8e7c46c6003f18493005a05b7c2fd8b1ed335dd989e53672e66fef3","first_computed_at":"2026-07-05T11:28:48.198559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:28:48.198559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NrAPe5YM9aTCl3wcDB88VQogeZgRbycAM2TMPlrjPNAcG5Oztku6MSEmnQR7Z8+2PMudtyw5jReoHT9C0cjaDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:28:48.199054Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.22954","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1883ddf236352b2ea95091504c0a5c4fbca75d19ee15524db83060c34c8d263","sha256:931f4aa9e63f6a62f5c0aea037c7666e9a4ca571b05042ca22f5fab396d93f49"],"state_sha256":"5488f2393e8d72521029c467477f07f97b1354474717ef35059fe53d01c9a831"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cn52PCOazupvPXRDHHK0/9kWaeuYRS30e8ASPenscYT3+cxAlpvkiRFZhSCmFZZksCDvaRFIdJfAqDAyYByuDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T05:37:21.601255Z","bundle_sha256":"4cf2ea51e8ee2e5204870b55367a947fd7375ea7a743b7a5f719496303359c5c"}}