{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BPUSPACS2R5RMRQYSJZU3SGP45","short_pith_number":"pith:BPUSPACS","canonical_record":{"source":{"id":"1702.08662","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-28T06:26:44Z","cross_cats_sorted":["cs.CC","cs.CG","cs.DM"],"title_canon_sha256":"0d39de74e46e170d64eaed981bbee3caeef6f0967ffb550b68358e913521528f","abstract_canon_sha256":"124c7b15cc8e27a9c7c343a6e0701c63f2de97d47c2678a0d84e40b2c5754ba4"},"schema_version":"1.0"},"canonical_sha256":"0be9278052d47b16461892734dc8cfe74ac3535c66c349dbb814003a8f1d7854","source":{"kind":"arxiv","id":"1702.08662","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08662","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08662v4","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08662","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"pith_short_12","alias_value":"BPUSPACS2R5R","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BPUSPACS2R5RMRQY","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BPUSPACS","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BPUSPACS2R5RMRQYSJZU3SGP45","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08662","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-28T06:26:44Z","cross_cats_sorted":["cs.CC","cs.CG","cs.DM"],"title_canon_sha256":"0d39de74e46e170d64eaed981bbee3caeef6f0967ffb550b68358e913521528f","abstract_canon_sha256":"124c7b15cc8e27a9c7c343a6e0701c63f2de97d47c2678a0d84e40b2c5754ba4"},"schema_version":"1.0"},"canonical_sha256":"0be9278052d47b16461892734dc8cfe74ac3535c66c349dbb814003a8f1d7854","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:06.129861Z","signature_b64":"d+5Mgo4WspMoCkgG9DPkwqdDJPmxOUHjg/jSd/rPhRTmlFGKasprIaBWW+TZNZ5DHwMt0/MkyZqNlmx2UvpVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0be9278052d47b16461892734dc8cfe74ac3535c66c349dbb814003a8f1d7854","last_reissued_at":"2026-05-18T00:45:06.129260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:06.129260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08662","source_version":4,"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-18T00:45:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nxrtgpSQ8FwdzrKu6+NsipQrXaviSOzs+Fw/3LTciTj4J/8jAX4k97BocqC3uo0vvHgYwajLevnIejdGMhfXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:54:25.574348Z"},"content_sha256":"8e3ef0d348ab8576d2c4c5f42d04c6b584b6770f7f2cb5d0309372fb88ca1f31","schema_version":"1.0","event_id":"sha256:8e3ef0d348ab8576d2c4c5f42d04c6b584b6770f7f2cb5d0309372fb88ca1f31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BPUSPACS2R5RMRQYSJZU3SGP45","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The computational complexity of integer programming with alternations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Danny Nguyen, Igor Pak","submitted_at":"2017-02-28T06:26:44Z","abstract_excerpt":"We prove that integer programming with three quantifier alternations is $NP$-complete, even for a fixed number of variables. This complements earlier results by Lenstra and Kannan, which together say that integer programming with at most two quantifier alternations can be done in polynomial time for a fixed number of variables. As a byproduct of the proof, we show that for two polytopes $P,Q \\subset \\mathbb{R}^4$ , counting the projection of integer points in $Q \\backslash P$ is $\\#P$-complete. This contrasts the 2003 result by Barvinok and Woods, which allows counting in polynomial time the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08662","kind":"arxiv","version":4},"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-18T00:45:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LoyNK5+ueOSiyisdrceW1ZjNB2cfYW6QkPrVUT7FvEwr1OfRpZjvA+1XooB6AlFGxbOpbH4GZEYrlXKoJGfxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:54:25.575005Z"},"content_sha256":"e06dd52fbf9faef286b829234e9994ba9cdd87b5574eaafc2ac92b4ea8a76c2a","schema_version":"1.0","event_id":"sha256:e06dd52fbf9faef286b829234e9994ba9cdd87b5574eaafc2ac92b4ea8a76c2a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPUSPACS2R5RMRQYSJZU3SGP45/bundle.json","state_url":"https://pith.science/pith/BPUSPACS2R5RMRQYSJZU3SGP45/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPUSPACS2R5RMRQYSJZU3SGP45/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-30T20:54:25Z","links":{"resolver":"https://pith.science/pith/BPUSPACS2R5RMRQYSJZU3SGP45","bundle":"https://pith.science/pith/BPUSPACS2R5RMRQYSJZU3SGP45/bundle.json","state":"https://pith.science/pith/BPUSPACS2R5RMRQYSJZU3SGP45/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPUSPACS2R5RMRQYSJZU3SGP45/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BPUSPACS2R5RMRQYSJZU3SGP45","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":"124c7b15cc8e27a9c7c343a6e0701c63f2de97d47c2678a0d84e40b2c5754ba4","cross_cats_sorted":["cs.CC","cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-28T06:26:44Z","title_canon_sha256":"0d39de74e46e170d64eaed981bbee3caeef6f0967ffb550b68358e913521528f"},"schema_version":"1.0","source":{"id":"1702.08662","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08662","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08662v4","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08662","created_at":"2026-05-18T00:45:06Z"},{"alias_kind":"pith_short_12","alias_value":"BPUSPACS2R5R","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BPUSPACS2R5RMRQY","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BPUSPACS","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:e06dd52fbf9faef286b829234e9994ba9cdd87b5574eaafc2ac92b4ea8a76c2a","target":"graph","created_at":"2026-05-18T00:45:06Z","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 prove that integer programming with three quantifier alternations is $NP$-complete, even for a fixed number of variables. This complements earlier results by Lenstra and Kannan, which together say that integer programming with at most two quantifier alternations can be done in polynomial time for a fixed number of variables. As a byproduct of the proof, we show that for two polytopes $P,Q \\subset \\mathbb{R}^4$ , counting the projection of integer points in $Q \\backslash P$ is $\\#P$-complete. This contrasts the 2003 result by Barvinok and Woods, which allows counting in polynomial time the p","authors_text":"Danny Nguyen, Igor Pak","cross_cats":["cs.CC","cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-28T06:26:44Z","title":"The computational complexity of integer programming with alternations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08662","kind":"arxiv","version":4},"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:8e3ef0d348ab8576d2c4c5f42d04c6b584b6770f7f2cb5d0309372fb88ca1f31","target":"record","created_at":"2026-05-18T00:45:06Z","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":"124c7b15cc8e27a9c7c343a6e0701c63f2de97d47c2678a0d84e40b2c5754ba4","cross_cats_sorted":["cs.CC","cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-28T06:26:44Z","title_canon_sha256":"0d39de74e46e170d64eaed981bbee3caeef6f0967ffb550b68358e913521528f"},"schema_version":"1.0","source":{"id":"1702.08662","kind":"arxiv","version":4}},"canonical_sha256":"0be9278052d47b16461892734dc8cfe74ac3535c66c349dbb814003a8f1d7854","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0be9278052d47b16461892734dc8cfe74ac3535c66c349dbb814003a8f1d7854","first_computed_at":"2026-05-18T00:45:06.129260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:06.129260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d+5Mgo4WspMoCkgG9DPkwqdDJPmxOUHjg/jSd/rPhRTmlFGKasprIaBWW+TZNZ5DHwMt0/MkyZqNlmx2UvpVAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:06.129861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08662","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e3ef0d348ab8576d2c4c5f42d04c6b584b6770f7f2cb5d0309372fb88ca1f31","sha256:e06dd52fbf9faef286b829234e9994ba9cdd87b5574eaafc2ac92b4ea8a76c2a"],"state_sha256":"637cb1fc96c073c9d860b7144c39898deb27ea3523fb635f392923c029618a64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uark2HFOIT0zoHj/sbEh2x+hKA/QYAg1YGcu4G1eICStS7SfQlKqRFjvQyfFkLIpGj6daDv6tA9vLJvifk+gAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:54:25.579117Z","bundle_sha256":"1bf1b56b44a00afc1ba3d5cb06bb25505160238afd2da1e12c4016d9813b9629"}}