{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:53ICVNZOLBUJEKHPZYBV75U2NO","short_pith_number":"pith:53ICVNZO","schema_version":"1.0","canonical_sha256":"eed02ab72e58689228efce035ff69a6b92f8836b9d9c4fb640807cc553794f73","source":{"kind":"arxiv","id":"1909.13639","version":4},"attestation_state":"computed","paper":{"title":"NeuroVectorizer: End-to-End Vectorization with Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.PL"],"primary_cat":"cs.DC","authors_text":"Ameer Haj-Ali, Ion Stoica, Krste Asanovic, Nesreen K. Ahmed, Sophia Shao, Ted Willke","submitted_at":"2019-09-20T12:29:09Z","abstract_excerpt":"One of the key challenges arising when compilers vectorize loops for today's SIMD-compatible architectures is to decide if vectorization or interleaving is beneficial. Then, the compiler has to determine how many instructions to pack together and how many loop iterations to interleave. Compilers are designed today to use fixed-cost models that are based on heuristics to make vectorization decisions on loops. However, these models are unable to capture the data dependency, the computation graph, or the organization of instructions. Alternatively, software engineers often hand-write the vectoriz"},"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":"1909.13639","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-09-20T12:29:09Z","cross_cats_sorted":["cs.PF","cs.PL"],"title_canon_sha256":"94e34a8741721612b7de38933286fb5f65f9b0a604bd17d70327c3a21797d8a2","abstract_canon_sha256":"2c498e3730949c9234f7b3806592ce652ddeed6ad14ae9ed25cefbef8e200987"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:40.483387Z","signature_b64":"NIk4UTBHbutf0j8DEmHUrD2KhEkwgkveUMk94R7CXY+MCJSfMuUtNHhcoVQITdEFLKazFBDrctVFytC9+mnVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eed02ab72e58689228efce035ff69a6b92f8836b9d9c4fb640807cc553794f73","last_reissued_at":"2026-07-05T00:29:40.483017Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:40.483017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NeuroVectorizer: End-to-End Vectorization with Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.PL"],"primary_cat":"cs.DC","authors_text":"Ameer Haj-Ali, Ion Stoica, Krste Asanovic, Nesreen K. Ahmed, Sophia Shao, Ted Willke","submitted_at":"2019-09-20T12:29:09Z","abstract_excerpt":"One of the key challenges arising when compilers vectorize loops for today's SIMD-compatible architectures is to decide if vectorization or interleaving is beneficial. Then, the compiler has to determine how many instructions to pack together and how many loop iterations to interleave. Compilers are designed today to use fixed-cost models that are based on heuristics to make vectorization decisions on loops. However, these models are unable to capture the data dependency, the computation graph, or the organization of instructions. Alternatively, software engineers often hand-write the vectoriz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.13639","kind":"arxiv","version":4},"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/1909.13639/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":"1909.13639","created_at":"2026-07-05T00:29:40.483078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.13639v4","created_at":"2026-07-05T00:29:40.483078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.13639","created_at":"2026-07-05T00:29:40.483078+00:00"},{"alias_kind":"pith_short_12","alias_value":"53ICVNZOLBUJ","created_at":"2026-07-05T00:29:40.483078+00:00"},{"alias_kind":"pith_short_16","alias_value":"53ICVNZOLBUJEKHP","created_at":"2026-07-05T00:29:40.483078+00:00"},{"alias_kind":"pith_short_8","alias_value":"53ICVNZO","created_at":"2026-07-05T00:29:40.483078+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/53ICVNZOLBUJEKHPZYBV75U2NO","json":"https://pith.science/pith/53ICVNZOLBUJEKHPZYBV75U2NO.json","graph_json":"https://pith.science/api/pith-number/53ICVNZOLBUJEKHPZYBV75U2NO/graph.json","events_json":"https://pith.science/api/pith-number/53ICVNZOLBUJEKHPZYBV75U2NO/events.json","paper":"https://pith.science/paper/53ICVNZO"},"agent_actions":{"view_html":"https://pith.science/pith/53ICVNZOLBUJEKHPZYBV75U2NO","download_json":"https://pith.science/pith/53ICVNZOLBUJEKHPZYBV75U2NO.json","view_paper":"https://pith.science/paper/53ICVNZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.13639&json=true","fetch_graph":"https://pith.science/api/pith-number/53ICVNZOLBUJEKHPZYBV75U2NO/graph.json","fetch_events":"https://pith.science/api/pith-number/53ICVNZOLBUJEKHPZYBV75U2NO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53ICVNZOLBUJEKHPZYBV75U2NO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53ICVNZOLBUJEKHPZYBV75U2NO/action/storage_attestation","attest_author":"https://pith.science/pith/53ICVNZOLBUJEKHPZYBV75U2NO/action/author_attestation","sign_citation":"https://pith.science/pith/53ICVNZOLBUJEKHPZYBV75U2NO/action/citation_signature","submit_replication":"https://pith.science/pith/53ICVNZOLBUJEKHPZYBV75U2NO/action/replication_record"}},"created_at":"2026-07-05T00:29:40.483078+00:00","updated_at":"2026-07-05T00:29:40.483078+00:00"}