{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YUHHHT6U273JIUYL5SLCKIDU46","short_pith_number":"pith:YUHHHT6U","schema_version":"1.0","canonical_sha256":"c50e73cfd4d7f694530bec96252074e7bc21da4b76b38529975842190fa57aff","source":{"kind":"arxiv","id":"1308.0698","version":1},"attestation_state":"computed","paper":{"title":"An Improving Method for Loop Unrolling","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.OS"],"primary_cat":"cs.PL","authors_text":"Abbas Malekpour, Meisam Booshehri, Peter Luksch","submitted_at":"2013-08-03T14:09:23Z","abstract_excerpt":"In this paper we review main ideas mentioned in several other papers which talk about optimization techniques used by compilers. Here we focus on loop unrolling technique and its effect on power consumption, energy usage and also its impact on program speed up by achieving ILP (Instruction-level parallelism). Concentrating on superscalar processors, we discuss the idea of generalized loop unrolling presented by J.C. Hang and T. Leng and then we present a new method to traverse a linked list to get a better result of loop unrolling in that case. After that we mention the results of some experim"},"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":"1308.0698","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.PL","submitted_at":"2013-08-03T14:09:23Z","cross_cats_sorted":["cs.OS"],"title_canon_sha256":"478484d09f2356a23622a3a25ffc6a9b7f88c868fec26b04bbbaa1680b1f4708","abstract_canon_sha256":"c568806437ecb89cb126c1b5a874ef8e883e24d2409fffe8e0441b39a2d42dd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:08.287065Z","signature_b64":"fAl+rzMJKNDwVhb6sghbBy3ED8V0byrbmzmdmX+1VxftSFOP0vVSVJ57lTTLN8nzVUBlOwAEtscjA+3rNj4tBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c50e73cfd4d7f694530bec96252074e7bc21da4b76b38529975842190fa57aff","last_reissued_at":"2026-05-18T03:16:08.286453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:08.286453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improving Method for Loop Unrolling","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.OS"],"primary_cat":"cs.PL","authors_text":"Abbas Malekpour, Meisam Booshehri, Peter Luksch","submitted_at":"2013-08-03T14:09:23Z","abstract_excerpt":"In this paper we review main ideas mentioned in several other papers which talk about optimization techniques used by compilers. Here we focus on loop unrolling technique and its effect on power consumption, energy usage and also its impact on program speed up by achieving ILP (Instruction-level parallelism). Concentrating on superscalar processors, we discuss the idea of generalized loop unrolling presented by J.C. Hang and T. Leng and then we present a new method to traverse a linked list to get a better result of loop unrolling in that case. After that we mention the results of some experim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0698","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":"1308.0698","created_at":"2026-05-18T03:16:08.286555+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0698v1","created_at":"2026-05-18T03:16:08.286555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0698","created_at":"2026-05-18T03:16:08.286555+00:00"},{"alias_kind":"pith_short_12","alias_value":"YUHHHT6U273J","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YUHHHT6U273JIUYL","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YUHHHT6U","created_at":"2026-05-18T12:28:09.283467+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/YUHHHT6U273JIUYL5SLCKIDU46","json":"https://pith.science/pith/YUHHHT6U273JIUYL5SLCKIDU46.json","graph_json":"https://pith.science/api/pith-number/YUHHHT6U273JIUYL5SLCKIDU46/graph.json","events_json":"https://pith.science/api/pith-number/YUHHHT6U273JIUYL5SLCKIDU46/events.json","paper":"https://pith.science/paper/YUHHHT6U"},"agent_actions":{"view_html":"https://pith.science/pith/YUHHHT6U273JIUYL5SLCKIDU46","download_json":"https://pith.science/pith/YUHHHT6U273JIUYL5SLCKIDU46.json","view_paper":"https://pith.science/paper/YUHHHT6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0698&json=true","fetch_graph":"https://pith.science/api/pith-number/YUHHHT6U273JIUYL5SLCKIDU46/graph.json","fetch_events":"https://pith.science/api/pith-number/YUHHHT6U273JIUYL5SLCKIDU46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YUHHHT6U273JIUYL5SLCKIDU46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YUHHHT6U273JIUYL5SLCKIDU46/action/storage_attestation","attest_author":"https://pith.science/pith/YUHHHT6U273JIUYL5SLCKIDU46/action/author_attestation","sign_citation":"https://pith.science/pith/YUHHHT6U273JIUYL5SLCKIDU46/action/citation_signature","submit_replication":"https://pith.science/pith/YUHHHT6U273JIUYL5SLCKIDU46/action/replication_record"}},"created_at":"2026-05-18T03:16:08.286555+00:00","updated_at":"2026-05-18T03:16:08.286555+00:00"}