{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GOJQ5GEWZLODP5FZ27QGKPALJP","short_pith_number":"pith:GOJQ5GEW","schema_version":"1.0","canonical_sha256":"33930e9896cadc37f4b9d7e0653c0b4bf531f24ede40d46b0f41afb6505f582b","source":{"kind":"arxiv","id":"1805.10847","version":1},"attestation_state":"computed","paper":{"title":"On the intersection graph of the disks with diameters the sides of a convex $n$-gon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Luis H. Herrera, Pablo P\\'erez-Lantero","submitted_at":"2018-05-28T10:03:58Z","abstract_excerpt":"Given a convex $n$-gon, we can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with vertices the $n$ disks and two disks are adjacent if and only if they have a point in common. Such a graph was introduced by Huemer and P\\'erez-Lantero in 2016, proved to be planar and Hamiltonian. In this paper we study further combinatorial properties of this graph. We prove that the treewidth is at most 3, by showing an $O(n)$-time algorithm that builds a"},"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":"1805.10847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-05-28T10:03:58Z","cross_cats_sorted":[],"title_canon_sha256":"06693249c6e11ba85c7310f9e3663652b6f4556b7595e290cecfe631f0edf70c","abstract_canon_sha256":"3f1ad9ce934a4c805cd8b67b659bb2a5c3602178df6809916eed5b7748812f37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:51.211219Z","signature_b64":"eBKv1cni7krI4LANqH2QDH5+b4PDcnSidi8t0eikg7XZg/W7cckcF26ijZQCKpyTCDg7hQGOBXM/ioqx88RkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33930e9896cadc37f4b9d7e0653c0b4bf531f24ede40d46b0f41afb6505f582b","last_reissued_at":"2026-05-18T00:14:51.210607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:51.210607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the intersection graph of the disks with diameters the sides of a convex $n$-gon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Luis H. Herrera, Pablo P\\'erez-Lantero","submitted_at":"2018-05-28T10:03:58Z","abstract_excerpt":"Given a convex $n$-gon, we can draw $n$ disks (called side disks) where each disk has a different side of the polygon as diameter and the midpoint of the side as its center. The intersection graph of such disks is the undirected graph with vertices the $n$ disks and two disks are adjacent if and only if they have a point in common. Such a graph was introduced by Huemer and P\\'erez-Lantero in 2016, proved to be planar and Hamiltonian. In this paper we study further combinatorial properties of this graph. We prove that the treewidth is at most 3, by showing an $O(n)$-time algorithm that builds a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10847","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":"1805.10847","created_at":"2026-05-18T00:14:51.210705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10847v1","created_at":"2026-05-18T00:14:51.210705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10847","created_at":"2026-05-18T00:14:51.210705+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOJQ5GEWZLOD","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOJQ5GEWZLODP5FZ","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOJQ5GEW","created_at":"2026-05-18T12:32:25.280505+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/GOJQ5GEWZLODP5FZ27QGKPALJP","json":"https://pith.science/pith/GOJQ5GEWZLODP5FZ27QGKPALJP.json","graph_json":"https://pith.science/api/pith-number/GOJQ5GEWZLODP5FZ27QGKPALJP/graph.json","events_json":"https://pith.science/api/pith-number/GOJQ5GEWZLODP5FZ27QGKPALJP/events.json","paper":"https://pith.science/paper/GOJQ5GEW"},"agent_actions":{"view_html":"https://pith.science/pith/GOJQ5GEWZLODP5FZ27QGKPALJP","download_json":"https://pith.science/pith/GOJQ5GEWZLODP5FZ27QGKPALJP.json","view_paper":"https://pith.science/paper/GOJQ5GEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10847&json=true","fetch_graph":"https://pith.science/api/pith-number/GOJQ5GEWZLODP5FZ27QGKPALJP/graph.json","fetch_events":"https://pith.science/api/pith-number/GOJQ5GEWZLODP5FZ27QGKPALJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOJQ5GEWZLODP5FZ27QGKPALJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOJQ5GEWZLODP5FZ27QGKPALJP/action/storage_attestation","attest_author":"https://pith.science/pith/GOJQ5GEWZLODP5FZ27QGKPALJP/action/author_attestation","sign_citation":"https://pith.science/pith/GOJQ5GEWZLODP5FZ27QGKPALJP/action/citation_signature","submit_replication":"https://pith.science/pith/GOJQ5GEWZLODP5FZ27QGKPALJP/action/replication_record"}},"created_at":"2026-05-18T00:14:51.210705+00:00","updated_at":"2026-05-18T00:14:51.210705+00:00"}