{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XX2V66XTL6UQWPJPQSB2OC2PRH","short_pith_number":"pith:XX2V66XT","canonical_record":{"source":{"id":"2508.07434","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-08-10T17:11:56Z","cross_cats_sorted":[],"title_canon_sha256":"c721d9000b4b95ce27db3f1880e1e52a5e333c7146b7ad678e02d3831f170584","abstract_canon_sha256":"33c4726e6f69bd4f2c1c4c99cb2c8f171972bc78bd7438d604823b98459ba3a4"},"schema_version":"1.0"},"canonical_sha256":"bdf55f7af35fa90b3d2f8483a70b4f89f18387f0b2a631f5b5cdc53deeec7835","source":{"kind":"arxiv","id":"2508.07434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07434","created_at":"2026-07-05T11:51:46Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07434v1","created_at":"2026-07-05T11:51:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07434","created_at":"2026-07-05T11:51:46Z"},{"alias_kind":"pith_short_12","alias_value":"XX2V66XTL6UQ","created_at":"2026-07-05T11:51:46Z"},{"alias_kind":"pith_short_16","alias_value":"XX2V66XTL6UQWPJP","created_at":"2026-07-05T11:51:46Z"},{"alias_kind":"pith_short_8","alias_value":"XX2V66XT","created_at":"2026-07-05T11:51:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XX2V66XTL6UQWPJPQSB2OC2PRH","target":"record","payload":{"canonical_record":{"source":{"id":"2508.07434","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-08-10T17:11:56Z","cross_cats_sorted":[],"title_canon_sha256":"c721d9000b4b95ce27db3f1880e1e52a5e333c7146b7ad678e02d3831f170584","abstract_canon_sha256":"33c4726e6f69bd4f2c1c4c99cb2c8f171972bc78bd7438d604823b98459ba3a4"},"schema_version":"1.0"},"canonical_sha256":"bdf55f7af35fa90b3d2f8483a70b4f89f18387f0b2a631f5b5cdc53deeec7835","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:46.221585Z","signature_b64":"3oKwXDAjdSu2YrdUwuP0T2D0vQag8EgYG0KVUixW3TSwM4N/JQtTVRm/62PAI1ZNNbjOpbYNmChQn1oqixTyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdf55f7af35fa90b3d2f8483a70b4f89f18387f0b2a631f5b5cdc53deeec7835","last_reissued_at":"2026-07-05T11:51:46.221068Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:46.221068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.07434","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:51:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MnnE2emMYwLzvXxW+zOVQ35WRihtkRIF/0QESKJzmuuUe76vZfAO/wNqDA9EFeeyF634NLM/k3x5dSEw1rQnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T12:46:14.339056Z"},"content_sha256":"d7ec9d6a2bc597c848b3dac29614b9d97f061f45629683d081292e858729bee8","schema_version":"1.0","event_id":"sha256:d7ec9d6a2bc597c848b3dac29614b9d97f061f45629683d081292e858729bee8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XX2V66XTL6UQWPJPQSB2OC2PRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Bo An, Jianguo Huang, Steven Hoi, Yanchen Deng, Zhiyi Lyu","submitted_at":"2025-08-10T17:11:56Z","abstract_excerpt":"Large Language Models (LLMs) with inference-time scaling techniques show promise for code generation, yet face notable efficiency and scalability challenges. Construction-based tree-search methods suffer from rapid growth in tree size, high token consumption, and lack of anytime property. In contrast, improvement-based methods offer better performance but often struggle with uninformative reward signals and inefficient search strategies. In this work, we propose \\textbf{ReLoc}, a unified local search framework which effectively performs step-by-step code revision. Specifically, ReLoc explores "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07434","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/2508.07434/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:51:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cI3Z81w7aMJDCgG0i5QluzWk3OQIB3K6PYeOZfBvAM7yMwNHK1Tra0G29xCKGOwDwfYc8FqI2gkI/MkZp04VCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T12:46:14.339567Z"},"content_sha256":"55580e7c94b180791730673377447ff8f1469fd107abf47f8110bf6531ecd48e","schema_version":"1.0","event_id":"sha256:55580e7c94b180791730673377447ff8f1469fd107abf47f8110bf6531ecd48e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XX2V66XTL6UQWPJPQSB2OC2PRH/bundle.json","state_url":"https://pith.science/pith/XX2V66XTL6UQWPJPQSB2OC2PRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XX2V66XTL6UQWPJPQSB2OC2PRH/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-06T12:46:14Z","links":{"resolver":"https://pith.science/pith/XX2V66XTL6UQWPJPQSB2OC2PRH","bundle":"https://pith.science/pith/XX2V66XTL6UQWPJPQSB2OC2PRH/bundle.json","state":"https://pith.science/pith/XX2V66XTL6UQWPJPQSB2OC2PRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XX2V66XTL6UQWPJPQSB2OC2PRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XX2V66XTL6UQWPJPQSB2OC2PRH","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":"33c4726e6f69bd4f2c1c4c99cb2c8f171972bc78bd7438d604823b98459ba3a4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-08-10T17:11:56Z","title_canon_sha256":"c721d9000b4b95ce27db3f1880e1e52a5e333c7146b7ad678e02d3831f170584"},"schema_version":"1.0","source":{"id":"2508.07434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07434","created_at":"2026-07-05T11:51:46Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07434v1","created_at":"2026-07-05T11:51:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07434","created_at":"2026-07-05T11:51:46Z"},{"alias_kind":"pith_short_12","alias_value":"XX2V66XTL6UQ","created_at":"2026-07-05T11:51:46Z"},{"alias_kind":"pith_short_16","alias_value":"XX2V66XTL6UQWPJP","created_at":"2026-07-05T11:51:46Z"},{"alias_kind":"pith_short_8","alias_value":"XX2V66XT","created_at":"2026-07-05T11:51:46Z"}],"graph_snapshots":[{"event_id":"sha256:55580e7c94b180791730673377447ff8f1469fd107abf47f8110bf6531ecd48e","target":"graph","created_at":"2026-07-05T11:51:46Z","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/2508.07434/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large Language Models (LLMs) with inference-time scaling techniques show promise for code generation, yet face notable efficiency and scalability challenges. Construction-based tree-search methods suffer from rapid growth in tree size, high token consumption, and lack of anytime property. In contrast, improvement-based methods offer better performance but often struggle with uninformative reward signals and inefficient search strategies. In this work, we propose \\textbf{ReLoc}, a unified local search framework which effectively performs step-by-step code revision. Specifically, ReLoc explores ","authors_text":"Bo An, Jianguo Huang, Steven Hoi, Yanchen Deng, Zhiyi Lyu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-08-10T17:11:56Z","title":"Let's Revise Step-by-Step: A Unified Local Search Framework for Code Generation with LLMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07434","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:d7ec9d6a2bc597c848b3dac29614b9d97f061f45629683d081292e858729bee8","target":"record","created_at":"2026-07-05T11:51:46Z","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":"33c4726e6f69bd4f2c1c4c99cb2c8f171972bc78bd7438d604823b98459ba3a4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-08-10T17:11:56Z","title_canon_sha256":"c721d9000b4b95ce27db3f1880e1e52a5e333c7146b7ad678e02d3831f170584"},"schema_version":"1.0","source":{"id":"2508.07434","kind":"arxiv","version":1}},"canonical_sha256":"bdf55f7af35fa90b3d2f8483a70b4f89f18387f0b2a631f5b5cdc53deeec7835","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdf55f7af35fa90b3d2f8483a70b4f89f18387f0b2a631f5b5cdc53deeec7835","first_computed_at":"2026-07-05T11:51:46.221068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:51:46.221068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3oKwXDAjdSu2YrdUwuP0T2D0vQag8EgYG0KVUixW3TSwM4N/JQtTVRm/62PAI1ZNNbjOpbYNmChQn1oqixTyCw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:51:46.221585Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.07434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7ec9d6a2bc597c848b3dac29614b9d97f061f45629683d081292e858729bee8","sha256:55580e7c94b180791730673377447ff8f1469fd107abf47f8110bf6531ecd48e"],"state_sha256":"9326b153e158e7fc337c39d1133dd24378943bc980e00e8c4957ba82b3894da4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlTZOfhMmAZVaizvMRINc+lWy3kq7zkPiD+iX67hrP2CBH3c1iZJM3XfiYA+sBe+dS+bKwcMJZKRCXbcpHAuCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T12:46:14.343649Z","bundle_sha256":"95646fd505d0ac9e5def91b98797c7ff6852f66eabb4dc8e19021ab83f452492"}}