{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:P54LMKURM4J2CBA4ZNACN747RE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b575d3b254a22c2a38d1883988c6b18269d56df25a1bd36aed0aa6b4f9ddccde","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-07T12:15:06Z","title_canon_sha256":"09afb894b02133fe871fbd0a65087dc35766b0c07824a67de414ca9b39a6aac9"},"schema_version":"1.0","source":{"id":"1905.02494","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02494","created_at":"2026-07-05T00:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02494v4","created_at":"2026-07-05T00:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02494","created_at":"2026-07-05T00:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"P54LMKURM4J2","created_at":"2026-07-05T00:39:11Z"},{"alias_kind":"pith_short_16","alias_value":"P54LMKURM4J2CBA4","created_at":"2026-07-05T00:39:11Z"},{"alias_kind":"pith_short_8","alias_value":"P54LMKUR","created_at":"2026-07-05T00:39:11Z"}],"graph_snapshots":[{"event_id":"sha256:c8412f52fb0ccaaa8891142350cfa563db32cde88dfa3dfa4840c5b2b99948b4","target":"graph","created_at":"2026-07-05T00:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.02494/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a deep reinforcement learning approach to minimizing the execution cost of neural network computation graphs in an optimizing compiler. Unlike earlier learning-based works that require training the optimizer on the same graph to be optimized, we propose a learning approach that trains an optimizer offline and then generalizes to previously unseen graphs without further training. This allows our approach to produce high-quality execution decisions on real-world TensorFlow graphs in seconds instead of hours. We consider two optimization tasks for computation graphs: minimizing running","authors_text":"Aditya Paliwal, Felix Gimeno, Miles Lubin, Oriol Vinyals, Pushmeet Kohli, Vinod Nair, Yujia Li","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-07T12:15:06Z","title":"Reinforced Genetic Algorithm Learning for Optimizing Computation Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02494","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:06d8e4ffeb44d988c551acd5efdbce5bc7291b886f1dae58e8ceb4cbc8056f97","target":"record","created_at":"2026-07-05T00:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b575d3b254a22c2a38d1883988c6b18269d56df25a1bd36aed0aa6b4f9ddccde","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-07T12:15:06Z","title_canon_sha256":"09afb894b02133fe871fbd0a65087dc35766b0c07824a67de414ca9b39a6aac9"},"schema_version":"1.0","source":{"id":"1905.02494","kind":"arxiv","version":4}},"canonical_sha256":"7f78b62a916713a1041ccb4026ff9f8934fd306d7d40c32de380ae14ddac612d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f78b62a916713a1041ccb4026ff9f8934fd306d7d40c32de380ae14ddac612d","first_computed_at":"2026-07-05T00:39:11.565852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:39:11.565852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gJs4jigigRzK1eudrJsHWnqzmCr5X6ou0ifPfqz/QE+zbp6miTDFOo45X7BrSEpf3qKZw7Xs2fQEXLCDIYZ1Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:39:11.566408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02494","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06d8e4ffeb44d988c551acd5efdbce5bc7291b886f1dae58e8ceb4cbc8056f97","sha256:c8412f52fb0ccaaa8891142350cfa563db32cde88dfa3dfa4840c5b2b99948b4"],"state_sha256":"6178847cc05e74e607b9693ca8a6d5153ee60fb16b893a010ade5229a47deb30"}