{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:J7VTRF22R37Z7BDECH37PNVSPY","short_pith_number":"pith:J7VTRF22","canonical_record":{"source":{"id":"2605.07560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-08T10:34:11Z","cross_cats_sorted":[],"title_canon_sha256":"6a8ce84b86362d791902dcdc5c0c64803da0c3d18357d657427dcaf5c73eb71c","abstract_canon_sha256":"cb6ebc42dd0c48c9aec5091113e9fbfca0f1c62d25fbd9ca9049f5864446a889"},"schema_version":"1.0"},"canonical_sha256":"4feb38975a8eff9f846411f7f7b6b27e02a57482d66c2cb8bc1c58b609705c6a","source":{"kind":"arxiv","id":"2605.07560","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.07560","created_at":"2026-05-21T02:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"2605.07560v2","created_at":"2026-05-21T02:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.07560","created_at":"2026-05-21T02:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"J7VTRF22R37Z","created_at":"2026-05-21T02:05:04Z"},{"alias_kind":"pith_short_16","alias_value":"J7VTRF22R37Z7BDE","created_at":"2026-05-21T02:05:04Z"},{"alias_kind":"pith_short_8","alias_value":"J7VTRF22","created_at":"2026-05-21T02:05:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:J7VTRF22R37Z7BDECH37PNVSPY","target":"record","payload":{"canonical_record":{"source":{"id":"2605.07560","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-08T10:34:11Z","cross_cats_sorted":[],"title_canon_sha256":"6a8ce84b86362d791902dcdc5c0c64803da0c3d18357d657427dcaf5c73eb71c","abstract_canon_sha256":"cb6ebc42dd0c48c9aec5091113e9fbfca0f1c62d25fbd9ca9049f5864446a889"},"schema_version":"1.0"},"canonical_sha256":"4feb38975a8eff9f846411f7f7b6b27e02a57482d66c2cb8bc1c58b609705c6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T02:05:04.543384Z","signature_b64":"1bS5CUWXYtuRfH40yoVEJVDajUWh6NOM9SAuOcVOhzK24a5OIAKdZRWJxRNvuMXiPxMtZGRZxcpc3iPd9YaTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4feb38975a8eff9f846411f7f7b6b27e02a57482d66c2cb8bc1c58b609705c6a","last_reissued_at":"2026-05-21T02:05:04.542495Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T02:05:04.542495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.07560","source_version":2,"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-21T02:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/fBpxOWAuauzRmr80PUyBuYBu2ttSRMsdtvHYvq74wSZeOLT7jWH7FzATrfEaik0ueMAjxyb6BUSU2SVWwvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:04:24.946234Z"},"content_sha256":"5eb1e863a357d01e70b9770f01590cb3bb7deb82f3f729a97368418a54583892","schema_version":"1.0","event_id":"sha256:5eb1e863a357d01e70b9770f01590cb3bb7deb82f3f729a97368418a54583892"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:J7VTRF22R37Z7BDECH37PNVSPY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Utilize Failure Demo Data?: Effective Data Selection for Imitation Learning Using Distribution Differences in Attention Mechanism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Failure demonstrations can improve imitation learning policies when selected by measuring attention discrepancies between successes and failures.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Kana Miyamoto, Kanata Suzuki, Tetsuya Ogata","submitted_at":"2026-05-08T10:34:11Z","abstract_excerpt":"Imitation learning for robotic tasks has relied primarily on policies trained only on successful demonstrations, although failures are unavoidable during human data collection. Many existing approaches for exploiting failure data require additional data processing or iterative policy updates through autonomous rollouts, making it difficult to directly and stably utilize failure data accumulated during data collection. In this work, we propose a method that learns latent representations of success-failure discrepancies and incorporates them into the attention mechanism. During inference, an app"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Simulation results show that the proposed method improves task success rates when trained with failure data and that the proposed metric identifies failure samples that are beneficial for learning when combined with successful demonstrations.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the post-training attention discrepancy metric reliably identifies failure samples that improve rather than degrade policy performance, without introducing selection bias or requiring task-specific tuning.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The method uses attention discrepancy metrics on latent success-failure representations to select beneficial failure data for imitation learning, raising task success rates in simulations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Failure demonstrations can improve imitation learning policies when selected by measuring attention discrepancies between successes and failures.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7a16c2711b822002545b1bff5e525e96eababbb0a3ddcc71e301ec4c92198559"},"source":{"id":"2605.07560","kind":"arxiv","version":2},"verdict":{"id":"f2ea6984-96b0-40e2-9d6e-e9a2c314ed1b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-11T02:05:41.809372Z","strongest_claim":"Simulation results show that the proposed method improves task success rates when trained with failure data and that the proposed metric identifies failure samples that are beneficial for learning when combined with successful demonstrations.","one_line_summary":"The method uses attention discrepancy metrics on latent success-failure representations to select beneficial failure data for imitation learning, raising task success rates in simulations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the post-training attention discrepancy metric reliably identifies failure samples that improve rather than degrade policy performance, without introducing selection bias or requiring task-specific tuning.","pith_extraction_headline":"Failure demonstrations can improve imitation learning policies when selected by measuring attention discrepancies between successes and failures."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.07560/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T10:42:02.849982Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T05:39:56.508846Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.566672Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T11:41:48.732755Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"45a294f9a69f55a7791456201960799407c39b2ba0f110aa6e83ddec5a1ca387"},"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":"f2ea6984-96b0-40e2-9d6e-e9a2c314ed1b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T02:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aixu1Ye5w+94GvXMo80BA6IxkjqY7uDUm5Fo+++qaDgCLag6MDakVMFS45Grgs9D9z0wtuPvt+09n/6IuetYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:04:24.946829Z"},"content_sha256":"54f906cd48cb8615ce9b4423036a415eafb9643d771931439741786cbe48f6f8","schema_version":"1.0","event_id":"sha256:54f906cd48cb8615ce9b4423036a415eafb9643d771931439741786cbe48f6f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7VTRF22R37Z7BDECH37PNVSPY/bundle.json","state_url":"https://pith.science/pith/J7VTRF22R37Z7BDECH37PNVSPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7VTRF22R37Z7BDECH37PNVSPY/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-06-06T13:04:24Z","links":{"resolver":"https://pith.science/pith/J7VTRF22R37Z7BDECH37PNVSPY","bundle":"https://pith.science/pith/J7VTRF22R37Z7BDECH37PNVSPY/bundle.json","state":"https://pith.science/pith/J7VTRF22R37Z7BDECH37PNVSPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7VTRF22R37Z7BDECH37PNVSPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:J7VTRF22R37Z7BDECH37PNVSPY","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":"cb6ebc42dd0c48c9aec5091113e9fbfca0f1c62d25fbd9ca9049f5864446a889","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-08T10:34:11Z","title_canon_sha256":"6a8ce84b86362d791902dcdc5c0c64803da0c3d18357d657427dcaf5c73eb71c"},"schema_version":"1.0","source":{"id":"2605.07560","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.07560","created_at":"2026-05-21T02:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"2605.07560v2","created_at":"2026-05-21T02:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.07560","created_at":"2026-05-21T02:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"J7VTRF22R37Z","created_at":"2026-05-21T02:05:04Z"},{"alias_kind":"pith_short_16","alias_value":"J7VTRF22R37Z7BDE","created_at":"2026-05-21T02:05:04Z"},{"alias_kind":"pith_short_8","alias_value":"J7VTRF22","created_at":"2026-05-21T02:05:04Z"}],"graph_snapshots":[{"event_id":"sha256:54f906cd48cb8615ce9b4423036a415eafb9643d771931439741786cbe48f6f8","target":"graph","created_at":"2026-05-21T02:05:04Z","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":"Simulation results show that the proposed method improves task success rates when trained with failure data and that the proposed metric identifies failure samples that are beneficial for learning when combined with successful demonstrations."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the post-training attention discrepancy metric reliably identifies failure samples that improve rather than degrade policy performance, without introducing selection bias or requiring task-specific tuning."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The method uses attention discrepancy metrics on latent success-failure representations to select beneficial failure data for imitation learning, raising task success rates in simulations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Failure demonstrations can improve imitation learning policies when selected by measuring attention discrepancies between successes and failures."}],"snapshot_sha256":"7a16c2711b822002545b1bff5e525e96eababbb0a3ddcc71e301ec4c92198559"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-20T10:42:02.849982Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T05:39:56.508846Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.566672Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T11:41:48.732755Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.07560/integrity.json","findings":[],"snapshot_sha256":"45a294f9a69f55a7791456201960799407c39b2ba0f110aa6e83ddec5a1ca387","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Imitation learning for robotic tasks has relied primarily on policies trained only on successful demonstrations, although failures are unavoidable during human data collection. Many existing approaches for exploiting failure data require additional data processing or iterative policy updates through autonomous rollouts, making it difficult to directly and stably utilize failure data accumulated during data collection. In this work, we propose a method that learns latent representations of success-failure discrepancies and incorporates them into the attention mechanism. During inference, an app","authors_text":"Kana Miyamoto, Kanata Suzuki, Tetsuya Ogata","cross_cats":[],"headline":"Failure demonstrations can improve imitation learning policies when selected by measuring attention discrepancies between successes and failures.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-08T10:34:11Z","title":"How to Utilize Failure Demo Data?: Effective Data Selection for Imitation Learning Using Distribution Differences in Attention Mechanism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.07560","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-11T02:05:41.809372Z","id":"f2ea6984-96b0-40e2-9d6e-e9a2c314ed1b","model_set":{"reader":"grok-4.3"},"one_line_summary":"The method uses attention discrepancy metrics on latent success-failure representations to select beneficial failure data for imitation learning, raising task success rates in simulations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Failure demonstrations can improve imitation learning policies when selected by measuring attention discrepancies between successes and failures.","strongest_claim":"Simulation results show that the proposed method improves task success rates when trained with failure data and that the proposed metric identifies failure samples that are beneficial for learning when combined with successful demonstrations.","weakest_assumption":"That the post-training attention discrepancy metric reliably identifies failure samples that improve rather than degrade policy performance, without introducing selection bias or requiring task-specific tuning."}},"verdict_id":"f2ea6984-96b0-40e2-9d6e-e9a2c314ed1b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5eb1e863a357d01e70b9770f01590cb3bb7deb82f3f729a97368418a54583892","target":"record","created_at":"2026-05-21T02:05:04Z","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":"cb6ebc42dd0c48c9aec5091113e9fbfca0f1c62d25fbd9ca9049f5864446a889","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-08T10:34:11Z","title_canon_sha256":"6a8ce84b86362d791902dcdc5c0c64803da0c3d18357d657427dcaf5c73eb71c"},"schema_version":"1.0","source":{"id":"2605.07560","kind":"arxiv","version":2}},"canonical_sha256":"4feb38975a8eff9f846411f7f7b6b27e02a57482d66c2cb8bc1c58b609705c6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4feb38975a8eff9f846411f7f7b6b27e02a57482d66c2cb8bc1c58b609705c6a","first_computed_at":"2026-05-21T02:05:04.542495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T02:05:04.542495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1bS5CUWXYtuRfH40yoVEJVDajUWh6NOM9SAuOcVOhzK24a5OIAKdZRWJxRNvuMXiPxMtZGRZxcpc3iPd9YaTBw==","signature_status":"signed_v1","signed_at":"2026-05-21T02:05:04.543384Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.07560","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5eb1e863a357d01e70b9770f01590cb3bb7deb82f3f729a97368418a54583892","sha256:54f906cd48cb8615ce9b4423036a415eafb9643d771931439741786cbe48f6f8"],"state_sha256":"b89d73632136a3cff4d7de3aaf8327d1335245a0d7f5f04a87677f7dd069e366"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2ffHubqMscDHpFdSufwM4DxGKYIusVhmJOGpWJDfGNHGbkX7QrQLNs4CQiLC/yd+PcK5MboneaAguIdLD3+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:04:24.950343Z","bundle_sha256":"f35f26fe99d13aec14a301806b3543977e16f1ec29298090a040f3bb54d10214"}}