{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:C5Y3JVCUG2YTD6YLGHEOJ2CGUY","short_pith_number":"pith:C5Y3JVCU","schema_version":"1.0","canonical_sha256":"1771b4d45436b131fb0b31c8e4e846a63ef6f9696a4ca413456d4ccc1d761d65","source":{"kind":"arxiv","id":"1111.0499","version":1},"attestation_state":"computed","paper":{"title":"Evaluating geometric queries using few arithmetic operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","math.AG"],"primary_cat":"cs.DS","authors_text":"Bart Kuijpers, Joos Heintz, Rafael Grimson","submitted_at":"2011-11-01T17:57:20Z","abstract_excerpt":"Let $\\cp:=(P_1,...,P_s)$ be a given family of $n$-variate polynomials with integer coefficients and suppose that the degrees and logarithmic heights of these polynomials are bounded by $d$ and $h$, respectively. Suppose furthermore that for each $1\\leq i\\leq s$ the polynomial $P_i$ can be evaluated using $L$ arithmetic operations (additions, subtractions, multiplications and the constants 0 and 1). Assume that the family $\\cp$ is in a suitable sense \\emph{generic}. We construct a database $\\cal D$, supported by an algebraic computation tree, such that for each $x\\in [0,1]^n$ the query for the "},"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":"1111.0499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-01T17:57:20Z","cross_cats_sorted":["cs.DB","math.AG"],"title_canon_sha256":"05e9ad767c71e2f1e823cd64ccdd6defec290827618645f19cb20162c572a130","abstract_canon_sha256":"ebeb305071b24aff8ead2aec925f8f33be67f1a3af982c2497d9369ae759c256"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:44.816606Z","signature_b64":"g1hMJzYzamxrpIwXOX/0rQrj2I9ccR+hVbWchxYbSg+UT+9SpPxRHO5UiFIUR5LduvdHgTE8rkBhzZtaoazcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1771b4d45436b131fb0b31c8e4e846a63ef6f9696a4ca413456d4ccc1d761d65","last_reissued_at":"2026-05-18T04:09:44.816065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:44.816065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating geometric queries using few arithmetic operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","math.AG"],"primary_cat":"cs.DS","authors_text":"Bart Kuijpers, Joos Heintz, Rafael Grimson","submitted_at":"2011-11-01T17:57:20Z","abstract_excerpt":"Let $\\cp:=(P_1,...,P_s)$ be a given family of $n$-variate polynomials with integer coefficients and suppose that the degrees and logarithmic heights of these polynomials are bounded by $d$ and $h$, respectively. Suppose furthermore that for each $1\\leq i\\leq s$ the polynomial $P_i$ can be evaluated using $L$ arithmetic operations (additions, subtractions, multiplications and the constants 0 and 1). Assume that the family $\\cp$ is in a suitable sense \\emph{generic}. We construct a database $\\cal D$, supported by an algebraic computation tree, such that for each $x\\in [0,1]^n$ the query for the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0499","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":"1111.0499","created_at":"2026-05-18T04:09:44.816152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0499v1","created_at":"2026-05-18T04:09:44.816152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0499","created_at":"2026-05-18T04:09:44.816152+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5Y3JVCUG2YT","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5Y3JVCUG2YTD6YL","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5Y3JVCU","created_at":"2026-05-18T12:26:24.575870+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/C5Y3JVCUG2YTD6YLGHEOJ2CGUY","json":"https://pith.science/pith/C5Y3JVCUG2YTD6YLGHEOJ2CGUY.json","graph_json":"https://pith.science/api/pith-number/C5Y3JVCUG2YTD6YLGHEOJ2CGUY/graph.json","events_json":"https://pith.science/api/pith-number/C5Y3JVCUG2YTD6YLGHEOJ2CGUY/events.json","paper":"https://pith.science/paper/C5Y3JVCU"},"agent_actions":{"view_html":"https://pith.science/pith/C5Y3JVCUG2YTD6YLGHEOJ2CGUY","download_json":"https://pith.science/pith/C5Y3JVCUG2YTD6YLGHEOJ2CGUY.json","view_paper":"https://pith.science/paper/C5Y3JVCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0499&json=true","fetch_graph":"https://pith.science/api/pith-number/C5Y3JVCUG2YTD6YLGHEOJ2CGUY/graph.json","fetch_events":"https://pith.science/api/pith-number/C5Y3JVCUG2YTD6YLGHEOJ2CGUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5Y3JVCUG2YTD6YLGHEOJ2CGUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5Y3JVCUG2YTD6YLGHEOJ2CGUY/action/storage_attestation","attest_author":"https://pith.science/pith/C5Y3JVCUG2YTD6YLGHEOJ2CGUY/action/author_attestation","sign_citation":"https://pith.science/pith/C5Y3JVCUG2YTD6YLGHEOJ2CGUY/action/citation_signature","submit_replication":"https://pith.science/pith/C5Y3JVCUG2YTD6YLGHEOJ2CGUY/action/replication_record"}},"created_at":"2026-05-18T04:09:44.816152+00:00","updated_at":"2026-05-18T04:09:44.816152+00:00"}