{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7MUQCTLKBM2QCE22FJJK77LSEZ","short_pith_number":"pith:7MUQCTLK","schema_version":"1.0","canonical_sha256":"fb29014d6a0b3501135a2a52affd72265f71503e2ca67806b7a2ac32770d9edb","source":{"kind":"arxiv","id":"2209.09116","version":3},"attestation_state":"computed","paper":{"title":"Trolley Optimisation for Loading Printed Circuit Board Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CE","authors_text":"Ajith Kumar Parlikad, Alexandra Brintrup, Mark Bass, Vinod Kumar Chauhan","submitted_at":"2022-09-19T15:38:14Z","abstract_excerpt":"A trolley is a container for loading printed circuit board (PCB) components, and a trolley optimisation problem (TOP) is an assignment of PCB components to trolleys for use in the production of a set of PCBs in an assembly line. In this paper, we introduce the TOP, a novel operation research application. To formulate the TOP, we derive a novel extension of the bin packing problem. We exploit the problem structure to decompose the TOP into two smaller, identical, and independent problems. Further, we develop a mixed integer linear programming model to solve the TOP and prove that the TOP is an "},"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":"2209.09116","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2022-09-19T15:38:14Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"6dc2b20c73ca1ad898624050adb6b5a67ba74c26d0b10db8365ebef1faa1c777","abstract_canon_sha256":"9f185400cf4a87335d29c0bda235f9c8316080fc2b5e22a68b071329626431a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:50.970414Z","signature_b64":"FkOpLZ7bvETwlTGzynmS0tF/uHbaadhj5c6tvYTHK+v3fWqLDoF/Rq/qtZTMIF91ixz8W3MMJZStu3t1QQV+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb29014d6a0b3501135a2a52affd72265f71503e2ca67806b7a2ac32770d9edb","last_reissued_at":"2026-07-05T09:55:50.969981Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:50.969981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trolley Optimisation for Loading Printed Circuit Board Components","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CE","authors_text":"Ajith Kumar Parlikad, Alexandra Brintrup, Mark Bass, Vinod Kumar Chauhan","submitted_at":"2022-09-19T15:38:14Z","abstract_excerpt":"A trolley is a container for loading printed circuit board (PCB) components, and a trolley optimisation problem (TOP) is an assignment of PCB components to trolleys for use in the production of a set of PCBs in an assembly line. In this paper, we introduce the TOP, a novel operation research application. To formulate the TOP, we derive a novel extension of the bin packing problem. We exploit the problem structure to decompose the TOP into two smaller, identical, and independent problems. Further, we develop a mixed integer linear programming model to solve the TOP and prove that the TOP is an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.09116","kind":"arxiv","version":3},"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/2209.09116/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":"2209.09116","created_at":"2026-07-05T09:55:50.970033+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.09116v3","created_at":"2026-07-05T09:55:50.970033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.09116","created_at":"2026-07-05T09:55:50.970033+00:00"},{"alias_kind":"pith_short_12","alias_value":"7MUQCTLKBM2Q","created_at":"2026-07-05T09:55:50.970033+00:00"},{"alias_kind":"pith_short_16","alias_value":"7MUQCTLKBM2QCE22","created_at":"2026-07-05T09:55:50.970033+00:00"},{"alias_kind":"pith_short_8","alias_value":"7MUQCTLK","created_at":"2026-07-05T09:55:50.970033+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7MUQCTLKBM2QCE22FJJK77LSEZ","json":"https://pith.science/pith/7MUQCTLKBM2QCE22FJJK77LSEZ.json","graph_json":"https://pith.science/api/pith-number/7MUQCTLKBM2QCE22FJJK77LSEZ/graph.json","events_json":"https://pith.science/api/pith-number/7MUQCTLKBM2QCE22FJJK77LSEZ/events.json","paper":"https://pith.science/paper/7MUQCTLK"},"agent_actions":{"view_html":"https://pith.science/pith/7MUQCTLKBM2QCE22FJJK77LSEZ","download_json":"https://pith.science/pith/7MUQCTLKBM2QCE22FJJK77LSEZ.json","view_paper":"https://pith.science/paper/7MUQCTLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.09116&json=true","fetch_graph":"https://pith.science/api/pith-number/7MUQCTLKBM2QCE22FJJK77LSEZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7MUQCTLKBM2QCE22FJJK77LSEZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7MUQCTLKBM2QCE22FJJK77LSEZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7MUQCTLKBM2QCE22FJJK77LSEZ/action/storage_attestation","attest_author":"https://pith.science/pith/7MUQCTLKBM2QCE22FJJK77LSEZ/action/author_attestation","sign_citation":"https://pith.science/pith/7MUQCTLKBM2QCE22FJJK77LSEZ/action/citation_signature","submit_replication":"https://pith.science/pith/7MUQCTLKBM2QCE22FJJK77LSEZ/action/replication_record"}},"created_at":"2026-07-05T09:55:50.970033+00:00","updated_at":"2026-07-05T09:55:50.970033+00:00"}