{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7XRVUDE6FAD64E2C3XVPPPG5H2","short_pith_number":"pith:7XRVUDE6","schema_version":"1.0","canonical_sha256":"fde35a0c9e2807ee1342ddeaf7bcdd3eabbc0e0f94510b8868384778a44eedaf","source":{"kind":"arxiv","id":"1703.00112","version":1},"attestation_state":"computed","paper":{"title":"Minimum Enclosing Circle of a Set of Static Points with Dynamic Weight from One Free Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lei Qiu, Li Zhang, Yu Zhang","submitted_at":"2017-03-01T02:48:12Z","abstract_excerpt":"Given a set $S$ of $n$ static points and a free point $p$ in the Euclidean plane, we study a new variation of the minimum enclosing circle problem, in which a dynamic weight that equals to the reciprocal of the distance from the free point $p$ to the undetermined circle center is included. In this work, we prove the optimal solution of the new problem is unique and lies on the boundary of the farthest-point Voronoi diagram of $S$, once $p$ does not coincide with any vertex of the convex hull of $S$. We propose a tree structure constructed from the boundary of the farthest-point Voronoi diagram"},"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":"1703.00112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-03-01T02:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"a26e76b4ccd7ef096a5d96d8db30bfd69b018475c81b103425ce655bdc968d3f","abstract_canon_sha256":"0c8f7b4f8f2307fe862311433812e2cc4dc1860ee5e2351560ba438d46bb86ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:45.956083Z","signature_b64":"WIiXVexa5SlgNosX8nABAQ2JWYj7K4PxarMbkbZk0iVqxdpFG2otNS1dltCG9Wt/tobl7+I88u910sOH+rhJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fde35a0c9e2807ee1342ddeaf7bcdd3eabbc0e0f94510b8868384778a44eedaf","last_reissued_at":"2026-05-18T00:49:45.955419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:45.955419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Enclosing Circle of a Set of Static Points with Dynamic Weight from One Free Point","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Lei Qiu, Li Zhang, Yu Zhang","submitted_at":"2017-03-01T02:48:12Z","abstract_excerpt":"Given a set $S$ of $n$ static points and a free point $p$ in the Euclidean plane, we study a new variation of the minimum enclosing circle problem, in which a dynamic weight that equals to the reciprocal of the distance from the free point $p$ to the undetermined circle center is included. In this work, we prove the optimal solution of the new problem is unique and lies on the boundary of the farthest-point Voronoi diagram of $S$, once $p$ does not coincide with any vertex of the convex hull of $S$. We propose a tree structure constructed from the boundary of the farthest-point Voronoi diagram"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00112","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":"1703.00112","created_at":"2026-05-18T00:49:45.955522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00112v1","created_at":"2026-05-18T00:49:45.955522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00112","created_at":"2026-05-18T00:49:45.955522+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XRVUDE6FAD6","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XRVUDE6FAD64E2C","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XRVUDE6","created_at":"2026-05-18T12:31:05.417338+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/7XRVUDE6FAD64E2C3XVPPPG5H2","json":"https://pith.science/pith/7XRVUDE6FAD64E2C3XVPPPG5H2.json","graph_json":"https://pith.science/api/pith-number/7XRVUDE6FAD64E2C3XVPPPG5H2/graph.json","events_json":"https://pith.science/api/pith-number/7XRVUDE6FAD64E2C3XVPPPG5H2/events.json","paper":"https://pith.science/paper/7XRVUDE6"},"agent_actions":{"view_html":"https://pith.science/pith/7XRVUDE6FAD64E2C3XVPPPG5H2","download_json":"https://pith.science/pith/7XRVUDE6FAD64E2C3XVPPPG5H2.json","view_paper":"https://pith.science/paper/7XRVUDE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00112&json=true","fetch_graph":"https://pith.science/api/pith-number/7XRVUDE6FAD64E2C3XVPPPG5H2/graph.json","fetch_events":"https://pith.science/api/pith-number/7XRVUDE6FAD64E2C3XVPPPG5H2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XRVUDE6FAD64E2C3XVPPPG5H2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XRVUDE6FAD64E2C3XVPPPG5H2/action/storage_attestation","attest_author":"https://pith.science/pith/7XRVUDE6FAD64E2C3XVPPPG5H2/action/author_attestation","sign_citation":"https://pith.science/pith/7XRVUDE6FAD64E2C3XVPPPG5H2/action/citation_signature","submit_replication":"https://pith.science/pith/7XRVUDE6FAD64E2C3XVPPPG5H2/action/replication_record"}},"created_at":"2026-05-18T00:49:45.955522+00:00","updated_at":"2026-05-18T00:49:45.955522+00:00"}