{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7PFSY7BACAQBGO2XYCEXPI5XBV","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":"b34725124ea9eb3f03a4e0656afbb4469ad79ba6344c2cef591e9fcc1909e0c5","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T14:33:34Z","title_canon_sha256":"51c09b3f440dc5b2f773b13f533f33af1896f6aa502fbce271410e6b3e50dcec"},"schema_version":"1.0","source":{"id":"2605.17017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17017","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17017v1","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17017","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"7PFSY7BACAQB","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_16","alias_value":"7PFSY7BACAQBGO2X","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_8","alias_value":"7PFSY7BA","created_at":"2026-05-20T00:03:36Z"}],"graph_snapshots":[{"event_id":"sha256:81c80f73f14deda9321454d1ab399d269a34a4223d4e06c042c0621ae231984c","target":"graph","created_at":"2026-05-20T00:03:36Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"To the best of our knowledge, this is the first BFM-based framework that achieves robustness to dynamics shifts while relying solely on offline data from a single nominal environment."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The minimax optimization over dynamics perturbations can be solved tractably from offline nominal data alone and produces policies that generalize to actual (not just modeled) dynamics shifts."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Robust minimax task inference in BFMs achieves dynamics-shift robustness from nominal offline data alone and outperforms standard baselines."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Reformulating BFM task inference as a minimax problem over dynamics perturbations yields robust policies from single-environment offline data alone."}],"snapshot_sha256":"ba56163def9e78615d3ed0bb0a04cfeef81cf74c3cf7576421e95ab7c244190c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.019876Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:40:42.699731Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T19:49:48.650652Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T18:51:58.944220Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.186275Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:24.869901Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17017/integrity.json","findings":[],"snapshot_sha256":"d8b42bdefe477aeb9f3c18fc52895bd94356353837d925d4dec3ed0578b59b04","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Behavior Foundation Models (BFMs) enable scalable imitation learning (IL) by pretraining task-agnostic representations that can be rapidly adapted to new tasks. However, existing BFMs assume fixed environment dynamics, limiting their robustness under real-world shifts such as changes in friction, actuation, or sensor noise. We address this by formulating BFM task-inference as a robust minimax optimization problem, enabling adaptation to worst-case dynamics perturbations without modifying pretraining. To the best of our knowledge, this is the first BFM-based framework that achieves robustness t","authors_text":"Ashutosh Nayyar, Rahul Jain, Rishabh Agrawal","cross_cats":["cs.AI"],"headline":"Reformulating BFM task inference as a minimax problem over dynamics perturbations yields robust policies from single-environment offline data alone.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T14:33:34Z","title":"When Dynamics Shift, Robust Task Inference Wins: Offline Imitation Learning with Behavior Foundation Models Revisited"},"references":{"count":68,"internal_anchors":6,"resolved_work":68,"sample":[{"cited_arxiv_id":"2303.08774","doi":"","is_internal_anchor":true,"ref_index":1,"title":"GPT-4 Technical Report","work_id":"b928e041-6991-4c08-8c81-0359e4097c7b","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Policy optimization for strictly batch imitation learning","work_id":"6fa0b10c-a2b1-4424-b7fa-c1a60e8ea7e6","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Balance equation-based distributionally robust offline imitation learning.arXiv preprint arXiv:2511.07942, 2025","work_id":"8eecf44f-11c4-420f-a82e-26497c89989d","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Markov balance satisfac- tion improves performance in strictly batch offline imitation learning","work_id":"17015320-fc1b-450b-a03e-cd47cdfa93dd","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Conditional kernel imi- tation learning for continuous state environments","work_id":"1fd3a3df-eca8-4ac0-bb01-37dc1c7fc700","year":2025}],"snapshot_sha256":"88b30ea67bff5af6a851c343c941134216b4888e0ab82a66f520792f667fe063"},"source":{"id":"2605.17017","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:34:04.533249Z","id":"494bc298-6e33-492d-968e-7812db429314","model_set":{"reader":"grok-4.3"},"one_line_summary":"Robust minimax task inference in BFMs achieves dynamics-shift robustness from nominal offline data alone and outperforms standard baselines.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Reformulating BFM task inference as a minimax problem over dynamics perturbations yields robust policies from single-environment offline data alone.","strongest_claim":"To the best of our knowledge, this is the first BFM-based framework that achieves robustness to dynamics shifts while relying solely on offline data from a single nominal environment.","weakest_assumption":"The minimax optimization over dynamics perturbations can be solved tractably from offline nominal data alone and produces policies that generalize to actual (not just modeled) dynamics shifts."}},"verdict_id":"494bc298-6e33-492d-968e-7812db429314"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ad0e28b4b34e70c4d91dbfec483c8bb793ab59c3bfe1b356665fc20ffb7e4c99","target":"record","created_at":"2026-05-20T00:03:36Z","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":"b34725124ea9eb3f03a4e0656afbb4469ad79ba6344c2cef591e9fcc1909e0c5","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T14:33:34Z","title_canon_sha256":"51c09b3f440dc5b2f773b13f533f33af1896f6aa502fbce271410e6b3e50dcec"},"schema_version":"1.0","source":{"id":"2605.17017","kind":"arxiv","version":1}},"canonical_sha256":"fbcb2c7c201020133b57c08977a3b70d7097c9773427b1da4bdbbe65063c4861","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbcb2c7c201020133b57c08977a3b70d7097c9773427b1da4bdbbe65063c4861","first_computed_at":"2026-05-20T00:03:36.199052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:36.199052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kiq09Jer6dBztIVIxOVGCXFPWh9aQTPwnKbmCu9PlC1/8UN4DtGqiV35Bgc3560j2pTDeVFYhfig4qEnzm5GDg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:36.199949Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad0e28b4b34e70c4d91dbfec483c8bb793ab59c3bfe1b356665fc20ffb7e4c99","sha256:81c80f73f14deda9321454d1ab399d269a34a4223d4e06c042c0621ae231984c"],"state_sha256":"1d007bfb2acf94eca6765150e768b3d3e04b4fe00102d1b5ef8d8cff6e162eea"}