{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VI7W463C6A2IWSH55LLQOK6OCS","short_pith_number":"pith:VI7W463C","canonical_record":{"source":{"id":"1609.03737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-13T09:20:56Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"e8d645da6cf73f99088a7160ff93b6949cc63115d9d9289a5041bdec910e142d","abstract_canon_sha256":"bfe0e89b2bf77cc398213b21316cfefcdc803e919b031e10f9981ca02d6a1a2e"},"schema_version":"1.0"},"canonical_sha256":"aa3f6e7b62f0348b48fdead7072bce1484b352aeb6ea30840e089cafbc98de9d","source":{"kind":"arxiv","id":"1609.03737","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03737","created_at":"2026-05-18T00:57:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03737v2","created_at":"2026-05-18T00:57:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03737","created_at":"2026-05-18T00:57:39Z"},{"alias_kind":"pith_short_12","alias_value":"VI7W463C6A2I","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VI7W463C6A2IWSH5","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VI7W463C","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VI7W463C6A2IWSH55LLQOK6OCS","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03737","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-13T09:20:56Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"e8d645da6cf73f99088a7160ff93b6949cc63115d9d9289a5041bdec910e142d","abstract_canon_sha256":"bfe0e89b2bf77cc398213b21316cfefcdc803e919b031e10f9981ca02d6a1a2e"},"schema_version":"1.0"},"canonical_sha256":"aa3f6e7b62f0348b48fdead7072bce1484b352aeb6ea30840e089cafbc98de9d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:39.355143Z","signature_b64":"m2mTRCH303huo0uf7BizlUXOdyqEhM0zwefqOO5Qhdn4ejBdBSQlFp8I4zP0jssm6hSCmZ2m7H29XwD8YqLbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa3f6e7b62f0348b48fdead7072bce1484b352aeb6ea30840e089cafbc98de9d","last_reissued_at":"2026-05-18T00:57:39.354633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:39.354633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03737","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-18T00:57:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27aeZp3rz3E5zdGP8E+FqijEGHCP6gTAVUc6HWHmjd1OXryFdK13QSt8sgdnYq88MSjLf8u5UB2uccYm7ObIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:31:45.480399Z"},"content_sha256":"6d00c8d69cfca062e9923914d725464821b91e61733b7481df2d8feb08790f2c","schema_version":"1.0","event_id":"sha256:6d00c8d69cfca062e9923914d725464821b91e61733b7481df2d8feb08790f2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VI7W463C6A2IWSH55LLQOK6OCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DM","authors_text":"Abbas Bazzi, Ola Svensson, Samuel Fiorini, Sangxia Huang","submitted_at":"2016-09-13T09:20:56Z","abstract_excerpt":"Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type. In spite of their widespread use, these inequalities yield linear programming (LP) relaxations of exponential size, over which it is not known how to optimize exactly in polynomial time. In this paper we address this issue and obtain LP relaxations of quasi-polynomial size that are at least as strong as that given by the knapsack cover inequalities.\n  For the min-knapsack cover problem, our main result can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03737","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-18T00:57:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jk1jEUOa+kbJThdsNSXc+mXgPVoLjzvbv1zdSgbKVcquf0/kyAuLPUNT/9t58ym2J2beSdC9SPyPKypsBuYICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:31:45.481137Z"},"content_sha256":"9ff70e0bb7a6853f5fb70a577ab7dc065acb1ef843ff93e9450a2010f789a761","schema_version":"1.0","event_id":"sha256:9ff70e0bb7a6853f5fb70a577ab7dc065acb1ef843ff93e9450a2010f789a761"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VI7W463C6A2IWSH55LLQOK6OCS/bundle.json","state_url":"https://pith.science/pith/VI7W463C6A2IWSH55LLQOK6OCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VI7W463C6A2IWSH55LLQOK6OCS/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-05-24T04:31:45Z","links":{"resolver":"https://pith.science/pith/VI7W463C6A2IWSH55LLQOK6OCS","bundle":"https://pith.science/pith/VI7W463C6A2IWSH55LLQOK6OCS/bundle.json","state":"https://pith.science/pith/VI7W463C6A2IWSH55LLQOK6OCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VI7W463C6A2IWSH55LLQOK6OCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VI7W463C6A2IWSH55LLQOK6OCS","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":"bfe0e89b2bf77cc398213b21316cfefcdc803e919b031e10f9981ca02d6a1a2e","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-13T09:20:56Z","title_canon_sha256":"e8d645da6cf73f99088a7160ff93b6949cc63115d9d9289a5041bdec910e142d"},"schema_version":"1.0","source":{"id":"1609.03737","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03737","created_at":"2026-05-18T00:57:39Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03737v2","created_at":"2026-05-18T00:57:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03737","created_at":"2026-05-18T00:57:39Z"},{"alias_kind":"pith_short_12","alias_value":"VI7W463C6A2I","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VI7W463C6A2IWSH5","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VI7W463C","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:9ff70e0bb7a6853f5fb70a577ab7dc065acb1ef843ff93e9450a2010f789a761","target":"graph","created_at":"2026-05-18T00:57:39Z","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":"Initially developed for the min-knapsack problem, the knapsack cover inequalities are used in the current best relaxations for numerous combinatorial optimization problems of covering type. In spite of their widespread use, these inequalities yield linear programming (LP) relaxations of exponential size, over which it is not known how to optimize exactly in polynomial time. In this paper we address this issue and obtain LP relaxations of quasi-polynomial size that are at least as strong as that given by the knapsack cover inequalities.\n  For the min-knapsack cover problem, our main result can ","authors_text":"Abbas Bazzi, Ola Svensson, Samuel Fiorini, Sangxia Huang","cross_cats":["cs.CC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-13T09:20:56Z","title":"Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03737","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:6d00c8d69cfca062e9923914d725464821b91e61733b7481df2d8feb08790f2c","target":"record","created_at":"2026-05-18T00:57:39Z","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":"bfe0e89b2bf77cc398213b21316cfefcdc803e919b031e10f9981ca02d6a1a2e","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-13T09:20:56Z","title_canon_sha256":"e8d645da6cf73f99088a7160ff93b6949cc63115d9d9289a5041bdec910e142d"},"schema_version":"1.0","source":{"id":"1609.03737","kind":"arxiv","version":2}},"canonical_sha256":"aa3f6e7b62f0348b48fdead7072bce1484b352aeb6ea30840e089cafbc98de9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa3f6e7b62f0348b48fdead7072bce1484b352aeb6ea30840e089cafbc98de9d","first_computed_at":"2026-05-18T00:57:39.354633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:39.354633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m2mTRCH303huo0uf7BizlUXOdyqEhM0zwefqOO5Qhdn4ejBdBSQlFp8I4zP0jssm6hSCmZ2m7H29XwD8YqLbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:39.355143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03737","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d00c8d69cfca062e9923914d725464821b91e61733b7481df2d8feb08790f2c","sha256:9ff70e0bb7a6853f5fb70a577ab7dc065acb1ef843ff93e9450a2010f789a761"],"state_sha256":"c8ce155231d167286988e9365ed8b87589b63bca7018e7ae44c6a953ce64b244"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYhhNBOkQSrtK25Vjj7CJQBxmtIdVJkzANlDv6ZEx4q3DW+RBY8kWx7nUdZexGV1et7ZJy4I/TCVG/Se3EFIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T04:31:45.484893Z","bundle_sha256":"4c72db84e7827b8ea339c7c2d1647735532ccaf46b26cd67bb48d4cc92fa4bf9"}}