{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UE5MJU3OW2V5EUFATBGMQWF6Q4","short_pith_number":"pith:UE5MJU3O","schema_version":"1.0","canonical_sha256":"a13ac4d36eb6abd250a0984cc858be870eae88f1ce3c28defbd6ad12c53db91e","source":{"kind":"arxiv","id":"1809.09433","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1809.09433","created_at":"2026-05-18T00:04:53.366192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09433v1","created_at":"2026-05-18T00:04:53.366192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09433","created_at":"2026-05-18T00:04:53.366192+00:00"},{"alias_kind":"pith_short_12","alias_value":"UE5MJU3OW2V5","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UE5MJU3OW2V5EUFA","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UE5MJU3O","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4","json":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4.json","graph_json":"https://pith.science/api/pith-number/UE5MJU3OW2V5EUFATBGMQWF6Q4/graph.json","events_json":"https://pith.science/api/pith-number/UE5MJU3OW2V5EUFATBGMQWF6Q4/events.json","paper":"https://pith.science/paper/UE5MJU3O"},"agent_actions":{"view_html":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4","download_json":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4.json","view_paper":"https://pith.science/paper/UE5MJU3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09433&json=true","fetch_graph":"https://pith.science/api/pith-number/UE5MJU3OW2V5EUFATBGMQWF6Q4/graph.json","fetch_events":"https://pith.science/api/pith-number/UE5MJU3OW2V5EUFATBGMQWF6Q4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/action/storage_attestation","attest_author":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/action/author_attestation","sign_citation":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/action/citation_signature","submit_replication":"https://pith.science/pith/UE5MJU3OW2V5EUFATBGMQWF6Q4/action/replication_record"}},"created_at":"2026-05-18T00:04:53.366192+00:00","updated_at":"2026-05-18T00:04:53.366192+00:00"}