{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JP3JXQVHVECLOIMRBIFLHPTEHD","short_pith_number":"pith:JP3JXQVH","canonical_record":{"source":{"id":"2606.12027","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-10T12:49:47Z","cross_cats_sorted":[],"title_canon_sha256":"3a6478092380c2bf7ab5f9fb6254c1d2510d3dfb642553e5e80a3a034074cbb6","abstract_canon_sha256":"91028027d898fe54bcdfbcfa19666f187e1ab8192d591f839747bd9be4ad73d6"},"schema_version":"1.0"},"canonical_sha256":"4bf69bc2a7a904b721910a0ab3be6438e9cacfde9596389fcb54973d971aa3d8","source":{"kind":"arxiv","id":"2606.12027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12027","created_at":"2026-06-11T01:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12027v1","created_at":"2026-06-11T01:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12027","created_at":"2026-06-11T01:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"JP3JXQVHVECL","created_at":"2026-06-11T01:10:43Z"},{"alias_kind":"pith_short_16","alias_value":"JP3JXQVHVECLOIMR","created_at":"2026-06-11T01:10:43Z"},{"alias_kind":"pith_short_8","alias_value":"JP3JXQVH","created_at":"2026-06-11T01:10:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JP3JXQVHVECLOIMRBIFLHPTEHD","target":"record","payload":{"canonical_record":{"source":{"id":"2606.12027","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-10T12:49:47Z","cross_cats_sorted":[],"title_canon_sha256":"3a6478092380c2bf7ab5f9fb6254c1d2510d3dfb642553e5e80a3a034074cbb6","abstract_canon_sha256":"91028027d898fe54bcdfbcfa19666f187e1ab8192d591f839747bd9be4ad73d6"},"schema_version":"1.0"},"canonical_sha256":"4bf69bc2a7a904b721910a0ab3be6438e9cacfde9596389fcb54973d971aa3d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:43.893933Z","signature_b64":"VzUPTDrfP2LxOoAbJpdl6xydeNrgvsPUe+YtramedEZlcD0Q7ohIJYWiExSETjsEHbq2tHlNmhBh02n4nwu7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bf69bc2a7a904b721910a0ab3be6438e9cacfde9596389fcb54973d971aa3d8","last_reissued_at":"2026-06-11T01:10:43.893178Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:43.893178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.12027","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-06-11T01:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sD3qX+nGPctuReaXga/IqQOrX/VGJTXCy4/SEOvNTKHaEC4Wzk/pGzb0TnqhBrJilTduYCPimI/wGDoZPRInAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:00:33.237186Z"},"content_sha256":"488d92f9bcd2cc8a4fc0791b4d2cf37afcdb6e344c17f9848b3e4f9391caff54","schema_version":"1.0","event_id":"sha256:488d92f9bcd2cc8a4fc0791b4d2cf37afcdb6e344c17f9848b3e4f9391caff54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JP3JXQVHVECLOIMRBIFLHPTEHD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dongho Kang, Junha Cha, Kisang Park, Stelian Coros, Sungjoon Choi, Taerim Yoon","submitted_at":"2026-06-10T12:49:47Z","abstract_excerpt":"Collision-free path planning in cluttered, real-world environments relies on a representation of the collision-free space, and existing representations broadly fall into two\n  categories. Explicit representations, such as unions of convex sets, can be plugged into optimization-based planners as hard collision-free constraints, but their parameters scale\n  poorly with configuration-space dimension. Implicit representations, by contrast, are flexible and scale well to complex geometries, yet typically lack such guarantees. We bridge this\n  gap with ILD (Invertible Latent Decomposition), a framew"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12027","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.12027/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-11T01:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/4JOjzpF343NV1Y4+E3VYQxFKAcR4QsG9z2Z1tnD0EyGooMR5nS/SzjGWnYf9/nuWGWoMMVDjX69MZ1dOv/3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:00:33.237626Z"},"content_sha256":"34f343f96dfe395b515a692ecc0d1bcda986f87a7f255e1d0c77b7f151828856","schema_version":"1.0","event_id":"sha256:34f343f96dfe395b515a692ecc0d1bcda986f87a7f255e1d0c77b7f151828856"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JP3JXQVHVECLOIMRBIFLHPTEHD/bundle.json","state_url":"https://pith.science/pith/JP3JXQVHVECLOIMRBIFLHPTEHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JP3JXQVHVECLOIMRBIFLHPTEHD/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-11T11:00:33Z","links":{"resolver":"https://pith.science/pith/JP3JXQVHVECLOIMRBIFLHPTEHD","bundle":"https://pith.science/pith/JP3JXQVHVECLOIMRBIFLHPTEHD/bundle.json","state":"https://pith.science/pith/JP3JXQVHVECLOIMRBIFLHPTEHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JP3JXQVHVECLOIMRBIFLHPTEHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JP3JXQVHVECLOIMRBIFLHPTEHD","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":"91028027d898fe54bcdfbcfa19666f187e1ab8192d591f839747bd9be4ad73d6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-10T12:49:47Z","title_canon_sha256":"3a6478092380c2bf7ab5f9fb6254c1d2510d3dfb642553e5e80a3a034074cbb6"},"schema_version":"1.0","source":{"id":"2606.12027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.12027","created_at":"2026-06-11T01:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"2606.12027v1","created_at":"2026-06-11T01:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12027","created_at":"2026-06-11T01:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"JP3JXQVHVECL","created_at":"2026-06-11T01:10:43Z"},{"alias_kind":"pith_short_16","alias_value":"JP3JXQVHVECLOIMR","created_at":"2026-06-11T01:10:43Z"},{"alias_kind":"pith_short_8","alias_value":"JP3JXQVH","created_at":"2026-06-11T01:10:43Z"}],"graph_snapshots":[{"event_id":"sha256:34f343f96dfe395b515a692ecc0d1bcda986f87a7f255e1d0c77b7f151828856","target":"graph","created_at":"2026-06-11T01:10:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.12027/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Collision-free path planning in cluttered, real-world environments relies on a representation of the collision-free space, and existing representations broadly fall into two\n  categories. Explicit representations, such as unions of convex sets, can be plugged into optimization-based planners as hard collision-free constraints, but their parameters scale\n  poorly with configuration-space dimension. Implicit representations, by contrast, are flexible and scale well to complex geometries, yet typically lack such guarantees. We bridge this\n  gap with ILD (Invertible Latent Decomposition), a framew","authors_text":"Dongho Kang, Junha Cha, Kisang Park, Stelian Coros, Sungjoon Choi, Taerim Yoon","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12027","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:488d92f9bcd2cc8a4fc0791b4d2cf37afcdb6e344c17f9848b3e4f9391caff54","target":"record","created_at":"2026-06-11T01:10:43Z","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":"91028027d898fe54bcdfbcfa19666f187e1ab8192d591f839747bd9be4ad73d6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-10T12:49:47Z","title_canon_sha256":"3a6478092380c2bf7ab5f9fb6254c1d2510d3dfb642553e5e80a3a034074cbb6"},"schema_version":"1.0","source":{"id":"2606.12027","kind":"arxiv","version":1}},"canonical_sha256":"4bf69bc2a7a904b721910a0ab3be6438e9cacfde9596389fcb54973d971aa3d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bf69bc2a7a904b721910a0ab3be6438e9cacfde9596389fcb54973d971aa3d8","first_computed_at":"2026-06-11T01:10:43.893178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:10:43.893178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VzUPTDrfP2LxOoAbJpdl6xydeNrgvsPUe+YtramedEZlcD0Q7ohIJYWiExSETjsEHbq2tHlNmhBh02n4nwu7DQ==","signature_status":"signed_v1","signed_at":"2026-06-11T01:10:43.893933Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.12027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:488d92f9bcd2cc8a4fc0791b4d2cf37afcdb6e344c17f9848b3e4f9391caff54","sha256:34f343f96dfe395b515a692ecc0d1bcda986f87a7f255e1d0c77b7f151828856"],"state_sha256":"c050e17a468d6a3f259ef5e99c6d0845ba60e6890c976cd6402be412f3d4aec3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00Z51/U3WZoVnegy4ZC8ztOU52Gaz22JJuIIZg2vDrkw8R9Jr6E6zert6vCNlCgmHksaV+qkSSe/pc/9RG+xBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:00:33.241261Z","bundle_sha256":"839a5bab5106d67e76b3d1287c1cd75d400f7f4b2e604edda448465f828346ae"}}