{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IEMSLSCAJ4UA3YEL3S3V73IJZP","short_pith_number":"pith:IEMSLSCA","canonical_record":{"source":{"id":"2302.10887","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-21T21:05:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d19bdf479bde65a1489ef7a4bc7b4d0ac565fc2b02321d62d757fea5a167d8b6","abstract_canon_sha256":"c720ad0ceb33344bd319ff29ce8189a67f12bacb666926bdf9c5aff084468428"},"schema_version":"1.0"},"canonical_sha256":"411925c8404f280de08bdcb75fed09cbd7c0d7af537670cc797b47755fb96f1c","source":{"kind":"arxiv","id":"2302.10887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.10887","created_at":"2026-07-05T05:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"2302.10887v1","created_at":"2026-07-05T05:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10887","created_at":"2026-07-05T05:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"IEMSLSCAJ4UA","created_at":"2026-07-05T05:44:28Z"},{"alias_kind":"pith_short_16","alias_value":"IEMSLSCAJ4UA3YEL","created_at":"2026-07-05T05:44:28Z"},{"alias_kind":"pith_short_8","alias_value":"IEMSLSCA","created_at":"2026-07-05T05:44:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IEMSLSCAJ4UA3YEL3S3V73IJZP","target":"record","payload":{"canonical_record":{"source":{"id":"2302.10887","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-21T21:05:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d19bdf479bde65a1489ef7a4bc7b4d0ac565fc2b02321d62d757fea5a167d8b6","abstract_canon_sha256":"c720ad0ceb33344bd319ff29ce8189a67f12bacb666926bdf9c5aff084468428"},"schema_version":"1.0"},"canonical_sha256":"411925c8404f280de08bdcb75fed09cbd7c0d7af537670cc797b47755fb96f1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:44:28.104858Z","signature_b64":"AkklyKcsZD5nmmh/aonuS1rPHsvVnmRqkKLpSPFkZLoBPKd6WQdo1KKMZqGD1ykR42gDJD5GwXPpZwA/fAJ8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"411925c8404f280de08bdcb75fed09cbd7c0d7af537670cc797b47755fb96f1c","last_reissued_at":"2026-07-05T05:44:28.104476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:44:28.104476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.10887","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-05T05:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3YUcwfGsgmrB4SdcpM2tG+6unFk84LKJrJkhRfLCOFP4wSw4DLWHdd91/5Q8uOwkPs0t3Qsd1UkCUPInQNeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:38:35.559778Z"},"content_sha256":"d2f0764c05d287af4300a3c533cbf2b6726739a23588b95595ecdd656ea4e0d4","schema_version":"1.0","event_id":"sha256:d2f0764c05d287af4300a3c533cbf2b6726739a23588b95595ecdd656ea4e0d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IEMSLSCAJ4UA3YEL3S3V73IJZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The configurable tree graph (CT-graph): measurable problems in partially observable and distal reward environments for lifelong reinforcement learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Andrea Soltoggio, Christos Peridis, Eseoghene Ben-Iwhiwhu, Jeffery Dick, Pawel Ladosz, Praveen K. Pilly, Soheil Kolouri","submitted_at":"2023-01-21T21:05:52Z","abstract_excerpt":"This paper introduces a set of formally defined and transparent problems for reinforcement learning algorithms with the following characteristics: (1) variable degrees of observability (non-Markov observations), (2) distal and sparse rewards, (3) variable and hierarchical reward structure, (4) multiple-task generation, (5) variable problem complexity. The environment provides 1D or 2D categorical observations, and takes actions as input. The core structure of the CT-graph is a multi-branch tree graph with arbitrary branching factor, depth, and observation sets that can be varied to increase th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10887","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/2302.10887/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-05T05:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/NDcnCn7klubYyrD2SGQqMyhd8ZJO+FJtweltOAamY5wRxmruhfnRkA6Excefhn3kZG0u5UDLuP6jrKhNgVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:38:35.560117Z"},"content_sha256":"573597314db3791d3e3da037a9d77cae0d63a0901bc3eaa4773f75bc40d08ad5","schema_version":"1.0","event_id":"sha256:573597314db3791d3e3da037a9d77cae0d63a0901bc3eaa4773f75bc40d08ad5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEMSLSCAJ4UA3YEL3S3V73IJZP/bundle.json","state_url":"https://pith.science/pith/IEMSLSCAJ4UA3YEL3S3V73IJZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEMSLSCAJ4UA3YEL3S3V73IJZP/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-04T15:38:35Z","links":{"resolver":"https://pith.science/pith/IEMSLSCAJ4UA3YEL3S3V73IJZP","bundle":"https://pith.science/pith/IEMSLSCAJ4UA3YEL3S3V73IJZP/bundle.json","state":"https://pith.science/pith/IEMSLSCAJ4UA3YEL3S3V73IJZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEMSLSCAJ4UA3YEL3S3V73IJZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IEMSLSCAJ4UA3YEL3S3V73IJZP","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":"c720ad0ceb33344bd319ff29ce8189a67f12bacb666926bdf9c5aff084468428","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-21T21:05:52Z","title_canon_sha256":"d19bdf479bde65a1489ef7a4bc7b4d0ac565fc2b02321d62d757fea5a167d8b6"},"schema_version":"1.0","source":{"id":"2302.10887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.10887","created_at":"2026-07-05T05:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"2302.10887v1","created_at":"2026-07-05T05:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.10887","created_at":"2026-07-05T05:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"IEMSLSCAJ4UA","created_at":"2026-07-05T05:44:28Z"},{"alias_kind":"pith_short_16","alias_value":"IEMSLSCAJ4UA3YEL","created_at":"2026-07-05T05:44:28Z"},{"alias_kind":"pith_short_8","alias_value":"IEMSLSCA","created_at":"2026-07-05T05:44:28Z"}],"graph_snapshots":[{"event_id":"sha256:573597314db3791d3e3da037a9d77cae0d63a0901bc3eaa4773f75bc40d08ad5","target":"graph","created_at":"2026-07-05T05:44:28Z","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/2302.10887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a set of formally defined and transparent problems for reinforcement learning algorithms with the following characteristics: (1) variable degrees of observability (non-Markov observations), (2) distal and sparse rewards, (3) variable and hierarchical reward structure, (4) multiple-task generation, (5) variable problem complexity. The environment provides 1D or 2D categorical observations, and takes actions as input. The core structure of the CT-graph is a multi-branch tree graph with arbitrary branching factor, depth, and observation sets that can be varied to increase th","authors_text":"Andrea Soltoggio, Christos Peridis, Eseoghene Ben-Iwhiwhu, Jeffery Dick, Pawel Ladosz, Praveen K. Pilly, Soheil Kolouri","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-21T21:05:52Z","title":"The configurable tree graph (CT-graph): measurable problems in partially observable and distal reward environments for lifelong reinforcement learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.10887","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:d2f0764c05d287af4300a3c533cbf2b6726739a23588b95595ecdd656ea4e0d4","target":"record","created_at":"2026-07-05T05:44:28Z","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":"c720ad0ceb33344bd319ff29ce8189a67f12bacb666926bdf9c5aff084468428","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-01-21T21:05:52Z","title_canon_sha256":"d19bdf479bde65a1489ef7a4bc7b4d0ac565fc2b02321d62d757fea5a167d8b6"},"schema_version":"1.0","source":{"id":"2302.10887","kind":"arxiv","version":1}},"canonical_sha256":"411925c8404f280de08bdcb75fed09cbd7c0d7af537670cc797b47755fb96f1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"411925c8404f280de08bdcb75fed09cbd7c0d7af537670cc797b47755fb96f1c","first_computed_at":"2026-07-05T05:44:28.104476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:44:28.104476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AkklyKcsZD5nmmh/aonuS1rPHsvVnmRqkKLpSPFkZLoBPKd6WQdo1KKMZqGD1ykR42gDJD5GwXPpZwA/fAJ8AA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:44:28.104858Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.10887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2f0764c05d287af4300a3c533cbf2b6726739a23588b95595ecdd656ea4e0d4","sha256:573597314db3791d3e3da037a9d77cae0d63a0901bc3eaa4773f75bc40d08ad5"],"state_sha256":"448de0e7c92de080301fdec40f2f09fca19e43227f986105f1aefa0a251b330f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0IPX6l/QqBEg0323Q/+nUeBYjR4zEot8UZlFZrpW0b4Lzz1IftSEAKfYNVWvBs8Zj2tc04P7PDgS89PpHg9mBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T15:38:35.563518Z","bundle_sha256":"3d8055c484e404e1abd437ee97564fc0a54cae89096e829be4ed9ee55f2e311c"}}