{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:DRHIXKDBTOKHCNNWN7ZALONEYN","short_pith_number":"pith:DRHIXKDB","schema_version":"1.0","canonical_sha256":"1c4e8ba8619b947135b66ff205b9a4c3416da9e64364bd22d9f27e481d6f591c","source":{"kind":"arxiv","id":"cs/9909007","version":1},"attestation_state":"computed","paper":{"title":"Circular Separability of Polygons","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jean-Daniel Boissonnat, Jurek Czyzowicz, Mariette Yvinec, Olivier Devillers","submitted_at":"1999-09-03T16:51:23Z","abstract_excerpt":"Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set.\n This paper studies two problems related to circular separability. A linear-time algorithm is proposed to decide if two polygons are circularly separable. The algorithm outputs the smallest separating circle. The second problem asks for the largest circle included in a preprocessed, convex polygon, under some point and/or line constraints. The resulting circle must contain the query points and it must lie in the halfplanes delimited by the q"},"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":"cs/9909007","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CG","submitted_at":"1999-09-03T16:51:23Z","cross_cats_sorted":[],"title_canon_sha256":"5b70c5850461c342749f31e5123c4ed3973195681413d84612d4a486c2bb5e5d","abstract_canon_sha256":"378ccebbf467f2d66e9011c13962a1e88a4f00ef450adee4a0d1e16dee95da31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:48.783092Z","signature_b64":"hDQoDVqDDwFXEx9fgOdj72EMMk7zpelt1TKs99bcw+PbIjrtaE3XJwt6LQmDHNb2ykdCxbodhQmzGcs8JikFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c4e8ba8619b947135b66ff205b9a4c3416da9e64364bd22d9f27e481d6f591c","last_reissued_at":"2026-05-18T01:06:48.782585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:48.782585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circular Separability of Polygons","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jean-Daniel Boissonnat, Jurek Czyzowicz, Mariette Yvinec, Olivier Devillers","submitted_at":"1999-09-03T16:51:23Z","abstract_excerpt":"Two planar sets are circularly separable if there exists a circle enclosing one of the sets and whose open interior disk does not intersect the other set.\n This paper studies two problems related to circular separability. A linear-time algorithm is proposed to decide if two polygons are circularly separable. The algorithm outputs the smallest separating circle. The second problem asks for the largest circle included in a preprocessed, convex polygon, under some point and/or line constraints. The resulting circle must contain the query points and it must lie in the halfplanes delimited by the q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9909007","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":"cs/9909007","created_at":"2026-05-18T01:06:48.782674+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/9909007v1","created_at":"2026-05-18T01:06:48.782674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9909007","created_at":"2026-05-18T01:06:48.782674+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRHIXKDBTOKH","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRHIXKDBTOKHCNNW","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRHIXKDB","created_at":"2026-05-18T12:25:49.038998+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/DRHIXKDBTOKHCNNWN7ZALONEYN","json":"https://pith.science/pith/DRHIXKDBTOKHCNNWN7ZALONEYN.json","graph_json":"https://pith.science/api/pith-number/DRHIXKDBTOKHCNNWN7ZALONEYN/graph.json","events_json":"https://pith.science/api/pith-number/DRHIXKDBTOKHCNNWN7ZALONEYN/events.json","paper":"https://pith.science/paper/DRHIXKDB"},"agent_actions":{"view_html":"https://pith.science/pith/DRHIXKDBTOKHCNNWN7ZALONEYN","download_json":"https://pith.science/pith/DRHIXKDBTOKHCNNWN7ZALONEYN.json","view_paper":"https://pith.science/paper/DRHIXKDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/9909007&json=true","fetch_graph":"https://pith.science/api/pith-number/DRHIXKDBTOKHCNNWN7ZALONEYN/graph.json","fetch_events":"https://pith.science/api/pith-number/DRHIXKDBTOKHCNNWN7ZALONEYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRHIXKDBTOKHCNNWN7ZALONEYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRHIXKDBTOKHCNNWN7ZALONEYN/action/storage_attestation","attest_author":"https://pith.science/pith/DRHIXKDBTOKHCNNWN7ZALONEYN/action/author_attestation","sign_citation":"https://pith.science/pith/DRHIXKDBTOKHCNNWN7ZALONEYN/action/citation_signature","submit_replication":"https://pith.science/pith/DRHIXKDBTOKHCNNWN7ZALONEYN/action/replication_record"}},"created_at":"2026-05-18T01:06:48.782674+00:00","updated_at":"2026-05-18T01:06:48.782674+00:00"}