{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:LQNSAIC75PD4I5JZQFQLDRLNDC","short_pith_number":"pith:LQNSAIC7","canonical_record":{"source":{"id":"math/0410111","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2004-10-05T14:27:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9d682ce72a9de5666a2472ac18fccf40ab17bfa253b277f3d201dc6e4c480346","abstract_canon_sha256":"3416365187e4739b583b602fae2423d8791197ced40ff964a7719cb91f3fac2a"},"schema_version":"1.0"},"canonical_sha256":"5c1b20205febc7c475398160b1c56d189617224779674a518db64a3c93465f73","source":{"kind":"arxiv","id":"math/0410111","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0410111","created_at":"2026-05-18T00:53:35Z"},{"alias_kind":"arxiv_version","alias_value":"math/0410111v2","created_at":"2026-05-18T00:53:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0410111","created_at":"2026-05-18T00:53:35Z"},{"alias_kind":"pith_short_12","alias_value":"LQNSAIC75PD4","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"LQNSAIC75PD4I5JZ","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"LQNSAIC7","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:LQNSAIC75PD4I5JZQFQLDRLNDC","target":"record","payload":{"canonical_record":{"source":{"id":"math/0410111","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.OC","submitted_at":"2004-10-05T14:27:10Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9d682ce72a9de5666a2472ac18fccf40ab17bfa253b277f3d201dc6e4c480346","abstract_canon_sha256":"3416365187e4739b583b602fae2423d8791197ced40ff964a7719cb91f3fac2a"},"schema_version":"1.0"},"canonical_sha256":"5c1b20205febc7c475398160b1c56d189617224779674a518db64a3c93465f73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:35.490718Z","signature_b64":"IK5cSr25Epif0cMBklHTz8MWmyKtuIqtcawgzPjIuWkvrewNOH6Y/kGSXRm5WqSId0kuD5VaGjGRTrGQxnYNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c1b20205febc7c475398160b1c56d189617224779674a518db64a3c93465f73","last_reissued_at":"2026-05-18T00:53:35.490129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:35.490129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0410111","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-18T00:53:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cG2TLCaTVrLKr4Zu1mxmJWYGbTEdLehjXvfFogpx+8JXKXhApH3VngWPb4TRhGdBc+D+8W+26JEwD3/qgh2eDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:22:12.078198Z"},"content_sha256":"6550d60e0112774fcb076f835dd855344b493f13e91c88277118e9e680e6b7f2","schema_version":"1.0","event_id":"sha256:6550d60e0112774fcb076f835dd855344b493f13e91c88277118e9e680e6b7f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:LQNSAIC75PD4I5JZQFQLDRLNDC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Integer Polynomial Optimization in Fixed Dimension","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Jes\\'us A. De Loera, Matthias K\\\"oppe, Raymond Hemmecke, Robert Weismantel","submitted_at":"2004-10-05T14:27:10Z","abstract_excerpt":"We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an integer polynomial over the lattice points of a convex polytope, we show an algorithm to compute lower and upper bounds for the optimal value. For polynomials that are non-negative over the polytope, these sequences of bounds lead to a fully polynomial-time approximation scheme for the optimization problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0410111","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-18T00:53:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f72K7Dht9KskJI0mHUMl/X8WzOIspSrrOR+1rCkfL/K1PaMcVRIV+orrQRrfUxI1lcM30A5g+6rcyTmSSuEECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:22:12.078634Z"},"content_sha256":"b50de5eb1ec1be5a22935a111a8fcad0d28e5522f94a4656771778ffe4971186","schema_version":"1.0","event_id":"sha256:b50de5eb1ec1be5a22935a111a8fcad0d28e5522f94a4656771778ffe4971186"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQNSAIC75PD4I5JZQFQLDRLNDC/bundle.json","state_url":"https://pith.science/pith/LQNSAIC75PD4I5JZQFQLDRLNDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQNSAIC75PD4I5JZQFQLDRLNDC/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-28T03:22:12Z","links":{"resolver":"https://pith.science/pith/LQNSAIC75PD4I5JZQFQLDRLNDC","bundle":"https://pith.science/pith/LQNSAIC75PD4I5JZQFQLDRLNDC/bundle.json","state":"https://pith.science/pith/LQNSAIC75PD4I5JZQFQLDRLNDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQNSAIC75PD4I5JZQFQLDRLNDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:LQNSAIC75PD4I5JZQFQLDRLNDC","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":"3416365187e4739b583b602fae2423d8791197ced40ff964a7719cb91f3fac2a","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.OC","submitted_at":"2004-10-05T14:27:10Z","title_canon_sha256":"9d682ce72a9de5666a2472ac18fccf40ab17bfa253b277f3d201dc6e4c480346"},"schema_version":"1.0","source":{"id":"math/0410111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0410111","created_at":"2026-05-18T00:53:35Z"},{"alias_kind":"arxiv_version","alias_value":"math/0410111v2","created_at":"2026-05-18T00:53:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0410111","created_at":"2026-05-18T00:53:35Z"},{"alias_kind":"pith_short_12","alias_value":"LQNSAIC75PD4","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"LQNSAIC75PD4I5JZ","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"LQNSAIC7","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:b50de5eb1ec1be5a22935a111a8fcad0d28e5522f94a4656771778ffe4971186","target":"graph","created_at":"2026-05-18T00:53:35Z","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 classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an integer polynomial over the lattice points of a convex polytope, we show an algorithm to compute lower and upper bounds for the optimal value. For polynomials that are non-negative over the polytope, these sequences of bounds lead to a fully polynomial-time approximation scheme for the optimization problem.","authors_text":"Jes\\'us A. De Loera, Matthias K\\\"oppe, Raymond Hemmecke, Robert Weismantel","cross_cats":["math.CO"],"headline":"","license":"","primary_cat":"math.OC","submitted_at":"2004-10-05T14:27:10Z","title":"Integer Polynomial Optimization in Fixed Dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0410111","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:6550d60e0112774fcb076f835dd855344b493f13e91c88277118e9e680e6b7f2","target":"record","created_at":"2026-05-18T00:53:35Z","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":"3416365187e4739b583b602fae2423d8791197ced40ff964a7719cb91f3fac2a","cross_cats_sorted":["math.CO"],"license":"","primary_cat":"math.OC","submitted_at":"2004-10-05T14:27:10Z","title_canon_sha256":"9d682ce72a9de5666a2472ac18fccf40ab17bfa253b277f3d201dc6e4c480346"},"schema_version":"1.0","source":{"id":"math/0410111","kind":"arxiv","version":2}},"canonical_sha256":"5c1b20205febc7c475398160b1c56d189617224779674a518db64a3c93465f73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c1b20205febc7c475398160b1c56d189617224779674a518db64a3c93465f73","first_computed_at":"2026-05-18T00:53:35.490129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:35.490129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IK5cSr25Epif0cMBklHTz8MWmyKtuIqtcawgzPjIuWkvrewNOH6Y/kGSXRm5WqSId0kuD5VaGjGRTrGQxnYNDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:35.490718Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0410111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6550d60e0112774fcb076f835dd855344b493f13e91c88277118e9e680e6b7f2","sha256:b50de5eb1ec1be5a22935a111a8fcad0d28e5522f94a4656771778ffe4971186"],"state_sha256":"91dd1a6428d93f50e2bd9453ffdd356b2c5e5816477227cc56e24f4b10c24e06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zetv2fkKETXKkpRLFqH64JBgS1W3q3I6Bn/QKdIj5NLbY3HiULHDtk7g/wi/j24HneaESThpGPtHYKRzqg7PAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:22:12.081143Z","bundle_sha256":"d58164048817240bce3e4a7801ad143ae39fe71a9349e34d6753587872674cb2"}}