{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1999:DRHIXKDBTOKHCNNWN7ZALONEYN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"378ccebbf467f2d66e9011c13962a1e88a4f00ef450adee4a0d1e16dee95da31","cross_cats_sorted":[],"license":"","primary_cat":"cs.CG","submitted_at":"1999-09-03T16:51:23Z","title_canon_sha256":"5b70c5850461c342749f31e5123c4ed3973195681413d84612d4a486c2bb5e5d"},"schema_version":"1.0","source":{"id":"cs/9909007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/9909007","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"arxiv_version","alias_value":"cs/9909007v1","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/9909007","created_at":"2026-05-18T01:06:48Z"},{"alias_kind":"pith_short_12","alias_value":"DRHIXKDBTOKH","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_16","alias_value":"DRHIXKDBTOKHCNNW","created_at":"2026-05-18T12:25:49Z"},{"alias_kind":"pith_short_8","alias_value":"DRHIXKDB","created_at":"2026-05-18T12:25:49Z"}],"graph_snapshots":[{"event_id":"sha256:87a36dbdf4e0cf7e2a7df6466c433b065b048fea55b650fa791a678b3334c7e5","target":"graph","created_at":"2026-05-18T01:06:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jean-Daniel Boissonnat, Jurek Czyzowicz, Mariette Yvinec, Olivier Devillers","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CG","submitted_at":"1999-09-03T16:51:23Z","title":"Circular Separability of Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/9909007","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:46c13c16312f493d2d6b76bdb804d619077bf83257bd63684a1c925df7fcc51d","target":"record","created_at":"2026-05-18T01:06:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"378ccebbf467f2d66e9011c13962a1e88a4f00ef450adee4a0d1e16dee95da31","cross_cats_sorted":[],"license":"","primary_cat":"cs.CG","submitted_at":"1999-09-03T16:51:23Z","title_canon_sha256":"5b70c5850461c342749f31e5123c4ed3973195681413d84612d4a486c2bb5e5d"},"schema_version":"1.0","source":{"id":"cs/9909007","kind":"arxiv","version":1}},"canonical_sha256":"1c4e8ba8619b947135b66ff205b9a4c3416da9e64364bd22d9f27e481d6f591c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c4e8ba8619b947135b66ff205b9a4c3416da9e64364bd22d9f27e481d6f591c","first_computed_at":"2026-05-18T01:06:48.782585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:48.782585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hDQoDVqDDwFXEx9fgOdj72EMMk7zpelt1TKs99bcw+PbIjrtaE3XJwt6LQmDHNb2ykdCxbodhQmzGcs8JikFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:48.783092Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/9909007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46c13c16312f493d2d6b76bdb804d619077bf83257bd63684a1c925df7fcc51d","sha256:87a36dbdf4e0cf7e2a7df6466c433b065b048fea55b650fa791a678b3334c7e5"],"state_sha256":"2306dafc4270c4c788e1818b5a2cc6562b474e434cc3f012a100150837945fbe"}