{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HM3E3H6Z6NMHDGRVLJSVZFO6XF","short_pith_number":"pith:HM3E3H6Z","schema_version":"1.0","canonical_sha256":"3b364d9fd9f358719a355a655c95deb9734dc8ffb9ab8e4ce9058023d5686325","source":{"kind":"arxiv","id":"1603.03818","version":1},"attestation_state":"computed","paper":{"title":"Degree Four Plane Spanners: Simpler and Better","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Duru T\\\"urko\\v{g}lu, Iyad Kanj, Ljubomir Perkovi\\'c","submitted_at":"2016-03-11T23:08:15Z","abstract_excerpt":"Let ${\\cal P}$ be a set of $n$ points embedded in the plane, and let ${\\cal C}$ be the complete Euclidean graph whose point-set is ${\\cal P}$. Each edge in ${\\cal C}$ between two points $p, q$ is realized as the line segment $[pq]$, and is assigned a weight equal to the Euclidean distance $|pq|$. In this paper, we show how to construct in $O(n\\lg{n})$ time a plane spanner of ${\\cal C}$ of maximum degree at most 4 and stretch factor at most 20. This improves a long sequence of results on the construction of plane spanners of ${\\cal C}$. Our result matches the smallest known upper bound of 4 by "},"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":"1603.03818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-03-11T23:08:15Z","cross_cats_sorted":[],"title_canon_sha256":"dcb4e124c728a105229ca3f0d5083c835a5cf45202c8146cc15dd18d377f62c6","abstract_canon_sha256":"9c913e68f0e46c5bddb33ef323197a8f73597b0b3337c88bdc60c16e7be93553"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:10.424670Z","signature_b64":"VfjmR8PBqBKtLAH1FrBHKQxrAkxZAy+BOnLk9I5ydTISYtQsV9s9//4pPqMsdOgbphWDxdZi/+F7iGQSVxzPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b364d9fd9f358719a355a655c95deb9734dc8ffb9ab8e4ce9058023d5686325","last_reissued_at":"2026-05-18T01:19:10.424003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:10.424003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree Four Plane Spanners: Simpler and Better","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Duru T\\\"urko\\v{g}lu, Iyad Kanj, Ljubomir Perkovi\\'c","submitted_at":"2016-03-11T23:08:15Z","abstract_excerpt":"Let ${\\cal P}$ be a set of $n$ points embedded in the plane, and let ${\\cal C}$ be the complete Euclidean graph whose point-set is ${\\cal P}$. Each edge in ${\\cal C}$ between two points $p, q$ is realized as the line segment $[pq]$, and is assigned a weight equal to the Euclidean distance $|pq|$. In this paper, we show how to construct in $O(n\\lg{n})$ time a plane spanner of ${\\cal C}$ of maximum degree at most 4 and stretch factor at most 20. This improves a long sequence of results on the construction of plane spanners of ${\\cal C}$. Our result matches the smallest known upper bound of 4 by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03818","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":"1603.03818","created_at":"2026-05-18T01:19:10.424093+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03818v1","created_at":"2026-05-18T01:19:10.424093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03818","created_at":"2026-05-18T01:19:10.424093+00:00"},{"alias_kind":"pith_short_12","alias_value":"HM3E3H6Z6NMH","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HM3E3H6Z6NMHDGRV","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HM3E3H6Z","created_at":"2026-05-18T12:30:19.053100+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/HM3E3H6Z6NMHDGRVLJSVZFO6XF","json":"https://pith.science/pith/HM3E3H6Z6NMHDGRVLJSVZFO6XF.json","graph_json":"https://pith.science/api/pith-number/HM3E3H6Z6NMHDGRVLJSVZFO6XF/graph.json","events_json":"https://pith.science/api/pith-number/HM3E3H6Z6NMHDGRVLJSVZFO6XF/events.json","paper":"https://pith.science/paper/HM3E3H6Z"},"agent_actions":{"view_html":"https://pith.science/pith/HM3E3H6Z6NMHDGRVLJSVZFO6XF","download_json":"https://pith.science/pith/HM3E3H6Z6NMHDGRVLJSVZFO6XF.json","view_paper":"https://pith.science/paper/HM3E3H6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03818&json=true","fetch_graph":"https://pith.science/api/pith-number/HM3E3H6Z6NMHDGRVLJSVZFO6XF/graph.json","fetch_events":"https://pith.science/api/pith-number/HM3E3H6Z6NMHDGRVLJSVZFO6XF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HM3E3H6Z6NMHDGRVLJSVZFO6XF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HM3E3H6Z6NMHDGRVLJSVZFO6XF/action/storage_attestation","attest_author":"https://pith.science/pith/HM3E3H6Z6NMHDGRVLJSVZFO6XF/action/author_attestation","sign_citation":"https://pith.science/pith/HM3E3H6Z6NMHDGRVLJSVZFO6XF/action/citation_signature","submit_replication":"https://pith.science/pith/HM3E3H6Z6NMHDGRVLJSVZFO6XF/action/replication_record"}},"created_at":"2026-05-18T01:19:10.424093+00:00","updated_at":"2026-05-18T01:19:10.424093+00:00"}