{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JNAGJX6FTWXN6NWMXTKV22EJ3H","short_pith_number":"pith:JNAGJX6F","schema_version":"1.0","canonical_sha256":"4b4064dfc59daedf36ccbcd55d6889d9c845dfcd8664c641e6ad0d0503ff9d31","source":{"kind":"arxiv","id":"2501.04563","version":1},"attestation_state":"computed","paper":{"title":"On Branch-and-Price for Project Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Martin Grunow, Maximilian Kolter, Rainer Kolisch","submitted_at":"2025-01-08T15:24:20Z","abstract_excerpt":"Integer programs for resource-constrained project scheduling problems are notoriously hard to solve due to their weak linear relaxations. Several papers have proposed reformulating project scheduling problems via Dantzig-Wolfe decomposition to strengthen their linear relaxation and decompose large problem instances. The reformulation gives rise to a master problem that has a large number of variables. Therefore, the master problem is solved by a column generation procedure embedded in a branching framework, also known as branch-and-price. While branch-and-price has been successfully applied to"},"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":"2501.04563","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-08T15:24:20Z","cross_cats_sorted":[],"title_canon_sha256":"2bb9ca067f5b19378060db700030c3ab9da936a95df440c45256bd1aa0b61cff","abstract_canon_sha256":"0c94ff2cb92163d460c04357d26c0e89988b55bb1894bb2a6f062bed97efcce7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:37.342939Z","signature_b64":"Jr0mCpX20ToRRo6QszKhsLschg8iyAiI1vlx+Ld96C+RajNGTOi+KVXAlxzGbYbwOzEgiUs0u0U42p5zfWKFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b4064dfc59daedf36ccbcd55d6889d9c845dfcd8664c641e6ad0d0503ff9d31","last_reissued_at":"2026-07-05T09:58:37.342375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:37.342375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Branch-and-Price for Project Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Martin Grunow, Maximilian Kolter, Rainer Kolisch","submitted_at":"2025-01-08T15:24:20Z","abstract_excerpt":"Integer programs for resource-constrained project scheduling problems are notoriously hard to solve due to their weak linear relaxations. Several papers have proposed reformulating project scheduling problems via Dantzig-Wolfe decomposition to strengthen their linear relaxation and decompose large problem instances. The reformulation gives rise to a master problem that has a large number of variables. Therefore, the master problem is solved by a column generation procedure embedded in a branching framework, also known as branch-and-price. While branch-and-price has been successfully applied to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04563","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/2501.04563/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":"2501.04563","created_at":"2026-07-05T09:58:37.342441+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04563v1","created_at":"2026-07-05T09:58:37.342441+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04563","created_at":"2026-07-05T09:58:37.342441+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNAGJX6FTWXN","created_at":"2026-07-05T09:58:37.342441+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNAGJX6FTWXN6NWM","created_at":"2026-07-05T09:58:37.342441+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNAGJX6F","created_at":"2026-07-05T09:58:37.342441+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/JNAGJX6FTWXN6NWMXTKV22EJ3H","json":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H.json","graph_json":"https://pith.science/api/pith-number/JNAGJX6FTWXN6NWMXTKV22EJ3H/graph.json","events_json":"https://pith.science/api/pith-number/JNAGJX6FTWXN6NWMXTKV22EJ3H/events.json","paper":"https://pith.science/paper/JNAGJX6F"},"agent_actions":{"view_html":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H","download_json":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H.json","view_paper":"https://pith.science/paper/JNAGJX6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04563&json=true","fetch_graph":"https://pith.science/api/pith-number/JNAGJX6FTWXN6NWMXTKV22EJ3H/graph.json","fetch_events":"https://pith.science/api/pith-number/JNAGJX6FTWXN6NWMXTKV22EJ3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/action/storage_attestation","attest_author":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/action/author_attestation","sign_citation":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/action/citation_signature","submit_replication":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/action/replication_record"}},"created_at":"2026-07-05T09:58:37.342441+00:00","updated_at":"2026-07-05T09:58:37.342441+00:00"}