{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MGXGBIZRALOUQBUZTU7ANRLCXH","short_pith_number":"pith:MGXGBIZR","schema_version":"1.0","canonical_sha256":"61ae60a33102dd4806999d3e06c562b9e5aa7654c1c61d3ec520c3323e06ece5","source":{"kind":"arxiv","id":"1502.03690","version":1},"attestation_state":"computed","paper":{"title":"Semi-dynamic connectivity in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Michael Kerber, Sergio Cabello","submitted_at":"2015-02-12T15:03:56Z","abstract_excerpt":"Motivated by a path planning problem we consider the following procedure. Assume that we have two points $s$ and $t$ in the plane and take $\\mathcal{K}=\\emptyset$. At each step we add to $\\mathcal{K}$ a compact convex set that does not contain $s$ nor $t$. The procedure terminates when the sets in $\\mathcal{K}$ separate $s$ and $t$. We show how to add one set to $\\mathcal{K}$ in $O(1+k\\alpha(n))$ amortized time plus the time needed to find all sets of $\\mathcal{K}$ intersecting the newly added set, where $n$ is the cardinality of $\\mathcal{K}$, $k$ is the number of sets in $\\mathcal{K}$ inters"},"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":"1502.03690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-02-12T15:03:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a1232baa322e2a31eef56e84f409e0b8fe8725d69de8c9eb36d076074a3435e7","abstract_canon_sha256":"7fec44be0fec2b85b85f228e8ac75c0d854619b121199eab376f46f5cea87233"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:17.034017Z","signature_b64":"OW7+rzkba3X7QTi4OjvW1AlE1hetTChGhm5JQgX+p7ASdE7DhQi4BERAruCqfW/RXVjyVCMK1Bh+w7KyoEGqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61ae60a33102dd4806999d3e06c562b9e5aa7654c1c61d3ec520c3323e06ece5","last_reissued_at":"2026-05-18T02:27:17.033210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:17.033210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-dynamic connectivity in the plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Michael Kerber, Sergio Cabello","submitted_at":"2015-02-12T15:03:56Z","abstract_excerpt":"Motivated by a path planning problem we consider the following procedure. Assume that we have two points $s$ and $t$ in the plane and take $\\mathcal{K}=\\emptyset$. At each step we add to $\\mathcal{K}$ a compact convex set that does not contain $s$ nor $t$. The procedure terminates when the sets in $\\mathcal{K}$ separate $s$ and $t$. We show how to add one set to $\\mathcal{K}$ in $O(1+k\\alpha(n))$ amortized time plus the time needed to find all sets of $\\mathcal{K}$ intersecting the newly added set, where $n$ is the cardinality of $\\mathcal{K}$, $k$ is the number of sets in $\\mathcal{K}$ inters"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03690","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":"1502.03690","created_at":"2026-05-18T02:27:17.033349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03690v1","created_at":"2026-05-18T02:27:17.033349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03690","created_at":"2026-05-18T02:27:17.033349+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGXGBIZRALOU","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGXGBIZRALOUQBUZ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGXGBIZR","created_at":"2026-05-18T12:29:32.376354+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/MGXGBIZRALOUQBUZTU7ANRLCXH","json":"https://pith.science/pith/MGXGBIZRALOUQBUZTU7ANRLCXH.json","graph_json":"https://pith.science/api/pith-number/MGXGBIZRALOUQBUZTU7ANRLCXH/graph.json","events_json":"https://pith.science/api/pith-number/MGXGBIZRALOUQBUZTU7ANRLCXH/events.json","paper":"https://pith.science/paper/MGXGBIZR"},"agent_actions":{"view_html":"https://pith.science/pith/MGXGBIZRALOUQBUZTU7ANRLCXH","download_json":"https://pith.science/pith/MGXGBIZRALOUQBUZTU7ANRLCXH.json","view_paper":"https://pith.science/paper/MGXGBIZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03690&json=true","fetch_graph":"https://pith.science/api/pith-number/MGXGBIZRALOUQBUZTU7ANRLCXH/graph.json","fetch_events":"https://pith.science/api/pith-number/MGXGBIZRALOUQBUZTU7ANRLCXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGXGBIZRALOUQBUZTU7ANRLCXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGXGBIZRALOUQBUZTU7ANRLCXH/action/storage_attestation","attest_author":"https://pith.science/pith/MGXGBIZRALOUQBUZTU7ANRLCXH/action/author_attestation","sign_citation":"https://pith.science/pith/MGXGBIZRALOUQBUZTU7ANRLCXH/action/citation_signature","submit_replication":"https://pith.science/pith/MGXGBIZRALOUQBUZTU7ANRLCXH/action/replication_record"}},"created_at":"2026-05-18T02:27:17.033349+00:00","updated_at":"2026-05-18T02:27:17.033349+00:00"}