{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IBD5BO7CXFZCBCAADT4DA4ZCSC","short_pith_number":"pith:IBD5BO7C","schema_version":"1.0","canonical_sha256":"4047d0bbe2b9722088001cf83073229091ed0ef3ef1640da18cadc523b0c0f91","source":{"kind":"arxiv","id":"1403.5350","version":1},"attestation_state":"computed","paper":{"title":"There are Plane Spanners of Maximum Degree 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ge Xia, Iyad Kanj, Ljubomir Perkovi\\'c, Nicolas Bonichon","submitted_at":"2014-03-21T02:50:05Z","abstract_excerpt":"Let E be the complete Euclidean graph on a set of points embedded in the plane. Given a constant t >= 1, a spanning subgraph G of E is said to be a t-spanner, or simply a spanner, if for any pair of vertices u,v in E the distance between u and v in G is at most t times their distance in E. A spanner is plane if its edges do not cross.\n  This paper considers the question: \"What is the smallest maximum degree that can always be achieved for a plane spanner of E?\" Without the planarity constraint, it is known that the answer is 3 which is thus the best known lower bound on the degree of any plane"},"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":"1403.5350","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-03-21T02:50:05Z","cross_cats_sorted":[],"title_canon_sha256":"d0f8f9903e84c1c3472375d621ed2df1db3d0c4b3716e45acc59d25db28351fb","abstract_canon_sha256":"3a6b196c9ab643d67d734a80de670c1693d86227fa6220b64966703ca6ba747c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:56.597422Z","signature_b64":"difYCe3MyiPWIa9zWb6hoi/xOgP4xiOlz4N6kktyZmKEJjTrdNI/bVcJpHriK+SRgbRj6XoQND235BjaZOORDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4047d0bbe2b9722088001cf83073229091ed0ef3ef1640da18cadc523b0c0f91","last_reissued_at":"2026-05-18T02:55:56.596752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:56.596752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"There are Plane Spanners of Maximum Degree 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ge Xia, Iyad Kanj, Ljubomir Perkovi\\'c, Nicolas Bonichon","submitted_at":"2014-03-21T02:50:05Z","abstract_excerpt":"Let E be the complete Euclidean graph on a set of points embedded in the plane. Given a constant t >= 1, a spanning subgraph G of E is said to be a t-spanner, or simply a spanner, if for any pair of vertices u,v in E the distance between u and v in G is at most t times their distance in E. A spanner is plane if its edges do not cross.\n  This paper considers the question: \"What is the smallest maximum degree that can always be achieved for a plane spanner of E?\" Without the planarity constraint, it is known that the answer is 3 which is thus the best known lower bound on the degree of any plane"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5350","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":"1403.5350","created_at":"2026-05-18T02:55:56.596855+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5350v1","created_at":"2026-05-18T02:55:56.596855+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5350","created_at":"2026-05-18T02:55:56.596855+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBD5BO7CXFZC","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBD5BO7CXFZCBCAA","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBD5BO7C","created_at":"2026-05-18T12:28:33.132498+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/IBD5BO7CXFZCBCAADT4DA4ZCSC","json":"https://pith.science/pith/IBD5BO7CXFZCBCAADT4DA4ZCSC.json","graph_json":"https://pith.science/api/pith-number/IBD5BO7CXFZCBCAADT4DA4ZCSC/graph.json","events_json":"https://pith.science/api/pith-number/IBD5BO7CXFZCBCAADT4DA4ZCSC/events.json","paper":"https://pith.science/paper/IBD5BO7C"},"agent_actions":{"view_html":"https://pith.science/pith/IBD5BO7CXFZCBCAADT4DA4ZCSC","download_json":"https://pith.science/pith/IBD5BO7CXFZCBCAADT4DA4ZCSC.json","view_paper":"https://pith.science/paper/IBD5BO7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5350&json=true","fetch_graph":"https://pith.science/api/pith-number/IBD5BO7CXFZCBCAADT4DA4ZCSC/graph.json","fetch_events":"https://pith.science/api/pith-number/IBD5BO7CXFZCBCAADT4DA4ZCSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBD5BO7CXFZCBCAADT4DA4ZCSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBD5BO7CXFZCBCAADT4DA4ZCSC/action/storage_attestation","attest_author":"https://pith.science/pith/IBD5BO7CXFZCBCAADT4DA4ZCSC/action/author_attestation","sign_citation":"https://pith.science/pith/IBD5BO7CXFZCBCAADT4DA4ZCSC/action/citation_signature","submit_replication":"https://pith.science/pith/IBD5BO7CXFZCBCAADT4DA4ZCSC/action/replication_record"}},"created_at":"2026-05-18T02:55:56.596855+00:00","updated_at":"2026-05-18T02:55:56.596855+00:00"}