{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JNAGJX6FTWXN6NWMXTKV22EJ3H","short_pith_number":"pith:JNAGJX6F","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"},"canonical_sha256":"4b4064dfc59daedf36ccbcd55d6889d9c845dfcd8664c641e6ad0d0503ff9d31","source":{"kind":"arxiv","id":"2501.04563","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04563","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04563v1","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04563","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_12","alias_value":"JNAGJX6FTWXN","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_16","alias_value":"JNAGJX6FTWXN6NWM","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_8","alias_value":"JNAGJX6F","created_at":"2026-07-05T09:58:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JNAGJX6FTWXN6NWMXTKV22EJ3H","target":"record","payload":{"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"},"canonical_sha256":"4b4064dfc59daedf36ccbcd55d6889d9c845dfcd8664c641e6ad0d0503ff9d31","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"},"source_kind":"arxiv","source_id":"2501.04563","source_version":1,"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-07-05T09:58:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZCivjQxaIFaBd4MDQkEAuGdL3o7Q5V5qUNIqZp5Q+fwM0GRf/31I/EVwlUAzmB/Y2RBmE1f6nAXUZyJQvu+qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:37:10.051405Z"},"content_sha256":"29793933762ec443e0d6f1f616116907404a2a2ebebb2c1272b6f676326180fb","schema_version":"1.0","event_id":"sha256:29793933762ec443e0d6f1f616116907404a2a2ebebb2c1272b6f676326180fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JNAGJX6FTWXN6NWMXTKV22EJ3H","target":"graph","payload":{"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"},"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-07-05T09:58:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i1iCqwOU3JbtlTFjKB2qkNU5gYDrwaHGuSn9V7Wyn3XC2jq0B309Ae1Dpfod0E5EsFGmUqhAuGSztYk/F5WOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T13:37:10.051896Z"},"content_sha256":"6587dae2e3c9544ceaea4a26c540cb40684b4c7496e7732d90cfadd7f7c105cd","schema_version":"1.0","event_id":"sha256:6587dae2e3c9544ceaea4a26c540cb40684b4c7496e7732d90cfadd7f7c105cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/bundle.json","state_url":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/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-08-23T13:37:10Z","links":{"resolver":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H","bundle":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/bundle.json","state":"https://pith.science/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNAGJX6FTWXN6NWMXTKV22EJ3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JNAGJX6FTWXN6NWMXTKV22EJ3H","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":"0c94ff2cb92163d460c04357d26c0e89988b55bb1894bb2a6f062bed97efcce7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-08T15:24:20Z","title_canon_sha256":"2bb9ca067f5b19378060db700030c3ab9da936a95df440c45256bd1aa0b61cff"},"schema_version":"1.0","source":{"id":"2501.04563","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.04563","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"arxiv_version","alias_value":"2501.04563v1","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04563","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_12","alias_value":"JNAGJX6FTWXN","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_16","alias_value":"JNAGJX6FTWXN6NWM","created_at":"2026-07-05T09:58:37Z"},{"alias_kind":"pith_short_8","alias_value":"JNAGJX6F","created_at":"2026-07-05T09:58:37Z"}],"graph_snapshots":[{"event_id":"sha256:6587dae2e3c9544ceaea4a26c540cb40684b4c7496e7732d90cfadd7f7c105cd","target":"graph","created_at":"2026-07-05T09:58:37Z","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/2501.04563/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Martin Grunow, Maximilian Kolter, Rainer Kolisch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-08T15:24:20Z","title":"On Branch-and-Price for Project Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04563","kind":"arxiv","version":1},"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:29793933762ec443e0d6f1f616116907404a2a2ebebb2c1272b6f676326180fb","target":"record","created_at":"2026-07-05T09:58:37Z","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":"0c94ff2cb92163d460c04357d26c0e89988b55bb1894bb2a6f062bed97efcce7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-08T15:24:20Z","title_canon_sha256":"2bb9ca067f5b19378060db700030c3ab9da936a95df440c45256bd1aa0b61cff"},"schema_version":"1.0","source":{"id":"2501.04563","kind":"arxiv","version":1}},"canonical_sha256":"4b4064dfc59daedf36ccbcd55d6889d9c845dfcd8664c641e6ad0d0503ff9d31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b4064dfc59daedf36ccbcd55d6889d9c845dfcd8664c641e6ad0d0503ff9d31","first_computed_at":"2026-07-05T09:58:37.342375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:58:37.342375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jr0mCpX20ToRRo6QszKhsLschg8iyAiI1vlx+Ld96C+RajNGTOi+KVXAlxzGbYbwOzEgiUs0u0U42p5zfWKFCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:58:37.342939Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.04563","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29793933762ec443e0d6f1f616116907404a2a2ebebb2c1272b6f676326180fb","sha256:6587dae2e3c9544ceaea4a26c540cb40684b4c7496e7732d90cfadd7f7c105cd"],"state_sha256":"829e628d038456cd2fc62a5a9dedb6e10b186b29953be86d575dc2328b09cb61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBan+l6bHUJOFGvjs/XzkTkGqN1efEBPQNb9q9XzBbMK557E0OFuLVLshdjpOpCWQ5DuHmKK8e3ilParg768Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T13:37:10.056422Z","bundle_sha256":"3e437df2eb00bb636ce0f2a8915c5adc65a2bdcf5a907a85d6a44bc84ccbe238"}}