{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FLVBLG3SE2U33TU6SRBPMJHONU","short_pith_number":"pith:FLVBLG3S","schema_version":"1.0","canonical_sha256":"2aea159b7226a9bdce9e9442f624ee6d1ee014b50eef0b56dd85b05ad0a19856","source":{"kind":"arxiv","id":"2304.08246","version":1},"attestation_state":"computed","paper":{"title":"Base Placement Optimization for Coverage Mobile Manipulation Tasks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Huiwen Zhang, Kai Mi, Zhijun Zhang","submitted_at":"2023-04-17T13:04:44Z","abstract_excerpt":"Base placement optimization (BPO) is a fundamental capability for mobile manipulation and has been researched for decades. However, it is still very challenging for some reasons. First, compared with humans, current robots are extremely inflexible, and therefore have higher requirements on the accuracy of base placements (BPs). Second, the BP and task constraints are coupled with each other. The optimal BP depends on the task constraints, and in BP will affect task constraints in turn. More tricky is that some task constraints are flexible and non-deterministic. Third, except for fulfilling ta"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2304.08246","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2023-04-17T13:04:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"de3c2c407a0151d063a015a40f7c60bfbc8ab5a96e56a529708670a86edc80f1","abstract_canon_sha256":"ccc2f2c9f89e9d7e57b288adf029fc2daabc9e6532c232e13c930f5cd5053de0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:41.174963Z","signature_b64":"RZLkkIFkCfB6Qw6vV+F/Q1EbLdOeX+ypFHXnYVe3Wb9X1yteeGuhr7EKheUglSbUzAE+wehAXQuY5hYGQ/PtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2aea159b7226a9bdce9e9442f624ee6d1ee014b50eef0b56dd85b05ad0a19856","last_reissued_at":"2026-07-05T06:01:41.174628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:41.174628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Base Placement Optimization for Coverage Mobile Manipulation Tasks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Huiwen Zhang, Kai Mi, Zhijun Zhang","submitted_at":"2023-04-17T13:04:44Z","abstract_excerpt":"Base placement optimization (BPO) is a fundamental capability for mobile manipulation and has been researched for decades. However, it is still very challenging for some reasons. First, compared with humans, current robots are extremely inflexible, and therefore have higher requirements on the accuracy of base placements (BPs). Second, the BP and task constraints are coupled with each other. The optimal BP depends on the task constraints, and in BP will affect task constraints in turn. More tricky is that some task constraints are flexible and non-deterministic. Third, except for fulfilling ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.08246","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.08246/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2304.08246","created_at":"2026-07-05T06:01:41.174684+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.08246v1","created_at":"2026-07-05T06:01:41.174684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.08246","created_at":"2026-07-05T06:01:41.174684+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLVBLG3SE2U3","created_at":"2026-07-05T06:01:41.174684+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLVBLG3SE2U33TU6","created_at":"2026-07-05T06:01:41.174684+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLVBLG3S","created_at":"2026-07-05T06:01:41.174684+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.13151","citing_title":"Manipulate-to-Navigate: Reinforcement Learning with Visual Affordances and Manipulability Priors","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FLVBLG3SE2U33TU6SRBPMJHONU","json":"https://pith.science/pith/FLVBLG3SE2U33TU6SRBPMJHONU.json","graph_json":"https://pith.science/api/pith-number/FLVBLG3SE2U33TU6SRBPMJHONU/graph.json","events_json":"https://pith.science/api/pith-number/FLVBLG3SE2U33TU6SRBPMJHONU/events.json","paper":"https://pith.science/paper/FLVBLG3S"},"agent_actions":{"view_html":"https://pith.science/pith/FLVBLG3SE2U33TU6SRBPMJHONU","download_json":"https://pith.science/pith/FLVBLG3SE2U33TU6SRBPMJHONU.json","view_paper":"https://pith.science/paper/FLVBLG3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.08246&json=true","fetch_graph":"https://pith.science/api/pith-number/FLVBLG3SE2U33TU6SRBPMJHONU/graph.json","fetch_events":"https://pith.science/api/pith-number/FLVBLG3SE2U33TU6SRBPMJHONU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLVBLG3SE2U33TU6SRBPMJHONU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLVBLG3SE2U33TU6SRBPMJHONU/action/storage_attestation","attest_author":"https://pith.science/pith/FLVBLG3SE2U33TU6SRBPMJHONU/action/author_attestation","sign_citation":"https://pith.science/pith/FLVBLG3SE2U33TU6SRBPMJHONU/action/citation_signature","submit_replication":"https://pith.science/pith/FLVBLG3SE2U33TU6SRBPMJHONU/action/replication_record"}},"created_at":"2026-07-05T06:01:41.174684+00:00","updated_at":"2026-07-05T06:01:41.174684+00:00"}