{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RDHBPZUNSTYYWSY43NQNSXQVFD","short_pith_number":"pith:RDHBPZUN","schema_version":"1.0","canonical_sha256":"88ce17e68d94f18b4b1cdb60d95e1528f41ba2a16cbabcc364665bc7afa7f78f","source":{"kind":"arxiv","id":"2506.16048","version":1},"attestation_state":"computed","paper":{"title":"WAMI: Compilation to WebAssembly through MLIR without Losing Abstraction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Brandon Lucia, Byeongjee Kang, Harsh Desai, Limin Jia","submitted_at":"2025-06-19T06:05:26Z","abstract_excerpt":"WebAssembly (Wasm) is a portable bytecode format that serves as a compilation target for high-level languages, enabling their secure and efficient execution across diverse platforms, including web browsers and embedded systems. To improve support for high-level languages without incurring significant code size or performance overheads, Wasm continuously evolves by integrating high-level features such as Garbage Collection and Stack Switching. However, existing compilation approaches either lack reusable design -- requiring redundant implementation efforts for each language -- or lose abstracti"},"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":"2506.16048","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2025-06-19T06:05:26Z","cross_cats_sorted":[],"title_canon_sha256":"2117b21791bfe4cb20a5c351564f036566a5c7bc5260b9ae59d2e965847faa0c","abstract_canon_sha256":"12aeb237ae513e8eefa85fe77f59b0588801ae3ce132c08a89ec0dbd0c956dcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:29.335090Z","signature_b64":"KOQj9IfPUGgma9P/jMUfe/Viqfk+8sZdrrgJaum73X+9SDD/eE3DCT/hfwcDL+1Iip/7OsDIyXcaXc3OJU0uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88ce17e68d94f18b4b1cdb60d95e1528f41ba2a16cbabcc364665bc7afa7f78f","last_reissued_at":"2026-07-05T11:24:29.334561Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:29.334561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"WAMI: Compilation to WebAssembly through MLIR without Losing Abstraction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Brandon Lucia, Byeongjee Kang, Harsh Desai, Limin Jia","submitted_at":"2025-06-19T06:05:26Z","abstract_excerpt":"WebAssembly (Wasm) is a portable bytecode format that serves as a compilation target for high-level languages, enabling their secure and efficient execution across diverse platforms, including web browsers and embedded systems. To improve support for high-level languages without incurring significant code size or performance overheads, Wasm continuously evolves by integrating high-level features such as Garbage Collection and Stack Switching. However, existing compilation approaches either lack reusable design -- requiring redundant implementation efforts for each language -- or lose abstracti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16048","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/2506.16048/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":"2506.16048","created_at":"2026-07-05T11:24:29.334628+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.16048v1","created_at":"2026-07-05T11:24:29.334628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16048","created_at":"2026-07-05T11:24:29.334628+00:00"},{"alias_kind":"pith_short_12","alias_value":"RDHBPZUNSTYY","created_at":"2026-07-05T11:24:29.334628+00:00"},{"alias_kind":"pith_short_16","alias_value":"RDHBPZUNSTYYWSY4","created_at":"2026-07-05T11:24:29.334628+00:00"},{"alias_kind":"pith_short_8","alias_value":"RDHBPZUN","created_at":"2026-07-05T11:24:29.334628+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04352","citing_title":"Negative and Fractional Types in the Fidelity Framework","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2603.16437","citing_title":"Dimensional Type Systems and Deterministic Memory Management: Design-Time Semantic Preservation in Native Compilation","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2603.18104","citing_title":"Adaptive Domain Models: Bayesian Evolution, Warm Rotation, and Principled Training for Geometric and Neuromorphic AI","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2603.17627","citing_title":"The Program Hypergraph: Multi-Way Relational Structure for Geometric Algebra, Spatial Compute, and Physics-Aware Compilation","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RDHBPZUNSTYYWSY43NQNSXQVFD","json":"https://pith.science/pith/RDHBPZUNSTYYWSY43NQNSXQVFD.json","graph_json":"https://pith.science/api/pith-number/RDHBPZUNSTYYWSY43NQNSXQVFD/graph.json","events_json":"https://pith.science/api/pith-number/RDHBPZUNSTYYWSY43NQNSXQVFD/events.json","paper":"https://pith.science/paper/RDHBPZUN"},"agent_actions":{"view_html":"https://pith.science/pith/RDHBPZUNSTYYWSY43NQNSXQVFD","download_json":"https://pith.science/pith/RDHBPZUNSTYYWSY43NQNSXQVFD.json","view_paper":"https://pith.science/paper/RDHBPZUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.16048&json=true","fetch_graph":"https://pith.science/api/pith-number/RDHBPZUNSTYYWSY43NQNSXQVFD/graph.json","fetch_events":"https://pith.science/api/pith-number/RDHBPZUNSTYYWSY43NQNSXQVFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RDHBPZUNSTYYWSY43NQNSXQVFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RDHBPZUNSTYYWSY43NQNSXQVFD/action/storage_attestation","attest_author":"https://pith.science/pith/RDHBPZUNSTYYWSY43NQNSXQVFD/action/author_attestation","sign_citation":"https://pith.science/pith/RDHBPZUNSTYYWSY43NQNSXQVFD/action/citation_signature","submit_replication":"https://pith.science/pith/RDHBPZUNSTYYWSY43NQNSXQVFD/action/replication_record"}},"created_at":"2026-07-05T11:24:29.334628+00:00","updated_at":"2026-07-05T11:24:29.334628+00:00"}