{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1994:UZPDALD7RTVI6ASHOTPCXE72BM","short_pith_number":"pith:UZPDALD7","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"},"canonical_sha256":"a65e302c7f8cea8f024774de2b93fa0b3f3f3ec34cbbaaf075696607d40ad2ba","source":{"kind":"arxiv","id":"math/9409226","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9409226","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"math/9409226v1","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409226","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"UZPDALD7RTVI","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"UZPDALD7RTVI6ASH","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"UZPDALD7","created_at":"2026-05-18T12:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1994:UZPDALD7RTVI6ASHOTPCXE72BM","target":"record","payload":{"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"},"canonical_sha256":"a65e302c7f8cea8f024774de2b93fa0b3f3f3ec34cbbaaf075696607d40ad2ba","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"},"source_kind":"arxiv","source_id":"math/9409226","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:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Fcw0p3NOrBe6X8ulEk90tLFbcDaI5M+8nZhKtOFnz74wGkDPrh/hRuoYpNeQGNg24n0r9y/hQqHTbrkxc1SCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:40:40.670240Z"},"content_sha256":"5d244fbc68f4bb5c4ed92af33bc3f2e72dfedee013d1b77ac82e5af02ca8aea6","schema_version":"1.0","event_id":"sha256:5d244fbc68f4bb5c4ed92af33bc3f2e72dfedee013d1b77ac82e5af02ca8aea6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1994:UZPDALD7RTVI6ASHOTPCXE72BM","target":"graph","payload":{"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"},"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:05:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLcXYcRmxHMPQYYW/6o44QCDe+N0++/3lTVpCGQ1blHbMaHBYklOknTFEG0Kp43ViGL8EyJyCRr4JAlQnPfhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:40:40.670953Z"},"content_sha256":"cdb37c85780ab2acca7289cc8ae71920c61fb1f819652ef40206af8e6fc8203a","schema_version":"1.0","event_id":"sha256:cdb37c85780ab2acca7289cc8ae71920c61fb1f819652ef40206af8e6fc8203a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM/bundle.json","state_url":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZPDALD7RTVI6ASHOTPCXE72BM/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-25T13:40:40Z","links":{"resolver":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM","bundle":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM/bundle.json","state":"https://pith.science/pith/UZPDALD7RTVI6ASHOTPCXE72BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZPDALD7RTVI6ASHOTPCXE72BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1994:UZPDALD7RTVI6ASHOTPCXE72BM","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":"82936d76d2768ab0fb6174ed169b605e3a2b974d079f4e9dd85161a824c45636","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","title_canon_sha256":"fdffe588bd46bf10e043498c2b8e17e8b11d6a822d0f9be341cd36e794951c36"},"schema_version":"1.0","source":{"id":"math/9409226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9409226","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"arxiv_version","alias_value":"math/9409226v1","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9409226","created_at":"2026-05-18T01:05:51Z"},{"alias_kind":"pith_short_12","alias_value":"UZPDALD7RTVI","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"UZPDALD7RTVI6ASH","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"UZPDALD7","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:cdb37c85780ab2acca7289cc8ae71920c61fb1f819652ef40206af8e6fc8203a","target":"graph","created_at":"2026-05-18T01:05:51Z","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":"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","authors_text":"Daniel J. Rosenkrantz, Harry B. Hunt III, H. Breu, Madhav V. Marathe, S. S. Ravi","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","title":"Geometry based heuristics for unit disk graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9409226","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:5d244fbc68f4bb5c4ed92af33bc3f2e72dfedee013d1b77ac82e5af02ca8aea6","target":"record","created_at":"2026-05-18T01:05:51Z","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":"82936d76d2768ab0fb6174ed169b605e3a2b974d079f4e9dd85161a824c45636","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"math.CO","submitted_at":"1994-09-21T00:00:00Z","title_canon_sha256":"fdffe588bd46bf10e043498c2b8e17e8b11d6a822d0f9be341cd36e794951c36"},"schema_version":"1.0","source":{"id":"math/9409226","kind":"arxiv","version":1}},"canonical_sha256":"a65e302c7f8cea8f024774de2b93fa0b3f3f3ec34cbbaaf075696607d40ad2ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a65e302c7f8cea8f024774de2b93fa0b3f3f3ec34cbbaaf075696607d40ad2ba","first_computed_at":"2026-05-18T01:05:51.055145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:51.055145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uni6m6VLr9XeW2d2cIxD3DKWp3JFxtXcbuiolyD15DqbENMxWIhwBpb4Si1fL1mEpbiJqo64ooXQncsnFYyKBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:51.055783Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9409226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d244fbc68f4bb5c4ed92af33bc3f2e72dfedee013d1b77ac82e5af02ca8aea6","sha256:cdb37c85780ab2acca7289cc8ae71920c61fb1f819652ef40206af8e6fc8203a"],"state_sha256":"11a01610ea07c93190a253bdc36237e69f0cb0c0023e87f61a93d9c137ae55bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"On7qeEt5vQgSpFGfU18u+zT9nMO2n4gxY9mU601GkeaWF7pXnTR2OfjWtjxqRaCNFK8DiwnTsKpQZZh5HS/oCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:40:40.674981Z","bundle_sha256":"a23fc0a02b61575ca9e38e3e9d7be5f85a630b143194f0305521afac61a3565f"}}