{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7MUQCTLKBM2QCE22FJJK77LSEZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9f185400cf4a87335d29c0bda235f9c8316080fc2b5e22a68b071329626431a7","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2022-09-19T15:38:14Z","title_canon_sha256":"6dc2b20c73ca1ad898624050adb6b5a67ba74c26d0b10db8365ebef1faa1c777"},"schema_version":"1.0","source":{"id":"2209.09116","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.09116","created_at":"2026-07-05T09:55:50Z"},{"alias_kind":"arxiv_version","alias_value":"2209.09116v3","created_at":"2026-07-05T09:55:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.09116","created_at":"2026-07-05T09:55:50Z"},{"alias_kind":"pith_short_12","alias_value":"7MUQCTLKBM2Q","created_at":"2026-07-05T09:55:50Z"},{"alias_kind":"pith_short_16","alias_value":"7MUQCTLKBM2QCE22","created_at":"2026-07-05T09:55:50Z"},{"alias_kind":"pith_short_8","alias_value":"7MUQCTLK","created_at":"2026-07-05T09:55:50Z"}],"graph_snapshots":[{"event_id":"sha256:1a9062d27d674d7daa1d69d98e4c6e37a886b733c8a86d00342637a3f7b34429","target":"graph","created_at":"2026-07-05T09:55:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.09116/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Ajith Kumar Parlikad, Alexandra Brintrup, Mark Bass, Vinod Kumar Chauhan","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2022-09-19T15:38:14Z","title":"Trolley Optimisation for Loading Printed Circuit Board Components"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.09116","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e4786246cac9d6f37319021498d60e7c03d4c2f4aa49f04d5f033274c15e9829","target":"record","created_at":"2026-07-05T09:55:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9f185400cf4a87335d29c0bda235f9c8316080fc2b5e22a68b071329626431a7","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2022-09-19T15:38:14Z","title_canon_sha256":"6dc2b20c73ca1ad898624050adb6b5a67ba74c26d0b10db8365ebef1faa1c777"},"schema_version":"1.0","source":{"id":"2209.09116","kind":"arxiv","version":3}},"canonical_sha256":"fb29014d6a0b3501135a2a52affd72265f71503e2ca67806b7a2ac32770d9edb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb29014d6a0b3501135a2a52affd72265f71503e2ca67806b7a2ac32770d9edb","first_computed_at":"2026-07-05T09:55:50.969981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:55:50.969981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FkOpLZ7bvETwlTGzynmS0tF/uHbaadhj5c6tvYTHK+v3fWqLDoF/Rq/qtZTMIF91ixz8W3MMJZStu3t1QQV+AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:55:50.970414Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.09116","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4786246cac9d6f37319021498d60e7c03d4c2f4aa49f04d5f033274c15e9829","sha256:1a9062d27d674d7daa1d69d98e4c6e37a886b733c8a86d00342637a3f7b34429"],"state_sha256":"d84d83ee93ac4e4ea55a154f7fd8b873dbad116a2e76dbbcf19ea0de921e8d4d"}