{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:D2BYBGRAWVOZANAMO5DHSPHJQ4","short_pith_number":"pith:D2BYBGRA","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"},"canonical_sha256":"1e83809a20b55d90340c7746793ce9870032c233ab6a27735f0b984e7f548cb1","source":{"kind":"arxiv","id":"1109.2477","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2477","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2477v2","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2477","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"D2BYBGRAWVOZ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D2BYBGRAWVOZANAM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D2BYBGRA","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:D2BYBGRAWVOZANAMO5DHSPHJQ4","target":"record","payload":{"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"},"canonical_sha256":"1e83809a20b55d90340c7746793ce9870032c233ab6a27735f0b984e7f548cb1","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"},"source_kind":"arxiv","source_id":"1109.2477","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-18T04:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aC9XQdU/dXaSC+xzXTFUTf/+ZwkEI4v8DlLqXm/gNPEHypYZFC9K7gA6wy1DTPFJRw7fpl0O7vQaNkQKPuf1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:14:37.803716Z"},"content_sha256":"c331dbe7560db374118ce39dfdd5136cb3ed72e2a17d75ef589a72e5bec26ba2","schema_version":"1.0","event_id":"sha256:c331dbe7560db374118ce39dfdd5136cb3ed72e2a17d75ef589a72e5bec26ba2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:D2BYBGRAWVOZANAMO5DHSPHJQ4","target":"graph","payload":{"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"},"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-18T04:12:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pA23PcnClbeHj71yeYzOiGTSbPtaa2ncdeicKfp2OvUh2SfH5426kESoXphZOIe38cZLQzVnP2gcBTjn1eYoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:14:37.804298Z"},"content_sha256":"95a40181628199491bae6e2d6061748aa4be0034c60f517e860d475c1a520795","schema_version":"1.0","event_id":"sha256:95a40181628199491bae6e2d6061748aa4be0034c60f517e860d475c1a520795"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/bundle.json","state_url":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/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-27T10:14:37Z","links":{"resolver":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4","bundle":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/bundle.json","state":"https://pith.science/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2BYBGRAWVOZANAMO5DHSPHJQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:D2BYBGRAWVOZANAMO5DHSPHJQ4","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":"9c092cc7b1bb998351a4fad8b45b8ea272280a8c485c6990dbb16e8cd908e11a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-12T14:19:29Z","title_canon_sha256":"6e144650f86b0f504356f8bff22b3ad5f57e2b8d7542f49c1a5f1bf27e81b0af"},"schema_version":"1.0","source":{"id":"1109.2477","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2477","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2477v2","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2477","created_at":"2026-05-18T04:12:00Z"},{"alias_kind":"pith_short_12","alias_value":"D2BYBGRAWVOZ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"D2BYBGRAWVOZANAM","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"D2BYBGRA","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:95a40181628199491bae6e2d6061748aa4be0034c60f517e860d475c1a520795","target":"graph","created_at":"2026-05-18T04:12:00Z","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":"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","authors_text":"Daniel Dadush","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-12T14:19:29Z","title":"A O(1/eps^2)^n Time Sieving Algorithm for Approximate Integer Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2477","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:c331dbe7560db374118ce39dfdd5136cb3ed72e2a17d75ef589a72e5bec26ba2","target":"record","created_at":"2026-05-18T04:12:00Z","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":"9c092cc7b1bb998351a4fad8b45b8ea272280a8c485c6990dbb16e8cd908e11a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-12T14:19:29Z","title_canon_sha256":"6e144650f86b0f504356f8bff22b3ad5f57e2b8d7542f49c1a5f1bf27e81b0af"},"schema_version":"1.0","source":{"id":"1109.2477","kind":"arxiv","version":2}},"canonical_sha256":"1e83809a20b55d90340c7746793ce9870032c233ab6a27735f0b984e7f548cb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e83809a20b55d90340c7746793ce9870032c233ab6a27735f0b984e7f548cb1","first_computed_at":"2026-05-18T04:12:00.392815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:00.392815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hhsQnVMbWNQ5x+lbuYp2o70AAz8sj8bFMd0R2v6MtPsNjsN8GNBI6ljJ7uf9MOMDxM0HkBcCt5umLrvG0aWMCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:00.393527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2477","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c331dbe7560db374118ce39dfdd5136cb3ed72e2a17d75ef589a72e5bec26ba2","sha256:95a40181628199491bae6e2d6061748aa4be0034c60f517e860d475c1a520795"],"state_sha256":"4b7e8cbaa247296f55dd2634894c10268d42a7a700cd4d3d7e3b3309445b02d7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ovvbxniCdi2s4bd9p/qdb+jALgdiE4bZ+LABSlnrDIdIFMrgNdINm6LT62vpVur9jpkMNo7vNRXiVvF+H1eCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:14:37.807929Z","bundle_sha256":"74b792c4d5882f5784e15fd0949cd9d231684fb38af1cc7e4e2328b2756f87bc"}}