{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BXGNDEQ4FRT4OJYS6OOJLYVMZP","short_pith_number":"pith:BXGNDEQ4","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"},"canonical_sha256":"0dccd1921c2c67c72712f39c95e2accbd53b7cca1944c39738f23be3347457e5","source":{"kind":"arxiv","id":"1401.5512","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5512","created_at":"2026-05-18T02:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5512v2","created_at":"2026-05-18T02:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5512","created_at":"2026-05-18T02:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"BXGNDEQ4FRT4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BXGNDEQ4FRT4OJYS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BXGNDEQ4","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BXGNDEQ4FRT4OJYS6OOJLYVMZP","target":"record","payload":{"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"},"canonical_sha256":"0dccd1921c2c67c72712f39c95e2accbd53b7cca1944c39738f23be3347457e5","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"},"source_kind":"arxiv","source_id":"1401.5512","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-18T02:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3LXecOe79/3Tf6ma7FP6QKqh53m8U6bD8XdFFgPeRuYsyehQ+Sm3JFcHmIAZi3NelIaCopnlQNz5wHsiJ+y5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:17:57.386615Z"},"content_sha256":"315d1d0f730d9bb666a7c56b86e8d3c2948804a7cba0f72f16874bf0c4488b73","schema_version":"1.0","event_id":"sha256:315d1d0f730d9bb666a7c56b86e8d3c2948804a7cba0f72f16874bf0c4488b73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BXGNDEQ4FRT4OJYS6OOJLYVMZP","target":"graph","payload":{"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"},"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-18T02:58:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYSamMjB7R2qI3E9x3x5Zq0p9y3JdSlVIJ/FlCmXO9xK5rnz6jaMSuIgJYerAz4/UHN68yaLHWymizMWRrsvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:17:57.387288Z"},"content_sha256":"a63c38f7fc8884b79c67493e9df3a51114b0746b9d5b54aa8fd6b20ad61be31d","schema_version":"1.0","event_id":"sha256:a63c38f7fc8884b79c67493e9df3a51114b0746b9d5b54aa8fd6b20ad61be31d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/bundle.json","state_url":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/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-27T05:17:57Z","links":{"resolver":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP","bundle":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/bundle.json","state":"https://pith.science/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXGNDEQ4FRT4OJYS6OOJLYVMZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BXGNDEQ4FRT4OJYS6OOJLYVMZP","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":"55628db14cfcbdee291f4972129a915df24b6d97a1db59fda54e5debba1421af","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-21T22:46:18Z","title_canon_sha256":"daff3f1defcc447aedebd4eb94ca460f3457d59bf797e06904859ccb96dd9a20"},"schema_version":"1.0","source":{"id":"1401.5512","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5512","created_at":"2026-05-18T02:58:34Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5512v2","created_at":"2026-05-18T02:58:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5512","created_at":"2026-05-18T02:58:34Z"},{"alias_kind":"pith_short_12","alias_value":"BXGNDEQ4FRT4","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BXGNDEQ4FRT4OJYS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BXGNDEQ4","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:a63c38f7fc8884b79c67493e9df3a51114b0746b9d5b54aa8fd6b20ad61be31d","target":"graph","created_at":"2026-05-18T02:58:34Z","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":"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.","authors_text":"Ramamohan Paturi, Russell Impagliazzo, Shachar Lovett, Stefan Schneider","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-21T22:46:18Z","title":"0-1 Integer Linear Programming with a Linear Number of Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5512","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:315d1d0f730d9bb666a7c56b86e8d3c2948804a7cba0f72f16874bf0c4488b73","target":"record","created_at":"2026-05-18T02:58:34Z","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":"55628db14cfcbdee291f4972129a915df24b6d97a1db59fda54e5debba1421af","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-01-21T22:46:18Z","title_canon_sha256":"daff3f1defcc447aedebd4eb94ca460f3457d59bf797e06904859ccb96dd9a20"},"schema_version":"1.0","source":{"id":"1401.5512","kind":"arxiv","version":2}},"canonical_sha256":"0dccd1921c2c67c72712f39c95e2accbd53b7cca1944c39738f23be3347457e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dccd1921c2c67c72712f39c95e2accbd53b7cca1944c39738f23be3347457e5","first_computed_at":"2026-05-18T02:58:34.188295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:34.188295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5zsxMgVoKMDY/GsqVm2PkrQXy7F2Aee6pA3xarl6UDEUUaR6xikmip77hdLzxXcesDCdXQ3waoQE0jLOvONyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:34.188984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5512","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:315d1d0f730d9bb666a7c56b86e8d3c2948804a7cba0f72f16874bf0c4488b73","sha256:a63c38f7fc8884b79c67493e9df3a51114b0746b9d5b54aa8fd6b20ad61be31d"],"state_sha256":"bc810bc43e327004339b321f4bf39e561ec972ecd52e7cd26cd8460e79d77979"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JVp4zcxHCk9FoiprbQ5I3nhQ61T7WddZ/XFbVgH76NNUc6x7Iup5IzVTScvsEg9ElV+GGTefKBUsBzm2fVVzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:17:57.390882Z","bundle_sha256":"8b3ef856672a34ef916e83fa3068370bf9d108bc51e4837f2f702896c1d8bda4"}}