{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:W3VEIR3GDYPRIEGPINJZP2SIRF","short_pith_number":"pith:W3VEIR3G","canonical_record":{"source":{"id":"1710.08774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-24T13:51:36Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3d31f3b27c045c2722b414b929fc7e3986e262c5114af851c318dc11c082f775","abstract_canon_sha256":"7b57bf9bc3a3faa4405829d70f6c66b961c2fbf445262bea753a5526abca1c48"},"schema_version":"1.0"},"canonical_sha256":"b6ea4447661e1f1410cf435397ea488948fc70d815a5be39abeb8d149a17e38c","source":{"kind":"arxiv","id":"1710.08774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08774","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08774v1","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08774","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"W3VEIR3GDYPR","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W3VEIR3GDYPRIEGP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W3VEIR3G","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:W3VEIR3GDYPRIEGPINJZP2SIRF","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-24T13:51:36Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"3d31f3b27c045c2722b414b929fc7e3986e262c5114af851c318dc11c082f775","abstract_canon_sha256":"7b57bf9bc3a3faa4405829d70f6c66b961c2fbf445262bea753a5526abca1c48"},"schema_version":"1.0"},"canonical_sha256":"b6ea4447661e1f1410cf435397ea488948fc70d815a5be39abeb8d149a17e38c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:03.849663Z","signature_b64":"ainXH2yFQjElI6GpPaaFoyS+2wwoo4vS/4EajcwsF4cqcw1mc4dBMZzdD01u9B6T7gsbre41RVUo6vd6Z9aAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6ea4447661e1f1410cf435397ea488948fc70d815a5be39abeb8d149a17e38c","last_reissued_at":"2026-05-18T00:32:03.849214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:03.849214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08774","source_version":1,"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-18T00:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecDf24KEp94ZvmIFgxtDaMq4/iBEDsfb5cPtvMJbgYDQFQ9nw2tu/e8ZFAP1zfT0GTq+2nifTZshU9V0cw+9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:14:27.501894Z"},"content_sha256":"7eaa56703162f495170b0f888b9593e293a2084fccb945608233d9d07a5cd9f5","schema_version":"1.0","event_id":"sha256:7eaa56703162f495170b0f888b9593e293a2084fccb945608233d9d07a5cd9f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:W3VEIR3GDYPRIEGPINJZP2SIRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Performance Code Generation though Fusion and Vectorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Jason Sewall, Simon J. Pennycook","submitted_at":"2017-10-24T13:51:36Z","abstract_excerpt":"We present a technique for automatically transforming kernel-based computations in disparate, nested loops into a fused, vectorized form that can reduce intermediate storage needs and lead to improved performance on contemporary hardware.\n  We introduce representations for the abstract relationships and data dependencies of kernels in loop nests and algorithms for manipulating them into more efficient form; we similarly introduce techniques for determining data access patterns for stencil-like array accesses and show how this can be used to elide storage and improve vectorization.\n  We discuss"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08774","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":""},"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-18T00:32:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wh5VEYXNRWVQABRg0vSFirDnPYgnCMNwACpKM9i8pJdipvAQ4u7UPFLzVwSYy00odQ8ALMmRQJpEbA0ao1L2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:14:27.502228Z"},"content_sha256":"532f7513defa2712fc0b59a98febe5470b87d23ed67f3a3fd6e8060b4cc91adc","schema_version":"1.0","event_id":"sha256:532f7513defa2712fc0b59a98febe5470b87d23ed67f3a3fd6e8060b4cc91adc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3VEIR3GDYPRIEGPINJZP2SIRF/bundle.json","state_url":"https://pith.science/pith/W3VEIR3GDYPRIEGPINJZP2SIRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3VEIR3GDYPRIEGPINJZP2SIRF/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-06-27T18:14:27Z","links":{"resolver":"https://pith.science/pith/W3VEIR3GDYPRIEGPINJZP2SIRF","bundle":"https://pith.science/pith/W3VEIR3GDYPRIEGPINJZP2SIRF/bundle.json","state":"https://pith.science/pith/W3VEIR3GDYPRIEGPINJZP2SIRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3VEIR3GDYPRIEGPINJZP2SIRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:W3VEIR3GDYPRIEGPINJZP2SIRF","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":"7b57bf9bc3a3faa4405829d70f6c66b961c2fbf445262bea753a5526abca1c48","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-24T13:51:36Z","title_canon_sha256":"3d31f3b27c045c2722b414b929fc7e3986e262c5114af851c318dc11c082f775"},"schema_version":"1.0","source":{"id":"1710.08774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08774","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08774v1","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08774","created_at":"2026-05-18T00:32:03Z"},{"alias_kind":"pith_short_12","alias_value":"W3VEIR3GDYPR","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"W3VEIR3GDYPRIEGP","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"W3VEIR3G","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:532f7513defa2712fc0b59a98febe5470b87d23ed67f3a3fd6e8060b4cc91adc","target":"graph","created_at":"2026-05-18T00:32: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":"We present a technique for automatically transforming kernel-based computations in disparate, nested loops into a fused, vectorized form that can reduce intermediate storage needs and lead to improved performance on contemporary hardware.\n  We introduce representations for the abstract relationships and data dependencies of kernels in loop nests and algorithms for manipulating them into more efficient form; we similarly introduce techniques for determining data access patterns for stencil-like array accesses and show how this can be used to elide storage and improve vectorization.\n  We discuss","authors_text":"Jason Sewall, Simon J. Pennycook","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-24T13:51:36Z","title":"High-Performance Code Generation though Fusion and Vectorization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08774","kind":"arxiv","version":1},"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:7eaa56703162f495170b0f888b9593e293a2084fccb945608233d9d07a5cd9f5","target":"record","created_at":"2026-05-18T00:32: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":"7b57bf9bc3a3faa4405829d70f6c66b961c2fbf445262bea753a5526abca1c48","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-10-24T13:51:36Z","title_canon_sha256":"3d31f3b27c045c2722b414b929fc7e3986e262c5114af851c318dc11c082f775"},"schema_version":"1.0","source":{"id":"1710.08774","kind":"arxiv","version":1}},"canonical_sha256":"b6ea4447661e1f1410cf435397ea488948fc70d815a5be39abeb8d149a17e38c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6ea4447661e1f1410cf435397ea488948fc70d815a5be39abeb8d149a17e38c","first_computed_at":"2026-05-18T00:32:03.849214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:03.849214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ainXH2yFQjElI6GpPaaFoyS+2wwoo4vS/4EajcwsF4cqcw1mc4dBMZzdD01u9B6T7gsbre41RVUo6vd6Z9aAAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:03.849663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7eaa56703162f495170b0f888b9593e293a2084fccb945608233d9d07a5cd9f5","sha256:532f7513defa2712fc0b59a98febe5470b87d23ed67f3a3fd6e8060b4cc91adc"],"state_sha256":"94d373c537385fb1243413a980df7912e614428a7487d5f20d223fbdc6ed68f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNeDo1pJOVfW/zqNQ4mML9Y/qxNDaYDUwTL2s9ELO7F4iKPOacU1fd0WAUMrQpDEcRLlGBzMQ/zfWpNlN2yVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:14:27.504082Z","bundle_sha256":"4bf3a2a014ba6fe8a46cd1e28e0fa24fd925701d1e1289d6f5579c7efb13f12e"}}