{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UE5MJU3OW2V5EUFATBGMQWF6Q4","short_pith_number":"pith:UE5MJU3O","canonical_record":{"source":{"id":"1809.09433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-25T12:41:20Z","cross_cats_sorted":[],"title_canon_sha256":"bd8e57956d9384bd8d0f699498c1b143cfc115f8959442c971540db2cfb04e47","abstract_canon_sha256":"e4246880c2b01c5afde4b5ab80ab56ff805a5317c8b795bb30d12e4c33df07d2"},"schema_version":"1.0"},"canonical_sha256":"a13ac4d36eb6abd250a0984cc858be870eae88f1ce3c28defbd6ad12c53db91e","source":{"kind":"arxiv","id":"1809.09433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09433","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09433v1","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09433","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"UE5MJU3OW2V5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UE5MJU3OW2V5EUFA","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UE5MJU3O","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UE5MJU3OW2V5EUFATBGMQWF6Q4","target":"record","payload":{"canonical_record":{"source":{"id":"1809.09433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-25T12:41:20Z","cross_cats_sorted":[],"title_canon_sha256":"bd8e57956d9384bd8d0f699498c1b143cfc115f8959442c971540db2cfb04e47","abstract_canon_sha256":"e4246880c2b01c5afde4b5ab80ab56ff805a5317c8b795bb30d12e4c33df07d2"},"schema_version":"1.0"},"canonical_sha256":"a13ac4d36eb6abd250a0984cc858be870eae88f1ce3c28defbd6ad12c53db91e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:53.366625Z","signature_b64":"lhDAb7No9Dts/45/70nlGGjn6qeMGM/uxdy2GsWnQmUBIlwe0A60i4cRIZ/dbBFjRkJ9jgCcJmKAysaxh3ZfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a13ac4d36eb6abd250a0984cc858be870eae88f1ce3c28defbd6ad12c53db91e","last_reissued_at":"2026-05-18T00:04:53.366109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:53.366109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.09433","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-18T00:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"baWk5VY/ejmqG7B3pr6KvgUAz7YP1tQhsCQU1WhsDQxF6Q+06YLO0CK2q+asxAPuz45j9uZWIe8K5qAwQyc5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:43:38.250620Z"},"content_sha256":"24c69826af78d289ab5dd9fb10c6d8b9a00c09bb0d8f00a754bf99f4d1c4c85d","schema_version":"1.0","event_id":"sha256:24c69826af78d289ab5dd9fb10c6d8b9a00c09bb0d8f00a754bf99f4d1c4c85d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UE5MJU3OW2V5EUFATBGMQWF6Q4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Adversarial Learning for Optimal Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christian Rupprecht, Christoph Hennersperger, Nassir Navab, Salvatore Virga","submitted_at":"2018-09-25T12:41:20Z","abstract_excerpt":"Path planning plays an essential role in many areas of robotics. Various planning techniques have been presented, either focusing on learning a specific task from demonstrations or retrieving trajectories by optimizing for hand-crafted cost functions which are well defined a priori. In this work, we present an incremental adversarial learning-based framework that allows inferring implicit behaviour, i.e. the natural characteristic of a set of given trajectories. To achieve adversarial learning, a zero-sum game is constructed between a planning algorithm and an adversary - the discriminator. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09433","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-18T00:04:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kdqcWcaQzmtYZDR6ehyJlTHJDznz47mg8b0Ewb4AeCtqu7Q2xLVTr7GV9EDF1/FJB+fSWull25dsfLyBBuvGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T22:43:38.251208Z"},"content_sha256":"9b9dde7fb9493a1500eaa78fef7199ad55b2580865ef6ebd91a8d97456596a5e","schema_version":"1.0","event_id":"sha256:9b9dde7fb9493a1500eaa78fef7199ad55b2580865ef6ebd91a8d97456596a5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/bundle.json","state_url":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/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-07-01T22:43:38Z","links":{"resolver":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4","bundle":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/bundle.json","state":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UE5MJU3OW2V5EUFATBGMQWF6Q4","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":"e4246880c2b01c5afde4b5ab80ab56ff805a5317c8b795bb30d12e4c33df07d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-25T12:41:20Z","title_canon_sha256":"bd8e57956d9384bd8d0f699498c1b143cfc115f8959442c971540db2cfb04e47"},"schema_version":"1.0","source":{"id":"1809.09433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09433","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09433v1","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09433","created_at":"2026-05-18T00:04:53Z"},{"alias_kind":"pith_short_12","alias_value":"UE5MJU3OW2V5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UE5MJU3OW2V5EUFA","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UE5MJU3O","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:9b9dde7fb9493a1500eaa78fef7199ad55b2580865ef6ebd91a8d97456596a5e","target":"graph","created_at":"2026-05-18T00:04:53Z","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":"Path planning plays an essential role in many areas of robotics. Various planning techniques have been presented, either focusing on learning a specific task from demonstrations or retrieving trajectories by optimizing for hand-crafted cost functions which are well defined a priori. In this work, we present an incremental adversarial learning-based framework that allows inferring implicit behaviour, i.e. the natural characteristic of a set of given trajectories. To achieve adversarial learning, a zero-sum game is constructed between a planning algorithm and an adversary - the discriminator. We","authors_text":"Christian Rupprecht, Christoph Hennersperger, Nassir Navab, Salvatore Virga","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-25T12:41:20Z","title":"Incremental Adversarial Learning for Optimal Path Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09433","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:24c69826af78d289ab5dd9fb10c6d8b9a00c09bb0d8f00a754bf99f4d1c4c85d","target":"record","created_at":"2026-05-18T00:04:53Z","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":"e4246880c2b01c5afde4b5ab80ab56ff805a5317c8b795bb30d12e4c33df07d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-25T12:41:20Z","title_canon_sha256":"bd8e57956d9384bd8d0f699498c1b143cfc115f8959442c971540db2cfb04e47"},"schema_version":"1.0","source":{"id":"1809.09433","kind":"arxiv","version":1}},"canonical_sha256":"a13ac4d36eb6abd250a0984cc858be870eae88f1ce3c28defbd6ad12c53db91e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a13ac4d36eb6abd250a0984cc858be870eae88f1ce3c28defbd6ad12c53db91e","first_computed_at":"2026-05-18T00:04:53.366109Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:53.366109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lhDAb7No9Dts/45/70nlGGjn6qeMGM/uxdy2GsWnQmUBIlwe0A60i4cRIZ/dbBFjRkJ9jgCcJmKAysaxh3ZfBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:53.366625Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24c69826af78d289ab5dd9fb10c6d8b9a00c09bb0d8f00a754bf99f4d1c4c85d","sha256:9b9dde7fb9493a1500eaa78fef7199ad55b2580865ef6ebd91a8d97456596a5e"],"state_sha256":"7bf2ae96177c44962139423aba1daeb87086cf7ce1d7076faf8ce8851c7ac9a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXOuy8uPWfp5ebLl7l7MFdaeRop5sbPQ4/uBw9xgYMTrNzjEheSfntcenXkE2UpVdErMCATgcXQLGgZy6wVICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T22:43:38.254238Z","bundle_sha256":"d2939a112a9dd2e4b4511188365e962c7874b4a32840b2d9d8702880b17c025c"}}