{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5NZSELEJMM23XSPJCR2EPM4ZVV","short_pith_number":"pith:5NZSELEJ","schema_version":"1.0","canonical_sha256":"eb73222c896335bbc9e9147447b399ad6f1fc79d6016fcf8ae953b740f833b5a","source":{"kind":"arxiv","id":"2401.01817","version":1},"attestation_state":"computed","paper":{"title":"Many-Objective-Optimized Semi-Automated Robotic Disassembly Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Genichiro Matsuda, Kensuke Harada, Naoya Miyaji, Takuya Kiyokawa, Tomoki Ishikura, Weiwei Wan","submitted_at":"2024-01-03T16:20:11Z","abstract_excerpt":"This study tasckles the problem of many-objective sequence optimization for semi-automated robotic disassembly operations. To this end, we employ a many-objective genetic algorithm (MaOGA) algorithm inspired by the Non-dominated Sorting Genetic Algorithm (NSGA)-III, along with robotic-disassembly-oriented constraints and objective functions derived from geometrical and robot simulations using 3-dimensional (3D) geometrical information stored in a 3D Computer-Aided Design (CAD) model of the target product. The MaOGA begins by generating a set of initial chromosomes based on a contact and connec"},"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":"2401.01817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-01-03T16:20:11Z","cross_cats_sorted":[],"title_canon_sha256":"9266c346653bd77d07ff9f49afb17b45308e9d9e06b5d830066a683336af3adb","abstract_canon_sha256":"0173c8e7cc79ba72273b796c5930fda579ca9c6c31e16d70c1765832144c85c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:57.796957Z","signature_b64":"7o6oQN4vkqB2REXqznM73gU6twqklhFAF+3X0bPtwWuibEykprNNWWvRD838ehtk+q9AYYeEc/ZfZNLTwBlZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb73222c896335bbc9e9147447b399ad6f1fc79d6016fcf8ae953b740f833b5a","last_reissued_at":"2026-07-05T07:29:57.796531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:57.796531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Many-Objective-Optimized Semi-Automated Robotic Disassembly Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Genichiro Matsuda, Kensuke Harada, Naoya Miyaji, Takuya Kiyokawa, Tomoki Ishikura, Weiwei Wan","submitted_at":"2024-01-03T16:20:11Z","abstract_excerpt":"This study tasckles the problem of many-objective sequence optimization for semi-automated robotic disassembly operations. To this end, we employ a many-objective genetic algorithm (MaOGA) algorithm inspired by the Non-dominated Sorting Genetic Algorithm (NSGA)-III, along with robotic-disassembly-oriented constraints and objective functions derived from geometrical and robot simulations using 3-dimensional (3D) geometrical information stored in a 3D Computer-Aided Design (CAD) model of the target product. The MaOGA begins by generating a set of initial chromosomes based on a contact and connec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.01817","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/2401.01817/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":"2401.01817","created_at":"2026-07-05T07:29:57.796587+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.01817v1","created_at":"2026-07-05T07:29:57.796587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.01817","created_at":"2026-07-05T07:29:57.796587+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NZSELEJMM23","created_at":"2026-07-05T07:29:57.796587+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NZSELEJMM23XSPJ","created_at":"2026-07-05T07:29:57.796587+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NZSELEJ","created_at":"2026-07-05T07:29:57.796587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.05937","citing_title":"Affordance-Guided Dual-Armed Disassembly Teleoperation for Mating Parts","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5NZSELEJMM23XSPJCR2EPM4ZVV","json":"https://pith.science/pith/5NZSELEJMM23XSPJCR2EPM4ZVV.json","graph_json":"https://pith.science/api/pith-number/5NZSELEJMM23XSPJCR2EPM4ZVV/graph.json","events_json":"https://pith.science/api/pith-number/5NZSELEJMM23XSPJCR2EPM4ZVV/events.json","paper":"https://pith.science/paper/5NZSELEJ"},"agent_actions":{"view_html":"https://pith.science/pith/5NZSELEJMM23XSPJCR2EPM4ZVV","download_json":"https://pith.science/pith/5NZSELEJMM23XSPJCR2EPM4ZVV.json","view_paper":"https://pith.science/paper/5NZSELEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.01817&json=true","fetch_graph":"https://pith.science/api/pith-number/5NZSELEJMM23XSPJCR2EPM4ZVV/graph.json","fetch_events":"https://pith.science/api/pith-number/5NZSELEJMM23XSPJCR2EPM4ZVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NZSELEJMM23XSPJCR2EPM4ZVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NZSELEJMM23XSPJCR2EPM4ZVV/action/storage_attestation","attest_author":"https://pith.science/pith/5NZSELEJMM23XSPJCR2EPM4ZVV/action/author_attestation","sign_citation":"https://pith.science/pith/5NZSELEJMM23XSPJCR2EPM4ZVV/action/citation_signature","submit_replication":"https://pith.science/pith/5NZSELEJMM23XSPJCR2EPM4ZVV/action/replication_record"}},"created_at":"2026-07-05T07:29:57.796587+00:00","updated_at":"2026-07-05T07:29:57.796587+00:00"}