{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OH6LFN5D7SOMWW6QIUXC3FMDZD","short_pith_number":"pith:OH6LFN5D","schema_version":"1.0","canonical_sha256":"71fcb2b7a3fc9ccb5bd0452e2d9583c8d60d017e88d04e35d4ffc235e4c430d6","source":{"kind":"arxiv","id":"2309.07002","version":2},"attestation_state":"computed","paper":{"title":"Using Evolutionary Algorithms to Find Cache-Friendly Generalized Morton Layouts for Arrays","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NE","authors_text":"Ana-Lucia Varbanescu, Andreas Salzburger, Andy D. Pimentel, Attila Krasznahorkay, Stephen Nicholas Swatman","submitted_at":"2023-09-13T14:54:54Z","abstract_excerpt":"The layout of multi-dimensional data can have a significant impact on the efficacy of hardware caches and, by extension, the performance of applications. Common multi-dimensional layouts include the canonical row-major and column-major layouts as well as the Morton curve layout. In this paper, we describe how the Morton layout can be generalized to a very large family of multi-dimensional data layouts with widely varying performance characteristics. We posit that this design space can be efficiently explored using a combinatorial evolutionary methodology based on genetic algorithms. To this en"},"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":"2309.07002","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2023-09-13T14:54:54Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"0795c81a254dae662e88eca543a363c9e57f513a62511e772de1100d9d9207f2","abstract_canon_sha256":"3f2c0b7a5bf3f63711f0ff3ddf66e15fc1228f95f31c46e15d4dfc635806d085"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:41:27.820816Z","signature_b64":"+06XeRau+SCqrhWPts9XrGblQbHadK6gy9TE6Z5fiwz1McZkgj9mPx8YCNySwQs4hwpvyAuROrC+Reo6WnNpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71fcb2b7a3fc9ccb5bd0452e2d9583c8d60d017e88d04e35d4ffc235e4c430d6","last_reissued_at":"2026-07-05T07:41:27.820246Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:41:27.820246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Evolutionary Algorithms to Find Cache-Friendly Generalized Morton Layouts for Arrays","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.NE","authors_text":"Ana-Lucia Varbanescu, Andreas Salzburger, Andy D. Pimentel, Attila Krasznahorkay, Stephen Nicholas Swatman","submitted_at":"2023-09-13T14:54:54Z","abstract_excerpt":"The layout of multi-dimensional data can have a significant impact on the efficacy of hardware caches and, by extension, the performance of applications. Common multi-dimensional layouts include the canonical row-major and column-major layouts as well as the Morton curve layout. In this paper, we describe how the Morton layout can be generalized to a very large family of multi-dimensional data layouts with widely varying performance characteristics. We posit that this design space can be efficiently explored using a combinatorial evolutionary methodology based on genetic algorithms. To this en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.07002","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/2309.07002/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":"2309.07002","created_at":"2026-07-05T07:41:27.820307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.07002v2","created_at":"2026-07-05T07:41:27.820307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.07002","created_at":"2026-07-05T07:41:27.820307+00:00"},{"alias_kind":"pith_short_12","alias_value":"OH6LFN5D7SOM","created_at":"2026-07-05T07:41:27.820307+00:00"},{"alias_kind":"pith_short_16","alias_value":"OH6LFN5D7SOMWW6Q","created_at":"2026-07-05T07:41:27.820307+00:00"},{"alias_kind":"pith_short_8","alias_value":"OH6LFN5D","created_at":"2026-07-05T07:41:27.820307+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/OH6LFN5D7SOMWW6QIUXC3FMDZD","json":"https://pith.science/pith/OH6LFN5D7SOMWW6QIUXC3FMDZD.json","graph_json":"https://pith.science/api/pith-number/OH6LFN5D7SOMWW6QIUXC3FMDZD/graph.json","events_json":"https://pith.science/api/pith-number/OH6LFN5D7SOMWW6QIUXC3FMDZD/events.json","paper":"https://pith.science/paper/OH6LFN5D"},"agent_actions":{"view_html":"https://pith.science/pith/OH6LFN5D7SOMWW6QIUXC3FMDZD","download_json":"https://pith.science/pith/OH6LFN5D7SOMWW6QIUXC3FMDZD.json","view_paper":"https://pith.science/paper/OH6LFN5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.07002&json=true","fetch_graph":"https://pith.science/api/pith-number/OH6LFN5D7SOMWW6QIUXC3FMDZD/graph.json","fetch_events":"https://pith.science/api/pith-number/OH6LFN5D7SOMWW6QIUXC3FMDZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OH6LFN5D7SOMWW6QIUXC3FMDZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OH6LFN5D7SOMWW6QIUXC3FMDZD/action/storage_attestation","attest_author":"https://pith.science/pith/OH6LFN5D7SOMWW6QIUXC3FMDZD/action/author_attestation","sign_citation":"https://pith.science/pith/OH6LFN5D7SOMWW6QIUXC3FMDZD/action/citation_signature","submit_replication":"https://pith.science/pith/OH6LFN5D7SOMWW6QIUXC3FMDZD/action/replication_record"}},"created_at":"2026-07-05T07:41:27.820307+00:00","updated_at":"2026-07-05T07:41:27.820307+00:00"}