{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6Y7AIRLILTETIHGUY52UDCTT2T","short_pith_number":"pith:6Y7AIRLI","canonical_record":{"source":{"id":"1906.02280","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-05T19:56:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2cc00610fe4553adf3bc6d9db2ca9dfe754a8fa5031c282006900839ccb68438","abstract_canon_sha256":"5bc1c6a2e657e13e7e4f3c5cbbb34d242697768e199515cc1a8173a5377db079"},"schema_version":"1.0"},"canonical_sha256":"f63e0445685cc9341cd4c775418a73d4ee69a4d6a129b59f1c75fad4069bd011","source":{"kind":"arxiv","id":"1906.02280","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02280","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02280v1","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02280","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"6Y7AIRLILTET","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6Y7AIRLILTETIHGU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6Y7AIRLI","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6Y7AIRLILTETIHGUY52UDCTT2T","target":"record","payload":{"canonical_record":{"source":{"id":"1906.02280","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-05T19:56:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2cc00610fe4553adf3bc6d9db2ca9dfe754a8fa5031c282006900839ccb68438","abstract_canon_sha256":"5bc1c6a2e657e13e7e4f3c5cbbb34d242697768e199515cc1a8173a5377db079"},"schema_version":"1.0"},"canonical_sha256":"f63e0445685cc9341cd4c775418a73d4ee69a4d6a129b59f1c75fad4069bd011","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:01.705818Z","signature_b64":"XUvj2u34Juc88mK9U0xdqsWcvvktfiv3Xf56uyz/NECrP0pIs68t5OU9UL2Mmnh0YICosYlBKMxYeRtHE6GWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f63e0445685cc9341cd4c775418a73d4ee69a4d6a129b59f1c75fad4069bd011","last_reissued_at":"2026-05-17T23:44:01.705279Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:01.705279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.02280","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-05-17T23:44:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+JlBZ0O/2wRXDYVm84MkcImKdKxR0gZy9G49V5INfbpzlagTdnuXzYrDt/Pc5I1ff2uIWRLIuVzOcirpqOlCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:54:29.920123Z"},"content_sha256":"19cddab7a78e0291c5af4e26815a520c04b1fbe1f316c4668f878b062a20f147","schema_version":"1.0","event_id":"sha256:19cddab7a78e0291c5af4e26815a520c04b1fbe1f316c4668f878b062a20f147"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6Y7AIRLILTETIHGUY52UDCTT2T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Q-Learning for Directed Acyclic Graph Generation","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alun Preece, Laura D'Arcy, Padraig Corcoran","submitted_at":"2019-06-05T19:56:44Z","abstract_excerpt":"We present a method to generate directed acyclic graphs (DAGs) using deep reinforcement learning, specifically deep Q-learning. Generating graphs with specified structures is an important and challenging task in various application fields, however most current graph generation methods produce graphs with undirected edges. We demonstrate that this method is capable of generating DAGs with topology and node types satisfying specified criteria in highly sparse reward environments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02280","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"},"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-05-17T23:44:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVP9WzdX6iuZI3V0AMK8AHDGNeNmo9HL8/yPOMQk2v2c2IJJgpiHWJ2b+CsqP77dI2bPWJBsklsK6hDYNFhkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:54:29.920524Z"},"content_sha256":"6a869b6bf558fb465b50c346b48dab2c1ae401d15ab45813cd8c5c4caf4e5f8f","schema_version":"1.0","event_id":"sha256:6a869b6bf558fb465b50c346b48dab2c1ae401d15ab45813cd8c5c4caf4e5f8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6Y7AIRLILTETIHGUY52UDCTT2T/bundle.json","state_url":"https://pith.science/pith/6Y7AIRLILTETIHGUY52UDCTT2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6Y7AIRLILTETIHGUY52UDCTT2T/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-05-31T21:54:29Z","links":{"resolver":"https://pith.science/pith/6Y7AIRLILTETIHGUY52UDCTT2T","bundle":"https://pith.science/pith/6Y7AIRLILTETIHGUY52UDCTT2T/bundle.json","state":"https://pith.science/pith/6Y7AIRLILTETIHGUY52UDCTT2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6Y7AIRLILTETIHGUY52UDCTT2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6Y7AIRLILTETIHGUY52UDCTT2T","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":"5bc1c6a2e657e13e7e4f3c5cbbb34d242697768e199515cc1a8173a5377db079","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-05T19:56:44Z","title_canon_sha256":"2cc00610fe4553adf3bc6d9db2ca9dfe754a8fa5031c282006900839ccb68438"},"schema_version":"1.0","source":{"id":"1906.02280","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.02280","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"arxiv_version","alias_value":"1906.02280v1","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.02280","created_at":"2026-05-17T23:44:01Z"},{"alias_kind":"pith_short_12","alias_value":"6Y7AIRLILTET","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6Y7AIRLILTETIHGU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6Y7AIRLI","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:6a869b6bf558fb465b50c346b48dab2c1ae401d15ab45813cd8c5c4caf4e5f8f","target":"graph","created_at":"2026-05-17T23:44:01Z","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"},"paper":{"abstract_excerpt":"We present a method to generate directed acyclic graphs (DAGs) using deep reinforcement learning, specifically deep Q-learning. Generating graphs with specified structures is an important and challenging task in various application fields, however most current graph generation methods produce graphs with undirected edges. We demonstrate that this method is capable of generating DAGs with topology and node types satisfying specified criteria in highly sparse reward environments.","authors_text":"Alun Preece, Laura D'Arcy, Padraig Corcoran","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-05T19:56:44Z","title":"Deep Q-Learning for Directed Acyclic Graph Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.02280","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:19cddab7a78e0291c5af4e26815a520c04b1fbe1f316c4668f878b062a20f147","target":"record","created_at":"2026-05-17T23:44:01Z","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":"5bc1c6a2e657e13e7e4f3c5cbbb34d242697768e199515cc1a8173a5377db079","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-05T19:56:44Z","title_canon_sha256":"2cc00610fe4553adf3bc6d9db2ca9dfe754a8fa5031c282006900839ccb68438"},"schema_version":"1.0","source":{"id":"1906.02280","kind":"arxiv","version":1}},"canonical_sha256":"f63e0445685cc9341cd4c775418a73d4ee69a4d6a129b59f1c75fad4069bd011","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f63e0445685cc9341cd4c775418a73d4ee69a4d6a129b59f1c75fad4069bd011","first_computed_at":"2026-05-17T23:44:01.705279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:01.705279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XUvj2u34Juc88mK9U0xdqsWcvvktfiv3Xf56uyz/NECrP0pIs68t5OU9UL2Mmnh0YICosYlBKMxYeRtHE6GWCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:01.705818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.02280","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19cddab7a78e0291c5af4e26815a520c04b1fbe1f316c4668f878b062a20f147","sha256:6a869b6bf558fb465b50c346b48dab2c1ae401d15ab45813cd8c5c4caf4e5f8f"],"state_sha256":"e6ea73141bf6222bb260c6f442ab85e1e87fd42c30aa10a8f00efb7a7fe39e1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TclYscWNpgzlq0KSzcFXSTeyDBWX2YNoNX8rGxjmvqfFJz+ZBz6L6oYVyAObaNQRyYzbw8Qp/iODqj6pOVSxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:54:29.923583Z","bundle_sha256":"25d1131bb45af8f1195d42b9b5cd93da385aec6f75dfe2526db8010643ba94eb"}}