{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:752LJHLTTB2D42DAV3UJLOVTHB","short_pith_number":"pith:752LJHLT","canonical_record":{"source":{"id":"1401.5820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-22T22:34:21Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a137fa1ecfbb90d896eca38280c4a117e35b4dd8922aac87cd3e7d8fd33cc9b3","abstract_canon_sha256":"37d4b4cf969c79f58f14f0527ca9ea16026078f0ee841dae775d37d3f5aa1b60"},"schema_version":"1.0"},"canonical_sha256":"ff74b49d7398743e6860aee895bab33876c3a9953dadbb014197cd9799194feb","source":{"kind":"arxiv","id":"1401.5820","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5820","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5820v2","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5820","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"752LJHLTTB2D","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"752LJHLTTB2D42DA","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"752LJHLT","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:752LJHLTTB2D42DAV3UJLOVTHB","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5820","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-22T22:34:21Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a137fa1ecfbb90d896eca38280c4a117e35b4dd8922aac87cd3e7d8fd33cc9b3","abstract_canon_sha256":"37d4b4cf969c79f58f14f0527ca9ea16026078f0ee841dae775d37d3f5aa1b60"},"schema_version":"1.0"},"canonical_sha256":"ff74b49d7398743e6860aee895bab33876c3a9953dadbb014197cd9799194feb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:11.588105Z","signature_b64":"Bd8NrL13LRzZCeD5yt3PT0Oykb5YoiFXoiceqoUNZXswMFA/xVUAi1YprVwosKZ47c8knduLfxxE5dnOaYa7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff74b49d7398743e6860aee895bab33876c3a9953dadbb014197cd9799194feb","last_reissued_at":"2026-05-18T01:37:11.587387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:11.587387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5820","source_version":2,"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-18T01:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPMJoyGd+PsKmpISd+JZhOIdBmjz6KwnNmraNWEywRjZG9/+DghI2dLPiUR9xK2CDsvvDHgOUfWtw1xY6sD6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:17:46.812547Z"},"content_sha256":"2120b5e05b407f38357a5347ae64cd82501ac59a5cb3760a4d8a250ff2dd43bd","schema_version":"1.0","event_id":"sha256:2120b5e05b407f38357a5347ae64cd82501ac59a5cb3760a4d8a250ff2dd43bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:752LJHLTTB2D42DAV3UJLOVTHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring using Zero-Suppressed Binary Decision Diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson","submitted_at":"2014-01-22T22:34:21Z","abstract_excerpt":"Branch-and-price algorithms combine a branch-and-bound search with an exponentially-sized LP formulation that must be solved via column generation. Unfortunately, the standard branching rules used in branch-and-bound for integer programming interfere with the structure of the column generation routine; therefore, most such algorithms employ alternate branching rules to circumvent this difficulty. This paper shows how a zero-suppressed binary decision diagram (ZDD) can be used to solve the pricing problem in a branch-and-price algorithm for the graph coloring problem, even in the presence of co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5820","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"},"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-18T01:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1cDHauO0WqEsszpkooxk2r2Ih7IHWLxV2FCHCiSL0s4e4LZZt0N94O6yTDi/ztSzwE2yhhA2+Gx1p7RxuSX9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T10:17:46.813087Z"},"content_sha256":"7e5400c9ecd713dfaca7f02c65bf43fbce9096d2c648a110e9b22df5c1c97615","schema_version":"1.0","event_id":"sha256:7e5400c9ecd713dfaca7f02c65bf43fbce9096d2c648a110e9b22df5c1c97615"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB/bundle.json","state_url":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/752LJHLTTB2D42DAV3UJLOVTHB/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-07T10:17:46Z","links":{"resolver":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB","bundle":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB/bundle.json","state":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/752LJHLTTB2D42DAV3UJLOVTHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:752LJHLTTB2D42DAV3UJLOVTHB","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":"37d4b4cf969c79f58f14f0527ca9ea16026078f0ee841dae775d37d3f5aa1b60","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-22T22:34:21Z","title_canon_sha256":"a137fa1ecfbb90d896eca38280c4a117e35b4dd8922aac87cd3e7d8fd33cc9b3"},"schema_version":"1.0","source":{"id":"1401.5820","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5820","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5820v2","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5820","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"752LJHLTTB2D","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"752LJHLTTB2D42DA","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"752LJHLT","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:7e5400c9ecd713dfaca7f02c65bf43fbce9096d2c648a110e9b22df5c1c97615","target":"graph","created_at":"2026-05-18T01:37:11Z","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":"Branch-and-price algorithms combine a branch-and-bound search with an exponentially-sized LP formulation that must be solved via column generation. Unfortunately, the standard branching rules used in branch-and-bound for integer programming interfere with the structure of the column generation routine; therefore, most such algorithms employ alternate branching rules to circumvent this difficulty. This paper shows how a zero-suppressed binary decision diagram (ZDD) can be used to solve the pricing problem in a branch-and-price algorithm for the graph coloring problem, even in the presence of co","authors_text":"David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-22T22:34:21Z","title":"Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring using Zero-Suppressed Binary Decision Diagrams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5820","kind":"arxiv","version":2},"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:2120b5e05b407f38357a5347ae64cd82501ac59a5cb3760a4d8a250ff2dd43bd","target":"record","created_at":"2026-05-18T01:37:11Z","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":"37d4b4cf969c79f58f14f0527ca9ea16026078f0ee841dae775d37d3f5aa1b60","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-22T22:34:21Z","title_canon_sha256":"a137fa1ecfbb90d896eca38280c4a117e35b4dd8922aac87cd3e7d8fd33cc9b3"},"schema_version":"1.0","source":{"id":"1401.5820","kind":"arxiv","version":2}},"canonical_sha256":"ff74b49d7398743e6860aee895bab33876c3a9953dadbb014197cd9799194feb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff74b49d7398743e6860aee895bab33876c3a9953dadbb014197cd9799194feb","first_computed_at":"2026-05-18T01:37:11.587387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:11.587387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bd8NrL13LRzZCeD5yt3PT0Oykb5YoiFXoiceqoUNZXswMFA/xVUAi1YprVwosKZ47c8knduLfxxE5dnOaYa7DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:11.588105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5820","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2120b5e05b407f38357a5347ae64cd82501ac59a5cb3760a4d8a250ff2dd43bd","sha256:7e5400c9ecd713dfaca7f02c65bf43fbce9096d2c648a110e9b22df5c1c97615"],"state_sha256":"c51300d0e550d7a06be308fdf81c1541db5f6684747b96e7999fda847b345fd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuVZj75xCdd3gh5Vy0QQ37ArbSo0dVoWdcg90tJl6TsQGlCZgG2LjAf5hus8Qf4BfsoqLGx/5Dd0+dQdBwcgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T10:17:46.816017Z","bundle_sha256":"21aea4fde56039334416ce2a44cecd44bc4b33ec57781a396007fc662c451e58"}}