{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:S4PJI2NXHOUQOCNLDM76GLOM72","short_pith_number":"pith:S4PJI2NX","canonical_record":{"source":{"id":"2410.00704","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-01T13:56:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6d70c3b84e974660d7ba22e6fc0fbe65cca7f370b932ce47889bd53a949a6e0d","abstract_canon_sha256":"68f710e886d90165a6c53bcb4a09dde00528eec4a75d3723c0e32ba044b5e763"},"schema_version":"1.0"},"canonical_sha256":"971e9469b73ba90709ab1b3fe32dccfe9c737f751fbb2a2cc88988b2a8ac5d4a","source":{"kind":"arxiv","id":"2410.00704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.00704","created_at":"2026-07-05T09:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"2410.00704v1","created_at":"2026-07-05T09:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.00704","created_at":"2026-07-05T09:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"S4PJI2NXHOUQ","created_at":"2026-07-05T09:14:09Z"},{"alias_kind":"pith_short_16","alias_value":"S4PJI2NXHOUQOCNL","created_at":"2026-07-05T09:14:09Z"},{"alias_kind":"pith_short_8","alias_value":"S4PJI2NX","created_at":"2026-07-05T09:14:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:S4PJI2NXHOUQOCNLDM76GLOM72","target":"record","payload":{"canonical_record":{"source":{"id":"2410.00704","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-01T13:56:09Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6d70c3b84e974660d7ba22e6fc0fbe65cca7f370b932ce47889bd53a949a6e0d","abstract_canon_sha256":"68f710e886d90165a6c53bcb4a09dde00528eec4a75d3723c0e32ba044b5e763"},"schema_version":"1.0"},"canonical_sha256":"971e9469b73ba90709ab1b3fe32dccfe9c737f751fbb2a2cc88988b2a8ac5d4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:09.230036Z","signature_b64":"IKpgV1L20HCNzN5/fR/q7b7UQ7b7C8GZbLPZP6Mj7G5HRJYZCsuIAPS+8Ydf7KW8B+EtS8YRAW08aWIIBlrVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"971e9469b73ba90709ab1b3fe32dccfe9c737f751fbb2a2cc88988b2a8ac5d4a","last_reissued_at":"2026-07-05T09:14:09.229697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:09.229697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.00704","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-05T09:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYaC3bTPxLVpqMDpDY9/GHeRSkrB2Bb7UjKCtIRGc4wLB3LMjQBJsLvJk3ejuVZOgd2VBj/MvDJPS87STVxcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T20:42:09.111060Z"},"content_sha256":"539f36ba7b15fb8912522398c89d1afb184863161cdc708c46688525a72fd891","schema_version":"1.0","event_id":"sha256:539f36ba7b15fb8912522398c89d1afb184863161cdc708c46688525a72fd891"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:S4PJI2NXHOUQOCNLDM76GLOM72","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contrastive Abstraction for Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Elisabeth Rumetshofer, Markus Hofmarcher, Sepp Hochreiter, Vihang Patil","submitted_at":"2024-10-01T13:56:09Z","abstract_excerpt":"Learning agents with reinforcement learning is difficult when dealing with long trajectories that involve a large number of states. To address these learning problems effectively, the number of states can be reduced by abstract representations that cluster states. In principle, deep reinforcement learning can find abstract states, but end-to-end learning is unstable. We propose contrastive abstraction learning to find abstract states, where we assume that successive states in a trajectory belong to the same abstract state. Such abstract states may be basic locations, achieved subgoals, invento"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.00704","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/2410.00704/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-05T09:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/z0K4DkjsOf2y2y9i2Pvtzd5dilQsQc1NtoTWs8DDk+gh8AX10BZ2k/yPPY0EUjJL+LVz/OQo/HnzQUmxxrtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T20:42:09.111790Z"},"content_sha256":"3c5b4398961eca978ccaaf04250eab342e05f01b04c50a2b73bc624ba307f9ae","schema_version":"1.0","event_id":"sha256:3c5b4398961eca978ccaaf04250eab342e05f01b04c50a2b73bc624ba307f9ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4PJI2NXHOUQOCNLDM76GLOM72/bundle.json","state_url":"https://pith.science/pith/S4PJI2NXHOUQOCNLDM76GLOM72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4PJI2NXHOUQOCNLDM76GLOM72/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-21T20:42:09Z","links":{"resolver":"https://pith.science/pith/S4PJI2NXHOUQOCNLDM76GLOM72","bundle":"https://pith.science/pith/S4PJI2NXHOUQOCNLDM76GLOM72/bundle.json","state":"https://pith.science/pith/S4PJI2NXHOUQOCNLDM76GLOM72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4PJI2NXHOUQOCNLDM76GLOM72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:S4PJI2NXHOUQOCNLDM76GLOM72","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":"68f710e886d90165a6c53bcb4a09dde00528eec4a75d3723c0e32ba044b5e763","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-01T13:56:09Z","title_canon_sha256":"6d70c3b84e974660d7ba22e6fc0fbe65cca7f370b932ce47889bd53a949a6e0d"},"schema_version":"1.0","source":{"id":"2410.00704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.00704","created_at":"2026-07-05T09:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"2410.00704v1","created_at":"2026-07-05T09:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.00704","created_at":"2026-07-05T09:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"S4PJI2NXHOUQ","created_at":"2026-07-05T09:14:09Z"},{"alias_kind":"pith_short_16","alias_value":"S4PJI2NXHOUQOCNL","created_at":"2026-07-05T09:14:09Z"},{"alias_kind":"pith_short_8","alias_value":"S4PJI2NX","created_at":"2026-07-05T09:14:09Z"}],"graph_snapshots":[{"event_id":"sha256:3c5b4398961eca978ccaaf04250eab342e05f01b04c50a2b73bc624ba307f9ae","target":"graph","created_at":"2026-07-05T09:14:09Z","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/2410.00704/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning agents with reinforcement learning is difficult when dealing with long trajectories that involve a large number of states. To address these learning problems effectively, the number of states can be reduced by abstract representations that cluster states. In principle, deep reinforcement learning can find abstract states, but end-to-end learning is unstable. We propose contrastive abstraction learning to find abstract states, where we assume that successive states in a trajectory belong to the same abstract state. Such abstract states may be basic locations, achieved subgoals, invento","authors_text":"Elisabeth Rumetshofer, Markus Hofmarcher, Sepp Hochreiter, Vihang Patil","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-01T13:56:09Z","title":"Contrastive Abstraction for Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.00704","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:539f36ba7b15fb8912522398c89d1afb184863161cdc708c46688525a72fd891","target":"record","created_at":"2026-07-05T09:14:09Z","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":"68f710e886d90165a6c53bcb4a09dde00528eec4a75d3723c0e32ba044b5e763","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-01T13:56:09Z","title_canon_sha256":"6d70c3b84e974660d7ba22e6fc0fbe65cca7f370b932ce47889bd53a949a6e0d"},"schema_version":"1.0","source":{"id":"2410.00704","kind":"arxiv","version":1}},"canonical_sha256":"971e9469b73ba90709ab1b3fe32dccfe9c737f751fbb2a2cc88988b2a8ac5d4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"971e9469b73ba90709ab1b3fe32dccfe9c737f751fbb2a2cc88988b2a8ac5d4a","first_computed_at":"2026-07-05T09:14:09.229697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:14:09.229697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IKpgV1L20HCNzN5/fR/q7b7UQ7b7C8GZbLPZP6Mj7G5HRJYZCsuIAPS+8Ydf7KW8B+EtS8YRAW08aWIIBlrVBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:14:09.230036Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.00704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:539f36ba7b15fb8912522398c89d1afb184863161cdc708c46688525a72fd891","sha256:3c5b4398961eca978ccaaf04250eab342e05f01b04c50a2b73bc624ba307f9ae"],"state_sha256":"3d59b87b541a9db1533cf220e687ab8eb372de6f0de9bb6968a5241fd157fb1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVAySXvciLEogPW8VskVQ4h8EF5gL/vrBjuCeg1TEBPV1iqLgenQ7pl7CMJ99FC/Wl/ojW/bZ1WP6lM8dVSGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T20:42:09.117727Z","bundle_sha256":"63987aaa8f2e110ec7967d4a059cb71fc19299a4c5643b1764bfea4c0d06f56d"}}