{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KSVD6NSN5W3EZ3TTSDT76HS7ZJ","short_pith_number":"pith:KSVD6NSN","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"},"canonical_sha256":"54aa3f364dedb64cee7390e7ff1e5fca4f0fe79a3fd49fe102d5e151bc64fd51","source":{"kind":"arxiv","id":"1509.00720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00720","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00720v1","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00720","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"KSVD6NSN5W3E","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KSVD6NSN5W3EZ3TT","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KSVD6NSN","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KSVD6NSN5W3EZ3TTSDT76HS7ZJ","target":"record","payload":{"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"},"canonical_sha256":"54aa3f364dedb64cee7390e7ff1e5fca4f0fe79a3fd49fe102d5e151bc64fd51","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"},"source_kind":"arxiv","source_id":"1509.00720","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/UFAGphg7KX56n7njvBu7oEtmWDJ/qwW5L6+3ETkNMXk9Fo/Uv9TrWUJrvPfny3ZghxzGXLSKWrDaJqAlwMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:43:55.577446Z"},"content_sha256":"ea7b51c2315ff4ea61af85eed1648c5b1f4a2b4acf24d0a6fc99b91a7a8a3a66","schema_version":"1.0","event_id":"sha256:ea7b51c2315ff4ea61af85eed1648c5b1f4a2b4acf24d0a6fc99b91a7a8a3a66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KSVD6NSN5W3EZ3TTSDT76HS7ZJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:34:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYZUVP1U1qIGMh2CXr+69VxsZX7DO2qEd2kHeB8EykbA6HNcHoKJuj4mB4qZ+0jktG350gULVvuovVWqYMnXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:43:55.578169Z"},"content_sha256":"8d457d42477acf25976f8e23f06b3303008cc207c42f298dc975e17385e7f7f7","schema_version":"1.0","event_id":"sha256:8d457d42477acf25976f8e23f06b3303008cc207c42f298dc975e17385e7f7f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/bundle.json","state_url":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T16:43:55Z","links":{"resolver":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ","bundle":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/bundle.json","state":"https://pith.science/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KSVD6NSN5W3EZ3TTSDT76HS7ZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KSVD6NSN5W3EZ3TTSDT76HS7ZJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b9db2ed42798910261ea9cb8fca08018b3b267384e6656e3c251854b1093a6b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-02T14:30:18Z","title_canon_sha256":"6c470fec6258f7e40afb5a94e3329e848973e6d87735d67a4c6d23259bf4ea7a"},"schema_version":"1.0","source":{"id":"1509.00720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00720","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00720v1","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00720","created_at":"2026-05-18T01:34:06Z"},{"alias_kind":"pith_short_12","alias_value":"KSVD6NSN5W3E","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KSVD6NSN5W3EZ3TT","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KSVD6NSN","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:8d457d42477acf25976f8e23f06b3303008cc207c42f298dc975e17385e7f7f7","target":"graph","created_at":"2026-05-18T01:34:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Boris Klemz, Martin N\\\"ollenburg, Roman Prutkin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-02T14:30:18Z","title":"Recognizing Weighted Disk Contact Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00720","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ea7b51c2315ff4ea61af85eed1648c5b1f4a2b4acf24d0a6fc99b91a7a8a3a66","target":"record","created_at":"2026-05-18T01:34:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b9db2ed42798910261ea9cb8fca08018b3b267384e6656e3c251854b1093a6b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-09-02T14:30:18Z","title_canon_sha256":"6c470fec6258f7e40afb5a94e3329e848973e6d87735d67a4c6d23259bf4ea7a"},"schema_version":"1.0","source":{"id":"1509.00720","kind":"arxiv","version":1}},"canonical_sha256":"54aa3f364dedb64cee7390e7ff1e5fca4f0fe79a3fd49fe102d5e151bc64fd51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54aa3f364dedb64cee7390e7ff1e5fca4f0fe79a3fd49fe102d5e151bc64fd51","first_computed_at":"2026-05-18T01:34:06.258695Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:06.258695Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3q3RE/QsHXgqACtQcUvT0l413kztKCAuL3LTzDIAs7lOkdHtvk+7QEFiRNMXYNfg5uhrxSezK+rNOwIegOU/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:06.259123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea7b51c2315ff4ea61af85eed1648c5b1f4a2b4acf24d0a6fc99b91a7a8a3a66","sha256:8d457d42477acf25976f8e23f06b3303008cc207c42f298dc975e17385e7f7f7"],"state_sha256":"1072c6d990a91fc4d63e3eb02e65cdab505573066b27e9aa717d915008274e91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nf0ltLdwmj4CKTTQkXaWxnANyKSqZGQsXPXrzq0bLooI8ejlZvn/90jdE3oKYigtE1sZHAphuY/j4VvYOahbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:43:55.582061Z","bundle_sha256":"43b42ad23664b4dbf49559d6ddd8eaa282e3477b02c66280cd21999f160fbeed"}}