{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:342MJXJEDZ2DF6R4NKGCK7JYLI","short_pith_number":"pith:342MJXJE","schema_version":"1.0","canonical_sha256":"df34c4dd241e7432fa3c6a8c257d385a3d39de885ab2aae4e225a10c8d016f2f","source":{"kind":"arxiv","id":"2510.13176","version":2},"attestation_state":"computed","paper":{"title":"GRACE: Cluster-Specific Sequence Reuse for Compiler Auto-Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Chao Zha, Haolin Pan, Jinyuan Dong, Mingjie Xing, Yanjun Wu","submitted_at":"2025-10-15T06:01:19Z","abstract_excerpt":"Compiler auto-tuning aims to improve optimization quality beyond fixed compiler heuristics, but existing approaches often face a trade-off between effectiveness and deployability. Iterative compilation can discover strong program-specific optimization sequences, yet its search cost is often prohibitive for practical reuse. Learning-based methods reduce tuning overhead, but their effectiveness depends on how well optimization knowledge transfers to unseen programs. Recent coreset-based methods improve this trade-off, but they typically either still rely on relatively large test-time search or a"},"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":"2510.13176","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2025-10-15T06:01:19Z","cross_cats_sorted":[],"title_canon_sha256":"b28e7ecb891f9f728f4dd9778ae900517ea85437540ff4492666caeba0c3abbd","abstract_canon_sha256":"059dda3b033367c3807b6abf4429008a258c11807512f1a5099247a6dff306e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T01:11:59.192741Z","signature_b64":"MMfq1VuIv39fBAfHTEZM6xwDqU3Cn8dN3sq0HBNxQ92sSHuPyZ3rYUgaNvycTELBSIW2FbAYotFNNRbWmfFdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df34c4dd241e7432fa3c6a8c257d385a3d39de885ab2aae4e225a10c8d016f2f","last_reissued_at":"2026-08-03T01:11:59.190957Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T01:11:59.190957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GRACE: Cluster-Specific Sequence Reuse for Compiler Auto-Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Chao Zha, Haolin Pan, Jinyuan Dong, Mingjie Xing, Yanjun Wu","submitted_at":"2025-10-15T06:01:19Z","abstract_excerpt":"Compiler auto-tuning aims to improve optimization quality beyond fixed compiler heuristics, but existing approaches often face a trade-off between effectiveness and deployability. Iterative compilation can discover strong program-specific optimization sequences, yet its search cost is often prohibitive for practical reuse. Learning-based methods reduce tuning overhead, but their effectiveness depends on how well optimization knowledge transfers to unseen programs. Recent coreset-based methods improve this trade-off, but they typically either still rely on relatively large test-time search or a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.13176","kind":"arxiv","version":2},"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/2510.13176/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":"2510.13176","created_at":"2026-08-03T01:11:59.192047+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.13176v2","created_at":"2026-08-03T01:11:59.192047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.13176","created_at":"2026-08-03T01:11:59.192047+00:00"},{"alias_kind":"pith_short_12","alias_value":"342MJXJEDZ2D","created_at":"2026-08-03T01:11:59.192047+00:00"},{"alias_kind":"pith_short_16","alias_value":"342MJXJEDZ2DF6R4","created_at":"2026-08-03T01:11:59.192047+00:00"},{"alias_kind":"pith_short_8","alias_value":"342MJXJE","created_at":"2026-08-03T01:11:59.192047+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/342MJXJEDZ2DF6R4NKGCK7JYLI","json":"https://pith.science/pith/342MJXJEDZ2DF6R4NKGCK7JYLI.json","graph_json":"https://pith.science/api/pith-number/342MJXJEDZ2DF6R4NKGCK7JYLI/graph.json","events_json":"https://pith.science/api/pith-number/342MJXJEDZ2DF6R4NKGCK7JYLI/events.json","paper":"https://pith.science/paper/342MJXJE"},"agent_actions":{"view_html":"https://pith.science/pith/342MJXJEDZ2DF6R4NKGCK7JYLI","download_json":"https://pith.science/pith/342MJXJEDZ2DF6R4NKGCK7JYLI.json","view_paper":"https://pith.science/paper/342MJXJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.13176&json=true","fetch_graph":"https://pith.science/api/pith-number/342MJXJEDZ2DF6R4NKGCK7JYLI/graph.json","fetch_events":"https://pith.science/api/pith-number/342MJXJEDZ2DF6R4NKGCK7JYLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/342MJXJEDZ2DF6R4NKGCK7JYLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/342MJXJEDZ2DF6R4NKGCK7JYLI/action/storage_attestation","attest_author":"https://pith.science/pith/342MJXJEDZ2DF6R4NKGCK7JYLI/action/author_attestation","sign_citation":"https://pith.science/pith/342MJXJEDZ2DF6R4NKGCK7JYLI/action/citation_signature","submit_replication":"https://pith.science/pith/342MJXJEDZ2DF6R4NKGCK7JYLI/action/replication_record"}},"created_at":"2026-08-03T01:11:59.192047+00:00","updated_at":"2026-08-03T01:11:59.192047+00:00"}