{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JKKTKCZEZMKKGB4FPHRRCBC5US","short_pith_number":"pith:JKKTKCZE","canonical_record":{"source":{"id":"1905.11602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T04:18:05Z","cross_cats_sorted":["cs.AI","cs.RO","stat.ML"],"title_canon_sha256":"d8f8b73e1a3fb2bd01f765c7ca6328bf81ac28de3769d4b7d03f816375a5af58","abstract_canon_sha256":"fbcbd33e999108fa5364ca3782244fccb923b74978c385dc7ad84fa21f610d46"},"schema_version":"1.0"},"canonical_sha256":"4a95350b24cb14a3078579e311045da4b8c8633d5dfec40979e670848e16542a","source":{"kind":"arxiv","id":"1905.11602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11602","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11602v1","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11602","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"JKKTKCZEZMKK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JKKTKCZEZMKKGB4F","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JKKTKCZE","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JKKTKCZEZMKKGB4FPHRRCBC5US","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T04:18:05Z","cross_cats_sorted":["cs.AI","cs.RO","stat.ML"],"title_canon_sha256":"d8f8b73e1a3fb2bd01f765c7ca6328bf81ac28de3769d4b7d03f816375a5af58","abstract_canon_sha256":"fbcbd33e999108fa5364ca3782244fccb923b74978c385dc7ad84fa21f610d46"},"schema_version":"1.0"},"canonical_sha256":"4a95350b24cb14a3078579e311045da4b8c8633d5dfec40979e670848e16542a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:18.434074Z","signature_b64":"CwgT2lZT3z2ii9m5AfMOdtAYzK1Q98lxF+tu47eKTjrf/pM/nghDJuFXnnqGTucYuIITyOQnwhYT2OuoKYViAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a95350b24cb14a3078579e311045da4b8c8633d5dfec40979e670848e16542a","last_reissued_at":"2026-05-17T23:44:18.433437Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:18.433437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11602","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-05-17T23:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbNMKnWNKCznxOKluzBJbLtqPtlM5n6u5loRV6IK/ETnetU/Z4yWwtZPmsD/7UjSrxVu+7LNm0ddZPrSQqrWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:36:45.920414Z"},"content_sha256":"03ddce22f9f9cf9d246f71aa4722f5557d33e4974c9972be995154b97d9c78b6","schema_version":"1.0","event_id":"sha256:03ddce22f9f9cf9d246f71aa4722f5557d33e4974c9972be995154b97d9c78b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JKKTKCZEZMKKGB4FPHRRCBC5US","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentiable Algorithm Networks for Composable Robot Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Hsu, Leslie Pack Kaelbling, Peter Karkus, Tomas Lozano-Perez, Wee Sun Lee, Xiao Ma","submitted_at":"2019-05-28T04:18:05Z","abstract_excerpt":"This paper introduces the Differentiable Algorithm Network (DAN), a composable architecture for robot learning systems. A DAN is composed of neural network modules, each encoding a differentiable robot algorithm and an associated model; and it is trained end-to-end from data. DAN combines the strengths of model-driven modular system design and data-driven end-to-end learning. The algorithms and models act as structural assumptions to reduce the data requirements for learning; end-to-end learning allows the modules to adapt to one another and compensate for imperfect models and algorithms, in o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11602","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":""},"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-05-17T23:44:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/KAQdG6owXDIDq94HfYqpRUJ3I7ldJh5pGgXmXCiZP7T7oaLtPFwXPIM/D9G1Jm062QhJiU2U+otssqi+x4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:36:45.920768Z"},"content_sha256":"c62eebc0b46e10a1ce00e6212ddbe203a6c80b9489fbdf3eb4c3d9a6651e4db8","schema_version":"1.0","event_id":"sha256:c62eebc0b46e10a1ce00e6212ddbe203a6c80b9489fbdf3eb4c3d9a6651e4db8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKKTKCZEZMKKGB4FPHRRCBC5US/bundle.json","state_url":"https://pith.science/pith/JKKTKCZEZMKKGB4FPHRRCBC5US/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKKTKCZEZMKKGB4FPHRRCBC5US/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-05-28T07:36:45Z","links":{"resolver":"https://pith.science/pith/JKKTKCZEZMKKGB4FPHRRCBC5US","bundle":"https://pith.science/pith/JKKTKCZEZMKKGB4FPHRRCBC5US/bundle.json","state":"https://pith.science/pith/JKKTKCZEZMKKGB4FPHRRCBC5US/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKKTKCZEZMKKGB4FPHRRCBC5US/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JKKTKCZEZMKKGB4FPHRRCBC5US","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":"fbcbd33e999108fa5364ca3782244fccb923b74978c385dc7ad84fa21f610d46","cross_cats_sorted":["cs.AI","cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T04:18:05Z","title_canon_sha256":"d8f8b73e1a3fb2bd01f765c7ca6328bf81ac28de3769d4b7d03f816375a5af58"},"schema_version":"1.0","source":{"id":"1905.11602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11602","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11602v1","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11602","created_at":"2026-05-17T23:44:18Z"},{"alias_kind":"pith_short_12","alias_value":"JKKTKCZEZMKK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JKKTKCZEZMKKGB4F","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JKKTKCZE","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:c62eebc0b46e10a1ce00e6212ddbe203a6c80b9489fbdf3eb4c3d9a6651e4db8","target":"graph","created_at":"2026-05-17T23:44:18Z","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"},"paper":{"abstract_excerpt":"This paper introduces the Differentiable Algorithm Network (DAN), a composable architecture for robot learning systems. A DAN is composed of neural network modules, each encoding a differentiable robot algorithm and an associated model; and it is trained end-to-end from data. DAN combines the strengths of model-driven modular system design and data-driven end-to-end learning. The algorithms and models act as structural assumptions to reduce the data requirements for learning; end-to-end learning allows the modules to adapt to one another and compensate for imperfect models and algorithms, in o","authors_text":"David Hsu, Leslie Pack Kaelbling, Peter Karkus, Tomas Lozano-Perez, Wee Sun Lee, Xiao Ma","cross_cats":["cs.AI","cs.RO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T04:18:05Z","title":"Differentiable Algorithm Networks for Composable Robot Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11602","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:03ddce22f9f9cf9d246f71aa4722f5557d33e4974c9972be995154b97d9c78b6","target":"record","created_at":"2026-05-17T23:44:18Z","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":"fbcbd33e999108fa5364ca3782244fccb923b74978c385dc7ad84fa21f610d46","cross_cats_sorted":["cs.AI","cs.RO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-28T04:18:05Z","title_canon_sha256":"d8f8b73e1a3fb2bd01f765c7ca6328bf81ac28de3769d4b7d03f816375a5af58"},"schema_version":"1.0","source":{"id":"1905.11602","kind":"arxiv","version":1}},"canonical_sha256":"4a95350b24cb14a3078579e311045da4b8c8633d5dfec40979e670848e16542a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a95350b24cb14a3078579e311045da4b8c8633d5dfec40979e670848e16542a","first_computed_at":"2026-05-17T23:44:18.433437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:18.433437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CwgT2lZT3z2ii9m5AfMOdtAYzK1Q98lxF+tu47eKTjrf/pM/nghDJuFXnnqGTucYuIITyOQnwhYT2OuoKYViAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:18.434074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03ddce22f9f9cf9d246f71aa4722f5557d33e4974c9972be995154b97d9c78b6","sha256:c62eebc0b46e10a1ce00e6212ddbe203a6c80b9489fbdf3eb4c3d9a6651e4db8"],"state_sha256":"c3d975c5a5590e15b47a9d529ac9a3612e6a15f93953d8e181d3ae216b32786c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KrlzppurkRk9s2BzAKEHXNAPm6buAh/w2cNs7X8VLF6U4oRLzlcok7Vn0azApc6YV8O8azjAzqxIxwsjgF/YBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:36:45.922875Z","bundle_sha256":"2f97e113855aae0efb99cfb6060b8c8b5e8e941973bdda6e3463e23796525939"}}