{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GEL5SMO223RUR5O7CAPOVAL6DA","short_pith_number":"pith:GEL5SMO2","schema_version":"1.0","canonical_sha256":"3117d931dad6e348f5df101eea817e1811a51bcb32769847df7639665cf0ef6b","source":{"kind":"arxiv","id":"2505.09363","version":2},"attestation_state":"computed","paper":{"title":"eqsat: An Equality Saturation Dialect for Non-destructive Rewriting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alexandre Lopoukhine, Bjorn De Sutter, Jianyi Cheng, Jules Merckx, Samuel Coward, Tobias Grosser","submitted_at":"2025-05-14T13:12:39Z","abstract_excerpt":"With recent algorithmic improvements and easy-to-use libraries, equality saturation is being picked up for hardware design, program synthesis, theorem proving, program optimization, and more. Existing work on using equality saturation for program optimization makes use of external equality saturation libraries such as egg, typically generating a single optimized expression. In the context of a compiler, such an approach uses equality saturation to replace a small number of passes. In this work, we propose an alternative approach that represents equality saturation natively in the compiler's in"},"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":"2505.09363","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-05-14T13:12:39Z","cross_cats_sorted":[],"title_canon_sha256":"e77f9f9b25a1855738f39d194dccf8fbfbd38346214d23a3b9d06935df53cd51","abstract_canon_sha256":"3d8531b71df12a76dd697607bd64e781909bf8b4c0f88b62b69f250acf33463e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:25.387492Z","signature_b64":"Y1G5g8jsvtcuuaAutcX5A0wSPqcUtCZLReaqBBiKne6wB1zj9fxSgtKa17WJLleSSVcQRu5tbP7ooABw5QPPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3117d931dad6e348f5df101eea817e1811a51bcb32769847df7639665cf0ef6b","last_reissued_at":"2026-07-05T11:03:25.386991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:25.386991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"eqsat: An Equality Saturation Dialect for Non-destructive Rewriting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Alexandre Lopoukhine, Bjorn De Sutter, Jianyi Cheng, Jules Merckx, Samuel Coward, Tobias Grosser","submitted_at":"2025-05-14T13:12:39Z","abstract_excerpt":"With recent algorithmic improvements and easy-to-use libraries, equality saturation is being picked up for hardware design, program synthesis, theorem proving, program optimization, and more. Existing work on using equality saturation for program optimization makes use of external equality saturation libraries such as egg, typically generating a single optimized expression. In the context of a compiler, such an approach uses equality saturation to replace a small number of passes. In this work, we propose an alternative approach that represents equality saturation natively in the compiler's in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09363","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/2505.09363/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":"2505.09363","created_at":"2026-07-05T11:03:25.387053+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.09363v2","created_at":"2026-07-05T11:03:25.387053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09363","created_at":"2026-07-05T11:03:25.387053+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEL5SMO223RU","created_at":"2026-07-05T11:03:25.387053+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEL5SMO223RUR5O7","created_at":"2026-07-05T11:03:25.387053+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEL5SMO2","created_at":"2026-07-05T11:03:25.387053+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.22267","citing_title":"Aquas: Enhancing Domain Specialization through Holistic Hardware-Software Co-Optimization based on MLIR","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01124","citing_title":"Practical Formal Verification for MLIR Programs","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GEL5SMO223RUR5O7CAPOVAL6DA","json":"https://pith.science/pith/GEL5SMO223RUR5O7CAPOVAL6DA.json","graph_json":"https://pith.science/api/pith-number/GEL5SMO223RUR5O7CAPOVAL6DA/graph.json","events_json":"https://pith.science/api/pith-number/GEL5SMO223RUR5O7CAPOVAL6DA/events.json","paper":"https://pith.science/paper/GEL5SMO2"},"agent_actions":{"view_html":"https://pith.science/pith/GEL5SMO223RUR5O7CAPOVAL6DA","download_json":"https://pith.science/pith/GEL5SMO223RUR5O7CAPOVAL6DA.json","view_paper":"https://pith.science/paper/GEL5SMO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.09363&json=true","fetch_graph":"https://pith.science/api/pith-number/GEL5SMO223RUR5O7CAPOVAL6DA/graph.json","fetch_events":"https://pith.science/api/pith-number/GEL5SMO223RUR5O7CAPOVAL6DA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEL5SMO223RUR5O7CAPOVAL6DA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEL5SMO223RUR5O7CAPOVAL6DA/action/storage_attestation","attest_author":"https://pith.science/pith/GEL5SMO223RUR5O7CAPOVAL6DA/action/author_attestation","sign_citation":"https://pith.science/pith/GEL5SMO223RUR5O7CAPOVAL6DA/action/citation_signature","submit_replication":"https://pith.science/pith/GEL5SMO223RUR5O7CAPOVAL6DA/action/replication_record"}},"created_at":"2026-07-05T11:03:25.387053+00:00","updated_at":"2026-07-05T11:03:25.387053+00:00"}