{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KSVD6NSN5W3EZ3TTSDT76HS7ZJ","short_pith_number":"pith:KSVD6NSN","schema_version":"1.0","canonical_sha256":"54aa3f364dedb64cee7390e7ff1e5fca4f0fe79a3fd49fe102d5e151bc64fd51","source":{"kind":"arxiv","id":"1509.00720","version":1},"attestation_state":"computed","paper":{"title":"Recognizing Weighted Disk Contact Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Boris Klemz, Martin N\\\"ollenburg, Roman Prutkin","submitted_at":"2015-09-02T14:30:18Z","abstract_excerpt":"Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the corresponding vertices are adjacent in the graph. Deciding whether a vertex-weighted planar graph can be realized such that the disks' radii coincide with the vertex weights is known to be NP-hard. In this work, we reduce the gap between hardness and tractability by analyzing the problem for special graph classes. We show that it remains NP-hard for outerplanar graphs with unit weights and for stars with arbitrary weights, s"},"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":"1509.00720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-02T14:30:18Z","cross_cats_sorted":[],"title_canon_sha256":"6c470fec6258f7e40afb5a94e3329e848973e6d87735d67a4c6d23259bf4ea7a","abstract_canon_sha256":"b9db2ed42798910261ea9cb8fca08018b3b267384e6656e3c251854b1093a6b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:06.259123Z","signature_b64":"3q3RE/QsHXgqACtQcUvT0l413kztKCAuL3LTzDIAs7lOkdHtvk+7QEFiRNMXYNfg5uhrxSezK+rNOwIegOU/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54aa3f364dedb64cee7390e7ff1e5fca4f0fe79a3fd49fe102d5e151bc64fd51","last_reissued_at":"2026-05-18T01:34:06.258695Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:06.258695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recognizing Weighted Disk Contact Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Boris Klemz, Martin N\\\"ollenburg, Roman Prutkin","submitted_at":"2015-09-02T14:30:18Z","abstract_excerpt":"Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the corresponding vertices are adjacent in the graph. Deciding whether a vertex-weighted planar graph can be realized such that the disks' radii coincide with the vertex weights is known to be NP-hard. In this work, we reduce the gap between hardness and tractability by analyzing the problem for special graph classes. We show that it remains NP-hard for outerplanar graphs with unit weights and for stars with arbitrary weights, s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00720","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":"1509.00720","created_at":"2026-05-18T01:34:06.258761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00720v1","created_at":"2026-05-18T01:34:06.258761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00720","created_at":"2026-05-18T01:34:06.258761+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSVD6NSN5W3E","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSVD6NSN5W3EZ3TT","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSVD6NSN","created_at":"2026-05-18T12:29:29.992203+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/KSVD6NSN5W3EZ3TTSDT76HS7ZJ","json":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ.json","graph_json":"https://pith.science/api/pith-number/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/graph.json","events_json":"https://pith.science/api/pith-number/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/events.json","paper":"https://pith.science/paper/KSVD6NSN"},"agent_actions":{"view_html":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ","download_json":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ.json","view_paper":"https://pith.science/paper/KSVD6NSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00720&json=true","fetch_graph":"https://pith.science/api/pith-number/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/action/storage_attestation","attest_author":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/action/author_attestation","sign_citation":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/action/citation_signature","submit_replication":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/action/replication_record"}},"created_at":"2026-05-18T01:34:06.258761+00:00","updated_at":"2026-05-18T01:34:06.258761+00:00"}