{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PUY4SRN7TQWBDUL7S3VCNRG723","short_pith_number":"pith:PUY4SRN7","schema_version":"1.0","canonical_sha256":"7d31c945bf9c2c11d17f96ea26c4dfd6e0b58ab2a3186fcedefc3478a46fc607","source":{"kind":"arxiv","id":"1503.04717","version":1},"attestation_state":"computed","paper":{"title":"On the existence of compact {\\epsilon}-approximated formulations for knapsack in the original space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Laura Sanit\\`a, Yuri Faenza","submitted_at":"2015-03-16T16:30:34Z","abstract_excerpt":"We show that there exists a family of Knapsack polytopes such that, for each polytope P from this family and each {\\epsilon} > 0, any {\\epsilon}-approximated formulation of P in the original space R^n requires a number of inequalities that is super-polynomial in n. This answers a question by Bienstock and McClosky (2012). We also prove that, for any down-monotone polytope, an {\\epsilon}-approximated formulation in the original space can be obtained with inequalities using at most O(min{log(n/{\\epsilon}),n}/{\\epsilon}) different coefficients."},"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":"1503.04717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-16T16:30:34Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"16849ae8ac90f0eb5e8e8b1b150b56c3eba64a7fd7c784c4f9f06571c089e3c3","abstract_canon_sha256":"fb0284186821e77b04053586a5cbc76e6b5021eb269fb13aea8b26607c621617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:21.524708Z","signature_b64":"L/rwaovqTqfWoohnW79vyEkOtZvWRK2ffrN3HwA3E9qt7uzGYFXDBo3oZZPSf2OURSLjGRgwbWbQjMoxcOvKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d31c945bf9c2c11d17f96ea26c4dfd6e0b58ab2a3186fcedefc3478a46fc607","last_reissued_at":"2026-05-18T02:22:21.523566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:21.523566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the existence of compact {\\epsilon}-approximated formulations for knapsack in the original space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Laura Sanit\\`a, Yuri Faenza","submitted_at":"2015-03-16T16:30:34Z","abstract_excerpt":"We show that there exists a family of Knapsack polytopes such that, for each polytope P from this family and each {\\epsilon} > 0, any {\\epsilon}-approximated formulation of P in the original space R^n requires a number of inequalities that is super-polynomial in n. This answers a question by Bienstock and McClosky (2012). We also prove that, for any down-monotone polytope, an {\\epsilon}-approximated formulation in the original space can be obtained with inequalities using at most O(min{log(n/{\\epsilon}),n}/{\\epsilon}) different coefficients."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04717","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":"1503.04717","created_at":"2026-05-18T02:22:21.524227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04717v1","created_at":"2026-05-18T02:22:21.524227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04717","created_at":"2026-05-18T02:22:21.524227+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUY4SRN7TQWB","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUY4SRN7TQWBDUL7","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUY4SRN7","created_at":"2026-05-18T12:29:37.295048+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/PUY4SRN7TQWBDUL7S3VCNRG723","json":"https://pith.science/pith/PUY4SRN7TQWBDUL7S3VCNRG723.json","graph_json":"https://pith.science/api/pith-number/PUY4SRN7TQWBDUL7S3VCNRG723/graph.json","events_json":"https://pith.science/api/pith-number/PUY4SRN7TQWBDUL7S3VCNRG723/events.json","paper":"https://pith.science/paper/PUY4SRN7"},"agent_actions":{"view_html":"https://pith.science/pith/PUY4SRN7TQWBDUL7S3VCNRG723","download_json":"https://pith.science/pith/PUY4SRN7TQWBDUL7S3VCNRG723.json","view_paper":"https://pith.science/paper/PUY4SRN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04717&json=true","fetch_graph":"https://pith.science/api/pith-number/PUY4SRN7TQWBDUL7S3VCNRG723/graph.json","fetch_events":"https://pith.science/api/pith-number/PUY4SRN7TQWBDUL7S3VCNRG723/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUY4SRN7TQWBDUL7S3VCNRG723/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUY4SRN7TQWBDUL7S3VCNRG723/action/storage_attestation","attest_author":"https://pith.science/pith/PUY4SRN7TQWBDUL7S3VCNRG723/action/author_attestation","sign_citation":"https://pith.science/pith/PUY4SRN7TQWBDUL7S3VCNRG723/action/citation_signature","submit_replication":"https://pith.science/pith/PUY4SRN7TQWBDUL7S3VCNRG723/action/replication_record"}},"created_at":"2026-05-18T02:22:21.524227+00:00","updated_at":"2026-05-18T02:22:21.524227+00:00"}