{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HTR4GMJAZUEQB4WA65TLCFQMH7","short_pith_number":"pith:HTR4GMJA","canonical_record":{"source":{"id":"2607.23665","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-07-26T14:01:54Z","cross_cats_sorted":[],"title_canon_sha256":"96ceff22ac8ade57ada028d0b65ae1139a654ff505ecb6216cff18a37e9230f5","abstract_canon_sha256":"2e471204070620bc89dfffdce808662df81a24252e743990b043903cdede4a72"},"schema_version":"1.0"},"canonical_sha256":"3ce3c33120cd0900f2c0f766b1160c3fc6f0d30738ff46ec6c73543b17501768","source":{"kind":"arxiv","id":"2607.23665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.23665","created_at":"2026-07-28T01:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"2607.23665v1","created_at":"2026-07-28T01:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23665","created_at":"2026-07-28T01:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"HTR4GMJAZUEQ","created_at":"2026-07-28T01:23:04Z"},{"alias_kind":"pith_short_16","alias_value":"HTR4GMJAZUEQB4WA","created_at":"2026-07-28T01:23:04Z"},{"alias_kind":"pith_short_8","alias_value":"HTR4GMJA","created_at":"2026-07-28T01:23:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HTR4GMJAZUEQB4WA65TLCFQMH7","target":"record","payload":{"canonical_record":{"source":{"id":"2607.23665","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-07-26T14:01:54Z","cross_cats_sorted":[],"title_canon_sha256":"96ceff22ac8ade57ada028d0b65ae1139a654ff505ecb6216cff18a37e9230f5","abstract_canon_sha256":"2e471204070620bc89dfffdce808662df81a24252e743990b043903cdede4a72"},"schema_version":"1.0"},"canonical_sha256":"3ce3c33120cd0900f2c0f766b1160c3fc6f0d30738ff46ec6c73543b17501768","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:23:04.385396Z","signature_b64":"RwTwZR3z7uP6DT2jBWl3B+WBAb0llGyRBWIKEmIrtJQeCS/6GyaT8B/1KCHlZrdayaBSp3yChEX6J1efh8AMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ce3c33120cd0900f2c0f766b1160c3fc6f0d30738ff46ec6c73543b17501768","last_reissued_at":"2026-07-28T01:23:04.384567Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:23:04.384567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.23665","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-28T01:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2I4zliTrGhV0FZb/dpaZx2ISJarwq56j0O8+EXQ6xYfQ7OXk+MwR4XsvpIjYvx+EzCje9rkSnhMMr+RJcMPECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:52:47.413875Z"},"content_sha256":"8202951611eeb9d8b4978dc3c5d1777f842550f66159ea8c48635f441a8f6e03","schema_version":"1.0","event_id":"sha256:8202951611eeb9d8b4978dc3c5d1777f842550f66159ea8c48635f441a8f6e03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HTR4GMJAZUEQB4WA65TLCFQMH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-level Code Optimization via Mixture of Prompts","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"David Lo, Jiakun Liu, Jun Wan, Shuzheng Gao, Xiaoxue Ren, Yun Peng","submitted_at":"2026-07-26T14:01:54Z","abstract_excerpt":"Runtime efficiency is a critical factor that impacts both software quality and user satisfaction. There are many approaches proposed for code optimization to improve runtime efficiency. Traditional code optimization methods operate on intermediate representations (IRs) during compilation for static languages. They are effective but struggle to handle dynamic languages that do not require compilation. Recently, large language models (LLMs) have been leveraged to directly optimize source code in dynamic languages. However, these methods fail to identify suitable optimization targets and usually "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23665","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/2607.23665/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-28T01:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utRIf3jvzIE7A+ScpGuJLHWf7RLgx2uRUduhRRcDeGd7+xmCzAOnPyp4i2KVD0hsWRkHpS6AxkM52B3PQm7DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:52:47.414377Z"},"content_sha256":"f78c87cd8d0472c3a8a5767e76798e9e21e7846903a89a1ef3c9828e821008e2","schema_version":"1.0","event_id":"sha256:f78c87cd8d0472c3a8a5767e76798e9e21e7846903a89a1ef3c9828e821008e2"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTR4GMJAZUEQB4WA65TLCFQMH7","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TSE.2022.3167628) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Yutong Zhao, Lu Xiao, Andre B Bondi, Bihuan Chen, and Yang Liu. 2022. A large- scale empirical study of real-life performance issues in open source projects.IEEE Transactions on Software Engineering49, 2 (2022), 924–946. doi:10.1109/TSE.202","arxiv_id":"2607.23665","detector":"doi_compliance","evidence":{"ref_index":51,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1109/tse.2022","reconstructed_doi":"10.1109/TSE.2022.3167628"},"severity":"advisory","ref_index":51,"audited_at":"2026-07-30T16:31:53.584882Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/TSE.2022.3167628","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"daa48677e51bf83657bb886fb4d54d571971b4fe4c0534b9357deeeec1646050","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13999,"payload_sha256":"9d5e6b8cc004ea600861f76be762fb4e893d82984e46207be5b88c54897cbd7c","signature_b64":null,"signing_key_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-30T16:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BgxXIJJ+6p/9//xRBOamoZp4OtOv/oCpdmtpyQbi/3hKDLJT7possJ4Xbu4XciNtzBKAZIG/jcL0cX0kiNW4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:52:47.418789Z"},"content_sha256":"cd319705d34a365b0efb2e3ed2353c6cff4a691135fd689b4c3f31aa4ddb8cf6","schema_version":"1.0","event_id":"sha256:cd319705d34a365b0efb2e3ed2353c6cff4a691135fd689b4c3f31aa4ddb8cf6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTR4GMJAZUEQB4WA65TLCFQMH7","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.18653/V1/2023.EMNLP-MAIN.151) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Fengji Zhang, Bei Chen, Yue Zhang, Jacky Keung, Jin Liu, Daoguang Zan, Yi Mao, Jian-Guang Lou, and Weizhu Chen. 2023. RepoCoder: Repository-Level Code Completion Through Iterative Retrieval and Generation. InProceedings of the 2023 Conferen","arxiv_id":"2607.23665","detector":"doi_compliance","evidence":{"ref_index":49,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.18653/v1/","reconstructed_doi":"10.18653/V1/2023.EMNLP-MAIN.151"},"severity":"advisory","ref_index":49,"audited_at":"2026-07-30T16:31:53.584882Z","event_type":"pith.integrity.v1","detected_doi":"10.18653/V1/2023.EMNLP-MAIN.151","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"55f1cfccb0314c972a705aa014afdf0a77c1966c378106a59ba3b8254d5e2bab","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13998,"payload_sha256":"82ba4a2949809bf76c1b5feb0317549bd82d683e672ad02014c430f373a7c36d","signature_b64":null,"signing_key_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-30T16:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgXv9pDmBDlpxRxFttdIwcyewGmcPicxRF0eL6MX4KyW4a6T1kE7sVNhRue5Ktx9CDoKganP3ReO+ywZ1tnBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:52:47.419191Z"},"content_sha256":"5f6c54fa9c6e0bd8983788826a47fa9f3e6b2bdb81547d1dfa3a840900b45a98","schema_version":"1.0","event_id":"sha256:5f6c54fa9c6e0bd8983788826a47fa9f3e6b2bdb81547d1dfa3a840900b45a98"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTR4GMJAZUEQB4WA65TLCFQMH7","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/ISPASS.2009.4919635) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Dmitrijs Zaparanuks, Milan Jovic, and Matthias Hauswirth. 2009. Accuracy of performance counter measurements. In2009 IEEE International Symposium on Performance Analysis of Systems and Software. 23–32. doi:10.1109/ISPASS.2009. 4919635","arxiv_id":"2607.23665","detector":"doi_compliance","evidence":{"ref_index":46,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1109/ispass.2009","reconstructed_doi":"10.1109/ISPASS.2009.4919635"},"severity":"advisory","ref_index":46,"audited_at":"2026-07-30T16:31:53.584882Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/ISPASS.2009.4919635","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e726a6a4a485f59118686e4a4455c74268d6234647308b07f1d90488ce095798","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13997,"payload_sha256":"30d800a031c395e6b37782e04dc3b7b935204d65725bc821bfd96fc4ec4828af","signature_b64":null,"signing_key_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-30T16:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YrV+aEGaq1zHV1NtW4+TpHSE/5rA0eqCg6uOTpGngd5cBA0vreEcdWsgGegMVRhBTqlfH6mmspwEqvQLqonaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:52:47.419555Z"},"content_sha256":"3efe18a4cb6fe16f58184138099d31d40497d83283253d9023e7a6f26c07b761","schema_version":"1.0","event_id":"sha256:3efe18a4cb6fe16f58184138099d31d40497d83283253d9023e7a6f26c07b761"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:HTR4GMJAZUEQB4WA65TLCFQMH7","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10664-022-10247-x) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Luca Traini, Vittorio Cortellessa, Daniele Di Pompeo, and Michele Tucci. 2023. Towards effective assessment of steady state performance in Java software: are we there yet?Empirical Softw. Engg.28, 1 (Jan. 2023), 57 pages. doi:10.1007/s10664","arxiv_id":"2607.23665","detector":"doi_compliance","evidence":{"ref_index":40,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10664-","reconstructed_doi":"10.1007/s10664-022-10247-x"},"severity":"advisory","ref_index":40,"audited_at":"2026-07-30T16:31:53.584882Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10664-022-10247-x","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"7903c992bf95f3009c83481f933008387f32d1e96aa72a5cbff89d8db47c05c3","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":13996,"payload_sha256":"ed5d78e4ba8954dae2c82a6ab7f1a2379bb010396878de2217359849f98bbf4e","signature_b64":null,"signing_key_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-30T16:36:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSnVi44lMLarmLCzbycKczIT4xvfWcQX8eoNA0FxsSNb82VlvdopVbX2zsOYbOGT75MGmX3mACmeeAX1ITQIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:52:47.419974Z"},"content_sha256":"1df0f577cadec463655e0f272bb624656d0a8e6c119fbd630d1c22149c060745","schema_version":"1.0","event_id":"sha256:1df0f577cadec463655e0f272bb624656d0a8e6c119fbd630d1c22149c060745"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HTR4GMJAZUEQB4WA65TLCFQMH7/bundle.json","state_url":"https://pith.science/pith/HTR4GMJAZUEQB4WA65TLCFQMH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HTR4GMJAZUEQB4WA65TLCFQMH7/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-19T20:52:47Z","links":{"resolver":"https://pith.science/pith/HTR4GMJAZUEQB4WA65TLCFQMH7","bundle":"https://pith.science/pith/HTR4GMJAZUEQB4WA65TLCFQMH7/bundle.json","state":"https://pith.science/pith/HTR4GMJAZUEQB4WA65TLCFQMH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HTR4GMJAZUEQB4WA65TLCFQMH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HTR4GMJAZUEQB4WA65TLCFQMH7","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2e471204070620bc89dfffdce808662df81a24252e743990b043903cdede4a72","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-07-26T14:01:54Z","title_canon_sha256":"96ceff22ac8ade57ada028d0b65ae1139a654ff505ecb6216cff18a37e9230f5"},"schema_version":"1.0","source":{"id":"2607.23665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.23665","created_at":"2026-07-28T01:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"2607.23665v1","created_at":"2026-07-28T01:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23665","created_at":"2026-07-28T01:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"HTR4GMJAZUEQ","created_at":"2026-07-28T01:23:04Z"},{"alias_kind":"pith_short_16","alias_value":"HTR4GMJAZUEQB4WA","created_at":"2026-07-28T01:23:04Z"},{"alias_kind":"pith_short_8","alias_value":"HTR4GMJA","created_at":"2026-07-28T01:23:04Z"}],"graph_snapshots":[{"event_id":"sha256:f78c87cd8d0472c3a8a5767e76798e9e21e7846903a89a1ef3c9828e821008e2","target":"graph","created_at":"2026-07-28T01:23:04Z","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/2607.23665/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Runtime efficiency is a critical factor that impacts both software quality and user satisfaction. There are many approaches proposed for code optimization to improve runtime efficiency. Traditional code optimization methods operate on intermediate representations (IRs) during compilation for static languages. They are effective but struggle to handle dynamic languages that do not require compilation. Recently, large language models (LLMs) have been leveraged to directly optimize source code in dynamic languages. However, these methods fail to identify suitable optimization targets and usually ","authors_text":"David Lo, Jiakun Liu, Jun Wan, Shuzheng Gao, Xiaoxue Ren, Yun Peng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-07-26T14:01:54Z","title":"Multi-level Code Optimization via Mixture of Prompts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23665","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:8202951611eeb9d8b4978dc3c5d1777f842550f66159ea8c48635f441a8f6e03","target":"record","created_at":"2026-07-28T01:23:04Z","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":"2e471204070620bc89dfffdce808662df81a24252e743990b043903cdede4a72","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-07-26T14:01:54Z","title_canon_sha256":"96ceff22ac8ade57ada028d0b65ae1139a654ff505ecb6216cff18a37e9230f5"},"schema_version":"1.0","source":{"id":"2607.23665","kind":"arxiv","version":1}},"canonical_sha256":"3ce3c33120cd0900f2c0f766b1160c3fc6f0d30738ff46ec6c73543b17501768","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ce3c33120cd0900f2c0f766b1160c3fc6f0d30738ff46ec6c73543b17501768","first_computed_at":"2026-07-28T01:23:04.384567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T01:23:04.384567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RwTwZR3z7uP6DT2jBWl3B+WBAb0llGyRBWIKEmIrtJQeCS/6GyaT8B/1KCHlZrdayaBSp3yChEX6J1efh8AMDw==","signature_status":"signed_v1","signed_at":"2026-07-28T01:23:04.385396Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.23665","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:1df0f577cadec463655e0f272bb624656d0a8e6c119fbd630d1c22149c060745","sha256:3efe18a4cb6fe16f58184138099d31d40497d83283253d9023e7a6f26c07b761","sha256:5f6c54fa9c6e0bd8983788826a47fa9f3e6b2bdb81547d1dfa3a840900b45a98","sha256:cd319705d34a365b0efb2e3ed2353c6cff4a691135fd689b4c3f31aa4ddb8cf6"]}],"invalid_events":[],"applied_event_ids":["sha256:8202951611eeb9d8b4978dc3c5d1777f842550f66159ea8c48635f441a8f6e03","sha256:f78c87cd8d0472c3a8a5767e76798e9e21e7846903a89a1ef3c9828e821008e2"],"state_sha256":"c70c5aecd04b7da1c7368a768a36e92a56e00a12edd6c2fcabb78d2eb2739449"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObkfxK1THkMdyH8OzK1J6k8kOPK7RYzhLZmth1NQSE/DhBuD/BbMHnYCuPG1QdT5ZcPwE94gStr83r5Bxsw1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T20:52:47.423287Z","bundle_sha256":"b0e2ff3e030b5cdb924b80506af86a1ab9286d610080de5057ae716cae38322e"}}