{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EJ7CIYPF6II2AMN47A5C4RFM23","short_pith_number":"pith:EJ7CIYPF","schema_version":"1.0","canonical_sha256":"227e2461e5f211a031bcf83a2e44acd6dcb33117ebebe2f871d5d91d80bd31e7","source":{"kind":"arxiv","id":"1806.07435","version":1},"attestation_state":"computed","paper":{"title":"Simpler derivation of bounded pitch inequalities for set covering, and minimum knapsack sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Bienstock, Mark Zuckerberg","submitted_at":"2018-06-19T19:26:06Z","abstract_excerpt":"A valid inequality \\alpha^Tx \\ge \\alpha_0 for a set covering problem is said to have pitch <= k ( a positive integer) if the k smallest positive \\alpha_j sum to at least alpha_0. This paper presents a new, simple derivation of a relaxation for set covering problems whose solutions satisfy all valid inequalities of pitch and is of polynomial size, for each fixed . We also consider the minimum knapsack problem, and show that for each fixed integer p > 0 and 0 < \\epsilon < 1 one can separate, within additive tolerance \\epsilon, from the relaxation defined by the valid inequalities with coefficien"},"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":"1806.07435","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-19T19:26:06Z","cross_cats_sorted":[],"title_canon_sha256":"c925f60b125ab59a53004b4ccc4847db590bacab942f7e30e58009959baf5def","abstract_canon_sha256":"0303531a0b1a96c426c24d65f8f0ddfa2c4eb72179486728e07a791cdf08a196"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:47.763860Z","signature_b64":"DsjnSV8aU9+IbL+QnTKkVlwWvp5FyXpCDJe52yhbgDTvSuF4LPTgByhrTKLDe2Qql931H5dhTn/dmI4eyA+7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"227e2461e5f211a031bcf83a2e44acd6dcb33117ebebe2f871d5d91d80bd31e7","last_reissued_at":"2026-05-18T00:12:47.763267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:47.763267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simpler derivation of bounded pitch inequalities for set covering, and minimum knapsack sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Bienstock, Mark Zuckerberg","submitted_at":"2018-06-19T19:26:06Z","abstract_excerpt":"A valid inequality \\alpha^Tx \\ge \\alpha_0 for a set covering problem is said to have pitch <= k ( a positive integer) if the k smallest positive \\alpha_j sum to at least alpha_0. This paper presents a new, simple derivation of a relaxation for set covering problems whose solutions satisfy all valid inequalities of pitch and is of polynomial size, for each fixed . We also consider the minimum knapsack problem, and show that for each fixed integer p > 0 and 0 < \\epsilon < 1 one can separate, within additive tolerance \\epsilon, from the relaxation defined by the valid inequalities with coefficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07435","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":"1806.07435","created_at":"2026-05-18T00:12:47.763362+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07435v1","created_at":"2026-05-18T00:12:47.763362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07435","created_at":"2026-05-18T00:12:47.763362+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJ7CIYPF6II2","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJ7CIYPF6II2AMN4","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJ7CIYPF","created_at":"2026-05-18T12:32:22.470017+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/EJ7CIYPF6II2AMN47A5C4RFM23","json":"https://pith.science/pith/EJ7CIYPF6II2AMN47A5C4RFM23.json","graph_json":"https://pith.science/api/pith-number/EJ7CIYPF6II2AMN47A5C4RFM23/graph.json","events_json":"https://pith.science/api/pith-number/EJ7CIYPF6II2AMN47A5C4RFM23/events.json","paper":"https://pith.science/paper/EJ7CIYPF"},"agent_actions":{"view_html":"https://pith.science/pith/EJ7CIYPF6II2AMN47A5C4RFM23","download_json":"https://pith.science/pith/EJ7CIYPF6II2AMN47A5C4RFM23.json","view_paper":"https://pith.science/paper/EJ7CIYPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07435&json=true","fetch_graph":"https://pith.science/api/pith-number/EJ7CIYPF6II2AMN47A5C4RFM23/graph.json","fetch_events":"https://pith.science/api/pith-number/EJ7CIYPF6II2AMN47A5C4RFM23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJ7CIYPF6II2AMN47A5C4RFM23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJ7CIYPF6II2AMN47A5C4RFM23/action/storage_attestation","attest_author":"https://pith.science/pith/EJ7CIYPF6II2AMN47A5C4RFM23/action/author_attestation","sign_citation":"https://pith.science/pith/EJ7CIYPF6II2AMN47A5C4RFM23/action/citation_signature","submit_replication":"https://pith.science/pith/EJ7CIYPF6II2AMN47A5C4RFM23/action/replication_record"}},"created_at":"2026-05-18T00:12:47.763362+00:00","updated_at":"2026-05-18T00:12:47.763362+00:00"}