{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EEYFLWWTBRMQB5UWED2LM5VX5Z","short_pith_number":"pith:EEYFLWWT","canonical_record":{"source":{"id":"1708.04127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-14T14:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"0806146b4c0ead0e8461cc731060172cfd6bc67b3da60554a578e54d0224aba7","abstract_canon_sha256":"6b16b934dcb4f9c099778f5b194f4bb46895a60f0f2ff888190358d85e4895eb"},"schema_version":"1.0"},"canonical_sha256":"213055dad30c5900f69620f4b676b7ee72ee72c06c129d258e80e0d48e3cdb70","source":{"kind":"arxiv","id":"1708.04127","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04127","created_at":"2026-05-18T00:36:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04127v3","created_at":"2026-05-18T00:36:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04127","created_at":"2026-05-18T00:36:08Z"},{"alias_kind":"pith_short_12","alias_value":"EEYFLWWTBRMQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEYFLWWTBRMQB5UW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEYFLWWT","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EEYFLWWTBRMQB5UWED2LM5VX5Z","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04127","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-14T14:08:46Z","cross_cats_sorted":[],"title_canon_sha256":"0806146b4c0ead0e8461cc731060172cfd6bc67b3da60554a578e54d0224aba7","abstract_canon_sha256":"6b16b934dcb4f9c099778f5b194f4bb46895a60f0f2ff888190358d85e4895eb"},"schema_version":"1.0"},"canonical_sha256":"213055dad30c5900f69620f4b676b7ee72ee72c06c129d258e80e0d48e3cdb70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:08.305384Z","signature_b64":"SLszNUCI4xuqnMAjdj6QsJtZLwA3/q5S6qqYU5ddOmefJ1fYracZcAK2dHiZbvpM/8wAihRrh+ENCDdInNTqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"213055dad30c5900f69620f4b676b7ee72ee72c06c129d258e80e0d48e3cdb70","last_reissued_at":"2026-05-18T00:36:08.304696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:08.304696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04127","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfLnvMxJ3S+86wtExPKSM58pNA4DGYrd2mNJQgycQh+120NnHvJIbS/tevv645U1KMh1m+MF6fJzri/pL97dBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:43:22.302287Z"},"content_sha256":"5d825cacdc0b4540ac82db952a40717cff3a02508ab03e8b771e5f85ac8752fa","schema_version":"1.0","event_id":"sha256:5d825cacdc0b4540ac82db952a40717cff3a02508ab03e8b771e5f85ac8752fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EEYFLWWTBRMQB5UWED2LM5VX5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A branch, price and remember algorithm for the U shaped assembly line balancing problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abdolmajid Yolmeh, Najmeh Salehi","submitted_at":"2017-08-14T14:08:46Z","abstract_excerpt":"In this paper we propose a branch, price and remember algorithm to solve the U shaped assembly line balancing problem. Our proposed algorithm uses a column generation approach to obtain tight lower bounds for this problem. It also stores generated columns in memory to enhance the speed of column generation approach. We also develop a modification of Hoffman algorithm to obtain high quality upper bounds. Our computational results show that our proposed algorithm is able to optimally solve 255 of Scholl's well-known 269 benchmark problems. Previous best known exact algorithm, ULINO, is able to s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04127","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZGvPTW9XPyUKnnttHnTVoMBV2aSgStrEnE7pWh6V6HM00mSiCPDaaebonM67SkxfSXyZdi0r4x/4+6hUgGcLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:43:22.302643Z"},"content_sha256":"0a1829ba093653ff907739ba9957be4f8c50fcd8340f28dff40f0fa1bc9b2239","schema_version":"1.0","event_id":"sha256:0a1829ba093653ff907739ba9957be4f8c50fcd8340f28dff40f0fa1bc9b2239"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/bundle.json","state_url":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T20:43:22Z","links":{"resolver":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z","bundle":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/bundle.json","state":"https://pith.science/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEYFLWWTBRMQB5UWED2LM5VX5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EEYFLWWTBRMQB5UWED2LM5VX5Z","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":"6b16b934dcb4f9c099778f5b194f4bb46895a60f0f2ff888190358d85e4895eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-14T14:08:46Z","title_canon_sha256":"0806146b4c0ead0e8461cc731060172cfd6bc67b3da60554a578e54d0224aba7"},"schema_version":"1.0","source":{"id":"1708.04127","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04127","created_at":"2026-05-18T00:36:08Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04127v3","created_at":"2026-05-18T00:36:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04127","created_at":"2026-05-18T00:36:08Z"},{"alias_kind":"pith_short_12","alias_value":"EEYFLWWTBRMQ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEYFLWWTBRMQB5UW","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEYFLWWT","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:0a1829ba093653ff907739ba9957be4f8c50fcd8340f28dff40f0fa1bc9b2239","target":"graph","created_at":"2026-05-18T00:36:08Z","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"},"paper":{"abstract_excerpt":"In this paper we propose a branch, price and remember algorithm to solve the U shaped assembly line balancing problem. Our proposed algorithm uses a column generation approach to obtain tight lower bounds for this problem. It also stores generated columns in memory to enhance the speed of column generation approach. We also develop a modification of Hoffman algorithm to obtain high quality upper bounds. Our computational results show that our proposed algorithm is able to optimally solve 255 of Scholl's well-known 269 benchmark problems. Previous best known exact algorithm, ULINO, is able to s","authors_text":"Abdolmajid Yolmeh, Najmeh Salehi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-14T14:08:46Z","title":"A branch, price and remember algorithm for the U shaped assembly line balancing problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04127","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:5d825cacdc0b4540ac82db952a40717cff3a02508ab03e8b771e5f85ac8752fa","target":"record","created_at":"2026-05-18T00:36:08Z","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":"6b16b934dcb4f9c099778f5b194f4bb46895a60f0f2ff888190358d85e4895eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-14T14:08:46Z","title_canon_sha256":"0806146b4c0ead0e8461cc731060172cfd6bc67b3da60554a578e54d0224aba7"},"schema_version":"1.0","source":{"id":"1708.04127","kind":"arxiv","version":3}},"canonical_sha256":"213055dad30c5900f69620f4b676b7ee72ee72c06c129d258e80e0d48e3cdb70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"213055dad30c5900f69620f4b676b7ee72ee72c06c129d258e80e0d48e3cdb70","first_computed_at":"2026-05-18T00:36:08.304696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:08.304696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SLszNUCI4xuqnMAjdj6QsJtZLwA3/q5S6qqYU5ddOmefJ1fYracZcAK2dHiZbvpM/8wAihRrh+ENCDdInNTqCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:08.305384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04127","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d825cacdc0b4540ac82db952a40717cff3a02508ab03e8b771e5f85ac8752fa","sha256:0a1829ba093653ff907739ba9957be4f8c50fcd8340f28dff40f0fa1bc9b2239"],"state_sha256":"914b0cd2f5f249ab8cf06e563224fee9e58d0740cdbe6b8e66ce545806a85c4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"munDAGQKO+2TRX+Ky/PPCDDeULVD373chnMaZB7u+3r3UaTuSVgfBwr1vj42pcpz+tTvVUPr+MJ7MhygUdDRAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:43:22.304484Z","bundle_sha256":"8d568077562af8d2b11a86521279bca9684cf845d989db33c829f0cba03f58ab"}}