{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O66JDYGHF6PXFUQBJNPKB356LG","short_pith_number":"pith:O66JDYGH","schema_version":"1.0","canonical_sha256":"77bc91e0c72f9f72d2014b5ea0efbe59bc63c232377f6e545103d2468f6ab98f","source":{"kind":"arxiv","id":"1603.01112","version":1},"attestation_state":"computed","paper":{"title":"If-Conversion Optimization using Neuro Evolution of Augmenting Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ahmed El-Mahdy, Keiji Kimura, Reem Elkhouly","submitted_at":"2016-03-03T14:41:12Z","abstract_excerpt":"Control-flow dependence is an intrinsic limiting factor for pro- gram acceleration. With the availability of instruction-level par- allel architectures, if-conversion optimization has, therefore, be- come pivotal for extracting parallelism from serial programs. While many if-conversion optimization heuristics have been proposed in the literature, most of them consider rigid criteria regardless of the underlying hardware and input programs. In this paper, we propose a novel if-conversion scheme that preforms an efficient if-conversion transformation using a machine learning technique (NEAT). Th"},"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":"1603.01112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-03T14:41:12Z","cross_cats_sorted":[],"title_canon_sha256":"fc46d7e04c162487eb9bcfc6dca296201e42a213bf228e371c62331ab3942cc7","abstract_canon_sha256":"65aac68272a9cf9797ddc7c6339f3e98b04dcf88563c4fd4761e06a0e5772593"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:39.628355Z","signature_b64":"Y5xCRPDtiqjAKSTHcnl15WY7ReCYWjh12CKfnvRmVPxogdPnpLVu7CEyk5XJ3XDloswHvk+60zVPty29SKtsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77bc91e0c72f9f72d2014b5ea0efbe59bc63c232377f6e545103d2468f6ab98f","last_reissued_at":"2026-05-18T01:19:39.627899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:39.627899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"If-Conversion Optimization using Neuro Evolution of Augmenting Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ahmed El-Mahdy, Keiji Kimura, Reem Elkhouly","submitted_at":"2016-03-03T14:41:12Z","abstract_excerpt":"Control-flow dependence is an intrinsic limiting factor for pro- gram acceleration. With the availability of instruction-level par- allel architectures, if-conversion optimization has, therefore, be- come pivotal for extracting parallelism from serial programs. While many if-conversion optimization heuristics have been proposed in the literature, most of them consider rigid criteria regardless of the underlying hardware and input programs. In this paper, we propose a novel if-conversion scheme that preforms an efficient if-conversion transformation using a machine learning technique (NEAT). Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01112","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":"1603.01112","created_at":"2026-05-18T01:19:39.627962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01112v1","created_at":"2026-05-18T01:19:39.627962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01112","created_at":"2026-05-18T01:19:39.627962+00:00"},{"alias_kind":"pith_short_12","alias_value":"O66JDYGHF6PX","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O66JDYGHF6PXFUQB","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O66JDYGH","created_at":"2026-05-18T12:30:36.002864+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/O66JDYGHF6PXFUQBJNPKB356LG","json":"https://pith.science/pith/O66JDYGHF6PXFUQBJNPKB356LG.json","graph_json":"https://pith.science/api/pith-number/O66JDYGHF6PXFUQBJNPKB356LG/graph.json","events_json":"https://pith.science/api/pith-number/O66JDYGHF6PXFUQBJNPKB356LG/events.json","paper":"https://pith.science/paper/O66JDYGH"},"agent_actions":{"view_html":"https://pith.science/pith/O66JDYGHF6PXFUQBJNPKB356LG","download_json":"https://pith.science/pith/O66JDYGHF6PXFUQBJNPKB356LG.json","view_paper":"https://pith.science/paper/O66JDYGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01112&json=true","fetch_graph":"https://pith.science/api/pith-number/O66JDYGHF6PXFUQBJNPKB356LG/graph.json","fetch_events":"https://pith.science/api/pith-number/O66JDYGHF6PXFUQBJNPKB356LG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O66JDYGHF6PXFUQBJNPKB356LG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O66JDYGHF6PXFUQBJNPKB356LG/action/storage_attestation","attest_author":"https://pith.science/pith/O66JDYGHF6PXFUQBJNPKB356LG/action/author_attestation","sign_citation":"https://pith.science/pith/O66JDYGHF6PXFUQBJNPKB356LG/action/citation_signature","submit_replication":"https://pith.science/pith/O66JDYGHF6PXFUQBJNPKB356LG/action/replication_record"}},"created_at":"2026-05-18T01:19:39.627962+00:00","updated_at":"2026-05-18T01:19:39.627962+00:00"}