{"as_of":"2026-08-10T05:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6819e522186317a0a395ab55785f8215b276f134289342bba6af0c353e700f71","coverage":[{"denominator":43,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":43,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T22:47:13.122062Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2608.05830/citation-record","integrity":"/paper/2608.05830/integrity","json":"/paper/2608.05830/citation-record.json","paper":"/paper/2608.05830"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:12.791222Z","title":"Multi-agent pathfinding with continuous time,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.791222Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:ad0f7ffeb6641876dc83ab627260288cbde0af03e43e9ead11a6427399b352af","observation_id":"67442ef9-8064-468d-9a2a-2fdba018a149","resolution":{"observed_at":"2026-08-07T22:47:12.791222Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.647993Z","title":"Scale-invariant sampling in multi-arm bandit motion planning for object extraction,","venue":null,"work_id":"a70d2491-dedf-4837-834d-410e2be35672","year":2026},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.795698Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:2ba7b98cf3a9b498f85690c46e2a9d53976330237350f9fd3944a8ddab83ff33","observation_id":"5314c4a5-4ade-498a-8cd3-6bfc496fe853","resolution":{"observed_at":"2026-08-07T22:47:13.651783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.637320Z","title":"Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots,","venue":null,"work_id":"fc09b023-d506-408d-9e30-512b5ba50c35","year":2002},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.799453Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:3326adea9462057d3d314afba4fb45390671da2dd51e1da5118240ee2d8291b3","observation_id":"b3ce3c07-5d0e-475e-8e7c-9d20803cda14","resolution":{"observed_at":"2026-08-07T22:47:13.641293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.626348Z","title":"Prioritized planning algorithms for trajectory coordination of multiple mobile robots,","venue":null,"work_id":"f13b4abb-fa80-488a-b477-577621ab10c0","year":2015},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.803378Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:94f62b9945d5db115bba4a5f1985aa128352e8f02a496960e880dc88b7312fb0","observation_id":"d3cd156c-b63e-4019-816d-e18c35048ba9","resolution":{"observed_at":"2026-08-07T22:47:13.630198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02475","last_updated":"2022-03-04T18:12:49Z","snapshot_observed_at":"2026-08-05T10:34:19.934772Z","submitted_at":"2022-03-04T18:12:49Z","title":"Cooperative Task and Motion Planning for Multi-Arm Assembly Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02475","snapshot_observed_at":"2026-08-07T22:47:12.807157Z","title":"Cooperative task and motion planning for multi-arm assembly systems,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.807157Z"},"links":{"cited_paper":"/paper/2203.02475","citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:c819855c9a8d9544398d1c0ecbc9302d458f59e87f969dc9dedf312bcd62e0f3","observation_id":"7e08aa30-4923-4466-a264-2a84fb8350b8","resolution":{"observed_at":"2026-08-07T22:47:12.807157Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.615625Z","title":"On multiple moving objects,","venue":null,"work_id":"a6d31b7f-22c1-4156-8d6c-f3ca334534c3","year":1987},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.811417Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:1ee4f9157ed121aa009cbdda2926dba97b7f6d8e13c70b370b0af7816a0771e3","observation_id":"32e8faa8-63e4-4b1e-9fe2-91e3efd85446","resolution":{"observed_at":"2026-08-07T22:47:13.619341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.604161Z","title":"Pddlstream: Integrating symbolic planners and blackbox samplers via optimistic adaptive planning,","venue":null,"work_id":"f2e27fc1-8f6c-4601-8444-f7017951badc","year":2020},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.815558Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:568fe09580338a8c2d0c4bd1c0bf08fbe58940a57d7de15f46475d861c106acc","observation_id":"fcc30a21-4bd8-4580-be09-651d95604e47","resolution":{"observed_at":"2026-08-07T22:47:13.608107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.593533Z","title":"Integrated task and motion planning,","venue":null,"work_id":"f89e0756-591d-4f6a-ba81-565596e3112f","year":2021},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.819530Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:967069efa6321bb90bddd832b341d158b7ffe82291cb7413194706e25ed27ffb","observation_id":"bb77f53b-2aee-4705-b4a9-964f22ec9b18","resolution":{"observed_at":"2026-08-07T22:47:13.597214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.582801Z","title":"Pddl - the planning domain definition language,","venue":null,"work_id":"8a5c47d9-ac4b-4627-ae4e-d60f15d47fe6","year":1998},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.823333Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:bf7cf928ebfab05396ea7019b90bf616391ae054a2cb46480803d47def66a949","observation_id":"e681e7f3-f079-4d1e-8036-48107017259b","resolution":{"observed_at":"2026-08-07T22:47:13.586632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.571097Z","title":"ST-RRT*: Asymptotically-optimal bidirectional motion planning through space- time,","venue":null,"work_id":"74b831f2-11ca-4500-af7d-6dafca41c0a5","year":2022},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.826739Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:3fd19346c9f7f39f28dc364633b6a463ba31f857e066cb2ef0758c4bd1dc1627","observation_id":"1c5da867-498a-43c2-b4d8-d55dd0b19c80","resolution":{"observed_at":"2026-08-07T22:47:13.575240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.559494Z","title":"Towards computing low-makespan solutions for multi-arm multi-task planning problems,","venue":null,"work_id":"2d7dbad4-b3f6-4613-af54-7fd89e6d4ada","year":2023},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.830384Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:8855e1fb81b0ba2f8889a7205cf753a2b17eb930e642ae7d4b72706c34ca545d","observation_id":"9e55f9d1-a607-4ee6-9719-2536c67c43b5","resolution":{"observed_at":"2026-08-07T22:47:13.563471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.549080Z","title":"Long-horizon multi-robot rearrangement planning for construction as- sembly,","venue":null,"work_id":"44af9cc4-3392-42af-8396-6f70c705782c","year":2023},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.834144Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:65a73f00eaf6700a49bfdcf8059e4fa0e408ea59bea28ffbfe851a31777b958c","observation_id":"f1ac018d-c814-467b-80ca-d83b501580f4","resolution":{"observed_at":"2026-08-07T22:47:13.552788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.538331Z","title":"Multi-modal motion planning in non- expansive spaces,","venue":null,"work_id":"4592814c-cd3a-4f50-8983-20cd3e576bc3","year":2010},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.838093Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:d062a35e9803a7785c98fd56dba19eaa46feb951374d0be1f305fce2cb6831be","observation_id":"6f7f7ca9-b78e-4359-90c1-0308bd4e561d","resolution":{"observed_at":"2026-08-07T22:47:13.541916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.528016Z","title":"Randomized kin- odynamic motion planning with moving obstacles,","venue":null,"work_id":"cd643a2d-d764-4113-9309-5d881b863f65","year":2002},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.841761Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:50a60d2b9819b7115dae6d28d45d783b55a1e1a39d1266d53b54d573c9ac8753","observation_id":"f5ce712a-3b80-4ee2-8546-ff285bb06998","resolution":{"observed_at":"2026-08-07T22:47:13.531682Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.517278Z","title":"Hierarchical task and motion planning in the now,","venue":null,"work_id":"8d732df4-0560-483e-9260-141689560898","year":2011},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.845191Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:7936bc270a5febe6275d3774083a74f95136da5a3d333c12e61bc4aa0bdb89d3","observation_id":"c1ce32d1-c437-49e7-b0cd-0b45e931674d","resolution":{"observed_at":"2026-08-07T22:47:13.521297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-07T22:47:12.848937Z","title":"Sampling-based algorithms for optimal motion planning,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.848937Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:4be5d42c53b51e709d0a9bf4e67fb07b6edd4649b537e205edb331f24a435695","observation_id":"33e8d8ef-54d8-498e-be28-3d928951b9e5","resolution":{"observed_at":"2026-08-07T22:47:12.848937Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.499988Z","title":"Disassembly sequence planning based on a genetic algorithm,","venue":null,"work_id":"b4e6cff3-da0c-485b-b0d1-bfd29fe8ec5a","year":2014},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.851925Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:06b8c870a58ce6c849e0fccde49212cc555721d6de8be6a3a844efa147516311","observation_id":"00a59c9a-e1b7-4296-b6bd-35b8f2db4599","resolution":{"observed_at":"2026-08-07T22:47:13.503847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.488316Z","title":"Disassembly sequencing using genetic algorithm,","venue":null,"work_id":"dc039f28-6b5f-4821-a648-eeb9c5d16314","year":2006},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.855497Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:6e1a539d84390e0cc1d8fa1e53e75221588215a1ddceb4270f11a8a45cfcb51a","observation_id":"9baa8a9e-5d7d-4c3b-b3ed-8c2067c28d0f","resolution":{"observed_at":"2026-08-07T22:47:13.492221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.477673Z","title":"Dealing with difficult instances of object rearrangement,","venue":null,"work_id":"befcf33d-4d6f-49c5-b91e-4898efed89d6","year":2015},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.858724Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:74e007db20dfd4e7df6cc464e98406cec659d2235f8c47d6596479f44f65fa34","observation_id":"49b096a2-a081-4b4f-8374-58d7e59d05ac","resolution":{"observed_at":"2026-08-07T22:47:13.481432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.467037Z","title":"Disassembly sequencing: A survey,","venue":null,"work_id":"ad522f7a-65e3-4067-8ad1-c6849fd49b22","year":2003},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.862090Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:a7402e7a048027a3a130a3b452c4155bbea3f24f895e841fa9462425a119338b","observation_id":"47bbfb48-b27b-4b8a-8dab-914fe41897dd","resolution":{"observed_at":"2026-08-07T22:47:13.470933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.455809Z","title":"A genetic algorithm for generating optimal assembly plans,","venue":null,"work_id":"17f6743d-e637-4c37-960f-7ffa711477b5","year":2000},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.865579Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:0382bf759e90410e40277474935d960b0a0c700403b72542053376d329c6534a","observation_id":"d1f281f6-8e5e-48a3-a2d1-8f06020b5215","resolution":{"observed_at":"2026-08-07T22:47:13.459924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.444515Z","title":"Searching with consistent prioritization for multi-agent path finding,","venue":null,"work_id":"a8e6b614-82fa-4ad3-be90-30fc1c712e15","year":2019},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.868923Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:bf09bd9f5130c81a70bdd0ef71c26870f2682e7da8cb7f7419b18d97c6b49344","observation_id":"c75886b8-d7ac-411c-b822-c058bb74b6ba","resolution":{"observed_at":"2026-08-07T22:47:13.448452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-07T22:47:12.872104Z","title":"A general task and motion planning framework for multiple manipulators,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.872104Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:cafa16ca074b3da514b7baa5fe9ac1a542df5857d91a60c6d331adacb1b11d06","observation_id":"e72107aa-ce14-4b32-8df8-65cafdc3d6a5","resolution":{"observed_at":"2026-08-07T22:47:12.872104Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.426890Z","title":"SIPP: Safe interval path planning for dynamic environments,","venue":null,"work_id":"334fc192-e0e3-4b8d-bcff-ecd7fa03a889","year":2011},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.875326Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:e81364c8dfbfcb28424b3257fa8386d181e0df8dc77bc9fcb5c71ffe0c5c82df","observation_id":"b877ef01-a7d8-4526-8a19-cb52a926f392","resolution":{"observed_at":"2026-08-07T22:47:13.430850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.415827Z","title":"Fostering end- of-life utilization by information-driven robotic disassembly,","venue":null,"work_id":"8201baaf-f61e-447f-9ec1-b7df092ad661","year":2021},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.878757Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:249cdccd6f390c3f115e77ed2eaf9af0d38bbd283b162edf8f47e54eac5be4a2","observation_id":"067a8e84-9b96-4f65-93ba-db61b9059bb6","resolution":{"observed_at":"2026-08-07T22:47:13.419878Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-07T22:47:12.882101Z","title":"Conflict-based search for optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.882101Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:226694ebc437b574cf040f91605547bcb755c00ca3f2c73b7a03b8c818cd4143","observation_id":"808ebfe5-0671-4711-9c87-e4c0bcf087ed","resolution":{"observed_at":"2026-08-07T22:47:12.882101Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.397804Z","title":"dRRT*: Scalable and informed asymptotically-optimal multi-robot mo- tion planning,","venue":null,"work_id":"ec18f0e0-2531-4a20-897f-5e9aba25ee12","year":2020},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.885697Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:291d05c5845bc202d9fadbfec9903fc465d23bb98a9035294b071a662891fe6b","observation_id":"556c3a51-6b69-4277-9f7b-f9f2a5c4d0eb","resolution":{"observed_at":"2026-08-07T22:47:13.402022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.385928Z","title":"Manipulation planning with probabilistic roadmaps,","venue":null,"work_id":"4cda5ae5-4f1e-471b-880a-14e6f079238e","year":2004},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.901490Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:848062f91f8b27e1aa1a5a199964b75aa577be11915469fdd543a04e1d66a6fb","observation_id":"c30509ba-5dc3-42f1-bc56-8ec79359e262","resolution":{"observed_at":"2026-08-07T22:47:13.389880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.374088Z","title":"Time-based RRT algorithm for rendezvous planning of two dynamic systems,","venue":null,"work_id":"abc6fa1b-b9a0-4dca-aa2c-7bc38be0f50b","year":2014},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.929521Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:2702d84feabf51ed3d1521fe5ecd4b9a39f12615f8a6d29e5e7dbceef04c5bed","observation_id":"930875f7-88f0-4322-a54c-421033bb8480","resolution":{"observed_at":"2026-08-07T22:47:13.378241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.363086Z","title":"Disassembly sequence structure graphs: An optimal approach for multiple-target selective disassembly sequence planning,","venue":null,"work_id":"9e9f34ea-7a38-411a-a00e-0ca4391ebb3a","year":2012},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.941265Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:5f3ca37d5f63810bfb0a9b5c2a9ba75229c2e5ca6533f18ed5493dfd3beeec59","observation_id":"c7f33d22-9516-4463-8b83-a57ea9abec6d","resolution":{"observed_at":"2026-08-07T22:47:13.366613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.345968Z","title":"Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning,","venue":null,"work_id":"64c92e56-1925-473d-81fe-63b945532390","year":2016},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.966376Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:58fb470ac0c661fe43ccbae0a777be8c9aec721e3bae5390bbf382f5909f5fab","observation_id":"0ea00b42-2d22-4020-887c-1ca52cc19ca5","resolution":{"observed_at":"2026-08-07T22:47:13.355333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.301236Z","title":"Combined task and motion planning through an extensible planner- independent interface layer,","venue":null,"work_id":"357d573c-9373-4c5c-bf62-a60ad00a2a65","year":2014},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:12.984736Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:35192cf66480aa38cdb50b38d53e700d280cf416578eeabc0437711d8f9f613f","observation_id":"ddddaed0-af9b-4876-ab35-7823e4abfb6a","resolution":{"observed_at":"2026-08-07T22:47:13.322308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-07T22:47:13.001821Z","title":"The Open Motion Planning Library,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.001821Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:8c8d70f80b15fea5ade26f7a2c9d7aebf36239f87e9de2fabde3da13ebe638ba","observation_id":"e5a67846-c93b-4623-9c01-30443965fb5d","resolution":{"observed_at":"2026-08-07T22:47:13.001821Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.266295Z","title":"Assemble them all: Physics-based planning for generaliz- able assembly by disassembly,","venue":null,"work_id":"391eb6fc-3a2e-4f11-89b5-3e94c60e0753","year":2022},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.020785Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:e1453535c18240534a99d2c07baec60b86769d339da518a5dcd31aa125b95e77","observation_id":"3e483e69-3b63-4e0c-9442-b261796a7f87","resolution":{"observed_at":"2026-08-07T22:47:13.271787Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.254960Z","title":"Logic-geometric programming: An optimization-based approach to combined task and motion planning,","venue":null,"work_id":"020f23f8-9cc8-4edd-8108-5a4eced42bb0","year":2015},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.052686Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:b6739b0ae4ae17ff76104f14ec1eaa8f7bd797cd2876dbbbad22e44940ddae64","observation_id":"e5f4ba8f-3c14-4ce4-aebf-06492806ed9b","resolution":{"observed_at":"2026-08-07T22:47:13.259051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.243635Z","title":"A tutorial on Newton methods for constrained trajectory opti- mization and relations to SLAM, Gaussian process smoothing, opti- mal control, and probabilistic inference,","venue":null,"work_id":"e59f9bee-4027-4943-ba61-704b6f863ee7","year":2017},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.069518Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:3fd66bf8f1c92446fc35944b94e39f141b57bfdc1cd2215810798653350f496f","observation_id":"90d1f762-afb0-4f2f-a56b-89fcc0956f6e","resolution":{"observed_at":"2026-08-07T22:47:13.247777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.231513Z","title":"Multi-bound tree search for logic- geometric programming in cooperative manipulation domains,","venue":null,"work_id":"bc5148e0-f2e1-4cf2-80a1-f111efda0f7a","year":2017},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.086675Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:789bf5ceee5f50d735ee6c699c1c73730eda3833efcbabbec256e01fa93de36b","observation_id":"6b406bf5-84bd-42eb-b9a6-d16dfe118cf8","resolution":{"observed_at":"2026-08-07T22:47:13.235825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.219154Z","title":"Differen- tiable physics and stable modes for tool-use and manipulation planning,","venue":null,"work_id":"278163e9-2516-4b41-93e2-a2cf68b59ab5","year":2018},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.104673Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:3c75b3b2753a7b306a7aadff100c4df814b70acf2fc496dc5083478dc0b93322","observation_id":"d28e291f-7ab4-4605-b42a-7f32b2c89a18","resolution":{"observed_at":"2026-08-07T22:47:13.223573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.207185Z","title":"Roadmap-based motion planning in dynamic environments,","venue":null,"work_id":"f695fe4b-1eff-4148-b590-3271cd9ced86","year":2005},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.108349Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:de302d3458f05bfae8bad0156536f213f5832dbd046e533386775f830ff2ac3a","observation_id":"1b442bcb-5bfb-48bb-84bc-44e9a60f0bb8","resolution":{"observed_at":"2026-08-07T22:47:13.211053Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.196287Z","title":"Planning time-minimal safe paths amidst unpredictably moving obstacles,","venue":null,"work_id":"c57d10cf-41b3-473c-8967-4ba77978297c","year":2008},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.111662Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:1ab102ab85e9885aee2cd47bc0996d04a5f475d46a3a7cc57b1c9c088ba2e3b8","observation_id":"1a74ac1e-6e77-43c1-abd3-c6d55dd257ec","resolution":{"observed_at":"2026-08-07T22:47:13.200142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.184886Z","title":"Asymptotically optimal planning under piecewise-analytic constraints,","venue":null,"work_id":"fee0fa8a-9d99-4fbf-82ac-a03b7de3af82","year":2016},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.114947Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:5ce7e838df2e11fade241cabab10ad106ed68edf4f757bd848f1a24e5cf87ad8","observation_id":"c9c39964-0946-4e2c-b573-774898bba7ef","resolution":{"observed_at":"2026-08-07T22:47:13.188909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.173056Z","title":"M*: A complete multirobot path planning algorithm with performance bounds,","venue":null,"work_id":"eb54395a-304f-4aad-a7dd-ffa5551d2ea9","year":2011},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.118424Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:59327f8eee1ed5ce3e502809bfe721ab859466903d3c7bcc904e9eef4df51d5f","observation_id":"c0a3befb-a694-48a5-b6b8-cc14226201f4","resolution":{"observed_at":"2026-08-07T22:47:13.177211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:47:13.159550Z","title":"Structure and intractability of optimal multi- robot path planning on graphs,","venue":null,"work_id":"9628b72c-6390-4dc3-8173-1a66289a02e5","year":2013},"citing_paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T22:47:13.122062Z"},"links":{"citing_paper":"/paper/2608.05830"},"observation_digest":"sha256:27f35df813ceb32a68256898ed1838363e725c010522b2001e8c049fe4dfea95","observation_id":"1308edab-a6fb-4112-8c52-795d0e8049d0","resolution":{"observed_at":"2026-08-07T22:47:13.165371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.05830","last_updated":"2026-08-06T09:59:42Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-09T23:11:40.398642Z","submitted_at":"2026-08-06T09:59:42Z","title":"Coordinated Multi-Robot Disassembly for Makespan Optimization of Large-Scale Assemblies"},"reference_resolution":{"displayed":43,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":37},"total_outbound_references":43},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2608.05830."}