{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RBYGQHCBK64IZMP7ZJA5AW4ZDU","short_pith_number":"pith:RBYGQHCB","schema_version":"1.0","canonical_sha256":"8870681c4157b88cb1ffca41d05b991d1dc0142335d7ad80c162b4a4052bc89c","source":{"kind":"arxiv","id":"1607.01104","version":2},"attestation_state":"computed","paper":{"title":"A study of the Bienstock-Zuckerberg algorithm, Applications in Mining and Resource Constrained Project Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Espinoza, Eduardo Moreno, Gonzalo Mu\\~noz, Marcos Goycoolea, Maurice Queyranne, Orlando Rivera","submitted_at":"2016-07-05T03:51:55Z","abstract_excerpt":"We study a Lagrangian decomposition algorithm recently proposed by Dan Bienstock and Mark Zuckerberg for solving the LP relaxation of a class of open pit mine project scheduling problems. In this study we show that the Bienstock-Zuckerberg (BZ) algorithm can be used to solve LP relaxations corresponding to a much broader class of scheduling problems, including the well-known Resource Constrained Project Scheduling Problem (RCPSP), and multi-modal variants of the RCPSP that consider batch processing of jobs. We present a new, intuitive proof of correctness for the BZ algorithm that works by cas"},"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":"1607.01104","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-05T03:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"a7a1cfa3e126aec08efa50c206eadde8d126fdacd544db037e9d7fe07de8599e","abstract_canon_sha256":"632545a96ff0b9422738a6bbbe49b7ebf62bb15f0e5654e9fe3a921516c36bf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:49.309278Z","signature_b64":"Vu1aSH0cRMgyw3TbtgEm5GTJmg1ZQSPWpU/0vOZtD+Oao30UYwIQ8XRW4k3TvcX5bgb26OWcuFQ0EOEZzyQGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8870681c4157b88cb1ffca41d05b991d1dc0142335d7ad80c162b4a4052bc89c","last_reissued_at":"2026-05-18T00:46:49.308632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:49.308632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A study of the Bienstock-Zuckerberg algorithm, Applications in Mining and Resource Constrained Project Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Espinoza, Eduardo Moreno, Gonzalo Mu\\~noz, Marcos Goycoolea, Maurice Queyranne, Orlando Rivera","submitted_at":"2016-07-05T03:51:55Z","abstract_excerpt":"We study a Lagrangian decomposition algorithm recently proposed by Dan Bienstock and Mark Zuckerberg for solving the LP relaxation of a class of open pit mine project scheduling problems. In this study we show that the Bienstock-Zuckerberg (BZ) algorithm can be used to solve LP relaxations corresponding to a much broader class of scheduling problems, including the well-known Resource Constrained Project Scheduling Problem (RCPSP), and multi-modal variants of the RCPSP that consider batch processing of jobs. We present a new, intuitive proof of correctness for the BZ algorithm that works by cas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01104","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.01104","created_at":"2026-05-18T00:46:49.308730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01104v2","created_at":"2026-05-18T00:46:49.308730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01104","created_at":"2026-05-18T00:46:49.308730+00:00"},{"alias_kind":"pith_short_12","alias_value":"RBYGQHCBK64I","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RBYGQHCBK64IZMP7","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RBYGQHCB","created_at":"2026-05-18T12:30:41.710351+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/RBYGQHCBK64IZMP7ZJA5AW4ZDU","json":"https://pith.science/pith/RBYGQHCBK64IZMP7ZJA5AW4ZDU.json","graph_json":"https://pith.science/api/pith-number/RBYGQHCBK64IZMP7ZJA5AW4ZDU/graph.json","events_json":"https://pith.science/api/pith-number/RBYGQHCBK64IZMP7ZJA5AW4ZDU/events.json","paper":"https://pith.science/paper/RBYGQHCB"},"agent_actions":{"view_html":"https://pith.science/pith/RBYGQHCBK64IZMP7ZJA5AW4ZDU","download_json":"https://pith.science/pith/RBYGQHCBK64IZMP7ZJA5AW4ZDU.json","view_paper":"https://pith.science/paper/RBYGQHCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01104&json=true","fetch_graph":"https://pith.science/api/pith-number/RBYGQHCBK64IZMP7ZJA5AW4ZDU/graph.json","fetch_events":"https://pith.science/api/pith-number/RBYGQHCBK64IZMP7ZJA5AW4ZDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RBYGQHCBK64IZMP7ZJA5AW4ZDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RBYGQHCBK64IZMP7ZJA5AW4ZDU/action/storage_attestation","attest_author":"https://pith.science/pith/RBYGQHCBK64IZMP7ZJA5AW4ZDU/action/author_attestation","sign_citation":"https://pith.science/pith/RBYGQHCBK64IZMP7ZJA5AW4ZDU/action/citation_signature","submit_replication":"https://pith.science/pith/RBYGQHCBK64IZMP7ZJA5AW4ZDU/action/replication_record"}},"created_at":"2026-05-18T00:46:49.308730+00:00","updated_at":"2026-05-18T00:46:49.308730+00:00"}