{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RALGPDZPQ2GR5HXQT7PC6QCVI6","short_pith_number":"pith:RALGPDZP","schema_version":"1.0","canonical_sha256":"8816678f2f868d1e9ef09fde2f4055478ae42fe315973541fb269ca26bd318cd","source":{"kind":"arxiv","id":"2307.05603","version":1},"attestation_state":"computed","paper":{"title":"Can You Improve My Code? Optimizing Programs with Local Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PL"],"primary_cat":"cs.SE","authors_text":"Fatemeh Abdollahi, Levi H. S. Lelis, Matthew E. Taylor, Saqib Ameen","submitted_at":"2023-07-10T20:39:41Z","abstract_excerpt":"This paper introduces a local search method for improving an existing program with respect to a measurable objective. Program Optimization with Locally Improving Search (POLIS) exploits the structure of a program, defined by its lines. POLIS improves a single line of the program while keeping the remaining lines fixed, using existing brute-force synthesis algorithms, and continues iterating until it is unable to improve the program's performance. POLIS was evaluated with a 27-person user study, where participants wrote programs attempting to maximize the score of two single-agent games: Lunar "},"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":"2307.05603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2023-07-10T20:39:41Z","cross_cats_sorted":["cs.LG","cs.PL"],"title_canon_sha256":"98596f0f5808ee024bbe413ebe64fea115774506790c4baf4630830be3ca547d","abstract_canon_sha256":"9da70ab6c7838ded66c7024b37efec0cdc8df0efa16e4bbdc48b2d5a2c8d8b88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:10.305519Z","signature_b64":"nJOT1VOvWAzCzbLenbSf8LVMqan48KCRsiq6gnIRsDqqdZdDc8uoZ8cqC/7OW4grc77ccYQ4y6CZTeam84qpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8816678f2f868d1e9ef09fde2f4055478ae42fe315973541fb269ca26bd318cd","last_reissued_at":"2026-07-05T06:30:10.305124Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:10.305124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can You Improve My Code? Optimizing Programs with Local Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PL"],"primary_cat":"cs.SE","authors_text":"Fatemeh Abdollahi, Levi H. S. Lelis, Matthew E. Taylor, Saqib Ameen","submitted_at":"2023-07-10T20:39:41Z","abstract_excerpt":"This paper introduces a local search method for improving an existing program with respect to a measurable objective. Program Optimization with Locally Improving Search (POLIS) exploits the structure of a program, defined by its lines. POLIS improves a single line of the program while keeping the remaining lines fixed, using existing brute-force synthesis algorithms, and continues iterating until it is unable to improve the program's performance. POLIS was evaluated with a 27-person user study, where participants wrote programs attempting to maximize the score of two single-agent games: Lunar "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.05603","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/2307.05603/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":"2307.05603","created_at":"2026-07-05T06:30:10.305182+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.05603v1","created_at":"2026-07-05T06:30:10.305182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.05603","created_at":"2026-07-05T06:30:10.305182+00:00"},{"alias_kind":"pith_short_12","alias_value":"RALGPDZPQ2GR","created_at":"2026-07-05T06:30:10.305182+00:00"},{"alias_kind":"pith_short_16","alias_value":"RALGPDZPQ2GR5HXQ","created_at":"2026-07-05T06:30:10.305182+00:00"},{"alias_kind":"pith_short_8","alias_value":"RALGPDZP","created_at":"2026-07-05T06:30:10.305182+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19506","citing_title":"Learning Game-Playing Agents with Generative Code Optimization","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RALGPDZPQ2GR5HXQT7PC6QCVI6","json":"https://pith.science/pith/RALGPDZPQ2GR5HXQT7PC6QCVI6.json","graph_json":"https://pith.science/api/pith-number/RALGPDZPQ2GR5HXQT7PC6QCVI6/graph.json","events_json":"https://pith.science/api/pith-number/RALGPDZPQ2GR5HXQT7PC6QCVI6/events.json","paper":"https://pith.science/paper/RALGPDZP"},"agent_actions":{"view_html":"https://pith.science/pith/RALGPDZPQ2GR5HXQT7PC6QCVI6","download_json":"https://pith.science/pith/RALGPDZPQ2GR5HXQT7PC6QCVI6.json","view_paper":"https://pith.science/paper/RALGPDZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.05603&json=true","fetch_graph":"https://pith.science/api/pith-number/RALGPDZPQ2GR5HXQT7PC6QCVI6/graph.json","fetch_events":"https://pith.science/api/pith-number/RALGPDZPQ2GR5HXQT7PC6QCVI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RALGPDZPQ2GR5HXQT7PC6QCVI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RALGPDZPQ2GR5HXQT7PC6QCVI6/action/storage_attestation","attest_author":"https://pith.science/pith/RALGPDZPQ2GR5HXQT7PC6QCVI6/action/author_attestation","sign_citation":"https://pith.science/pith/RALGPDZPQ2GR5HXQT7PC6QCVI6/action/citation_signature","submit_replication":"https://pith.science/pith/RALGPDZPQ2GR5HXQT7PC6QCVI6/action/replication_record"}},"created_at":"2026-07-05T06:30:10.305182+00:00","updated_at":"2026-07-05T06:30:10.305182+00:00"}