{"as_of":"2026-08-19T23:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc96be58b7382a527161abe30b8e396009f5e21a34598e631e9201df9f7e0863","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T09:34:55.919165Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.12027/citation-record","integrity":"/paper/2606.12027/integrity","json":"/paper/2606.12027/citation-record.json","paper":"/paper/2606.12027"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":"Deits and R","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:0550e168086d02112dd880e358ec841dd6871b0494da6a417c821a57215648cf","observation_id":"13bd0325-f239-498a-a7e2-a08eb6794729","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":"Marcucci, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:fc416807430b3e3dbc7583719b07a8f99051ab1b765470b35995ef069889c289","observation_id":"43ce6f8a-268c-4d33-800f-f7b1a8debece","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":"Tedrake and the Drake Development Team","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:2f06525e66d075ccb06e6b22ddaadd5bbf25162270123ff5271be189c83369ee","observation_id":"85f95d86-e068-4745-945d-fe4423df04ed","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:1dfb25f613773892c9e9b8eb2f2a5864518b91a80b9c4eaa7014aab2016eeb95","observation_id":"323fa014-15f6-4a92-aef5-5b8106042956","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:c7eefedb90ebf5d65b7210b03ccc7ac9e252d25fa58ee8d7ee26e7ea9c2d7754","observation_id":"6d1e580d-776b-4aea-9fec-8330a5a7a568","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":"Werner, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:32df9944cdffc3b93f5f91c1c9b55b864c1ea8a9b39ac601109113153c3a0388","observation_id":"a58fe084-0593-453c-a0db-8fe02ce812e8","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.12649","last_updated":"2024-11-13T20:00:39Z","snapshot_observed_at":"2026-08-18T15:12:06.560968Z","submitted_at":"2024-10-16T15:13:27Z","title":"Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space","version":2},"cited_work":{"arxiv_id":"2410.12649","doi":"10.48550/arxiv.2410.12649","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.12649","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Faster algorithms for growing collision-free convex polytopes in robot configuration space","venue":null,"work_id":"52c43f19-7bbd-4ec8-9259-ba9a2b628183","year":2024},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"cited_paper":"/paper/2410.12649","citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:1f1db5afc177b602e7f71d709c03ebd632b66da5a6a0e62000dfa5c0adbb6662","observation_id":"23a6ffcb-e91a-4604-b4b1-d10803a6f433","resolution":{"observed_at":"2026-07-03T11:28:04.200802Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":"Koptev, N","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:da53fe24ddcb43ef745246a529200554b90954c3acd420edea069d45bbf0465a","observation_id":"6567529f-a1e4-4e46-a062-08932a324093","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:beafe06dd2edf53e40556a42673183f53379cdf48ff096d0956196c37b82c842","observation_id":"54dd1477-4b1f-474c-8619-8ee9b99cc744","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":"Sundaralingam, S","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:059095e13f3fc9c22aacfe916bb300a35a1150976c27c25b676d7f329542d02f","observation_id":"38229176-5c00-4e05-b15f-c059b9ba9f46","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:7b1720504da1349b612d509303b3deaf0d3ec5b75396c554257e1550d9e78a88","observation_id":"936f6446-1136-40d3-9bc5-c1e9f1156b1a","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:bb9089170ac731564e4f0a82faab6466aafa97c7ac98c53441be41994619fc16","observation_id":"d70381be-98b6-4a06-b2f2-4496788723aa","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:442ff4db0c75a1e5aa074ce09ea7940e5f0deaddad176b4b7c3a0fe986f943c9","observation_id":"ae31f869-735c-4458-84fe-2e559be0807c","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":"Charatan, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:52729ea9212668273518b447a3cd0e07120b4ef37bbe42e0689b2b5df3e8c6c5","observation_id":"e09e63a8-4909-4642-beef-4495cb487d35","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:464fc71235be0438fead01a34102443fa2d0cf437ebd709212b41d238a92a3d9","observation_id":"74e67231-417b-42c1-98bd-269bcb2953fe","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":"Rezende and S","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:8889f0473173ccac78954aff91ef624f00af14f9e90c5c40221a07ba2d24a3bb","observation_id":"a166811d-eb4d-489e-9265-1a7058080f69","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:34:55.919165Z","title":"Kobyzev, S","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T09:34:55.919165Z"},"links":{"citing_paper":"/paper/2606.12027"},"observation_digest":"sha256:33a1eb3c1f19fa505abf6078061704ced8b2d94d6d0aadc6cc8d2c3346d6b1cb","observation_id":"08a32676-644d-4abe-9e2c-f8aec71ece10","resolution":{"observed_at":"2026-06-27T09:34:55.919165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.12027","last_updated":"2026-06-10T12:49:47Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-14T07:48:26.978472Z","submitted_at":"2026-06-10T12:49:47Z","title":"Learning Unions of Convex Sets via Invertible Latent Decomposition for Path Planning"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":17},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2606.12027."}