{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HO4RUSUKEFDKHJ5XJUR3ULDSVR","short_pith_number":"pith:HO4RUSUK","schema_version":"1.0","canonical_sha256":"3bb91a4a8a2146a3a7b74d23ba2c72ac5d79b7750039af257dda3f17be96b165","source":{"kind":"arxiv","id":"1811.00632","version":1},"attestation_state":"computed","paper":{"title":"Loop Optimization Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hal Finkel, Michael Kruse","submitted_at":"2018-11-01T20:58:56Z","abstract_excerpt":"The LLVM compiler framework supports a selection of loop transformations such as vectorization, distribution and unrolling. Each transformation is carried-out by specialized passes that have been developed independently. In this paper we propose an integrated approach to loop optimizations: A single dedicated pass that mutates a Loop Structure DAG. Each transformation can make use of a common infrastructure such as dependency analysis, transformation preconditions, etc."},"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.00632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-11-01T20:58:56Z","cross_cats_sorted":[],"title_canon_sha256":"3399803b03faa41e78c8fa93375b30e1ec3fd95813aadf021e3b924c3c3317c1","abstract_canon_sha256":"8a3b58fee386b4e4208a3049fe4554eccdf846cad2fe14622b552ef3e5fc122a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:42.650093Z","signature_b64":"gLT+75Z0A1d7PQeC/ZJeYjFSO/QYgHcyl3ieI3nCD432l6rzlWfVE3kIKoykx1Y5WNoRdw8TtdrFVAOlcu7VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bb91a4a8a2146a3a7b74d23ba2c72ac5d79b7750039af257dda3f17be96b165","last_reissued_at":"2026-05-18T00:01:42.649555Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:42.649555Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Loop Optimization Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hal Finkel, Michael Kruse","submitted_at":"2018-11-01T20:58:56Z","abstract_excerpt":"The LLVM compiler framework supports a selection of loop transformations such as vectorization, distribution and unrolling. Each transformation is carried-out by specialized passes that have been developed independently. In this paper we propose an integrated approach to loop optimizations: A single dedicated pass that mutates a Loop Structure DAG. Each transformation can make use of a common infrastructure such as dependency analysis, transformation preconditions, etc."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00632","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.00632","created_at":"2026-05-18T00:01:42.649644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00632v1","created_at":"2026-05-18T00:01:42.649644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00632","created_at":"2026-05-18T00:01:42.649644+00:00"},{"alias_kind":"pith_short_12","alias_value":"HO4RUSUKEFDK","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HO4RUSUKEFDKHJ5X","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HO4RUSUK","created_at":"2026-05-18T12:32:28.185984+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/HO4RUSUKEFDKHJ5XJUR3ULDSVR","json":"https://pith.science/pith/HO4RUSUKEFDKHJ5XJUR3ULDSVR.json","graph_json":"https://pith.science/api/pith-number/HO4RUSUKEFDKHJ5XJUR3ULDSVR/graph.json","events_json":"https://pith.science/api/pith-number/HO4RUSUKEFDKHJ5XJUR3ULDSVR/events.json","paper":"https://pith.science/paper/HO4RUSUK"},"agent_actions":{"view_html":"https://pith.science/pith/HO4RUSUKEFDKHJ5XJUR3ULDSVR","download_json":"https://pith.science/pith/HO4RUSUKEFDKHJ5XJUR3ULDSVR.json","view_paper":"https://pith.science/paper/HO4RUSUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00632&json=true","fetch_graph":"https://pith.science/api/pith-number/HO4RUSUKEFDKHJ5XJUR3ULDSVR/graph.json","fetch_events":"https://pith.science/api/pith-number/HO4RUSUKEFDKHJ5XJUR3ULDSVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HO4RUSUKEFDKHJ5XJUR3ULDSVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HO4RUSUKEFDKHJ5XJUR3ULDSVR/action/storage_attestation","attest_author":"https://pith.science/pith/HO4RUSUKEFDKHJ5XJUR3ULDSVR/action/author_attestation","sign_citation":"https://pith.science/pith/HO4RUSUKEFDKHJ5XJUR3ULDSVR/action/citation_signature","submit_replication":"https://pith.science/pith/HO4RUSUKEFDKHJ5XJUR3ULDSVR/action/replication_record"}},"created_at":"2026-05-18T00:01:42.649644+00:00","updated_at":"2026-05-18T00:01:42.649644+00:00"}