{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:VFZILUPHCGP7HHVYEMZESDVWZ6","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":"d83cbb4ee545d229d59d8250f21145c4e103ee546d40c7b3453a2ee4922edb31","cross_cats_sorted":[],"license":"","primary_cat":"cs.PL","submitted_at":"2007-10-25T11:59:01Z","title_canon_sha256":"b8cbf1f946d01aee527d72a719f4e374409e2118027833c4d0641c98aeae7428"},"schema_version":"1.0","source":{"id":"0710.4807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.4807","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"arxiv_version","alias_value":"0710.4807v1","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.4807","created_at":"2026-05-18T04:09:05Z"},{"alias_kind":"pith_short_12","alias_value":"VFZILUPHCGP7","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"VFZILUPHCGP7HHVY","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"VFZILUPH","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:10be5a303829e3aa275addfe16f29e4242788bbc918c4ef900a925b7f108906d","target":"graph","created_at":"2026-05-18T04:09:05Z","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":"While loop restructuring based code optimization for array intensive applications has been successful in the past, it has several problems such as the requirement of checking dependences (legality issues) and transformation of all of the array references within the loop body indiscriminately (while some of the references can benefit from the transformation, others may not). As a result, data transformations, i.e., transformations that modify memory layout of array data instead of loop structure have been proposed. One of the problems associated with data transformations is the difficulty of se","authors_text":"G. Chen, M. Kandemir, M. Karakoy","cross_cats":[],"headline":"","license":"","primary_cat":"cs.PL","submitted_at":"2007-10-25T11:59:01Z","title":"A Constraint Network Based Approach to Memory Layout Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.4807","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:468c1aba94087c99958cf5dc208fe488d7099f7b4a1aff8e7455c31bde641eb6","target":"record","created_at":"2026-05-18T04:09:05Z","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":"d83cbb4ee545d229d59d8250f21145c4e103ee546d40c7b3453a2ee4922edb31","cross_cats_sorted":[],"license":"","primary_cat":"cs.PL","submitted_at":"2007-10-25T11:59:01Z","title_canon_sha256":"b8cbf1f946d01aee527d72a719f4e374409e2118027833c4d0641c98aeae7428"},"schema_version":"1.0","source":{"id":"0710.4807","kind":"arxiv","version":1}},"canonical_sha256":"a97285d1e7119ff39eb82332490eb6cfbe1a0e71fb400510f87931a313e7a899","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a97285d1e7119ff39eb82332490eb6cfbe1a0e71fb400510f87931a313e7a899","first_computed_at":"2026-05-18T04:09:05.183205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:05.183205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H95MlLle3v0qIJ+E7kLt4dmMdLCaNjaEo+q+p1lpxt2UTRG0d2gF3m/NUVQKkpULYqFWM0ZgVkVXFttAegX0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:05.184035Z","signed_message":"canonical_sha256_bytes"},"source_id":"0710.4807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:468c1aba94087c99958cf5dc208fe488d7099f7b4a1aff8e7455c31bde641eb6","sha256:10be5a303829e3aa275addfe16f29e4242788bbc918c4ef900a925b7f108906d"],"state_sha256":"6d33bed2c00acfcfe525225d8c5c6444bfa92555e2027549d1af39efe6440d0a"}