{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VB7JU7M7Z3RNHAVMFLXBN6DSB5","short_pith_number":"pith:VB7JU7M7","schema_version":"1.0","canonical_sha256":"a87e9a7d9fcee2d382ac2aee16f8720f77ce94c6ccbddd6a0730ae6051d0139e","source":{"kind":"arxiv","id":"1907.03162","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial separation algorithms for the continuous knapsack polyhedra with divisible capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Wei-Kun Chen, Yu-Hong Dai","submitted_at":"2019-07-06T17:43:50Z","abstract_excerpt":"It is important to design separation algorithms of low computational complexity in mixed integer programming. We study the separation problems of the two continuous knapsack polyhedra with divisible capacities. The two polyhedra are the convex hulls of the sets which consist of $ n $ nonnegative integer variables, one unbounded continuous, $ m $ bounded continuous variables, and one linear constraint in either $ \\geq $ or $ \\leq $ form where the coefficients of integer variables are integer and divisible. Wolsey and Yaman (Math Program 156: 1--20, 2016) have shown that the polyhedra can be des"},"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":"1907.03162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-06T17:43:50Z","cross_cats_sorted":[],"title_canon_sha256":"997533f1dcddd915916d4b20f4fe80703630ec214f8fd9ece9ac28f409186558","abstract_canon_sha256":"06e6ffa902edb905b56c7475d9b01063f95dc141761ac9506ac4165c82158d73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:18.778088Z","signature_b64":"z1havsU/ikcUD4Uu4RvjidZ5kc4x+nSDnB85uSmlafhC29XmhcoRV5nXa0Sf8sJjcROZqPYsrrAaLyuhzUdGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a87e9a7d9fcee2d382ac2aee16f8720f77ce94c6ccbddd6a0730ae6051d0139e","last_reissued_at":"2026-05-17T23:41:18.777563Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:18.777563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial separation algorithms for the continuous knapsack polyhedra with divisible capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Wei-Kun Chen, Yu-Hong Dai","submitted_at":"2019-07-06T17:43:50Z","abstract_excerpt":"It is important to design separation algorithms of low computational complexity in mixed integer programming. We study the separation problems of the two continuous knapsack polyhedra with divisible capacities. The two polyhedra are the convex hulls of the sets which consist of $ n $ nonnegative integer variables, one unbounded continuous, $ m $ bounded continuous variables, and one linear constraint in either $ \\geq $ or $ \\leq $ form where the coefficients of integer variables are integer and divisible. Wolsey and Yaman (Math Program 156: 1--20, 2016) have shown that the polyhedra can be des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03162","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":""},"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":"1907.03162","created_at":"2026-05-17T23:41:18.777654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03162v1","created_at":"2026-05-17T23:41:18.777654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03162","created_at":"2026-05-17T23:41:18.777654+00:00"},{"alias_kind":"pith_short_12","alias_value":"VB7JU7M7Z3RN","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VB7JU7M7Z3RNHAVM","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VB7JU7M7","created_at":"2026-05-18T12:33:30.264802+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/VB7JU7M7Z3RNHAVMFLXBN6DSB5","json":"https://pith.science/pith/VB7JU7M7Z3RNHAVMFLXBN6DSB5.json","graph_json":"https://pith.science/api/pith-number/VB7JU7M7Z3RNHAVMFLXBN6DSB5/graph.json","events_json":"https://pith.science/api/pith-number/VB7JU7M7Z3RNHAVMFLXBN6DSB5/events.json","paper":"https://pith.science/paper/VB7JU7M7"},"agent_actions":{"view_html":"https://pith.science/pith/VB7JU7M7Z3RNHAVMFLXBN6DSB5","download_json":"https://pith.science/pith/VB7JU7M7Z3RNHAVMFLXBN6DSB5.json","view_paper":"https://pith.science/paper/VB7JU7M7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03162&json=true","fetch_graph":"https://pith.science/api/pith-number/VB7JU7M7Z3RNHAVMFLXBN6DSB5/graph.json","fetch_events":"https://pith.science/api/pith-number/VB7JU7M7Z3RNHAVMFLXBN6DSB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VB7JU7M7Z3RNHAVMFLXBN6DSB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VB7JU7M7Z3RNHAVMFLXBN6DSB5/action/storage_attestation","attest_author":"https://pith.science/pith/VB7JU7M7Z3RNHAVMFLXBN6DSB5/action/author_attestation","sign_citation":"https://pith.science/pith/VB7JU7M7Z3RNHAVMFLXBN6DSB5/action/citation_signature","submit_replication":"https://pith.science/pith/VB7JU7M7Z3RNHAVMFLXBN6DSB5/action/replication_record"}},"created_at":"2026-05-17T23:41:18.777654+00:00","updated_at":"2026-05-17T23:41:18.777654+00:00"}