{"as_of":"2026-08-12T14:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec3d9f61d92d4445118738fbb43d766cb3a4cf648be069bf4083947c225df831","coverage":[{"denominator":120,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T11:37:45.118457Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2412.15398/citation-record","integrity":"/paper/2412.15398/integrity","json":"/paper/2412.15398/citation-record.json","paper":"/paper/2412.15398"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T11:37:44.746846Z","title":"Complexity results and fast methods for optimal tabletop rearrangement with overhand grasps,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.746846Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:b85d9d4ea7b2820a4b823aa06dec1dba8f867b48230977052883fdfb68d9c5b4","observation_id":"f5d396c6-68db-4a88-96ee-32546c9859f6","resolution":{"observed_at":"2026-08-11T11:37:44.746846Z","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-08-11T11:37:44.751368Z","title":"Robotic grasping of novel objects using vision,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.751368Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:e7839e663bce704fac1b2edc9ac69f96fb00946cd896232c7d396dbfe35abb0d","observation_id":"b479d802-be92-4272-8470-6a20f930b43c","resolution":{"observed_at":"2026-08-11T11:37:44.751368Z","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-08-11T11:37:44.756210Z","title":"High precision grasp pose de- tection in dense clutter,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.756210Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:54d5b91c40b1e53975e858ed32823a46babc07e9c5d77a4fd2ded75f5eb7aa05","observation_id":"74cbabec-f000-47ed-a8d3-834a89a938fa","resolution":{"observed_at":"2026-08-11T11:37:44.756210Z","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-08-11T11:37:44.760073Z","title":"A self-supervised learning system for object detection using physics simulation and multi-view pose estimation,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.760073Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:8091c55d34f70796c45383861096fffbefe7b21ed1e583d57442dd098ef61ad6","observation_id":"bffd9d21-80e7-46bb-b08d-1d1e551603ca","resolution":{"observed_at":"2026-08-11T11:37:44.760073Z","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-08-11T11:37:44.763774Z","title":"Posecnn: A convolutional neu- ral network for 6d object pose estimation in cluttered scenes,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.763774Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:50e4ef7647994866a22333769a2065238024c531c9527df6d60802a3029cdee0","observation_id":"1fc5495a-dac5-4730-beff-5bedb75b6c9b","resolution":{"observed_at":"2026-08-11T11:37:44.763774Z","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-08-11T11:37:44.767552Z","title":"Navigation among movable obstacles: Real-time reasoning in complex environments,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.767552Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:dc193b2e7345230c8d63161e139580111f9f0fffe61ac8dafc8234d9f7a0604c","observation_id":"828a3e6a-6db9-4954-9621-7316f3230bf2","resolution":{"observed_at":"2026-08-11T11:37:44.767552Z","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-08-11T11:37:44.771573Z","title":"Asymptotically optimal algorithms for one-to-one pickup and delivery problems with applications to transportation sys- tems,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.771573Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:5643d22cd56c666b535624af4d4adbecd897ba17ddafb82af13c8541c9b74b22","observation_id":"bd763983-0884-4aaf-bc3c-21f37dfe7dba","resolution":{"observed_at":"2026-08-11T11:37:44.771573Z","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-08-11T11:37:44.775224Z","title":"Geometric rearrangement of multiple movable objects on cluttered surfaces: A hybrid reasoning approach,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.775224Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:eb5f0177270edd068bafee31618312ef92fedc75994a6b0a4db9141cdf3ef9a9","observation_id":"f177b392-358c-49e9-86df-3bf2e46f9ed4","resolution":{"observed_at":"2026-08-11T11:37:44.775224Z","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-08-11T11:37:44.778952Z","title":"Dealing with difficult instances of object rearrange- ment.,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.778952Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:bcfa506587458049d7bce4e53c9f5ea6a2084e31ac594912a6712a1a4cc28e52","observation_id":"c2f2ba06-37fa-4f62-affc-556d11d6f86f","resolution":{"observed_at":"2026-08-11T11:37:44.778952Z","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-08-11T11:37:44.783067Z","title":"Rearrangement planning using object- centric and robot-centric action spaces,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.783067Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:01293312f8a5a179eeeb2a1a7daec9d5dc3b02d0b013c67851afd7c993e27c24","observation_id":"9fd88a4d-bf84-4932-8ae7-e2e3f86d4c60","resolution":{"observed_at":"2026-08-11T11:37:44.783067Z","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-08-11T11:37:44.786753Z","title":"Efficient obstacle rearrangement for object manipulation tasks in cluttered environments,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.786753Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:00c82cdc8d3047bbbb35dc03584ecfed0298941179315d3620ee748e327a4d4e","observation_id":"651551f8-b377-473c-9a5a-e05257de7931","resolution":{"observed_at":"2026-08-11T11:37:44.786753Z","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-08-11T11:37:44.790850Z","title":"Sensor-based manipulation plan- ning as a game with nature,","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.790850Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:3c21a5cf3e3d372f14ec350bd075a03cf7fbaeaff719803a71b8fa0f78791412","observation_id":"0d69b17d-a6bc-482d-a7df-543e9dd67473","resolution":{"observed_at":"2026-08-11T11:37:44.790850Z","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-08-11T11:37:44.794770Z","title":"Orienting polygonal parts without sensors,","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.794770Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:171364f43c1b6f2d1ddeeee5c34a2f48acb04888147932be498afb0856e6d9a7","observation_id":"a8e5591b-8bff-4507-acb7-1e9ebafa4e37","resolution":{"observed_at":"2026-08-11T11:37:44.794770Z","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-08-11T11:37:44.798284Z","title":"Dynamic nonprehensile manipulation: Controlla- bility, planning, and experiments,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.798284Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:9dab27c44dfe59106f4db0d1de4ce749e71e426dd703398e0ece03a4036879da","observation_id":"099682c1-1daa-4bd6-9c5c-ff29125eb097","resolution":{"observed_at":"2026-08-11T11:37:44.798284Z","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-08-11T11:37:44.801425Z","title":"A framework for push-grasping in clutter,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.801425Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:cbe5b6708f0ed220cf92afa43b26fc795b8715cd5c7c46302750746a99a7f5b8","observation_id":"18a46501-4108-432f-8c5b-2ff229b96182","resolution":{"observed_at":"2026-08-11T11:37:44.801425Z","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-08-11T11:37:44.804799Z","title":"Data-driven grasp synthesis—a survey,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.804799Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:a550e7878b380f0e131d5a4177fe8d328dd93bd0ceb259594b0e09d93155a8ff","observation_id":"eb0ecee4-50c9-4d74-ba71-dd3881c644e4","resolution":{"observed_at":"2026-08-11T11:37:44.804799Z","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-08-11T11:37:44.807795Z","title":"Extrinsic dexterity: In-hand manipulation with external forces,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.807795Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:0187a064bd60f13c6ecc2ffc7f935e9a6274a619f2b535aad25e9015c682f50e","observation_id":"cc861adf-f59d-4458-b52c-0ef6ebc9c1f8","resolution":{"observed_at":"2026-08-11T11:37:44.807795Z","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-08-11T11:37:44.811376Z","title":"Learning to manipulate unknown objects in clutter by reinforcement,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.811376Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:6d6b40e03bf49b1ce2b8a2c575e43435e7350171dc4bc6e7f406bfb3e9871eac","observation_id":"98110a57-788b-4ade-a345-c71852b9476e","resolution":{"observed_at":"2026-08-11T11:37:44.811376Z","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-08-11T11:37:44.815176Z","title":"Prehensile pushing: In-hand manipulation with push-primitives,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.815176Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:495d3623bc62c49364e8e1dafa55016d81c60ff28c62265eb786f999eaa57bb7","observation_id":"5e986828-2368-4feb-861f-8358bdce990a","resolution":{"observed_at":"2026-08-11T11:37:44.815176Z","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-08-11T11:37:44.818908Z","title":"Hierarchical task and motion planning in the now,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.818908Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:cbbe52bf95f6ebf804b765896448c1e1a94f556307faeffa9df061ddc712f197","observation_id":"b682435e-a686-4f11-8682-502ae3d5575a","resolution":{"observed_at":"2026-08-11T11:37:44.818908Z","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-08-11T11:37:44.822403Z","title":"End-to-end training of deep visuomo- tor policies,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.822403Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:5cdb0b01b3c020846d98c54c03d1e06996b1f1333d3e07b5e8b0b60548aa5627","observation_id":"531cd17d-80d1-4c61-a219-5d526673280b","resolution":{"observed_at":"2026-08-11T11:37:44.822403Z","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-08-11T11:37:44.825956Z","title":"Dex-net 2.0: Deep learning to plan robust grasps with synthetic point clouds and analytic grasp metrics,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.825956Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:beb17ef5078fcc144f00885209e00cba0eaf2bcc329acecc066e1ad8ca460b88","observation_id":"e4b0e8b5-772a-4c25-86fa-b116f3ceb597","resolution":{"observed_at":"2026-08-11T11:37:44.825956Z","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-08-11T11:37:44.829901Z","title":"Robotic pick-and-place of novel objects in clutter with multi- affordance grasping and cross-domain image matching,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.829901Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:6297fd24278b2dc9d18a44e900a48bbaaf5a0f4be90050460d36866ae0104af7","observation_id":"494aef90-387a-4063-8246-b8d4a851a6bb","resolution":{"observed_at":"2026-08-11T11:37:44.829901Z","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-08-11T11:37:44.833778Z","title":"Learning feasi- bility for task and motion planning in tabletop environments,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.833778Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:9b786cb16babd037007cbac50c9d2422fc94ba50fde8be70e96150ba0d9e5e7b","observation_id":"0a6b08dd-5f56-407e-80ee-dadc446d9f3d","resolution":{"observed_at":"2026-08-11T11:37:44.833778Z","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-08-11T11:37:44.838505Z","title":"On the complexity of motion plan- ning for multiple independent objects; pspace-hardness of the ‘warehouseman’s problem’,","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.838505Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:92ed9bd1c0bb35fee7aa02d1d51dbf1990a36262f3e41d8f8d5a0f99638417c6","observation_id":"2413e060-1413-4d66-a34e-b4dcc5a8379f","resolution":{"observed_at":"2026-08-11T11:37:44.838505Z","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-08-11T11:37:44.842386Z","title":"Motion planning in the presence of movable obstacles,","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.842386Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:bc29b43a90df9b762c07f2720a9cc9cc497180514efd644970991b77f4506bde","observation_id":"b4b4c753-8f24-44d5-9a3a-5c68517f7432","resolution":{"observed_at":"2026-08-11T11:37:44.842386Z","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-08-11T11:37:44.846066Z","title":"Manipulation planning among movable obstacles,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.846066Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:29fd286b9f3a1915e9dab900df43c0ee43e8b45e00344752ebab60b3f3ced320","observation_id":"837f557f-873c-4b45-bef5-37f6ebc9abc8","resolution":{"observed_at":"2026-08-11T11:37:44.846066Z","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-08-11T11:37:44.849693Z","title":"Lazy rearrangement planning in confined spaces,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.849693Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:fc2c0bb39734ea7dbaa00f6deb5f925684fb5661bfd448ece2257ebc9ec39747","observation_id":"022b944e-c970-4717-b7b8-9db57daa37fe","resolution":{"observed_at":"2026-08-11T11:37:44.849693Z","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-08-11T11:37:44.853320Z","title":"The euclidean travelling salesman problem is np-complete,","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.853320Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:56280d1e1fff349a0825d19c1ec41c285cd9067e9d670bad232d76a0c79dd5f0","observation_id":"e5543bab-570f-4990-b5ea-96f4aff66775","resolution":{"observed_at":"2026-08-11T11:37:44.853320Z","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-08-11T11:37:44.857019Z","title":"Reducibility among combinatorial problems,","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.857019Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:e6cd5ba3bb549ef1724d96e8d11d955736784198a61ec09f14ce2f20db2dadd6","observation_id":"6c274046-b1de-40cd-8861-92fe84f73ee1","resolution":{"observed_at":"2026-08-11T11:37:44.857019Z","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-08-11T11:37:44.860979Z","title":"The lifting model for reconfiguration,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.860979Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:2b00f3cea5483ed6f377eb8e6ae1f0aafe35803b5b14b1da3fb9701caf63a438","observation_id":"8e9d845a-ec7e-47b6-9a48-93428ad8bfca","resolution":{"observed_at":"2026-08-11T11:37:44.860979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.03956","last_updated":"2019-07-09T03:18:51Z","snapshot_observed_at":"2026-07-06T08:06:25.449351Z","submitted_at":"2019-07-09T03:18:51Z","title":"Planning for target retrieval using a robotic manipulator in cluttered and occluded environments","version":1},"cited_work":{"arxiv_id":"1907.03956","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.03956","snapshot_observed_at":"2026-08-11T11:37:45.447214Z","title":"Planning for target retrieval using a robotic manipulator in cluttered and occluded environments","venue":"cs.RO","work_id":"6b3d647e-7667-486c-8ac0-aae3f3dfd174","year":2019},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.864567Z"},"links":{"cited_paper":"/paper/1907.03956","citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:76be5b7e46cecdc7979dba413fc21533d0f991e9f072439f4c50f8be1f5ef2f0","observation_id":"1720a2c7-10d6-45ea-803d-eeb1216fb645","resolution":{"observed_at":"2026-08-11T11:37:45.450710Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:44.868615Z","title":"Space-aware re- configuration,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.868615Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:80ab9ed5dd47990c5c3823b11f19883bf84e855d10815eeac6c4c4588599d68e","observation_id":"afe81a4e-8c5f-4dd0-ba08-c9610888237b","resolution":{"observed_at":"2026-08-11T11:37:44.868615Z","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-08-11T11:37:44.871927Z","title":"Practical pushing planning for rearrangement tasks,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.871927Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:f7fb329c3e62fb0ac3fee891fc2d777b2ae9e56bda42dbafb6676242b1a78ade","observation_id":"ca1e42cc-b36a-42d2-95da-5fef66d3f68d","resolution":{"observed_at":"2026-08-11T11:37:44.871927Z","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-08-11T11:37:44.875278Z","title":"Large-scale multi-object rearrangement,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.875278Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:9e09ba4943e4468564e7bec9a6648215bb5ef418a2a0af8539f9264d31b5863c","observation_id":"293d23e8-67a5-4d47-9ad9-7a8a3275915e","resolution":{"observed_at":"2026-08-11T11:37:44.875278Z","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-08-11T11:37:44.878402Z","title":"Interactive singulation of objects from a pile,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.878402Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:885c5ca18ab14d937dcf1ab0d449ce1accf91343d9ae015b4ce881cf9c5a92a7","observation_id":"ea9c8499-25fe-4097-850f-77ccf3b5b227","resolution":{"observed_at":"2026-08-11T11:37:44.878402Z","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-08-11T11:37:44.881454Z","title":"Robot grasping in clutter: Using a hierarchy of supervisors for learning from demonstrations,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.881454Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:f27cfe15fbeec3cf3129bff02f34da6cbc4e369b15ada4562163f9306b7f89c9","observation_id":"d10297c0-d7b6-409c-adeb-add1cf4fa4eb","resolution":{"observed_at":"2026-08-11T11:37:44.881454Z","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-08-11T11:37:44.884562Z","title":"Learning to singulate objects using a push proposal network,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.884562Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:5a5e1bce5a180c842b4ffa47a0c42db7e3280221be57872d6bbbaf1edc7dffed","observation_id":"1a25eee9-e5e0-4204-9ad9-35d49d8d6d0a","resolution":{"observed_at":"2026-08-11T11:37:44.884562Z","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-08-11T11:37:44.887525Z","title":"Multi-object rearrangement with monte carlo tree search: A case study on planar nonprehensile sorting,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.887525Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:30794046f58aeff6432cb9e7405a69f5d4b4e4009708cb578762b68450f0b9d0","observation_id":"3d108e55-8c19-4a9c-a537-1ec3821fb8a3","resolution":{"observed_at":"2026-08-11T11:37:44.887525Z","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-08-11T11:37:44.890703Z","title":"Decision making in joint push-grasp action space for large- scale object sorting,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.890703Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:74bd39398e42f9dcc69ec123d3f65045c9206c75d47812d32081d285d5a20e40","observation_id":"faa9d944-9326-40f5-8147-e8d4b7660e68","resolution":{"observed_at":"2026-08-11T11:37:44.890703Z","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-08-11T11:37:44.893824Z","title":"Learning synergies between pushing and grasping with self-supervised deep reinforcement learning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.893824Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:2968c3797df366f1073cdbbba1cb993459a2fd463dd1181cf852be3937243ef2","observation_id":"4237135c-8036-4487-995d-7160da4b737c","resolution":{"observed_at":"2026-08-11T11:37:44.893824Z","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-11T11:37:46.196288Z","title":"Dipn: Deep interaction prediction network with application to clutter removal,","venue":null,"work_id":"ed1380a8-c0bd-4b51-877c-2553e54835c8","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.897457Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:6b5212fbde789d75ad1cb46d83f9d4a949e167a29ea59cc60adc49dda4b04758","observation_id":"6d6449a5-f937-47e3-b7bc-7dd19a4e8d0e","resolution":{"observed_at":"2026-08-11T11:37:46.200371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.182863Z","title":"Visual foresight trees for object retrieval from clutter with nonprehensile rearrangement,","venue":null,"work_id":"5328b7be-0457-4cc7-aed1-6ec97ebfde73","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.901303Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:2f00983c21a452f9c1ff8121daaf514719d92ce3de3eab55131e63a2a2932aa2","observation_id":"3439abe5-e747-4178-bf01-ca4c5a11a9f6","resolution":{"observed_at":"2026-08-11T11:37:46.186873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.02937","last_updated":"2022-02-07T04:44:29Z","snapshot_observed_at":"2026-08-07T05:36:18.742695Z","submitted_at":"2022-02-07T04:44:29Z","title":"Persistent Homology for Effective Non-Prehensile Manipulation","version":1},"cited_work":{"arxiv_id":"2202.02937","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.02937","snapshot_observed_at":"2026-08-11T11:37:45.432402Z","title":"Persistent Homology for Effective Non-Prehensile Manipulation","venue":"cs.RO","work_id":"6daa27f5-8c54-4fb4-a2ce-4aa9db570ede","year":2022},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.904774Z"},"links":{"cited_paper":"/paper/2202.02937","citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:c831f3f754e9fbe6d906eeb32dc7072ebf465011a5464be3bbe1485c2b850000","observation_id":"eadee7f5-2ab9-4ed6-a647-b6f41026f01c","resolution":{"observed_at":"2026-08-11T11:37:45.436521Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.171952Z","title":null,"venue":null,"work_id":"c98079fd-57ac-49cc-8f97-df1e39444797","year":1988},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.909185Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:984928a374c6999c8c43b1e826e17dbdb5b1e41952a2d29ffa198576be561809","observation_id":"7af7720c-94e9-48f4-9d00-8074283f7629","resolution":{"observed_at":"2026-08-11T11:37:46.175633Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.160693Z","title":"Centralized path plan- ning for multiple robots: Optimal decoupling into sequential plans.,","venue":null,"work_id":"a243d672-91fd-48bf-ae8d-fc9468ed4935","year":2009},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.912842Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:54fa721d4160cc498a7794c261165a2c62cdf2c9e14fcfa6f19faf504a0c4c0a","observation_id":"a6b389d9-b66c-4da4-a08a-2bb7f156ef28","resolution":{"observed_at":"2026-08-11T11:37:46.164725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.149011Z","title":"Efficiently solving general rearrangement tasks: A fast extension primitive for an incremental sampling-based planner,","venue":null,"work_id":"5712e67e-08dc-4ef3-b321-0cc15bad7acb","year":2016},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.916593Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:a90200d44f7ae8872560aff6b0d87b0e75008f79d33d1044f63b717bded04d2b","observation_id":"e56a2db2-df72-4e13-b306-2698f01870b1","resolution":{"observed_at":"2026-08-11T11:37:46.153204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.138321Z","title":"Robot packing with known items and nondeterministic arrival order,","venue":null,"work_id":"2248744c-df26-416d-bf8d-f383b45e64ff","year":2020},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.920153Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:c454e89a29f3948a98b3ffc084351947c6f1653dcd2083874b2e3f339d5e131c","observation_id":"3dfb34cf-824c-4254-9f02-b67763594ab8","resolution":{"observed_at":"2026-08-11T11:37:46.141988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.127356Z","title":"Toward efficient task planning for dual-arm tabletop object rearrangement,","venue":null,"work_id":"089a69ec-d820-4302-bff1-08b3d8f91c4e","year":2022},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.923880Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:d0b4d98dffdc1e77ee8676ba329f64c1dfa2e4011117791033e54eaa689cf825","observation_id":"1b65d5ea-d091-4b28-8a6c-19a75ef881f2","resolution":{"observed_at":"2026-08-11T11:37:46.131679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.116080Z","title":"A survey of graph layout problems,","venue":null,"work_id":"e4578f7c-d5c9-42b4-9729-fda53c8ecfa5","year":2002},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.928043Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:178417b248912f9bde1bb3edc21d028e00ad90a307141f9b8db3529957556195","observation_id":"81d5f420-6d6a-4e28-86cd-144a5d55dd0b","resolution":{"observed_at":"2026-08-11T11:37:46.119924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.104655Z","title":"Michael r. ngarey and david s. johnson. computers and intractability. a guide to the theory of np-completeness. w. h. freeman and company, san fran- cisco1979, x 338 pp.,","venue":null,"work_id":"49628762-b7fc-4c16-9784-65bd74096a41","year":1983},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.931753Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:1eb813d16fba9872724bbe85565a074b9eea2c0f77ae5277c0c89916a21953ba","observation_id":"16c449e5-b874-458d-895b-d3df3b372a17","resolution":{"observed_at":"2026-08-11T11:37:46.108861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.092561Z","title":"The np-completeness of the bandwidth minimization prob- lem,","venue":null,"work_id":"56d75111-fd4a-4d5c-94a1-d91780ad5294","year":1976},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.935377Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:ec3397ed9336d171561bebc1d0facd5c03424937735194cac35805b2639fb059","observation_id":"db6e9895-de0a-4829-b736-fa3bcd7aca24","resolution":{"observed_at":"2026-08-11T11:37:46.096737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.080520Z","title":"Some simplified np-complete problems,","venue":null,"work_id":"195b74ef-04d0-43a1-b603-cdb3bb1a0478","year":1974},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.938984Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:74367beb7fe8386bacf9286dfb301de87f03a5534d04ee14d391a3de07cdd2cb","observation_id":"09c948db-d71a-4a89-be1c-cc625103c518","resolution":{"observed_at":"2026-08-11T11:37:46.084772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.069117Z","title":"Some np-complete problems on graphs,","venue":null,"work_id":"e81bf298-e7be-4fce-a0f2-d4458924fa40","year":2011},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.942560Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:5a5b1fad94d6e1f69a9e893b1ebaeee21abe30dc6231591c05b06afa25f53c51","observation_id":"fd83df8e-a9e5-4c1e-a9f3-7a731567604e","resolution":{"observed_at":"2026-08-11T11:37:46.073131Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.056765Z","title":"Approximating treewidth, pathwidth, frontsize, and shortest elimination tree,","venue":null,"work_id":"e242acf1-316a-4e4d-a65f-43347e44c685","year":1995},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.946141Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:bd3d6c4074d862f2b0967299eda257b23b089605f01fce0a814cd260e6eb0a8a","observation_id":"563c702f-3e15-4c40-ad8e-44e5f820d0d8","resolution":{"observed_at":"2026-08-11T11:37:46.060756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.045880Z","title":"Minimizing buffer requirements for throughput con- strained parallel execution of synchronous dataflow graph,","venue":null,"work_id":"4f2eb139-dd7f-4a55-89df-4abf3fc004cf","year":2011},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.949766Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:26f8b693ace5843609e1985f72eaf0c0d0cfb7752a8b10b13f0dfc6813652b2d","observation_id":"f21e849c-4185-42a1-b492-bfa8d7a5ec8d","resolution":{"observed_at":"2026-08-11T11:37:46.049906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.033682Z","title":"A separator theorem for planar graphs,","venue":null,"work_id":"5dfa8a20-24bd-4ae9-8f84-1590fdb7a3b0","year":1979},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.953345Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:ff0c283d3e5fc4229a3318c6e00d3c408fb6b85f6ae18cd08c29dd5cf6d09a6c","observation_id":"df542263-0dba-4adf-91ab-09fe84bfe5c8","resolution":{"observed_at":"2026-08-11T11:37:46.038936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.021883Z","title":"A separator theorem for graphs of bounded genus,","venue":null,"work_id":"79a8ac09-7c9b-4cb8-9e00-51acc9ffc726","year":1984},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.957104Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:eb953cb3de7f74088e7167cb9e5e9bce97d5dc88213ce29fc4d5e27cc4672809","observation_id":"25f6ac3d-15d8-4ece-89d4-4ddfe6c80692","resolution":{"observed_at":"2026-08-11T11:37:46.025822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:46.010430Z","title":"A separator theorem for graphs with an excluded minor and its applications,","venue":null,"work_id":"b0a4fefb-141b-449b-a4d2-fdd16fb26fd3","year":1990},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.960714Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:62e846daa917392b02f458cdc5d69944bad4926c1a389f06ca1cb99d7c8d3515","observation_id":"aa31d039-301b-4bf3-981b-217033c04a2c","resolution":{"observed_at":"2026-08-11T11:37:46.014606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.996772Z","title":"Elsner, Graph partitioning-a survey","venue":null,"work_id":"0d784e69-53af-4b57-8b01-d6570d0cd310","year":1997},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.964312Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:ae7e50d4b3bcd15a0a1e9bebe5aec4378c25ef140cd44bfa8dfd1cd0260fced9","observation_id":"a5e3757b-99f9-45ec-b014-4fb86b154ac1","resolution":{"observed_at":"2026-08-11T11:37:46.000735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.984761Z","title":"Depth-first search and linear graph algorithms,","venue":null,"work_id":"f945d7cd-06c2-49f8-b4cf-80690ec4b16b","year":1972},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.967873Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:c32bc6978d0aa9c1a9b2e67e311da0cab4349248288669fa42e615107412f680","observation_id":"e8809bd1-99a7-4c64-affc-9a2445dd0e38","resolution":{"observed_at":"2026-08-11T11:37:45.989319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.971424Z","title":"A minimum linear arrangement algorithm for undirected trees,","venue":null,"work_id":"32259e52-54be-451e-8320-b95420f3fbce","year":1979},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.971317Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:c637b7e400b669298950fd118a40d08c6927b307f9d9cc1490f18c77341b145c","observation_id":"c7c45a65-17b3-4f38-b161-e08701852068","resolution":{"observed_at":"2026-08-11T11:37:45.976558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.960313Z","title":"Optimal linear ordering,","venue":null,"work_id":"9a8b42c1-f8f7-4169-a7fe-b90742b92202","year":1973},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.974946Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:bb252d9dd49a9b1058d84fa7b2a306981e8653993346124a7141f59bbf08bc54","observation_id":"67519b39-a465-4da9-8d36-13485dc708eb","resolution":{"observed_at":"2026-08-11T11:37:45.964183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.949335Z","title":"Searching and pebbling,","venue":null,"work_id":"6997bf10-3f18-4469-93fe-b92513103cec","year":1986},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.978668Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:e839a00ac1cb3ff0961294ae41840172faa54aada8fde4935352324c09abe416","observation_id":"1f9a3e71-e6ce-4207-8899-5e58643a8593","resolution":{"observed_at":"2026-08-11T11:37:45.952999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.938296Z","title":"The vertex separation number of a graph equals its path-width,","venue":null,"work_id":"8d95d50a-981d-4e07-a009-fb459323e7dd","year":1992},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.982037Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:c3bdd8813a2cf24a42467ddf38c40f862707ce3b44b33e1be96151c174e1cdf7","observation_id":"30bb9464-9fbb-48fb-aff3-4099e32a2ea3","resolution":{"observed_at":"2026-08-11T11:37:45.942287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.925605Z","title":"On search decision and the efficiency of polynomial-time algorithms,","venue":null,"work_id":"81df2983-2fd2-4e00-ba91-ba03f960a2f5","year":1989},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.985996Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:aa7b50ca23055a00bb0b5db66a2779303dbf82e099e54a0ff25a69cea3521f9a","observation_id":"b7c69cc0-9c56-45a8-a3f2-d981a556177d","resolution":{"observed_at":"2026-08-11T11:37:45.930161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.913891Z","title":"Min cut is np-complete for edge weighted trees,","venue":null,"work_id":"e05ef567-de2b-4d5d-9908-ed8c332fd504","year":1988},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.989224Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:a830e6d8729a874bd4ec4be605f03e995156afbe524a5ab09caaf1b3b90361a2","observation_id":"f791b258-5dae-488f-a3d6-659221596966","resolution":{"observed_at":"2026-08-11T11:37:45.918020Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.900039Z","title":"On straight-line representation of planar graphs,","venue":null,"work_id":"1aaf0988-24a9-48fa-86e8-11c6db5aac3d","year":1948},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.992959Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:3befa9bd4558db074d3204f624525bae55d400e29d41a729b0e1e02d7a6905f8","observation_id":"f20e7293-5c8b-44df-80c3-47861742b320","resolution":{"observed_at":"2026-08-11T11:37:45.904743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.887008Z","title":"Uniform object re- arrangement: From complete monotone primitives to efficient non-monotone in- 143 formed search,","venue":null,"work_id":"9229932a-d1a5-466b-8e6a-9f1a24220a02","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.996220Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:2ae0b24420dc642cdd30570bd46fae87b0089cf3a8f68f61245001e86112a03c","observation_id":"218c6fb7-894a-49ae-a41e-644adb428088","resolution":{"observed_at":"2026-08-11T11:37:45.891366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.876048Z","title":"Design and use paradigms for gazebo, an open-source multi-robot simulator,","venue":null,"work_id":"4ddd3f7d-84e6-45a1-8b24-3b3e34ce134f","year":2004},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:44.999295Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:801c064cc8678cd48067b59e3a01aeabacff3920b7dae9614a1075f8887337eb","observation_id":"5bf075da-af8e-4fee-add9-fa4f5b7e7702","resolution":{"observed_at":"2026-08-11T11:37:45.879739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.864927Z","title":"Gurobi Optimization, Gurobi optimizer reference manual, 2021","venue":null,"work_id":"14aa1ace-1e78-4dd4-9207-4efe8f0dc039","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.002956Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:b4fee14e06b4486b6c406841728a2801faee8e5029934f9f88c0d32530e37167","observation_id":"fff3f271-e0f9-424e-bdb0-aac6b01b3a45","resolution":{"observed_at":"2026-08-11T11:37:45.868898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.853816Z","title":"Bonnard et al., Chilitags 2: Robust fiducial markers for augmented reality and robotics","venue":null,"work_id":"3c643680-4023-43ea-822a-aa4489368e20","year":2013},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.006636Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:4adb3c3240b2875e36a88db62bcc566eba6134e6af4a67a997d7295f94c79f28","observation_id":"3b2dd2ac-6596-4d3a-aedc-0c9da59f5cf9","resolution":{"observed_at":"2026-08-11T11:37:45.857701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.842807Z","title":"Push planning for object place- ment on cluttered table surfaces,","venue":null,"work_id":"bf73ce07-0340-42cc-b6c6-931d0b1a4010","year":2011},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.011293Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:c62426ac7d247925f6a8e129450752e69e21e6c5e530ab74c83f48541ba80676","observation_id":"edb730e4-b980-4de1-a1a5-a3447ce5ceb3","resolution":{"observed_at":"2026-08-11T11:37:45.846737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.015439Z","title":"Minimizing running buffers for tabletop object rearrangement: Complexity, fast algorithms, and applications,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.015439Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:ac419308e05b6c4ea488a6e778ad90204f0d797fd8d1af9876c5d10956415cf5","observation_id":"cdc39ef5-1587-4f0e-bb60-9762aeb717cc","resolution":{"observed_at":"2026-08-11T11:37:45.015439Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.02814","last_updated":"2022-03-18T01:25:06Z","snapshot_observed_at":"2026-07-06T11:55:00.678191Z","submitted_at":"2021-10-06T14:42:21Z","title":"Efficient and High-quality Prehensile Rearrangement in Cluttered and Confined Spaces","version":2},"cited_work":{"arxiv_id":"2110.02814","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.02814","snapshot_observed_at":"2026-08-11T11:37:45.415590Z","title":"Efficient and High-quality Prehensile Rearrangement in Cluttered and Confined Spaces","venue":"cs.RO","work_id":"eff73ebe-0be0-417c-911d-4d9bd4b40c37","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.020249Z"},"links":{"cited_paper":"/paper/2110.02814","citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:01c6a63abb71e7c3fb7552de9772ec8b4e501633d931bfd71b79df274abc6013","observation_id":"7b4c3c68-c768-4e9f-93ab-ec00c76522f7","resolution":{"observed_at":"2026-08-11T11:37:45.420040Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.831326Z","title":"Planning and execut- ing navigation among movable obstacles,","venue":null,"work_id":"67579d71-e93a-4aef-a447-0d9e36c7e852","year":2007},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.024635Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:4d6633c7d9f49cbc82458b0d391a2e3d2da28caf0c751290a736d250b7f603f0","observation_id":"cda26cf7-9cac-4e7c-bbcc-e10be3e1c5b0","resolution":{"observed_at":"2026-08-11T11:37:45.835208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.818131Z","title":"Planning among movable obstacles with artificial constraints,","venue":null,"work_id":"fd395d3a-8d94-4030-ac7e-c2e2b4af171f","year":2008},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.028502Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:1cd08f1272ebd784dd59e35f0f246d5e73d96bac7d589b7790a6b133f6d1df61","observation_id":"ad5a448f-f000-4810-818b-12918a469bdd","resolution":{"observed_at":"2026-08-11T11:37:45.822571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.804206Z","title":"INVIGORATE: Interactive Visual Grounding and Grasping in Clutter,","venue":null,"work_id":"a3259cba-f3a1-4dc4-ad13-642f6401acc4","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.032580Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:17ef060e42ced3bca40efd0e817f0dda9a2a16f2f5e647fbb1a7f20b29f7cc88","observation_id":"710c66f9-cbe9-412a-ad4e-9e9b86700c72","resolution":{"observed_at":"2026-08-11T11:37:45.809245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.790374Z","title":"Unobservable monte carlo planning for nonprehensile rearrangement tasks,","venue":null,"work_id":"5380a3de-f657-4ca4-8c51-1d691d56c5f2","year":2017},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.036690Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:6949042ee7a913b2e7559e243a8c6317c52dbcc6dfd5d268b1a1977374f72e6f","observation_id":"17189ac4-2bf9-4977-b060-f2d33409169b","resolution":{"observed_at":"2026-08-11T11:37:45.795390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.779320Z","title":"Dipn: Deep interaction prediction network with application to clutter removal,","venue":null,"work_id":"7dc2f788-8803-4dbb-b487-077a66bf3a52","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.040528Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:1c9f7e9983fe1937f6a36f5f0d32d87d5a54eda5ccc7b6567f203600a9d1ec15","observation_id":"3c5ed354-a4f0-4b05-a7cf-f41ca2870cc4","resolution":{"observed_at":"2026-08-11T11:37:45.782826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.767413Z","title":"Monte-carlo tree search for efficient visually guided rearrangement planning,","venue":null,"work_id":"578d8168-3602-4bce-b6d1-7e4b7008703c","year":2020},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.044107Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:aaf8434ccb44b5cec9f437983612a82bc94de49d7a6ce94dc2c79242facfce18","observation_id":"2141c0ef-e8d6-41e4-8608-7a557ffc60c3","resolution":{"observed_at":"2026-08-11T11:37:45.771466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.756674Z","title":"Vision- driven compliant manipulation for reliable, high-precision assembly tasks,","venue":null,"work_id":"d7753384-c485-4935-9cb5-3462278e9b69","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.048219Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:a937d57c582ecc81ed70b67ecc31c1e08922a45f8285d5d226587499158ff237","observation_id":"63ce5dea-8e9e-4b8e-95ad-b659f1089b16","resolution":{"observed_at":"2026-08-11T11:37:45.760582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.09163","last_updated":"2022-02-25T20:09:44Z","snapshot_observed_at":"2026-07-06T11:49:17.554557Z","submitted_at":"2021-09-19T16:48:33Z","title":"CaTGrasp: Learning Category-Level Task-Relevant Grasping in Clutter from Simulation","version":2},"cited_work":{"arxiv_id":"2109.09163","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.09163","snapshot_observed_at":"2026-08-11T11:37:45.398653Z","title":"CaTGrasp: Learning Category-Level Task-Relevant Grasping in Clutter from Simulation","venue":"cs.RO","work_id":"dec41e07-245c-4dac-b59a-7991aca35a20","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.052161Z"},"links":{"cited_paper":"/paper/2109.09163","citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:de4512749b13623882a4f13ec58f1b182b503efe92c897a0193ee9f7b5f18162","observation_id":"16a76923-d4dc-46a3-ba95-6a4e3940f876","resolution":{"observed_at":"2026-08-11T11:37:45.403133Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.745509Z","title":"Environment manip- ulation planner for humanoid robots using task graph that generates action se- quence,","venue":null,"work_id":"f8c84c59-08e0-4eac-87e8-92f801f0b745","year":2004},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.055716Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:b90e9e74f65de79d7db323c4a846ceb2402884f230c2251d552c9b81c15e0390","observation_id":"93674898-02e9-4759-a617-eaeb7800e935","resolution":{"observed_at":"2026-08-11T11:37:45.749961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.733353Z","title":"Hierarchical decision theoretic planning for navigation among movable obstacles,","venue":null,"work_id":"fbdf12d0-1021-4f67-bc10-885754540004","year":2013},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.058844Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:a0d78ade5baa5ec7c9d14a892e11d79ac1de316ead562cff37abac7e708b4ad2","observation_id":"ded44211-fca1-488c-86fa-3cf8d714c00b","resolution":{"observed_at":"2026-08-11T11:37:45.737823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.722526Z","title":"Where to relocate?: Object rearrangement inside cluttered and confined environments for robotic manipula- tion,","venue":null,"work_id":"46ded232-c7aa-4cf2-81f9-88be1debd4c2","year":2020},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.061950Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:56181c501910f8565d803037cd781be8ddc16946bf20717a515f42e65e95d00c","observation_id":"b1d12777-3071-4c4c-8062-8f32b21e44dd","resolution":{"observed_at":"2026-08-11T11:37:45.726310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.711849Z","title":"Path planning using lazy prm,","venue":null,"work_id":"1e57176e-11ac-4949-9c1f-1549956cfd47","year":2000},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.066280Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:fcce5d042140274834bfd3a0d790755ac42cc9d3a70d86b6ae207475c63d2f32","observation_id":"e1b65ee3-dc2b-44c6-b228-f0f9c7e9ac60","resolution":{"observed_at":"2026-08-11T11:37:45.715451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.699045Z","title":"Lazy toggle prm: A single-query approach to motion planning,","venue":null,"work_id":"b14612b7-5ffb-4483-a23f-d043f5eec7ee","year":2013},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.069742Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:a38992b92c2cbfa5b6df96be14fa0e0fc01febd1a2d783353e3939797ba0adc9","observation_id":"80919e29-a03d-4c85-a7df-1af8120279cb","resolution":{"observed_at":"2026-08-11T11:37:45.703301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.687572Z","title":"Lazy collision checking in asymptotically-optimal motion planning,","venue":null,"work_id":"e1912ffa-a55d-46e0-9bff-3bd9ad381170","year":2015},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.073583Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:a74ac04f824f9b31d25e312d6d86083d67ec4b2f2ddb70c5f4df3154b6f5bda4","observation_id":"f72bfeda-62d2-49d4-83ef-1704f51ab536","resolution":{"observed_at":"2026-08-11T11:37:45.691705Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.675311Z","title":"Mathematical model and efficient al- gorithms for object packing problem,","venue":null,"work_id":"8761dc4c-36a4-462b-9267-a41e20e5da18","year":2010},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.078370Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:2b26f8afbcd9baa1caf0cc990bc3dc6e9ad99e893891535ebc00698c8e0a2e74","observation_id":"cc68b376-3f45-4106-aeec-92175460c3eb","resolution":{"observed_at":"2026-08-11T11:37:45.679530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.662738Z","title":"Fast, high-quality dual- arm rearrangement in synchronous, monotone tabletop setups,","venue":null,"work_id":"9c534dc6-f931-4fa6-8736-236b9e5d8452","year":2020},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.082375Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:35860b65735b2be069741ed2038f75a3974ac34ccb8479dc4c3e1f4736107180","observation_id":"834f38e4-b08e-4cea-8675-f3fd0f974427","resolution":{"observed_at":"2026-08-11T11:37:45.666871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.651952Z","title":"Fast high-quality tabletop rear- rangement in bounded workspace,","venue":null,"work_id":"69cfdf2e-acb9-419f-b22c-0e545eb6d365","year":2022},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.085986Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:5f747c48132e380228cbb02eff1e090ac7882d6a3496958563d3617da1ed68d3","observation_id":"ba6e0d42-9d6e-44fe-831d-9dcb98c51e9d","resolution":{"observed_at":"2026-08-11T11:37:45.656018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.640215Z","title":"Rearrangement on lattices with pic-n-swaps: Optimality structures and effi- cient algorithms,","venue":null,"work_id":"55f522f9-6330-4367-b94f-33e872adb434","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.089915Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:f72b13b3015dc27dfff23a82310f60cab3032f95612f598611ed19743d571bc5","observation_id":"983fe685-76f1-459b-b3a7-ea294f314563","resolution":{"observed_at":"2026-08-11T11:37:45.644458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.09127","last_updated":"2020-05-18T22:55:50Z","snapshot_observed_at":"2026-08-09T16:44:47.255272Z","submitted_at":"2020-05-18T22:55:50Z","title":"Synchronized Multi-Arm Rearrangement Guided by Mode Graphs with Capacity Constraints","version":1},"cited_work":{"arxiv_id":"2005.09127","doi":null,"metadata_source":"pith","pith_arxiv_id":"2005.09127","snapshot_observed_at":"2026-08-11T11:37:45.382188Z","title":"Synchronized Multi-Arm Rearrangement Guided by Mode Graphs with Capacity Constraints","venue":"cs.RO","work_id":"8f1e2ca2-5960-47d0-8436-c4369a5837d2","year":2020},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.093580Z"},"links":{"cited_paper":"/paper/2005.09127","citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:f970b65b86fa2fc179d5de9d948f01eb824d97c34ec1e003706c49694ca24813","observation_id":"12031ac8-7e6b-4496-b420-83e24b37d723","resolution":{"observed_at":"2026-08-11T11:37:45.386405Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.628133Z","title":"Fast, high-quality two- arm rearrangement in synchronous, monotone tabletop setups,","venue":null,"work_id":"160bcf5b-1691-4149-a3cb-f2f25f905c24","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.097825Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:ceb4c7e57e8d35a9b08fc6ac981a083f8570a4837d376da734988ce5c6170723","observation_id":"e3024ea9-ff1c-4b63-86b6-ad1b6e559ee5","resolution":{"observed_at":"2026-08-11T11:37:45.632592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.17274","last_updated":"2023-11-03T17:49:03Z","snapshot_observed_at":"2026-08-09T12:21:37.584649Z","submitted_at":"2023-10-26T09:50:40Z","title":"cuRobo: Parallelized Collision-Free Minimum-Jerk Robot Motion Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.17274","snapshot_observed_at":"2026-08-11T11:37:45.101874Z","title":"Curobo: Parallelized collision-free minimum-jerk robot motion generation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.101874Z"},"links":{"cited_paper":"/paper/2310.17274","citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:abc69befdae6ac5d85992294d41f7d98a30e6116281a3cd02574998ab9951775","observation_id":"d4007665-ee09-4ced-983d-d0a119150dab","resolution":{"observed_at":"2026-08-11T11:37:45.101874Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.12325","last_updated":"2021-10-24T01:35:51Z","snapshot_observed_at":"2026-07-06T12:01:00.920610Z","submitted_at":"2021-10-24T01:35:51Z","title":"Fast High-Quality Tabletop Rearrangement in Bounded Workspace","version":1},"cited_work":{"arxiv_id":"2110.12325","doi":null,"metadata_source":"pith","pith_arxiv_id":"2110.12325","snapshot_observed_at":"2026-08-11T11:37:45.356176Z","title":"Fast High-Quality Tabletop Rearrangement in Bounded Workspace","venue":"cs.RO","work_id":"7c950c0d-9d39-4108-9789-79c492f54935","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.105931Z"},"links":{"cited_paper":"/paper/2110.12325","citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:f92ffdb93abf540d9fffc961a3054acc8ed121e446ce1673814267b585e956cb","observation_id":"b3d2dcc9-9cb5-4d72-8eab-acbb9b2481fe","resolution":{"observed_at":"2026-08-11T11:37:45.360601Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.01426","last_updated":"2022-03-23T20:24:52Z","snapshot_observed_at":"2026-08-05T07:24:04.568920Z","submitted_at":"2022-02-03T05:58:46Z","title":"Interleaving Monte Carlo Tree Search and Self-Supervised Learning for Object Retrieval in Clutter","version":3},"cited_work":{"arxiv_id":"2202.01426","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.01426","snapshot_observed_at":"2026-08-11T11:37:45.340366Z","title":"Interleaving Monte Carlo Tree Search and Self-Supervised Learning for Object Retrieval in Clutter","venue":"cs.RO","work_id":"97930b64-d6f1-4e5f-a52e-b7f601355584","year":2022},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.110066Z"},"links":{"cited_paper":"/paper/2202.01426","citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:41ea70f508a6d4820c627f139ac8a128db47ed5beb44efdd84a55a579e27916e","observation_id":"e5ab040f-6450-4039-bd9a-a89f548b40ec","resolution":{"observed_at":"2026-08-11T11:37:45.344557Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.15220","last_updated":"2021-09-30T15:45:30Z","snapshot_observed_at":"2026-08-10T09:07:20.883342Z","submitted_at":"2021-09-30T15:45:30Z","title":"Coordination of two robotic manipulators for object retrieval in clutter","version":1},"cited_work":{"arxiv_id":"2109.15220","doi":null,"metadata_source":"pith","pith_arxiv_id":"2109.15220","snapshot_observed_at":"2026-08-11T11:37:45.325603Z","title":"Coordination of two robotic manipulators for object retrieval in clutter","venue":"cs.RO","work_id":"5d8a6faa-eaf3-409f-a29f-11f01c293265","year":2021},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.114201Z"},"links":{"cited_paper":"/paper/2109.15220","citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:c24864f070098d0e19d9e094c6160c6322837e8d7320a99a8c9a05c943393bf9","observation_id":"4b0ac705-6045-4a1c-ab65-13b754dd226e","resolution":{"observed_at":"2026-08-11T11:37:45.329391Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-11T11:37:45.615150Z","title":"Enhancing optimal feeder assignment of the multi- head surface mounting machine using genetic algorithms,","venue":null,"work_id":"9304e58c-bdfd-4f94-ad47-fd8dc426e65f","year":2008},"citing_paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions","version":2},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-11T11:37:45.118457Z"},"links":{"citing_paper":"/paper/2412.15398"},"observation_digest":"sha256:616269166b4192e7915fc0ff10798638cfdde9904726ef0ebf7517340ad219a1","observation_id":"1e87aa2b-ff21-4395-b35d-6cc8b7db346e","resolution":{"observed_at":"2026-08-11T11:37:45.620042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.15398","last_updated":"2025-01-31T14:28:46Z","latest_version":2,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-11T11:25:49.276661Z","submitted_at":"2024-12-19T21:03:56Z","title":"Tabletop Object Rearrangement: Structure, Complexity, and Efficient Combinatorial Search-Based Solutions"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":43,"verified_exact":8,"verified_fuzzy":49},"total_outbound_references":120},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 100 of 120 outbound references and 0 inbound Pith citation observations for arXiv:2412.15398."}