{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:JH5QQ3EOQT7DGVKQBNKV7YL6DG","short_pith_number":"pith:JH5QQ3EO","canonical_record":{"source":{"id":"2107.04321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-07-09T09:20:30Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6b207d914ebe4ba6bf619358e54e752c2249ca2d1aa00a2424d43de25b4c0fdb","abstract_canon_sha256":"ec994c9352e77116b46b8bfa8d35a7961486bcc891cb0cf3da44672ad1848503"},"schema_version":"1.0"},"canonical_sha256":"49fb086c8e84fe3355500b555fe17e1986d09523ca98ad1e0f7b8429e529a77a","source":{"kind":"arxiv","id":"2107.04321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.04321","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"2107.04321v1","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04321","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"JH5QQ3EOQT7D","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_16","alias_value":"JH5QQ3EOQT7DGVKQ","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_8","alias_value":"JH5QQ3EO","created_at":"2026-07-05T02:56:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:JH5QQ3EOQT7DGVKQBNKV7YL6DG","target":"record","payload":{"canonical_record":{"source":{"id":"2107.04321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-07-09T09:20:30Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"6b207d914ebe4ba6bf619358e54e752c2249ca2d1aa00a2424d43de25b4c0fdb","abstract_canon_sha256":"ec994c9352e77116b46b8bfa8d35a7961486bcc891cb0cf3da44672ad1848503"},"schema_version":"1.0"},"canonical_sha256":"49fb086c8e84fe3355500b555fe17e1986d09523ca98ad1e0f7b8429e529a77a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:56:32.127692Z","signature_b64":"+UGY8x7mNH3tQgnwo5teECn7/0Dw5iSSiXDh67rlrVid7x4H/hw2nD24grBLG3KDAl+DxobKgIEo5NEXUtZdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49fb086c8e84fe3355500b555fe17e1986d09523ca98ad1e0f7b8429e529a77a","last_reissued_at":"2026-07-05T02:56:32.127182Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:56:32.127182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.04321","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-07-05T02:56:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4p5s6vatDqHmE4g8yNFnZCIWts05nwhuJWH78U/ym6q+WewWaCNtemcWDWwGPwZou8Io7ly0bFPYW5dLdvPHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:07:18.855561Z"},"content_sha256":"7c0f263c6950e1e0d38f2b18faa8a52d4dae7dab98378b6806ef90c077eafa47","schema_version":"1.0","event_id":"sha256:7c0f263c6950e1e0d38f2b18faa8a52d4dae7dab98378b6806ef90c077eafa47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:JH5QQ3EOQT7DGVKQBNKV7YL6DG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Malte Renken, Pascal Kunz, Rolf Niedermeier, Till Fluschnik","submitted_at":"2021-07-09T09:20:30Z","abstract_excerpt":"Proximity graphs have been studied for several decades, motivated by applications in computational geometry, geography, data mining, and many other fields. However, the computational complexity of classic graph problems on proximity graphs mostly remained open. We now study 3-Colorability, Dominating Set, Feedback Vertex Set, Hamiltonian Cycle, and Independent Set on the proximity graph classes relative neighborhood graphs, Gabriel graphs, and relatively closest graphs. We prove that all of the problems remain NP-hard on these graphs, except for 3-Colorability and Hamiltonian Cycle on relative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04321","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.04321/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:56:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4C6yBUSE2VPKc57b8A8BeCFt/02LFXn1mbqiMta90xHiWrDLhN+CzRzgoEF/CO3+ZI7ISNkcN21/1d7cJWwlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:07:18.856134Z"},"content_sha256":"dbd09919b753712e797ccad2d5064b5d31e72bc1b9d65b7d8f17c692e29ab470","schema_version":"1.0","event_id":"sha256:dbd09919b753712e797ccad2d5064b5d31e72bc1b9d65b7d8f17c692e29ab470"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JH5QQ3EOQT7DGVKQBNKV7YL6DG/bundle.json","state_url":"https://pith.science/pith/JH5QQ3EOQT7DGVKQBNKV7YL6DG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JH5QQ3EOQT7DGVKQBNKV7YL6DG/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-08-05T03:07:18Z","links":{"resolver":"https://pith.science/pith/JH5QQ3EOQT7DGVKQBNKV7YL6DG","bundle":"https://pith.science/pith/JH5QQ3EOQT7DGVKQBNKV7YL6DG/bundle.json","state":"https://pith.science/pith/JH5QQ3EOQT7DGVKQBNKV7YL6DG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JH5QQ3EOQT7DGVKQBNKV7YL6DG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:JH5QQ3EOQT7DGVKQBNKV7YL6DG","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":"ec994c9352e77116b46b8bfa8d35a7961486bcc891cb0cf3da44672ad1848503","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-07-09T09:20:30Z","title_canon_sha256":"6b207d914ebe4ba6bf619358e54e752c2249ca2d1aa00a2424d43de25b4c0fdb"},"schema_version":"1.0","source":{"id":"2107.04321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.04321","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"2107.04321v1","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.04321","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"JH5QQ3EOQT7D","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_16","alias_value":"JH5QQ3EOQT7DGVKQ","created_at":"2026-07-05T02:56:32Z"},{"alias_kind":"pith_short_8","alias_value":"JH5QQ3EO","created_at":"2026-07-05T02:56:32Z"}],"graph_snapshots":[{"event_id":"sha256:dbd09919b753712e797ccad2d5064b5d31e72bc1b9d65b7d8f17c692e29ab470","target":"graph","created_at":"2026-07-05T02:56:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2107.04321/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Proximity graphs have been studied for several decades, motivated by applications in computational geometry, geography, data mining, and many other fields. However, the computational complexity of classic graph problems on proximity graphs mostly remained open. We now study 3-Colorability, Dominating Set, Feedback Vertex Set, Hamiltonian Cycle, and Independent Set on the proximity graph classes relative neighborhood graphs, Gabriel graphs, and relatively closest graphs. We prove that all of the problems remain NP-hard on these graphs, except for 3-Colorability and Hamiltonian Cycle on relative","authors_text":"Malte Renken, Pascal Kunz, Rolf Niedermeier, Till Fluschnik","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-07-09T09:20:30Z","title":"Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.04321","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:7c0f263c6950e1e0d38f2b18faa8a52d4dae7dab98378b6806ef90c077eafa47","target":"record","created_at":"2026-07-05T02:56:32Z","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":"ec994c9352e77116b46b8bfa8d35a7961486bcc891cb0cf3da44672ad1848503","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-07-09T09:20:30Z","title_canon_sha256":"6b207d914ebe4ba6bf619358e54e752c2249ca2d1aa00a2424d43de25b4c0fdb"},"schema_version":"1.0","source":{"id":"2107.04321","kind":"arxiv","version":1}},"canonical_sha256":"49fb086c8e84fe3355500b555fe17e1986d09523ca98ad1e0f7b8429e529a77a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49fb086c8e84fe3355500b555fe17e1986d09523ca98ad1e0f7b8429e529a77a","first_computed_at":"2026-07-05T02:56:32.127182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:56:32.127182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+UGY8x7mNH3tQgnwo5teECn7/0Dw5iSSiXDh67rlrVid7x4H/hw2nD24grBLG3KDAl+DxobKgIEo5NEXUtZdDw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:56:32.127692Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.04321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c0f263c6950e1e0d38f2b18faa8a52d4dae7dab98378b6806ef90c077eafa47","sha256:dbd09919b753712e797ccad2d5064b5d31e72bc1b9d65b7d8f17c692e29ab470"],"state_sha256":"1e1f3c15e833576c2aa791f32440f2968dec986477038c63723908ce509f8fb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"faLcGLU2m1n1qrujfpRaswLpVdQp2PMuDyXbQnH0c4Zz13jroc+l0DHypNWVbQFox0Sx+MLZ1tvtnLmIqcXODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:07:18.861017Z","bundle_sha256":"349e31adf37b5ca9e9e8486f7a9b5536ef4f0c2c7c7d7ef874d9770a89ab1044"}}