{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:D2BYBGRAWVOZANAMO5DHSPHJQ4","short_pith_number":"pith:D2BYBGRA","schema_version":"1.0","canonical_sha256":"1e83809a20b55d90340c7746793ce9870032c233ab6a27735f0b984e7f548cb1","source":{"kind":"arxiv","id":"1109.2477","version":2},"attestation_state":"computed","paper":{"title":"A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Dadush","submitted_at":"2011-09-12T14:19:29Z","abstract_excerpt":"The Integer Programming Problem (IP) for a polytope P \\subseteq R^n is to find an integer point in P or decide that P is integer free. We give an algorithm for an approximate version of this problem, which correctly decides whether P contains an integer point or whether a (1+\\eps) scaling of P around its barycenter is integer free in time O(1/\\eps^2)^n. We reduce this approximate IP question to an approximate Closest Vector Problem (CVP) in a \"near-symmetric\" semi-norm, which we solve via a sieving technique first developed by Ajtai, Kumar, and Sivakumar (STOC 2001). Our main technical contrib"},"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":"1109.2477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-12T14:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"6e144650f86b0f504356f8bff22b3ad5f57e2b8d7542f49c1a5f1bf27e81b0af","abstract_canon_sha256":"9c092cc7b1bb998351a4fad8b45b8ea272280a8c485c6990dbb16e8cd908e11a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:00.393527Z","signature_b64":"hhsQnVMbWNQ5x+lbuYp2o70AAz8sj8bFMd0R2v6MtPsNjsN8GNBI6ljJ7uf9MOMDxM0HkBcCt5umLrvG0aWMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e83809a20b55d90340c7746793ce9870032c233ab6a27735f0b984e7f548cb1","last_reissued_at":"2026-05-18T04:12:00.392815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:00.392815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Dadush","submitted_at":"2011-09-12T14:19:29Z","abstract_excerpt":"The Integer Programming Problem (IP) for a polytope P \\subseteq R^n is to find an integer point in P or decide that P is integer free. We give an algorithm for an approximate version of this problem, which correctly decides whether P contains an integer point or whether a (1+\\eps) scaling of P around its barycenter is integer free in time O(1/\\eps^2)^n. We reduce this approximate IP question to an approximate Closest Vector Problem (CVP) in a \"near-symmetric\" semi-norm, which we solve via a sieving technique first developed by Ajtai, Kumar, and Sivakumar (STOC 2001). Our main technical contrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2477","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":"1109.2477","created_at":"2026-05-18T04:12:00.392914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2477v2","created_at":"2026-05-18T04:12:00.392914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2477","created_at":"2026-05-18T04:12:00.392914+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2BYBGRAWVOZ","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2BYBGRAWVOZANAM","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2BYBGRA","created_at":"2026-05-18T12:26:26.731475+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/D2BYBGRAWVOZANAMO5DHSPHJQ4","json":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4.json","graph_json":"https://pith.science/api/pith-number/D2BYBGRAWVOZANAMO5DHSPHJQ4/graph.json","events_json":"https://pith.science/api/pith-number/D2BYBGRAWVOZANAMO5DHSPHJQ4/events.json","paper":"https://pith.science/paper/D2BYBGRA"},"agent_actions":{"view_html":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4","download_json":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4.json","view_paper":"https://pith.science/paper/D2BYBGRA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2477&json=true","fetch_graph":"https://pith.science/api/pith-number/D2BYBGRAWVOZANAMO5DHSPHJQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/D2BYBGRAWVOZANAMO5DHSPHJQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/action/storage_attestation","attest_author":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/action/author_attestation","sign_citation":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/action/citation_signature","submit_replication":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/action/replication_record"}},"created_at":"2026-05-18T04:12:00.392914+00:00","updated_at":"2026-05-18T04:12:00.392914+00:00"}