{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:6LFR3AVFI7NN5BCPQ7LUF5GEFJ","short_pith_number":"pith:6LFR3AVF","canonical_record":{"source":{"id":"2011.04333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-09T10:57:21Z","cross_cats_sorted":[],"title_canon_sha256":"03778f7d0a3dd051bebe31afa191bc97a8af7ba5d0241019a2738e0981add84b","abstract_canon_sha256":"e63a9a8a940adf163744f9439b573f93f677e5189c45f4598121cd365efd22bd"},"schema_version":"1.0"},"canonical_sha256":"f2cb1d82a547dade844f87d742f4c42a7d396cb9ac20792d3e32cfacc911a4b8","source":{"kind":"arxiv","id":"2011.04333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.04333","created_at":"2026-07-05T01:50:04Z"},{"alias_kind":"arxiv_version","alias_value":"2011.04333v1","created_at":"2026-07-05T01:50:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04333","created_at":"2026-07-05T01:50:04Z"},{"alias_kind":"pith_short_12","alias_value":"6LFR3AVFI7NN","created_at":"2026-07-05T01:50:04Z"},{"alias_kind":"pith_short_16","alias_value":"6LFR3AVFI7NN5BCP","created_at":"2026-07-05T01:50:04Z"},{"alias_kind":"pith_short_8","alias_value":"6LFR3AVF","created_at":"2026-07-05T01:50:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:6LFR3AVFI7NN5BCPQ7LUF5GEFJ","target":"record","payload":{"canonical_record":{"source":{"id":"2011.04333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-09T10:57:21Z","cross_cats_sorted":[],"title_canon_sha256":"03778f7d0a3dd051bebe31afa191bc97a8af7ba5d0241019a2738e0981add84b","abstract_canon_sha256":"e63a9a8a940adf163744f9439b573f93f677e5189c45f4598121cd365efd22bd"},"schema_version":"1.0"},"canonical_sha256":"f2cb1d82a547dade844f87d742f4c42a7d396cb9ac20792d3e32cfacc911a4b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:04.634453Z","signature_b64":"zhe3v8fx6EM6eAxeIvpcocQiCpWIl/6CgZhGpFiqbUb8paHNGNNrRh72rQtx2+wIXC7sj1/q90+qsC/ka2gqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2cb1d82a547dade844f87d742f4c42a7d396cb9ac20792d3e32cfacc911a4b8","last_reissued_at":"2026-07-05T01:50:04.633976Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:04.633976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.04333","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:50:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z9a8ZQ6/lnSjcl0Pm6ujiyaKCdYb4//SlAvmezk/T58peIzTd43J84tnb6BLfp1PIO3MdjA5ikWvDK64LgnzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:27:39.870368Z"},"content_sha256":"2c34c0a11d45bcaf3bdf9bd813d2d3fe48239cc30c08fae39f3a5fd372b4b9e5","schema_version":"1.0","event_id":"sha256:2c34c0a11d45bcaf3bdf9bd813d2d3fe48239cc30c08fae39f3a5fd372b4b9e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:6LFR3AVFI7NN5BCPQ7LUF5GEFJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Geometric Deep Reinforcement Learning for Dynamic DAG Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Emmanuel Jeannot, Nathan Grinsztajn, Olivier Beaumont, Philippe Preux","submitted_at":"2020-11-09T10:57:21Z","abstract_excerpt":"In practice, it is quite common to face combinatorial optimization problems which contain uncertainty along with non-determinism and dynamicity. These three properties call for appropriate algorithms; reinforcement learning (RL) is dealing with them in a very natural way. Today, despite some efforts, most real-life combinatorial optimization problems remain out of the reach of reinforcement learning algorithms.\n  In this paper, we propose a reinforcement learning approach to solve a realistic scheduling problem, and apply it to an algorithm commonly executed in the high performance computing c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04333","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.04333/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:50:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cx7QN8FFAXE05n+myhquVdpgXmB18NCJjry2PuF7jxsv1mRbF5kYujeiQTv70JKZ3Lhk6w58sKmONEu4BdfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:27:39.870960Z"},"content_sha256":"ae037639dead50f6d94284e972d644d1f86b3ff233080ec5ca132112560f2d11","schema_version":"1.0","event_id":"sha256:ae037639dead50f6d94284e972d644d1f86b3ff233080ec5ca132112560f2d11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LFR3AVFI7NN5BCPQ7LUF5GEFJ/bundle.json","state_url":"https://pith.science/pith/6LFR3AVFI7NN5BCPQ7LUF5GEFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LFR3AVFI7NN5BCPQ7LUF5GEFJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T16:27:39Z","links":{"resolver":"https://pith.science/pith/6LFR3AVFI7NN5BCPQ7LUF5GEFJ","bundle":"https://pith.science/pith/6LFR3AVFI7NN5BCPQ7LUF5GEFJ/bundle.json","state":"https://pith.science/pith/6LFR3AVFI7NN5BCPQ7LUF5GEFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LFR3AVFI7NN5BCPQ7LUF5GEFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6LFR3AVFI7NN5BCPQ7LUF5GEFJ","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":"e63a9a8a940adf163744f9439b573f93f677e5189c45f4598121cd365efd22bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-09T10:57:21Z","title_canon_sha256":"03778f7d0a3dd051bebe31afa191bc97a8af7ba5d0241019a2738e0981add84b"},"schema_version":"1.0","source":{"id":"2011.04333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.04333","created_at":"2026-07-05T01:50:04Z"},{"alias_kind":"arxiv_version","alias_value":"2011.04333v1","created_at":"2026-07-05T01:50:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04333","created_at":"2026-07-05T01:50:04Z"},{"alias_kind":"pith_short_12","alias_value":"6LFR3AVFI7NN","created_at":"2026-07-05T01:50:04Z"},{"alias_kind":"pith_short_16","alias_value":"6LFR3AVFI7NN5BCP","created_at":"2026-07-05T01:50:04Z"},{"alias_kind":"pith_short_8","alias_value":"6LFR3AVF","created_at":"2026-07-05T01:50:04Z"}],"graph_snapshots":[{"event_id":"sha256:ae037639dead50f6d94284e972d644d1f86b3ff233080ec5ca132112560f2d11","target":"graph","created_at":"2026-07-05T01:50:04Z","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/2011.04333/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In practice, it is quite common to face combinatorial optimization problems which contain uncertainty along with non-determinism and dynamicity. These three properties call for appropriate algorithms; reinforcement learning (RL) is dealing with them in a very natural way. Today, despite some efforts, most real-life combinatorial optimization problems remain out of the reach of reinforcement learning algorithms.\n  In this paper, we propose a reinforcement learning approach to solve a realistic scheduling problem, and apply it to an algorithm commonly executed in the high performance computing c","authors_text":"Emmanuel Jeannot, Nathan Grinsztajn, Olivier Beaumont, Philippe Preux","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-09T10:57:21Z","title":"Geometric Deep Reinforcement Learning for Dynamic DAG Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04333","kind":"arxiv","version":1},"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:2c34c0a11d45bcaf3bdf9bd813d2d3fe48239cc30c08fae39f3a5fd372b4b9e5","target":"record","created_at":"2026-07-05T01:50:04Z","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":"e63a9a8a940adf163744f9439b573f93f677e5189c45f4598121cd365efd22bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-11-09T10:57:21Z","title_canon_sha256":"03778f7d0a3dd051bebe31afa191bc97a8af7ba5d0241019a2738e0981add84b"},"schema_version":"1.0","source":{"id":"2011.04333","kind":"arxiv","version":1}},"canonical_sha256":"f2cb1d82a547dade844f87d742f4c42a7d396cb9ac20792d3e32cfacc911a4b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2cb1d82a547dade844f87d742f4c42a7d396cb9ac20792d3e32cfacc911a4b8","first_computed_at":"2026-07-05T01:50:04.633976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:50:04.633976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zhe3v8fx6EM6eAxeIvpcocQiCpWIl/6CgZhGpFiqbUb8paHNGNNrRh72rQtx2+wIXC7sj1/q90+qsC/ka2gqBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:50:04.634453Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.04333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c34c0a11d45bcaf3bdf9bd813d2d3fe48239cc30c08fae39f3a5fd372b4b9e5","sha256:ae037639dead50f6d94284e972d644d1f86b3ff233080ec5ca132112560f2d11"],"state_sha256":"5838c4c411025294e1c6e6c0852b4b046bd7214e9e70b2e226a886ba368e462f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrsG0ZP4KpXnAhimb9AsuqrJ2KGHziN8mX/9U0x7r2gL+6rC+4szyz3MhAWrVpgOka3GWf++n+vZ+Pnf+K2OAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T16:27:39.879543Z","bundle_sha256":"4dd3e85c4628c7395e2d967ce5eea8e3843da56662cc2ec4ce86a559a8c70a5b"}}