{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PHG3XPHHZELHMQ54SEGAGM2WGJ","short_pith_number":"pith:PHG3XPHH","schema_version":"1.0","canonical_sha256":"79cdbbbce7c9167643bc910c033356325a2da0aee04ae79bf15e6dc7ae6a0ba1","source":{"kind":"arxiv","id":"1404.6233","version":1},"attestation_state":"computed","paper":{"title":"Towards Tight Bounds on Theta-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Jean-Lou De Carufel, Pat Morin, Prosenjit Bose, Sander Verdonschot","submitted_at":"2014-04-24T19:24:30Z","abstract_excerpt":"We present improved upper and lower bounds on the spanning ratio of $\\theta$-graphs with at least six cones. Given a set of points in the plane, a $\\theta$-graph partitions the plane around each vertex into $m$ disjoint cones, each having aperture $\\theta=2\\pi/m$, and adds an edge to the `closest' vertex in each cone. We show that for any integer $k \\geq 1$, $\\theta$-graphs with $4k+2$ cones have a spanning ratio of $1+2\\sin(\\theta/2)$ and we provide a matching lower bound, showing that this spanning ratio tight.\n  Next, we show that for any integer $k \\geq 1$, $\\theta$-graphs with $4k+4$ cone"},"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":"1404.6233","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-24T19:24:30Z","cross_cats_sorted":[],"title_canon_sha256":"04fb26191a1640531b7f74ea870cc09a1b3d7e58f367ac3a6503937efd0f418c","abstract_canon_sha256":"b9f6197747f79008a9f16362b6e60f9acd80c12df0e5ce037ad747e63e0bf1b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:17.969740Z","signature_b64":"pPx0dXE7ds4Z5d6Ud+Z8NDeUR6Exet0G95ygMO7G8OsXx1zWeQczVfw86h9M+BHxKunxo8L+XMtGMZH1JPz+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79cdbbbce7c9167643bc910c033356325a2da0aee04ae79bf15e6dc7ae6a0ba1","last_reissued_at":"2026-05-18T02:53:17.968917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:17.968917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Tight Bounds on Theta-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Jean-Lou De Carufel, Pat Morin, Prosenjit Bose, Sander Verdonschot","submitted_at":"2014-04-24T19:24:30Z","abstract_excerpt":"We present improved upper and lower bounds on the spanning ratio of $\\theta$-graphs with at least six cones. Given a set of points in the plane, a $\\theta$-graph partitions the plane around each vertex into $m$ disjoint cones, each having aperture $\\theta=2\\pi/m$, and adds an edge to the `closest' vertex in each cone. We show that for any integer $k \\geq 1$, $\\theta$-graphs with $4k+2$ cones have a spanning ratio of $1+2\\sin(\\theta/2)$ and we provide a matching lower bound, showing that this spanning ratio tight.\n  Next, we show that for any integer $k \\geq 1$, $\\theta$-graphs with $4k+4$ cone"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6233","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":"1404.6233","created_at":"2026-05-18T02:53:17.969058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6233v1","created_at":"2026-05-18T02:53:17.969058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6233","created_at":"2026-05-18T02:53:17.969058+00:00"},{"alias_kind":"pith_short_12","alias_value":"PHG3XPHHZELH","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PHG3XPHHZELHMQ54","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PHG3XPHH","created_at":"2026-05-18T12:28:43.426989+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/PHG3XPHHZELHMQ54SEGAGM2WGJ","json":"https://pith.science/pith/PHG3XPHHZELHMQ54SEGAGM2WGJ.json","graph_json":"https://pith.science/api/pith-number/PHG3XPHHZELHMQ54SEGAGM2WGJ/graph.json","events_json":"https://pith.science/api/pith-number/PHG3XPHHZELHMQ54SEGAGM2WGJ/events.json","paper":"https://pith.science/paper/PHG3XPHH"},"agent_actions":{"view_html":"https://pith.science/pith/PHG3XPHHZELHMQ54SEGAGM2WGJ","download_json":"https://pith.science/pith/PHG3XPHHZELHMQ54SEGAGM2WGJ.json","view_paper":"https://pith.science/paper/PHG3XPHH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6233&json=true","fetch_graph":"https://pith.science/api/pith-number/PHG3XPHHZELHMQ54SEGAGM2WGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/PHG3XPHHZELHMQ54SEGAGM2WGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PHG3XPHHZELHMQ54SEGAGM2WGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PHG3XPHHZELHMQ54SEGAGM2WGJ/action/storage_attestation","attest_author":"https://pith.science/pith/PHG3XPHHZELHMQ54SEGAGM2WGJ/action/author_attestation","sign_citation":"https://pith.science/pith/PHG3XPHHZELHMQ54SEGAGM2WGJ/action/citation_signature","submit_replication":"https://pith.science/pith/PHG3XPHHZELHMQ54SEGAGM2WGJ/action/replication_record"}},"created_at":"2026-05-18T02:53:17.969058+00:00","updated_at":"2026-05-18T02:53:17.969058+00:00"}