{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IOEW5FYY24ELYMIKUNRWGJACQH","short_pith_number":"pith:IOEW5FYY","schema_version":"1.0","canonical_sha256":"43896e9718d708bc310aa36363240281c7e3ae19ead8b166497e6cdcdfc4a1f0","source":{"kind":"arxiv","id":"1206.7067","version":3},"attestation_state":"computed","paper":{"title":"Faster Geometric Algorithms via Dynamic Determinant Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Luis Pe\\~naranda, Vissarion Fisikopoulos","submitted_at":"2012-06-29T16:24:28Z","abstract_excerpt":"The computation of determinants or their signs is the core procedure in many important geometric algorithms, such as convex hull, volume and point location. As the dimension of the computation space grows, a higher percentage of the total computation time is consumed by these computations. In this paper we study the sequences of determinants that appear in geometric algorithms. The computation of a single determinant is accelerated by using the information from the previous computations in that sequence.\n  We propose two dynamic determinant algorithms with quadratic arithmetic complexity when "},"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":"1206.7067","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2012-06-29T16:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"fbb109208b685fc96de9ad0230dd980fb30f4f14ce25e54d11beb9535aedec00","abstract_canon_sha256":"39a844c314adaaf0db12616808120d5feff83368fd548eb005e2f3fde199897a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:40.970628Z","signature_b64":"YB1jOoq4t765M4tDAtdBIvcrT9+qHwyBEwrl08wUDAZ7HnQRgoUrSovx8cQPoioGzVJug7r1rpBinoszDa1/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43896e9718d708bc310aa36363240281c7e3ae19ead8b166497e6cdcdfc4a1f0","last_reissued_at":"2026-05-18T01:21:40.970017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:40.970017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Geometric Algorithms via Dynamic Determinant Computation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Luis Pe\\~naranda, Vissarion Fisikopoulos","submitted_at":"2012-06-29T16:24:28Z","abstract_excerpt":"The computation of determinants or their signs is the core procedure in many important geometric algorithms, such as convex hull, volume and point location. As the dimension of the computation space grows, a higher percentage of the total computation time is consumed by these computations. In this paper we study the sequences of determinants that appear in geometric algorithms. The computation of a single determinant is accelerated by using the information from the previous computations in that sequence.\n  We propose two dynamic determinant algorithms with quadratic arithmetic complexity when "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.7067","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":"1206.7067","created_at":"2026-05-18T01:21:40.970096+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.7067v3","created_at":"2026-05-18T01:21:40.970096+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.7067","created_at":"2026-05-18T01:21:40.970096+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOEW5FYY24EL","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOEW5FYY24ELYMIK","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOEW5FYY","created_at":"2026-05-18T12:27:09.501522+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/IOEW5FYY24ELYMIKUNRWGJACQH","json":"https://pith.science/pith/IOEW5FYY24ELYMIKUNRWGJACQH.json","graph_json":"https://pith.science/api/pith-number/IOEW5FYY24ELYMIKUNRWGJACQH/graph.json","events_json":"https://pith.science/api/pith-number/IOEW5FYY24ELYMIKUNRWGJACQH/events.json","paper":"https://pith.science/paper/IOEW5FYY"},"agent_actions":{"view_html":"https://pith.science/pith/IOEW5FYY24ELYMIKUNRWGJACQH","download_json":"https://pith.science/pith/IOEW5FYY24ELYMIKUNRWGJACQH.json","view_paper":"https://pith.science/paper/IOEW5FYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.7067&json=true","fetch_graph":"https://pith.science/api/pith-number/IOEW5FYY24ELYMIKUNRWGJACQH/graph.json","fetch_events":"https://pith.science/api/pith-number/IOEW5FYY24ELYMIKUNRWGJACQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOEW5FYY24ELYMIKUNRWGJACQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOEW5FYY24ELYMIKUNRWGJACQH/action/storage_attestation","attest_author":"https://pith.science/pith/IOEW5FYY24ELYMIKUNRWGJACQH/action/author_attestation","sign_citation":"https://pith.science/pith/IOEW5FYY24ELYMIKUNRWGJACQH/action/citation_signature","submit_replication":"https://pith.science/pith/IOEW5FYY24ELYMIKUNRWGJACQH/action/replication_record"}},"created_at":"2026-05-18T01:21:40.970096+00:00","updated_at":"2026-05-18T01:21:40.970096+00:00"}