{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:SGPT27D5SPMMCBY4YSVB4PTCN2","short_pith_number":"pith:SGPT27D5","schema_version":"1.0","canonical_sha256":"919f3d7c7d93d8c1071cc4aa1e3e626ea77e44fd71be4bae59e15c88ffa1eebb","source":{"kind":"arxiv","id":"0809.2083","version":3},"attestation_state":"computed","paper":{"title":"How to Integrate a Polynomial over a Simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SC"],"primary_cat":"math.MG","authors_text":"Jesus De Loera, Matthias K\\\"oppe, Mich\\`ele Vergne (CMLS-EcolePolytechnique), Nicole Berline (CMLS-EcolePolytechnique), Velleda Baldoni","submitted_at":"2008-09-11T19:00:12Z","abstract_excerpt":"This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and Straus. On the other hand, if the polynomial depends only on a fixed number of variables, while its degree and the dimension of the simplex are allowed to vary, we prove that integration can be done in polynomial time. As a consequence, for polynomials of fixed total degree, there is a polynomial time algorithm as well. We conclude the article with extensions"},"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":"0809.2083","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2008-09-11T19:00:12Z","cross_cats_sorted":["cs.CC","cs.SC"],"title_canon_sha256":"e443037aeebf57c875e1a6c704ff1b391d9b30e1f6b725139b4dc57b4cfe7376","abstract_canon_sha256":"62d6ec9b89602b729898751aa8bc20fcaac99be8c019f9b604bc429a846d536c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:57.213241Z","signature_b64":"4SPhiff8xEMYsduk6r2hWzk4GegI0Kt7r0zrGSKyEck+mTh87U49KHzALxtcyLW2x6EfVteTQcj3j5T/HKPdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"919f3d7c7d93d8c1071cc4aa1e3e626ea77e44fd71be4bae59e15c88ffa1eebb","last_reissued_at":"2026-05-18T03:19:57.212519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:57.212519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How to Integrate a Polynomial over a Simplex","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.SC"],"primary_cat":"math.MG","authors_text":"Jesus De Loera, Matthias K\\\"oppe, Mich\\`ele Vergne (CMLS-EcolePolytechnique), Nicole Berline (CMLS-EcolePolytechnique), Velleda Baldoni","submitted_at":"2008-09-11T19:00:12Z","abstract_excerpt":"This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and Straus. On the other hand, if the polynomial depends only on a fixed number of variables, while its degree and the dimension of the simplex are allowed to vary, we prove that integration can be done in polynomial time. As a consequence, for polynomials of fixed total degree, there is a polynomial time algorithm as well. We conclude the article with extensions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0809.2083","kind":"arxiv","version":3},"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":"0809.2083","created_at":"2026-05-18T03:19:57.212631+00:00"},{"alias_kind":"arxiv_version","alias_value":"0809.2083v3","created_at":"2026-05-18T03:19:57.212631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0809.2083","created_at":"2026-05-18T03:19:57.212631+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGPT27D5SPMM","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGPT27D5SPMMCBY4","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGPT27D5","created_at":"2026-05-18T12:25:58.018023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SGPT27D5SPMMCBY4YSVB4PTCN2","json":"https://pith.science/pith/SGPT27D5SPMMCBY4YSVB4PTCN2.json","graph_json":"https://pith.science/api/pith-number/SGPT27D5SPMMCBY4YSVB4PTCN2/graph.json","events_json":"https://pith.science/api/pith-number/SGPT27D5SPMMCBY4YSVB4PTCN2/events.json","paper":"https://pith.science/paper/SGPT27D5"},"agent_actions":{"view_html":"https://pith.science/pith/SGPT27D5SPMMCBY4YSVB4PTCN2","download_json":"https://pith.science/pith/SGPT27D5SPMMCBY4YSVB4PTCN2.json","view_paper":"https://pith.science/paper/SGPT27D5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0809.2083&json=true","fetch_graph":"https://pith.science/api/pith-number/SGPT27D5SPMMCBY4YSVB4PTCN2/graph.json","fetch_events":"https://pith.science/api/pith-number/SGPT27D5SPMMCBY4YSVB4PTCN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGPT27D5SPMMCBY4YSVB4PTCN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGPT27D5SPMMCBY4YSVB4PTCN2/action/storage_attestation","attest_author":"https://pith.science/pith/SGPT27D5SPMMCBY4YSVB4PTCN2/action/author_attestation","sign_citation":"https://pith.science/pith/SGPT27D5SPMMCBY4YSVB4PTCN2/action/citation_signature","submit_replication":"https://pith.science/pith/SGPT27D5SPMMCBY4YSVB4PTCN2/action/replication_record"}},"created_at":"2026-05-18T03:19:57.212631+00:00","updated_at":"2026-05-18T03:19:57.212631+00:00"}