{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DZW7J67UEOPDXPL6I4PZ6O5ZSC","short_pith_number":"pith:DZW7J67U","canonical_record":{"source":{"id":"1712.09381","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-26T19:43:59Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"22a6a037dba228d885cc0658cc837498091109a5ee01a1cca4fc7e688f0c536b","abstract_canon_sha256":"1c296d5881ad88d333552d3d4c715592b1eb54fcf7d45d213f49ff7aa6e91a95"},"schema_version":"1.0"},"canonical_sha256":"1e6df4fbf4239e3bbd7e471f9f3bb990a87b942e487f51cc8ce81b9636e7e5f2","source":{"kind":"arxiv","id":"1712.09381","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09381","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09381v4","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09381","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"pith_short_12","alias_value":"DZW7J67UEOPD","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DZW7J67UEOPDXPL6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DZW7J67U","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DZW7J67UEOPDXPL6I4PZ6O5ZSC","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09381","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-26T19:43:59Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"22a6a037dba228d885cc0658cc837498091109a5ee01a1cca4fc7e688f0c536b","abstract_canon_sha256":"1c296d5881ad88d333552d3d4c715592b1eb54fcf7d45d213f49ff7aa6e91a95"},"schema_version":"1.0"},"canonical_sha256":"1e6df4fbf4239e3bbd7e471f9f3bb990a87b942e487f51cc8ce81b9636e7e5f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:06.083719Z","signature_b64":"lrGQOnV4ch57QEfPGibAOd5sl7WPEm9qRMUTMvF7tcdN4l22CPmuVkRGov3EnfgGoHZwK0vzMTVIg9ki+mQDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e6df4fbf4239e3bbd7e471f9f3bb990a87b942e487f51cc8ce81b9636e7e5f2","last_reissued_at":"2026-05-18T00:12:06.083079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:06.083079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09381","source_version":4,"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-18T00:12:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGnoGkpCXSP0ujMIGujH5hCo28NFd4yJZeBCVU3ozqZ8LW+7QE/HRr2J0zaVLS24qYiiG+u4A7iujTxpSlrXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:35:27.805526Z"},"content_sha256":"e5361eb2bbbfb46e9d124ca2b58f121dcf8c2d58b453239e8f129e1ac7ca5517","schema_version":"1.0","event_id":"sha256:e5361eb2bbbfb46e9d124ca2b58f121dcf8c2d58b453239e8f129e1ac7ca5517"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DZW7J67UEOPDXPL6I4PZ6O5ZSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RLlib: Abstractions for Distributed Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"cs.AI","authors_text":"Eric Liang, Ion Stoica, Joseph E. Gonzalez, Ken Goldberg, Michael I. Jordan, Philipp Moritz, Richard Liaw, Robert Nishihara, Roy Fox","submitted_at":"2017-12-26T19:43:59Z","abstract_excerpt":"Reinforcement learning (RL) algorithms involve the deep nesting of highly irregular computation patterns, each of which typically exhibits opportunities for distributed computation. We argue for distributing RL components in a composable way by adapting algorithms for top-down hierarchical control, thereby encapsulating parallelism and resource requirements within short-running compute tasks. We demonstrate the benefits of this principle through RLlib: a library that provides scalable software primitives for RL. These primitives enable a broad range of algorithms to be implemented with high pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09381","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":""},"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-18T00:12:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7AkJDfW9ld6fVJBRBAFSl1Kp4z3AfW4P2jif5DautTEYNvQqW6ZWCWcMqgtrH0Jhpk9Ea1I1i3s8M8k9ejhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:35:27.806255Z"},"content_sha256":"94882584de658852ebae23fa0de940deedb55f67b4c9e4486ebbd863e4147a69","schema_version":"1.0","event_id":"sha256:94882584de658852ebae23fa0de940deedb55f67b4c9e4486ebbd863e4147a69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DZW7J67UEOPDXPL6I4PZ6O5ZSC/bundle.json","state_url":"https://pith.science/pith/DZW7J67UEOPDXPL6I4PZ6O5ZSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DZW7J67UEOPDXPL6I4PZ6O5ZSC/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-06-10T04:35:27Z","links":{"resolver":"https://pith.science/pith/DZW7J67UEOPDXPL6I4PZ6O5ZSC","bundle":"https://pith.science/pith/DZW7J67UEOPDXPL6I4PZ6O5ZSC/bundle.json","state":"https://pith.science/pith/DZW7J67UEOPDXPL6I4PZ6O5ZSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DZW7J67UEOPDXPL6I4PZ6O5ZSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DZW7J67UEOPDXPL6I4PZ6O5ZSC","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":"1c296d5881ad88d333552d3d4c715592b1eb54fcf7d45d213f49ff7aa6e91a95","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-26T19:43:59Z","title_canon_sha256":"22a6a037dba228d885cc0658cc837498091109a5ee01a1cca4fc7e688f0c536b"},"schema_version":"1.0","source":{"id":"1712.09381","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09381","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09381v4","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09381","created_at":"2026-05-18T00:12:06Z"},{"alias_kind":"pith_short_12","alias_value":"DZW7J67UEOPD","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"DZW7J67UEOPDXPL6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"DZW7J67U","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:94882584de658852ebae23fa0de940deedb55f67b4c9e4486ebbd863e4147a69","target":"graph","created_at":"2026-05-18T00:12:06Z","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":"Reinforcement learning (RL) algorithms involve the deep nesting of highly irregular computation patterns, each of which typically exhibits opportunities for distributed computation. We argue for distributing RL components in a composable way by adapting algorithms for top-down hierarchical control, thereby encapsulating parallelism and resource requirements within short-running compute tasks. We demonstrate the benefits of this principle through RLlib: a library that provides scalable software primitives for RL. These primitives enable a broad range of algorithms to be implemented with high pe","authors_text":"Eric Liang, Ion Stoica, Joseph E. Gonzalez, Ken Goldberg, Michael I. Jordan, Philipp Moritz, Richard Liaw, Robert Nishihara, Roy Fox","cross_cats":["cs.DC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-26T19:43:59Z","title":"RLlib: Abstractions for Distributed Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09381","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:e5361eb2bbbfb46e9d124ca2b58f121dcf8c2d58b453239e8f129e1ac7ca5517","target":"record","created_at":"2026-05-18T00:12:06Z","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":"1c296d5881ad88d333552d3d4c715592b1eb54fcf7d45d213f49ff7aa6e91a95","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-12-26T19:43:59Z","title_canon_sha256":"22a6a037dba228d885cc0658cc837498091109a5ee01a1cca4fc7e688f0c536b"},"schema_version":"1.0","source":{"id":"1712.09381","kind":"arxiv","version":4}},"canonical_sha256":"1e6df4fbf4239e3bbd7e471f9f3bb990a87b942e487f51cc8ce81b9636e7e5f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e6df4fbf4239e3bbd7e471f9f3bb990a87b942e487f51cc8ce81b9636e7e5f2","first_computed_at":"2026-05-18T00:12:06.083079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:06.083079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lrGQOnV4ch57QEfPGibAOd5sl7WPEm9qRMUTMvF7tcdN4l22CPmuVkRGov3EnfgGoHZwK0vzMTVIg9ki+mQDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:06.083719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09381","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5361eb2bbbfb46e9d124ca2b58f121dcf8c2d58b453239e8f129e1ac7ca5517","sha256:94882584de658852ebae23fa0de940deedb55f67b4c9e4486ebbd863e4147a69"],"state_sha256":"a086f95f678bb379c91dea24714f1637058dec6099e7f1ff3caff829774095fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UsaDAYCLzshF/HjHu5pZxyei3QM8EROdq57n+KWXlwGAHrdnP3qjUgS0JpFAwCa6ipTOYzjDEN/SI1rhnmXcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T04:35:27.810357Z","bundle_sha256":"ed22874c308a247df30c3f755f2b5be2135c8a9f531471cd43135987db882e25"}}