{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:752LJHLTTB2D42DAV3UJLOVTHB","short_pith_number":"pith:752LJHLT","schema_version":"1.0","canonical_sha256":"ff74b49d7398743e6860aee895bab33876c3a9953dadbb014197cd9799194feb","source":{"kind":"arxiv","id":"1401.5820","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.5820","created_at":"2026-05-18T01:37:11.587518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5820v2","created_at":"2026-05-18T01:37:11.587518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5820","created_at":"2026-05-18T01:37:11.587518+00:00"},{"alias_kind":"pith_short_12","alias_value":"752LJHLTTB2D","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"752LJHLTTB2D42DA","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"752LJHLT","created_at":"2026-05-18T12:28:16.859392+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/752LJHLTTB2D42DAV3UJLOVTHB","json":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB.json","graph_json":"https://pith.science/api/pith-number/752LJHLTTB2D42DAV3UJLOVTHB/graph.json","events_json":"https://pith.science/api/pith-number/752LJHLTTB2D42DAV3UJLOVTHB/events.json","paper":"https://pith.science/paper/752LJHLT"},"agent_actions":{"view_html":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB","download_json":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB.json","view_paper":"https://pith.science/paper/752LJHLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5820&json=true","fetch_graph":"https://pith.science/api/pith-number/752LJHLTTB2D42DAV3UJLOVTHB/graph.json","fetch_events":"https://pith.science/api/pith-number/752LJHLTTB2D42DAV3UJLOVTHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB/action/storage_attestation","attest_author":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB/action/author_attestation","sign_citation":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB/action/citation_signature","submit_replication":"https://pith.science/pith/752LJHLTTB2D42DAV3UJLOVTHB/action/replication_record"}},"created_at":"2026-05-18T01:37:11.587518+00:00","updated_at":"2026-05-18T01:37:11.587518+00:00"}