{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BXGNDEQ4FRT4OJYS6OOJLYVMZP","short_pith_number":"pith:BXGNDEQ4","schema_version":"1.0","canonical_sha256":"0dccd1921c2c67c72712f39c95e2accbd53b7cca1944c39738f23be3347457e5","source":{"kind":"arxiv","id":"1401.5512","version":2},"attestation_state":"computed","paper":{"title":"0-1 Integer Linear Programming with a Linear Number of Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ramamohan Paturi, Russell Impagliazzo, Shachar Lovett, Stefan Schneider","submitted_at":"2014-01-21T22:46:18Z","abstract_excerpt":"We give an exact algorithm for the 0-1 Integer Linear Programming problem with a linear number of constraints that improves over exhaustive search by an exponential factor. Specifically, our algorithm runs in time $2^{(1-\\text{poly}(1/c))n}$ where n is the number of variables and cn is the number of constraints. The key idea for the algorithm is a reduction to the Vector Domination problem and a new algorithm for that subproblem."},"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":"1401.5512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-21T22:46:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"daff3f1defcc447aedebd4eb94ca460f3457d59bf797e06904859ccb96dd9a20","abstract_canon_sha256":"55628db14cfcbdee291f4972129a915df24b6d97a1db59fda54e5debba1421af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:34.188984Z","signature_b64":"5zsxMgVoKMDY/GsqVm2PkrQXy7F2Aee6pA3xarl6UDEUUaR6xikmip77hdLzxXcesDCdXQ3waoQE0jLOvONyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dccd1921c2c67c72712f39c95e2accbd53b7cca1944c39738f23be3347457e5","last_reissued_at":"2026-05-18T02:58:34.188295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:34.188295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"0-1 Integer Linear Programming with a Linear Number of Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ramamohan Paturi, Russell Impagliazzo, Shachar Lovett, Stefan Schneider","submitted_at":"2014-01-21T22:46:18Z","abstract_excerpt":"We give an exact algorithm for the 0-1 Integer Linear Programming problem with a linear number of constraints that improves over exhaustive search by an exponential factor. Specifically, our algorithm runs in time $2^{(1-\\text{poly}(1/c))n}$ where n is the number of variables and cn is the number of constraints. The key idea for the algorithm is a reduction to the Vector Domination problem and a new algorithm for that subproblem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5512","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":"1401.5512","created_at":"2026-05-18T02:58:34.188400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5512v2","created_at":"2026-05-18T02:58:34.188400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5512","created_at":"2026-05-18T02:58:34.188400+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXGNDEQ4FRT4","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXGNDEQ4FRT4OJYS","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXGNDEQ4","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04798","citing_title":"Online Orthogonal Vectors Revisited","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP","json":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP.json","graph_json":"https://pith.science/api/pith-number/BXGNDEQ4FRT4OJYS6OOJLYVMZP/graph.json","events_json":"https://pith.science/api/pith-number/BXGNDEQ4FRT4OJYS6OOJLYVMZP/events.json","paper":"https://pith.science/paper/BXGNDEQ4"},"agent_actions":{"view_html":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP","download_json":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP.json","view_paper":"https://pith.science/paper/BXGNDEQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5512&json=true","fetch_graph":"https://pith.science/api/pith-number/BXGNDEQ4FRT4OJYS6OOJLYVMZP/graph.json","fetch_events":"https://pith.science/api/pith-number/BXGNDEQ4FRT4OJYS6OOJLYVMZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/action/storage_attestation","attest_author":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/action/author_attestation","sign_citation":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/action/citation_signature","submit_replication":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/action/replication_record"}},"created_at":"2026-05-18T02:58:34.188400+00:00","updated_at":"2026-05-18T02:58:34.188400+00:00"}