{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:K77P3UNOJFMQERWMJ4B7RO4XQR","short_pith_number":"pith:K77P3UNO","schema_version":"1.0","canonical_sha256":"57fefdd1ae49590246cc4f03f8bb9784692db81e18618791923933db25c5b22b","source":{"kind":"arxiv","id":"2204.13261","version":1},"attestation_state":"computed","paper":{"title":"Genetic Improvement in the Shackleton Framework for Optimizing LLVM Pass Sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Andrew N. Sloss, Hannah Peeler, Kenneth N. Reid, Shuyue Stella Li, Wolfgang Banzhaf","submitted_at":"2022-04-28T02:48:04Z","abstract_excerpt":"Genetic improvement is a search technique that aims to improve a given acceptable solution to a problem. In this paper, we present the novel use of genetic improvement to find problem-specific optimized LLVM pass sequences. We develop a pass-level patch representation in the linear genetic programming framework, Shackleton, to evolve the modifications to be applied to the default optimization pass sequences. Our GI-evolved solution has a mean of 3.7% runtime improvement compared to the -O3 optimization level in the default code generation options which optimizes on runtime. The proposed GI met"},"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":"2204.13261","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2022-04-28T02:48:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"da510c31ffa492e329fe9c2bb9de3f3792c356901f1d5d8250a1110e82ac2533","abstract_canon_sha256":"14f75e19fe361071c94725c7c28af02c83857c213acec72e474b6c8f34b9a396"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:18:33.017354Z","signature_b64":"CpHnHOnnkaseg9F+3XzWXs2kLayzmIjLv1t2ZRgZ0BvtGBNt3FttWOCYEzpBTslQjHUvWMDJdYCCFUUsVT30Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57fefdd1ae49590246cc4f03f8bb9784692db81e18618791923933db25c5b22b","last_reissued_at":"2026-07-05T04:18:33.016883Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:18:33.016883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genetic Improvement in the Shackleton Framework for Optimizing LLVM Pass Sequences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Andrew N. Sloss, Hannah Peeler, Kenneth N. Reid, Shuyue Stella Li, Wolfgang Banzhaf","submitted_at":"2022-04-28T02:48:04Z","abstract_excerpt":"Genetic improvement is a search technique that aims to improve a given acceptable solution to a problem. In this paper, we present the novel use of genetic improvement to find problem-specific optimized LLVM pass sequences. We develop a pass-level patch representation in the linear genetic programming framework, Shackleton, to evolve the modifications to be applied to the default optimization pass sequences. Our GI-evolved solution has a mean of 3.7% runtime improvement compared to the -O3 optimization level in the default code generation options which optimizes on runtime. The proposed GI met"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.13261","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/2204.13261/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":"2204.13261","created_at":"2026-07-05T04:18:33.016943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.13261v1","created_at":"2026-07-05T04:18:33.016943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.13261","created_at":"2026-07-05T04:18:33.016943+00:00"},{"alias_kind":"pith_short_12","alias_value":"K77P3UNOJFMQ","created_at":"2026-07-05T04:18:33.016943+00:00"},{"alias_kind":"pith_short_16","alias_value":"K77P3UNOJFMQERWM","created_at":"2026-07-05T04:18:33.016943+00:00"},{"alias_kind":"pith_short_8","alias_value":"K77P3UNO","created_at":"2026-07-05T04:18:33.016943+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K77P3UNOJFMQERWMJ4B7RO4XQR","json":"https://pith.science/pith/K77P3UNOJFMQERWMJ4B7RO4XQR.json","graph_json":"https://pith.science/api/pith-number/K77P3UNOJFMQERWMJ4B7RO4XQR/graph.json","events_json":"https://pith.science/api/pith-number/K77P3UNOJFMQERWMJ4B7RO4XQR/events.json","paper":"https://pith.science/paper/K77P3UNO"},"agent_actions":{"view_html":"https://pith.science/pith/K77P3UNOJFMQERWMJ4B7RO4XQR","download_json":"https://pith.science/pith/K77P3UNOJFMQERWMJ4B7RO4XQR.json","view_paper":"https://pith.science/paper/K77P3UNO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.13261&json=true","fetch_graph":"https://pith.science/api/pith-number/K77P3UNOJFMQERWMJ4B7RO4XQR/graph.json","fetch_events":"https://pith.science/api/pith-number/K77P3UNOJFMQERWMJ4B7RO4XQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K77P3UNOJFMQERWMJ4B7RO4XQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K77P3UNOJFMQERWMJ4B7RO4XQR/action/storage_attestation","attest_author":"https://pith.science/pith/K77P3UNOJFMQERWMJ4B7RO4XQR/action/author_attestation","sign_citation":"https://pith.science/pith/K77P3UNOJFMQERWMJ4B7RO4XQR/action/citation_signature","submit_replication":"https://pith.science/pith/K77P3UNOJFMQERWMJ4B7RO4XQR/action/replication_record"}},"created_at":"2026-07-05T04:18:33.016943+00:00","updated_at":"2026-07-05T04:18:33.016943+00:00"}