{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7UL224GU5O2AHT72VZPWOTSHT7","short_pith_number":"pith:7UL224GU","canonical_record":{"source":{"id":"1901.05152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-16T06:38:11Z","cross_cats_sorted":[],"title_canon_sha256":"7e1d28c20bb574578dc4179df4755eac7a35d87929d6d1635718691c86097afc","abstract_canon_sha256":"25c2472353daeca7513f36d042c5ff0756e6a88cb34bdd8b7d2423f731d15983"},"schema_version":"1.0"},"canonical_sha256":"fd17ad70d4ebb403cffaae5f674e479fe63301ff773b967d227245324fa9d9c3","source":{"kind":"arxiv","id":"1901.05152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05152","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05152v1","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05152","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"7UL224GU5O2A","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7UL224GU5O2AHT72","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7UL224GU","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7UL224GU5O2AHT72VZPWOTSHT7","target":"record","payload":{"canonical_record":{"source":{"id":"1901.05152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-16T06:38:11Z","cross_cats_sorted":[],"title_canon_sha256":"7e1d28c20bb574578dc4179df4755eac7a35d87929d6d1635718691c86097afc","abstract_canon_sha256":"25c2472353daeca7513f36d042c5ff0756e6a88cb34bdd8b7d2423f731d15983"},"schema_version":"1.0"},"canonical_sha256":"fd17ad70d4ebb403cffaae5f674e479fe63301ff773b967d227245324fa9d9c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:11.718736Z","signature_b64":"kFOnYxpL6VURHdvU09wgP4YP+FCGK4JeXd7mE46TMm0zTvrlOF9I7CIbMCcW8SAvHstlP5X8i+qV/c7tFBYpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd17ad70d4ebb403cffaae5f674e479fe63301ff773b967d227245324fa9d9c3","last_reissued_at":"2026-05-17T23:56:11.718063Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:11.718063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.05152","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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kZ+NaX/QWqNOGud2QCsldOqo5mjKstCiaS7UcDm28COJoSIEtIgPzKQz0y787IEf8bIufDkvJ+eWNKhjaZn+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:10:47.704575Z"},"content_sha256":"95beba574087e125e86606d98d948e5741803f48bfa82f37467c4c609cfd86ec","schema_version":"1.0","event_id":"sha256:95beba574087e125e86606d98d948e5741803f48bfa82f37467c4c609cfd86ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7UL224GU5O2AHT72VZPWOTSHT7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Deepak Maram, Immanuel Trummer, Joseph Antonakakis, Junxiong Wang, Saehan Jo, Samuel Moseley","submitted_at":"2019-01-16T06:38:11Z","abstract_excerpt":"SkinnerDB is designed from the ground up for reliable join ordering. It maintains no data statistics and uses no cost or cardinality models. Instead, it uses reinforcement learning to learn optimal join orders on the fly, during the execution of the current query. To that purpose, we divide the execution of a query into many small time slices. Different join orders are tried in different time slices. We merge result tuples generated according to different join orders until a complete result is obtained. By measuring execution progress per time slice, we identify promising join orders as execut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05152","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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ps7kLZmk+YUqXVnuCsWwRDXE9uGS+oLshhsvcTys1urjxBPWQjE++pGH/gOX4QK+5d9zI15tkSETy871dEi9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:10:47.705051Z"},"content_sha256":"5e682c8c1cb6c1aa6d1d5919520112864bdb215813e8325127f0b96d37a782d8","schema_version":"1.0","event_id":"sha256:5e682c8c1cb6c1aa6d1d5919520112864bdb215813e8325127f0b96d37a782d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UL224GU5O2AHT72VZPWOTSHT7/bundle.json","state_url":"https://pith.science/pith/7UL224GU5O2AHT72VZPWOTSHT7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UL224GU5O2AHT72VZPWOTSHT7/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-31T04:10:47Z","links":{"resolver":"https://pith.science/pith/7UL224GU5O2AHT72VZPWOTSHT7","bundle":"https://pith.science/pith/7UL224GU5O2AHT72VZPWOTSHT7/bundle.json","state":"https://pith.science/pith/7UL224GU5O2AHT72VZPWOTSHT7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UL224GU5O2AHT72VZPWOTSHT7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7UL224GU5O2AHT72VZPWOTSHT7","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":"25c2472353daeca7513f36d042c5ff0756e6a88cb34bdd8b7d2423f731d15983","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-16T06:38:11Z","title_canon_sha256":"7e1d28c20bb574578dc4179df4755eac7a35d87929d6d1635718691c86097afc"},"schema_version":"1.0","source":{"id":"1901.05152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05152","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05152v1","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05152","created_at":"2026-05-17T23:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"7UL224GU5O2A","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7UL224GU5O2AHT72","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7UL224GU","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:5e682c8c1cb6c1aa6d1d5919520112864bdb215813e8325127f0b96d37a782d8","target":"graph","created_at":"2026-05-17T23:56: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"},"paper":{"abstract_excerpt":"SkinnerDB is designed from the ground up for reliable join ordering. It maintains no data statistics and uses no cost or cardinality models. Instead, it uses reinforcement learning to learn optimal join orders on the fly, during the execution of the current query. To that purpose, we divide the execution of a query into many small time slices. Different join orders are tried in different time slices. We merge result tuples generated according to different join orders until a complete result is obtained. By measuring execution progress per time slice, we identify promising join orders as execut","authors_text":"Deepak Maram, Immanuel Trummer, Joseph Antonakakis, Junxiong Wang, Saehan Jo, Samuel Moseley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-16T06:38:11Z","title":"SkinnerDB: Regret-Bounded Query Evaluation via Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05152","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:95beba574087e125e86606d98d948e5741803f48bfa82f37467c4c609cfd86ec","target":"record","created_at":"2026-05-17T23:56: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":"25c2472353daeca7513f36d042c5ff0756e6a88cb34bdd8b7d2423f731d15983","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-01-16T06:38:11Z","title_canon_sha256":"7e1d28c20bb574578dc4179df4755eac7a35d87929d6d1635718691c86097afc"},"schema_version":"1.0","source":{"id":"1901.05152","kind":"arxiv","version":1}},"canonical_sha256":"fd17ad70d4ebb403cffaae5f674e479fe63301ff773b967d227245324fa9d9c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd17ad70d4ebb403cffaae5f674e479fe63301ff773b967d227245324fa9d9c3","first_computed_at":"2026-05-17T23:56:11.718063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:11.718063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kFOnYxpL6VURHdvU09wgP4YP+FCGK4JeXd7mE46TMm0zTvrlOF9I7CIbMCcW8SAvHstlP5X8i+qV/c7tFBYpDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:11.718736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95beba574087e125e86606d98d948e5741803f48bfa82f37467c4c609cfd86ec","sha256:5e682c8c1cb6c1aa6d1d5919520112864bdb215813e8325127f0b96d37a782d8"],"state_sha256":"e2a1b24392c3f8581f2bb29aab0cfcfa5f4d3f4370ea7549d5f613b47e06e679"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRCkq6tPELQcc/0SLUFQ1RIk0mxqbffIV2doi7NHXrxdVLNmATrA0wK4y739iUQBIGgBC0e5MN9QDPWMA+zECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:10:47.707906Z","bundle_sha256":"62ddad97fe2cd0addd71785ed0488d1880e2418e7ac6915232745f85ddeeacce"}}