{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SM4Y7TROCE3MO5M2OQHXCPOT2D","short_pith_number":"pith:SM4Y7TRO","schema_version":"1.0","canonical_sha256":"93398fce2e1136c7759a740f713dd3d0d68d23c7ab1f8fbbaca118fde5d7ce68","source":{"kind":"arxiv","id":"1205.0273","version":1},"attestation_state":"computed","paper":{"title":"Geometric Computations on Indecisive and Uncertain Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Allan Jorgensen, Jeff M. Phillips, Maarten L\\\"offler","submitted_at":"2012-05-01T22:32:59Z","abstract_excerpt":"We study computing geometric problems on uncertain points. An uncertain point is a point that does not have a fixed location, but rather is described by a probability distribution. When these probability distributions are restricted to a finite number of locations, the points are called indecisive points. In particular, we focus on geometric shape-fitting problems and on building compact distributions to describe how the solutions to these problems vary with respect to the uncertainty in the points. Our main results are: (1) a simple and efficient randomized approximation algorithm for calcula"},"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":"1205.0273","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-05-01T22:32:59Z","cross_cats_sorted":[],"title_canon_sha256":"e17c24cdf8557671522f18e9b797f986aee89b57e475d8d7924fca604c4c43d5","abstract_canon_sha256":"c870e081d51e1c82da3c0c9a008a9bfbcdc9e53b82c4672c7751b98d6ea5ce93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:34.866254Z","signature_b64":"ruUeXOi7jOA+FRXw2XGruk/uf4ZFH9NAC8nFfeSjL0CCCd4b3XwG7JtPWmvpAky2KHI7tot1YiJOAceCOf3QBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93398fce2e1136c7759a740f713dd3d0d68d23c7ab1f8fbbaca118fde5d7ce68","last_reissued_at":"2026-05-18T03:56:34.865846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:34.865846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric Computations on Indecisive and Uncertain Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Allan Jorgensen, Jeff M. Phillips, Maarten L\\\"offler","submitted_at":"2012-05-01T22:32:59Z","abstract_excerpt":"We study computing geometric problems on uncertain points. An uncertain point is a point that does not have a fixed location, but rather is described by a probability distribution. When these probability distributions are restricted to a finite number of locations, the points are called indecisive points. In particular, we focus on geometric shape-fitting problems and on building compact distributions to describe how the solutions to these problems vary with respect to the uncertainty in the points. Our main results are: (1) a simple and efficient randomized approximation algorithm for calcula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0273","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":"1205.0273","created_at":"2026-05-18T03:56:34.865908+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0273v1","created_at":"2026-05-18T03:56:34.865908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0273","created_at":"2026-05-18T03:56:34.865908+00:00"},{"alias_kind":"pith_short_12","alias_value":"SM4Y7TROCE3M","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SM4Y7TROCE3MO5M2","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SM4Y7TRO","created_at":"2026-05-18T12:27:20.899486+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/SM4Y7TROCE3MO5M2OQHXCPOT2D","json":"https://pith.science/pith/SM4Y7TROCE3MO5M2OQHXCPOT2D.json","graph_json":"https://pith.science/api/pith-number/SM4Y7TROCE3MO5M2OQHXCPOT2D/graph.json","events_json":"https://pith.science/api/pith-number/SM4Y7TROCE3MO5M2OQHXCPOT2D/events.json","paper":"https://pith.science/paper/SM4Y7TRO"},"agent_actions":{"view_html":"https://pith.science/pith/SM4Y7TROCE3MO5M2OQHXCPOT2D","download_json":"https://pith.science/pith/SM4Y7TROCE3MO5M2OQHXCPOT2D.json","view_paper":"https://pith.science/paper/SM4Y7TRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0273&json=true","fetch_graph":"https://pith.science/api/pith-number/SM4Y7TROCE3MO5M2OQHXCPOT2D/graph.json","fetch_events":"https://pith.science/api/pith-number/SM4Y7TROCE3MO5M2OQHXCPOT2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SM4Y7TROCE3MO5M2OQHXCPOT2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SM4Y7TROCE3MO5M2OQHXCPOT2D/action/storage_attestation","attest_author":"https://pith.science/pith/SM4Y7TROCE3MO5M2OQHXCPOT2D/action/author_attestation","sign_citation":"https://pith.science/pith/SM4Y7TROCE3MO5M2OQHXCPOT2D/action/citation_signature","submit_replication":"https://pith.science/pith/SM4Y7TROCE3MO5M2OQHXCPOT2D/action/replication_record"}},"created_at":"2026-05-18T03:56:34.865908+00:00","updated_at":"2026-05-18T03:56:34.865908+00:00"}