{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z4OK7NBSHR6WGCFCGELTJZQRHE","short_pith_number":"pith:Z4OK7NBS","schema_version":"1.0","canonical_sha256":"cf1cafb4323c7d6308a2311734e61139330034bdff6fcb7eb49e65a9c33fc9e1","source":{"kind":"arxiv","id":"1811.06043","version":2},"attestation_state":"computed","paper":{"title":"A Performance Vocabulary for Affine Loop Transformations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Louis-No\\\"el Pouchet, Martin Kong","submitted_at":"2018-11-14T20:22:07Z","abstract_excerpt":"Modern polyhedral compilers excel at aggressively optimizing codes with static control parts, but the state-of-practice to find high-performance polyhedral transformations especially for different hardware targets still largely involves auto-tuning. In this work we propose a novel polyhedral scheduling technique, with the aim to reduce the need for auto-tuning while allowing to build customizable and specific transformation strategies. We design constraints and objectives that model several crucial aspects of performance such as stride optimization or the trade-off between parallelism and reus"},"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":"1811.06043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-14T20:22:07Z","cross_cats_sorted":[],"title_canon_sha256":"269440963f18dd4c7386cf6362818bd1200c25e28985212b1f477f255d4e9cea","abstract_canon_sha256":"e777cb61fb11203d5f49b77674cf1cd9996bcc0f66ffd5685383920327fcb182"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:03.003938Z","signature_b64":"Zy20lbXYLtlGEN4AtVQiip8dSeG0K0KfWmJJ0PchRzNMILuLw7sIyRP4HXhD9eV44DC1t603XRSe3vfC8OYZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf1cafb4323c7d6308a2311734e61139330034bdff6fcb7eb49e65a9c33fc9e1","last_reissued_at":"2026-05-17T23:49:03.003532Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:03.003532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Performance Vocabulary for Affine Loop Transformations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Louis-No\\\"el Pouchet, Martin Kong","submitted_at":"2018-11-14T20:22:07Z","abstract_excerpt":"Modern polyhedral compilers excel at aggressively optimizing codes with static control parts, but the state-of-practice to find high-performance polyhedral transformations especially for different hardware targets still largely involves auto-tuning. In this work we propose a novel polyhedral scheduling technique, with the aim to reduce the need for auto-tuning while allowing to build customizable and specific transformation strategies. We design constraints and objectives that model several crucial aspects of performance such as stride optimization or the trade-off between parallelism and reus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06043","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":""},"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":"1811.06043","created_at":"2026-05-17T23:49:03.003593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06043v2","created_at":"2026-05-17T23:49:03.003593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06043","created_at":"2026-05-17T23:49:03.003593+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z4OK7NBSHR6W","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z4OK7NBSHR6WGCFC","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z4OK7NBS","created_at":"2026-05-18T12:33:04.347982+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/Z4OK7NBSHR6WGCFCGELTJZQRHE","json":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE.json","graph_json":"https://pith.science/api/pith-number/Z4OK7NBSHR6WGCFCGELTJZQRHE/graph.json","events_json":"https://pith.science/api/pith-number/Z4OK7NBSHR6WGCFCGELTJZQRHE/events.json","paper":"https://pith.science/paper/Z4OK7NBS"},"agent_actions":{"view_html":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE","download_json":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE.json","view_paper":"https://pith.science/paper/Z4OK7NBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06043&json=true","fetch_graph":"https://pith.science/api/pith-number/Z4OK7NBSHR6WGCFCGELTJZQRHE/graph.json","fetch_events":"https://pith.science/api/pith-number/Z4OK7NBSHR6WGCFCGELTJZQRHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/action/storage_attestation","attest_author":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/action/author_attestation","sign_citation":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/action/citation_signature","submit_replication":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/action/replication_record"}},"created_at":"2026-05-17T23:49:03.003593+00:00","updated_at":"2026-05-17T23:49:03.003593+00:00"}