{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NTCROPFHQKCVQD43G7NDOX6W2T","short_pith_number":"pith:NTCROPFH","schema_version":"1.0","canonical_sha256":"6cc5173ca78285580f9b37da375fd6d4f0e06bde2b3cb572c076a05e7c315061","source":{"kind":"arxiv","id":"2008.08951","version":3},"attestation_state":"computed","paper":{"title":"Static Neural Compiler Optimization via Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Jannesari, Felix Wolf, Rahim Mammadli","submitted_at":"2020-08-20T13:16:29Z","abstract_excerpt":"The phase-ordering problem of modern compilers has received a lot of attention from the research community over the years, yet remains largely unsolved. Various optimization sequences exposed to the user are manually designed by compiler developers. In designing such a sequence developers have to choose the set of optimization passes, their parameters and ordering within a sequence. Resulting sequences usually fall short of achieving optimal runtime for a given source code and may sometimes even degrade the performance when compared to unoptimized version. In this paper, we employ a deep reinf"},"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":"2008.08951","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-08-20T13:16:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c6216544ef6347776dd48bc96740ceebaece6cb3f488bb327209e23bfb72dce6","abstract_canon_sha256":"f7da8b0533b2555a7ab973d04717a11eb7218d3d658bd1d40ea2d1e52e1ecbe5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:27.948681Z","signature_b64":"s5qytVp/DaQuE+JvbuYCTn4U3wxTbt21AWhKMh3onBa4JLK86hC/wv28CT/M+t1xeiNFOKkxXKDyn7PC7V4rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cc5173ca78285580f9b37da375fd6d4f0e06bde2b3cb572c076a05e7c315061","last_reissued_at":"2026-07-05T01:43:27.948264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:27.948264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Static Neural Compiler Optimization via Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Jannesari, Felix Wolf, Rahim Mammadli","submitted_at":"2020-08-20T13:16:29Z","abstract_excerpt":"The phase-ordering problem of modern compilers has received a lot of attention from the research community over the years, yet remains largely unsolved. Various optimization sequences exposed to the user are manually designed by compiler developers. In designing such a sequence developers have to choose the set of optimization passes, their parameters and ordering within a sequence. Resulting sequences usually fall short of achieving optimal runtime for a given source code and may sometimes even degrade the performance when compared to unoptimized version. In this paper, we employ a deep reinf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.08951","kind":"arxiv","version":3},"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/2008.08951/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":"2008.08951","created_at":"2026-07-05T01:43:27.948342+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.08951v3","created_at":"2026-07-05T01:43:27.948342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.08951","created_at":"2026-07-05T01:43:27.948342+00:00"},{"alias_kind":"pith_short_12","alias_value":"NTCROPFHQKCV","created_at":"2026-07-05T01:43:27.948342+00:00"},{"alias_kind":"pith_short_16","alias_value":"NTCROPFHQKCVQD43","created_at":"2026-07-05T01:43:27.948342+00:00"},{"alias_kind":"pith_short_8","alias_value":"NTCROPFH","created_at":"2026-07-05T01:43:27.948342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04466","citing_title":"Accelerating C/C++ Pointer Analysis via Compiler-Based Offline Simplifications","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NTCROPFHQKCVQD43G7NDOX6W2T","json":"https://pith.science/pith/NTCROPFHQKCVQD43G7NDOX6W2T.json","graph_json":"https://pith.science/api/pith-number/NTCROPFHQKCVQD43G7NDOX6W2T/graph.json","events_json":"https://pith.science/api/pith-number/NTCROPFHQKCVQD43G7NDOX6W2T/events.json","paper":"https://pith.science/paper/NTCROPFH"},"agent_actions":{"view_html":"https://pith.science/pith/NTCROPFHQKCVQD43G7NDOX6W2T","download_json":"https://pith.science/pith/NTCROPFHQKCVQD43G7NDOX6W2T.json","view_paper":"https://pith.science/paper/NTCROPFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.08951&json=true","fetch_graph":"https://pith.science/api/pith-number/NTCROPFHQKCVQD43G7NDOX6W2T/graph.json","fetch_events":"https://pith.science/api/pith-number/NTCROPFHQKCVQD43G7NDOX6W2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NTCROPFHQKCVQD43G7NDOX6W2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NTCROPFHQKCVQD43G7NDOX6W2T/action/storage_attestation","attest_author":"https://pith.science/pith/NTCROPFHQKCVQD43G7NDOX6W2T/action/author_attestation","sign_citation":"https://pith.science/pith/NTCROPFHQKCVQD43G7NDOX6W2T/action/citation_signature","submit_replication":"https://pith.science/pith/NTCROPFHQKCVQD43G7NDOX6W2T/action/replication_record"}},"created_at":"2026-07-05T01:43:27.948342+00:00","updated_at":"2026-07-05T01:43:27.948342+00:00"}