{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1994:UZPDALD7RTVI6ASHOTPCXE72BM","short_pith_number":"pith:UZPDALD7","schema_version":"1.0","canonical_sha256":"a65e302c7f8cea8f024774de2b93fa0b3f3f3ec34cbbaaf075696607d40ad2ba","source":{"kind":"arxiv","id":"math/9409226","version":1},"attestation_state":"computed","paper":{"title":"Geometry based heuristics for unit disk graphs","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Daniel J. Rosenkrantz, Harry B. Hunt III, H. Breu, Madhav V. Marathe, S. S. Ravi","submitted_at":"1994-09-21T00:00:00Z","abstract_excerpt":"Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line coloring heuristic which achieves a competitive ratio of 6 for unit disk graphs. Our heuristics do not need a geometric representation of unit disk graphs. Geometric representations are used only in establishing the performance guarantees of th"},"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":"math/9409226","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"fdffe588bd46bf10e043498c2b8e17e8b11d6a822d0f9be341cd36e794951c36","abstract_canon_sha256":"82936d76d2768ab0fb6174ed169b605e3a2b974d079f4e9dd85161a824c45636"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:51.055783Z","signature_b64":"Uni6m6VLr9XeW2d2cIxD3DKWp3JFxtXcbuiolyD15DqbENMxWIhwBpb4Si1fL1mEpbiJqo64ooXQncsnFYyKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a65e302c7f8cea8f024774de2b93fa0b3f3f3ec34cbbaaf075696607d40ad2ba","last_reissued_at":"2026-05-18T01:05:51.055145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:51.055145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometry based heuristics for unit disk graphs","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Daniel J. Rosenkrantz, Harry B. Hunt III, H. Breu, Madhav V. Marathe, S. S. Ravi","submitted_at":"1994-09-21T00:00:00Z","abstract_excerpt":"Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line coloring heuristic which achieves a competitive ratio of 6 for unit disk graphs. Our heuristics do not need a geometric representation of unit disk graphs. Geometric representations are used only in establishing the performance guarantees of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9409226","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":"math/9409226","created_at":"2026-05-18T01:05:51.055244+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9409226v1","created_at":"2026-05-18T01:05:51.055244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409226","created_at":"2026-05-18T01:05:51.055244+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZPDALD7RTVI","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZPDALD7RTVI6ASH","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZPDALD7","created_at":"2026-05-18T12:25:47.102015+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/UZPDALD7RTVI6ASHOTPCXE72BM","json":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM.json","graph_json":"https://pith.science/api/pith-number/UZPDALD7RTVI6ASHOTPCXE72BM/graph.json","events_json":"https://pith.science/api/pith-number/UZPDALD7RTVI6ASHOTPCXE72BM/events.json","paper":"https://pith.science/paper/UZPDALD7"},"agent_actions":{"view_html":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM","download_json":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM.json","view_paper":"https://pith.science/paper/UZPDALD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9409226&json=true","fetch_graph":"https://pith.science/api/pith-number/UZPDALD7RTVI6ASHOTPCXE72BM/graph.json","fetch_events":"https://pith.science/api/pith-number/UZPDALD7RTVI6ASHOTPCXE72BM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM/action/storage_attestation","attest_author":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM/action/author_attestation","sign_citation":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM/action/citation_signature","submit_replication":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM/action/replication_record"}},"created_at":"2026-05-18T01:05:51.055244+00:00","updated_at":"2026-05-18T01:05:51.055244+00:00"}