{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:6KAOB2VNFCGWDQQU67HLMECBGE","short_pith_number":"pith:6KAOB2VN","schema_version":"1.0","canonical_sha256":"f280e0eaad288d61c214f7ceb6104131235c72cb25cac45a1b75305ec935b001","source":{"kind":"arxiv","id":"1011.1602","version":1},"attestation_state":"computed","paper":{"title":"Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Jes\\'us A. De Loera, Matthias K\\\"oppe, Mich\\`ele Vergne, Nicole Berline, Velleda Baldoni","submitted_at":"2010-11-07T01:27:49Z","abstract_excerpt":"This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree coefficients of the weighted Ehrhart quasi-polynomial for a rational simple polytope in varying dimension, when the weights of the lattice points are given by a polynomial function h. Our technique is based on a refinement of an algorithm of A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), pp. 1449--1466] in the u"},"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":"1011.1602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-07T01:27:49Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"72e9af41b3a8307002a666d7e0844794d06631c6b45212a8f2d9940d77e5d1c3","abstract_canon_sha256":"165c1131e02f94307235b579a534fbbe443050ce0dd5c60871298cd92b48b391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:50.840998Z","signature_b64":"B6lj4e6h2Rqv8JM2fTR2QOOLQIHTQ/zb+6o7G69wLoGBCOrKu+M8V1GtAa/Ja3oEmZYTvd3DAL1N/Epw+4n0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f280e0eaad288d61c214f7ceb6104131235c72cb25cac45a1b75305ec935b001","last_reissued_at":"2026-05-18T04:36:50.840623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:50.840623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Jes\\'us A. De Loera, Matthias K\\\"oppe, Mich\\`ele Vergne, Nicole Berline, Velleda Baldoni","submitted_at":"2010-11-07T01:27:49Z","abstract_excerpt":"This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree coefficients of the weighted Ehrhart quasi-polynomial for a rational simple polytope in varying dimension, when the weights of the lattice points are given by a polynomial function h. Our technique is based on a refinement of an algorithm of A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), pp. 1449--1466] in the u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1602","kind":"arxiv","version":1},"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":"1011.1602","created_at":"2026-05-18T04:36:50.840679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1602v1","created_at":"2026-05-18T04:36:50.840679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1602","created_at":"2026-05-18T04:36:50.840679+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KAOB2VNFCGW","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KAOB2VNFCGWDQQU","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KAOB2VN","created_at":"2026-05-18T12:26:04.259169+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/6KAOB2VNFCGWDQQU67HLMECBGE","json":"https://pith.science/pith/6KAOB2VNFCGWDQQU67HLMECBGE.json","graph_json":"https://pith.science/api/pith-number/6KAOB2VNFCGWDQQU67HLMECBGE/graph.json","events_json":"https://pith.science/api/pith-number/6KAOB2VNFCGWDQQU67HLMECBGE/events.json","paper":"https://pith.science/paper/6KAOB2VN"},"agent_actions":{"view_html":"https://pith.science/pith/6KAOB2VNFCGWDQQU67HLMECBGE","download_json":"https://pith.science/pith/6KAOB2VNFCGWDQQU67HLMECBGE.json","view_paper":"https://pith.science/paper/6KAOB2VN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1602&json=true","fetch_graph":"https://pith.science/api/pith-number/6KAOB2VNFCGWDQQU67HLMECBGE/graph.json","fetch_events":"https://pith.science/api/pith-number/6KAOB2VNFCGWDQQU67HLMECBGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KAOB2VNFCGWDQQU67HLMECBGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KAOB2VNFCGWDQQU67HLMECBGE/action/storage_attestation","attest_author":"https://pith.science/pith/6KAOB2VNFCGWDQQU67HLMECBGE/action/author_attestation","sign_citation":"https://pith.science/pith/6KAOB2VNFCGWDQQU67HLMECBGE/action/citation_signature","submit_replication":"https://pith.science/pith/6KAOB2VNFCGWDQQU67HLMECBGE/action/replication_record"}},"created_at":"2026-05-18T04:36:50.840679+00:00","updated_at":"2026-05-18T04:36:50.840679+00:00"}