{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IOO22SVXJMLSU4GYXDCO3CAQAI","short_pith_number":"pith:IOO22SVX","canonical_record":{"source":{"id":"2304.13774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-04-26T18:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"11c65f4751c1de75c0825636a326558d3fe45167371e1f6bfc95bacd8369e154","abstract_canon_sha256":"e087eccfabac576d7c16fac47689d0318585c7885a9dcd4efff97bca40a76484"},"schema_version":"1.0"},"canonical_sha256":"439dad4ab74b172a70d8b8c4ed8810023c68cc0c8a2be69242543ef5a3efbc9d","source":{"kind":"arxiv","id":"2304.13774","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.13774","created_at":"2026-07-05T06:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2304.13774v1","created_at":"2026-07-05T06:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.13774","created_at":"2026-07-05T06:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"IOO22SVXJMLS","created_at":"2026-07-05T06:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"IOO22SVXJMLSU4GY","created_at":"2026-07-05T06:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"IOO22SVX","created_at":"2026-07-05T06:04:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IOO22SVXJMLSU4GYXDCO3CAQAI","target":"record","payload":{"canonical_record":{"source":{"id":"2304.13774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-04-26T18:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"11c65f4751c1de75c0825636a326558d3fe45167371e1f6bfc95bacd8369e154","abstract_canon_sha256":"e087eccfabac576d7c16fac47689d0318585c7885a9dcd4efff97bca40a76484"},"schema_version":"1.0"},"canonical_sha256":"439dad4ab74b172a70d8b8c4ed8810023c68cc0c8a2be69242543ef5a3efbc9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:04:57.092353Z","signature_b64":"d4CtQMON708F6InayIaJ+uPrSqZCGKBMwKS+G8JR6NYb7IH1hoTM3b/L25emESiz1JhmRWTspFxpkj+AK3F4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"439dad4ab74b172a70d8b8c4ed8810023c68cc0c8a2be69242543ef5a3efbc9d","last_reissued_at":"2026-07-05T06:04:57.091907Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:04:57.091907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.13774","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-05T06:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mKv0lAt3KwReaKwwV+HIE26hh+o1DaNg8rKTplou5zriEgnKoS7BFdN46Sn89XcaU7/CQ2FGOlY9bIktgzEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:04:10.540940Z"},"content_sha256":"b23bb51d34ce49a39e5804ef7e7a7c790afcc8fabab9f3c2b37c953b853b2f50","schema_version":"1.0","event_id":"sha256:b23bb51d34ce49a39e5804ef7e7a7c790afcc8fabab9f3c2b37c953b853b2f50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IOO22SVXJMLSU4GYXDCO3CAQAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance Weighted Supervised Learning for Offline Interaction Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dorsa Sadigh, Jensen Gao, Joey Hejna","submitted_at":"2023-04-26T18:35:49Z","abstract_excerpt":"Sequential decision making algorithms often struggle to leverage different sources of unstructured offline interaction data. Imitation learning (IL) methods based on supervised learning are robust, but require optimal demonstrations, which are hard to collect. Offline goal-conditioned reinforcement learning (RL) algorithms promise to learn from sub-optimal data, but face optimization challenges especially with high-dimensional data. To bridge the gap between IL and RL, we introduce Distance Weighted Supervised Learning or DWSL, a supervised method for learning goal-conditioned policies from of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.13774","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/2304.13774/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-05T06:04:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owyks5nlBVE5sA09JhwKjjVqdFbEEvkpZCeMzMQ22vWstGSR9DTXrFbUwq9UQCqNvUcmxTxqHxUGL635r2QdCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:04:10.541429Z"},"content_sha256":"111cbf23aaec2b77a29caef9bbf19b99e277c6497d50bd37762e7935a28b1889","schema_version":"1.0","event_id":"sha256:111cbf23aaec2b77a29caef9bbf19b99e277c6497d50bd37762e7935a28b1889"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOO22SVXJMLSU4GYXDCO3CAQAI/bundle.json","state_url":"https://pith.science/pith/IOO22SVXJMLSU4GYXDCO3CAQAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOO22SVXJMLSU4GYXDCO3CAQAI/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-08T19:04:10Z","links":{"resolver":"https://pith.science/pith/IOO22SVXJMLSU4GYXDCO3CAQAI","bundle":"https://pith.science/pith/IOO22SVXJMLSU4GYXDCO3CAQAI/bundle.json","state":"https://pith.science/pith/IOO22SVXJMLSU4GYXDCO3CAQAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOO22SVXJMLSU4GYXDCO3CAQAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IOO22SVXJMLSU4GYXDCO3CAQAI","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":"e087eccfabac576d7c16fac47689d0318585c7885a9dcd4efff97bca40a76484","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-04-26T18:35:49Z","title_canon_sha256":"11c65f4751c1de75c0825636a326558d3fe45167371e1f6bfc95bacd8369e154"},"schema_version":"1.0","source":{"id":"2304.13774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.13774","created_at":"2026-07-05T06:04:57Z"},{"alias_kind":"arxiv_version","alias_value":"2304.13774v1","created_at":"2026-07-05T06:04:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.13774","created_at":"2026-07-05T06:04:57Z"},{"alias_kind":"pith_short_12","alias_value":"IOO22SVXJMLS","created_at":"2026-07-05T06:04:57Z"},{"alias_kind":"pith_short_16","alias_value":"IOO22SVXJMLSU4GY","created_at":"2026-07-05T06:04:57Z"},{"alias_kind":"pith_short_8","alias_value":"IOO22SVX","created_at":"2026-07-05T06:04:57Z"}],"graph_snapshots":[{"event_id":"sha256:111cbf23aaec2b77a29caef9bbf19b99e277c6497d50bd37762e7935a28b1889","target":"graph","created_at":"2026-07-05T06:04:57Z","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/2304.13774/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sequential decision making algorithms often struggle to leverage different sources of unstructured offline interaction data. Imitation learning (IL) methods based on supervised learning are robust, but require optimal demonstrations, which are hard to collect. Offline goal-conditioned reinforcement learning (RL) algorithms promise to learn from sub-optimal data, but face optimization challenges especially with high-dimensional data. To bridge the gap between IL and RL, we introduce Distance Weighted Supervised Learning or DWSL, a supervised method for learning goal-conditioned policies from of","authors_text":"Dorsa Sadigh, Jensen Gao, Joey Hejna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-04-26T18:35:49Z","title":"Distance Weighted Supervised Learning for Offline Interaction Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.13774","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:b23bb51d34ce49a39e5804ef7e7a7c790afcc8fabab9f3c2b37c953b853b2f50","target":"record","created_at":"2026-07-05T06:04:57Z","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":"e087eccfabac576d7c16fac47689d0318585c7885a9dcd4efff97bca40a76484","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-04-26T18:35:49Z","title_canon_sha256":"11c65f4751c1de75c0825636a326558d3fe45167371e1f6bfc95bacd8369e154"},"schema_version":"1.0","source":{"id":"2304.13774","kind":"arxiv","version":1}},"canonical_sha256":"439dad4ab74b172a70d8b8c4ed8810023c68cc0c8a2be69242543ef5a3efbc9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"439dad4ab74b172a70d8b8c4ed8810023c68cc0c8a2be69242543ef5a3efbc9d","first_computed_at":"2026-07-05T06:04:57.091907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:04:57.091907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d4CtQMON708F6InayIaJ+uPrSqZCGKBMwKS+G8JR6NYb7IH1hoTM3b/L25emESiz1JhmRWTspFxpkj+AK3F4AA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:04:57.092353Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.13774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b23bb51d34ce49a39e5804ef7e7a7c790afcc8fabab9f3c2b37c953b853b2f50","sha256:111cbf23aaec2b77a29caef9bbf19b99e277c6497d50bd37762e7935a28b1889"],"state_sha256":"a09de7df726c28eaf458ed9b381a82e2683f478f4f3211e7e3a0ff1874166df4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4TF2zOkQmoW965PnjcLPuv0y9mNqYENsCEgZhu1yM3rjSQkouL5o/0bsZ/N9uWNChThPbJ/yy+TBpba4PSqyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:04:10.545093Z","bundle_sha256":"2c575af484716eefd209a4039752b064cf0740c86b4ad6b1bcaa9d168c4f706c"}}