{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:J2GXGTGBLBGLZJM5WHWXBAZFXD","short_pith_number":"pith:J2GXGTGB","canonical_record":{"source":{"id":"2408.05715","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-11T07:53:51Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"b0c5e381b3eca6879f161569159bd1d956be45b43393cf0a132ef8027c66b7cf","abstract_canon_sha256":"ecab832d5cd4c2c1f4c073c8f5bab06781f5a4b197369fafd1328cf7ef0d2734"},"schema_version":"1.0"},"canonical_sha256":"4e8d734cc1584cbca59db1ed708325b8ca4edafe9980a6fd904f095423bbb4cd","source":{"kind":"arxiv","id":"2408.05715","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.05715","created_at":"2026-07-05T08:54:24Z"},{"alias_kind":"arxiv_version","alias_value":"2408.05715v1","created_at":"2026-07-05T08:54:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05715","created_at":"2026-07-05T08:54:24Z"},{"alias_kind":"pith_short_12","alias_value":"J2GXGTGBLBGL","created_at":"2026-07-05T08:54:24Z"},{"alias_kind":"pith_short_16","alias_value":"J2GXGTGBLBGLZJM5","created_at":"2026-07-05T08:54:24Z"},{"alias_kind":"pith_short_8","alias_value":"J2GXGTGB","created_at":"2026-07-05T08:54:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:J2GXGTGBLBGLZJM5WHWXBAZFXD","target":"record","payload":{"canonical_record":{"source":{"id":"2408.05715","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-11T07:53:51Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"b0c5e381b3eca6879f161569159bd1d956be45b43393cf0a132ef8027c66b7cf","abstract_canon_sha256":"ecab832d5cd4c2c1f4c073c8f5bab06781f5a4b197369fafd1328cf7ef0d2734"},"schema_version":"1.0"},"canonical_sha256":"4e8d734cc1584cbca59db1ed708325b8ca4edafe9980a6fd904f095423bbb4cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:54:24.163771Z","signature_b64":"PmMVAAIWE3FAnlEZkVk7LyGnJ0zNLTC/oD8VUp1AQKUgx7XXcRXEegmQnxcwAtnlMEFsx1YE7K3NdcIDCtM/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e8d734cc1584cbca59db1ed708325b8ca4edafe9980a6fd904f095423bbb4cd","last_reissued_at":"2026-07-05T08:54:24.163247Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:54:24.163247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.05715","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-05T08:54:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PdO6eQ6Q/6fUWaLB+mwR4DAe8TWQ2SrpmKToOSRBiAdmgEXg8g4HnYhmB2tTEF4P61vsBbCOeORFMdMLHySQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:08:20.903328Z"},"content_sha256":"0694e169a707999346666eac55d10d57ec81fc15369a091c8588a134d22463d0","schema_version":"1.0","event_id":"sha256:0694e169a707999346666eac55d10d57ec81fc15369a091c8588a134d22463d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:J2GXGTGBLBGLZJM5WHWXBAZFXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Top Pass: Improve Code Generation by Pass@k-Maximized Code Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.AI","authors_text":"Ming Li, Xin-Ye Li, Zheng Xie, Zhi-Cun Lyu","submitted_at":"2024-08-11T07:53:51Z","abstract_excerpt":"Code generation has been greatly enhanced by the profound advancements in Large Language Models (LLMs) recently. Nevertheless, such LLM-based code generation approaches still struggle to generate error-free code in a few tries when faced with complex problems. To address this, the prevailing strategy is to sample a huge number of candidate programs, with the hope of any one in them could work. However, users of code generation systems usually expect to find a correct program by reviewing or testing only a small number of code candidates. Otherwise, the system would be unhelpful. In this paper,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05715","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/2408.05715/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-05T08:54:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1WcCFsyD28F17ttbRgOJxOPqVXxDRPHEf5bkps9T/V2S9almUncasP8cUliSh+GFoW3E+zD3ryQ9NZfVEiVKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T22:08:20.904293Z"},"content_sha256":"721ffeed2112d202f0c62734053859860b97fa1458a743629e1418ffdf13020a","schema_version":"1.0","event_id":"sha256:721ffeed2112d202f0c62734053859860b97fa1458a743629e1418ffdf13020a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2GXGTGBLBGLZJM5WHWXBAZFXD/bundle.json","state_url":"https://pith.science/pith/J2GXGTGBLBGLZJM5WHWXBAZFXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2GXGTGBLBGLZJM5WHWXBAZFXD/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-16T22:08:20Z","links":{"resolver":"https://pith.science/pith/J2GXGTGBLBGLZJM5WHWXBAZFXD","bundle":"https://pith.science/pith/J2GXGTGBLBGLZJM5WHWXBAZFXD/bundle.json","state":"https://pith.science/pith/J2GXGTGBLBGLZJM5WHWXBAZFXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2GXGTGBLBGLZJM5WHWXBAZFXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:J2GXGTGBLBGLZJM5WHWXBAZFXD","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":"ecab832d5cd4c2c1f4c073c8f5bab06781f5a4b197369fafd1328cf7ef0d2734","cross_cats_sorted":["cs.SE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-11T07:53:51Z","title_canon_sha256":"b0c5e381b3eca6879f161569159bd1d956be45b43393cf0a132ef8027c66b7cf"},"schema_version":"1.0","source":{"id":"2408.05715","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.05715","created_at":"2026-07-05T08:54:24Z"},{"alias_kind":"arxiv_version","alias_value":"2408.05715v1","created_at":"2026-07-05T08:54:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05715","created_at":"2026-07-05T08:54:24Z"},{"alias_kind":"pith_short_12","alias_value":"J2GXGTGBLBGL","created_at":"2026-07-05T08:54:24Z"},{"alias_kind":"pith_short_16","alias_value":"J2GXGTGBLBGLZJM5","created_at":"2026-07-05T08:54:24Z"},{"alias_kind":"pith_short_8","alias_value":"J2GXGTGB","created_at":"2026-07-05T08:54:24Z"}],"graph_snapshots":[{"event_id":"sha256:721ffeed2112d202f0c62734053859860b97fa1458a743629e1418ffdf13020a","target":"graph","created_at":"2026-07-05T08:54:24Z","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/2408.05715/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Code generation has been greatly enhanced by the profound advancements in Large Language Models (LLMs) recently. Nevertheless, such LLM-based code generation approaches still struggle to generate error-free code in a few tries when faced with complex problems. To address this, the prevailing strategy is to sample a huge number of candidate programs, with the hope of any one in them could work. However, users of code generation systems usually expect to find a correct program by reviewing or testing only a small number of code candidates. Otherwise, the system would be unhelpful. In this paper,","authors_text":"Ming Li, Xin-Ye Li, Zheng Xie, Zhi-Cun Lyu","cross_cats":["cs.SE"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-11T07:53:51Z","title":"Top Pass: Improve Code Generation by Pass@k-Maximized Code Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05715","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:0694e169a707999346666eac55d10d57ec81fc15369a091c8588a134d22463d0","target":"record","created_at":"2026-07-05T08:54:24Z","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":"ecab832d5cd4c2c1f4c073c8f5bab06781f5a4b197369fafd1328cf7ef0d2734","cross_cats_sorted":["cs.SE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-11T07:53:51Z","title_canon_sha256":"b0c5e381b3eca6879f161569159bd1d956be45b43393cf0a132ef8027c66b7cf"},"schema_version":"1.0","source":{"id":"2408.05715","kind":"arxiv","version":1}},"canonical_sha256":"4e8d734cc1584cbca59db1ed708325b8ca4edafe9980a6fd904f095423bbb4cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e8d734cc1584cbca59db1ed708325b8ca4edafe9980a6fd904f095423bbb4cd","first_computed_at":"2026-07-05T08:54:24.163247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:54:24.163247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PmMVAAIWE3FAnlEZkVk7LyGnJ0zNLTC/oD8VUp1AQKUgx7XXcRXEegmQnxcwAtnlMEFsx1YE7K3NdcIDCtM/BA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:54:24.163771Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.05715","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0694e169a707999346666eac55d10d57ec81fc15369a091c8588a134d22463d0","sha256:721ffeed2112d202f0c62734053859860b97fa1458a743629e1418ffdf13020a"],"state_sha256":"d652350d2de771a06652a5acd1160a7bf95cdf3021afc030b93bf34eb0545c56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jB5LQtyCLr3CI570IOkuUWmrWdX4CB+SV4tUc1QLCi0sGsovwfaZ97Y0wyCN8L0CjrHeKpUheAzOrxb3GCH9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T22:08:20.910787Z","bundle_sha256":"c31b4055c7d8f23e8f96832c9883057d29b84c50381453e376a643369e0c1dd7"}}