{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z4OK7NBSHR6WGCFCGELTJZQRHE","short_pith_number":"pith:Z4OK7NBS","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"},"canonical_sha256":"cf1cafb4323c7d6308a2311734e61139330034bdff6fcb7eb49e65a9c33fc9e1","source":{"kind":"arxiv","id":"1811.06043","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06043","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06043v2","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06043","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"Z4OK7NBSHR6W","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4OK7NBSHR6WGCFC","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4OK7NBS","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z4OK7NBSHR6WGCFCGELTJZQRHE","target":"record","payload":{"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"},"canonical_sha256":"cf1cafb4323c7d6308a2311734e61139330034bdff6fcb7eb49e65a9c33fc9e1","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"},"source_kind":"arxiv","source_id":"1811.06043","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"adq3mKYHmnsgAjIp3UQL+hrL5l1gg7RFlGJvcagW/fvi62F7b3wXbi0GQa96k/Mxt1/qdKxkOMBh4e3bS5ZzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:39:11.223608Z"},"content_sha256":"d0fcf62d606c7c72c04f84d6e3b65b5117c7ece13907994dc21c9c84c9440346","schema_version":"1.0","event_id":"sha256:d0fcf62d606c7c72c04f84d6e3b65b5117c7ece13907994dc21c9c84c9440346"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z4OK7NBSHR6WGCFCGELTJZQRHE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+xBsCg4MXOXcn1MPOrA9NK1wwqFQFn2Z2m+N1O2fJ6CrZ/kNxrQiVNwWkBg2PDzcj342Ayr5/W58M5vNpzHwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:39:11.224221Z"},"content_sha256":"60438286d89d265546c6556c9538f751e4095ed96126f0e41839e1a666d139ee","schema_version":"1.0","event_id":"sha256:60438286d89d265546c6556c9538f751e4095ed96126f0e41839e1a666d139ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/bundle.json","state_url":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T08:39:11Z","links":{"resolver":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE","bundle":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/bundle.json","state":"https://pith.science/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4OK7NBSHR6WGCFCGELTJZQRHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z4OK7NBSHR6WGCFCGELTJZQRHE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e777cb61fb11203d5f49b77674cf1cd9996bcc0f66ffd5685383920327fcb182","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-14T20:22:07Z","title_canon_sha256":"269440963f18dd4c7386cf6362818bd1200c25e28985212b1f477f255d4e9cea"},"schema_version":"1.0","source":{"id":"1811.06043","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.06043","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"arxiv_version","alias_value":"1811.06043v2","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06043","created_at":"2026-05-17T23:49:03Z"},{"alias_kind":"pith_short_12","alias_value":"Z4OK7NBSHR6W","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4OK7NBSHR6WGCFC","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4OK7NBS","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:60438286d89d265546c6556c9538f751e4095ed96126f0e41839e1a666d139ee","target":"graph","created_at":"2026-05-17T23:49:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Louis-No\\\"el Pouchet, Martin Kong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-14T20:22:07Z","title":"A Performance Vocabulary for Affine Loop Transformations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06043","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d0fcf62d606c7c72c04f84d6e3b65b5117c7ece13907994dc21c9c84c9440346","target":"record","created_at":"2026-05-17T23:49:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e777cb61fb11203d5f49b77674cf1cd9996bcc0f66ffd5685383920327fcb182","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-14T20:22:07Z","title_canon_sha256":"269440963f18dd4c7386cf6362818bd1200c25e28985212b1f477f255d4e9cea"},"schema_version":"1.0","source":{"id":"1811.06043","kind":"arxiv","version":2}},"canonical_sha256":"cf1cafb4323c7d6308a2311734e61139330034bdff6fcb7eb49e65a9c33fc9e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf1cafb4323c7d6308a2311734e61139330034bdff6fcb7eb49e65a9c33fc9e1","first_computed_at":"2026-05-17T23:49:03.003532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:03.003532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zy20lbXYLtlGEN4AtVQiip8dSeG0K0KfWmJJ0PchRzNMILuLw7sIyRP4HXhD9eV44DC1t603XRSe3vfC8OYZDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:03.003938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.06043","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0fcf62d606c7c72c04f84d6e3b65b5117c7ece13907994dc21c9c84c9440346","sha256:60438286d89d265546c6556c9538f751e4095ed96126f0e41839e1a666d139ee"],"state_sha256":"7df45b18ff06e57251bb131cf98df0e577cba545e398af153e4762ed19708ecd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBx06s7GyRXZSRkD6MEieuJodyh001wIUkwnF1EFgmhnK3cC3aPx3JO6XwASOoBeFJC14I2m3HXW3A7nptQFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:39:11.227588Z","bundle_sha256":"defa3e259bc282ab7aea7ca724df43626f27efad5ca9babee76eb47b176822fc"}}