{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YQWNL4LCL6OOVQVFYVUL2OIS5V","short_pith_number":"pith:YQWNL4LC","canonical_record":{"source":{"id":"2301.05550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-01-13T13:55:03Z","cross_cats_sorted":[],"title_canon_sha256":"6f5c0ddbc216dd9b888a8bee16952a1d2e025f6faa3e8cce3bfabb889a787d8d","abstract_canon_sha256":"cba9249866995b6627da21f8deb7adebb4a050625c383b26ab3869de29fe47d3"},"schema_version":"1.0"},"canonical_sha256":"c42cd5f1625f9ceac2a5c568bd3912ed7bf0a78c24299c52c34cff07f772254b","source":{"kind":"arxiv","id":"2301.05550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.05550","created_at":"2026-07-05T05:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"2301.05550v1","created_at":"2026-07-05T05:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05550","created_at":"2026-07-05T05:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"YQWNL4LCL6OO","created_at":"2026-07-05T05:32:54Z"},{"alias_kind":"pith_short_16","alias_value":"YQWNL4LCL6OOVQVF","created_at":"2026-07-05T05:32:54Z"},{"alias_kind":"pith_short_8","alias_value":"YQWNL4LC","created_at":"2026-07-05T05:32:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YQWNL4LCL6OOVQVFYVUL2OIS5V","target":"record","payload":{"canonical_record":{"source":{"id":"2301.05550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-01-13T13:55:03Z","cross_cats_sorted":[],"title_canon_sha256":"6f5c0ddbc216dd9b888a8bee16952a1d2e025f6faa3e8cce3bfabb889a787d8d","abstract_canon_sha256":"cba9249866995b6627da21f8deb7adebb4a050625c383b26ab3869de29fe47d3"},"schema_version":"1.0"},"canonical_sha256":"c42cd5f1625f9ceac2a5c568bd3912ed7bf0a78c24299c52c34cff07f772254b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:54.264698Z","signature_b64":"Myv9guGQ89UbcYiATG0WVx/UmvXPgKkjlIpCTjsQLOezYgaRt0AaCfSPfuYCRaytigQE0z6WFTrRrrhBaOH5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c42cd5f1625f9ceac2a5c568bd3912ed7bf0a78c24299c52c34cff07f772254b","last_reissued_at":"2026-07-05T05:32:54.264360Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:54.264360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.05550","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-05T05:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQ6dgD82xsfasC535nJCcEi9u4RbXD7CUiv6EpUXsvA+krfQpx0OLAldmPwZ5toatjUsBSHMNvspTcPe8qc2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:51:28.438598Z"},"content_sha256":"25f243613b0f18fbe4a5b8178193e8be8f37d0628dd8002316c16607dbf8e06e","schema_version":"1.0","event_id":"sha256:25f243613b0f18fbe4a5b8178193e8be8f37d0628dd8002316c16607dbf8e06e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YQWNL4LCL6OOVQVFYVUL2OIS5V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recognizing Unit Disk Graphs in Hyperbolic Geometry is $\\exists\\mathbb{R}$-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Emil Dohse, Nicholas Bieker, Paul Jungeblut, Thomas Bl\\\"asius","submitted_at":"2023-01-13T13:55:03Z","abstract_excerpt":"A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane $\\mathbb{R}^2$. Recognizing them is known to be $\\exists\\mathbb{R}$-complete, i.e., as hard as solving a system of polynomial inequalities. In this note we describe a simple framework to translate $\\exists\\mathbb{R}$-hardness reductions from the Euclidean plane $\\mathbb{R}^2$ to the hyperbolic plane $\\mathbb{H}^2$. We apply our framework to prove that the recognition of unit disk graphs in the hyperbolic plane is also $\\exists\\mathbb{R}$-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05550","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/2301.05550/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-05T05:32:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bnh+JKiZe3ZrfqMc/eBIJqTkTtKIORYcSpOCIHHOtZW3W6/0RPsPwtDhh0DcbQhPgTleU3o3j6o4Zjya1BJdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T14:51:28.439089Z"},"content_sha256":"202066c742197b0fbb6270e6f64a58c5f8b38791a7ad6e233aeddf9dc308f974","schema_version":"1.0","event_id":"sha256:202066c742197b0fbb6270e6f64a58c5f8b38791a7ad6e233aeddf9dc308f974"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQWNL4LCL6OOVQVFYVUL2OIS5V/bundle.json","state_url":"https://pith.science/pith/YQWNL4LCL6OOVQVFYVUL2OIS5V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQWNL4LCL6OOVQVFYVUL2OIS5V/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-15T14:51:28Z","links":{"resolver":"https://pith.science/pith/YQWNL4LCL6OOVQVFYVUL2OIS5V","bundle":"https://pith.science/pith/YQWNL4LCL6OOVQVFYVUL2OIS5V/bundle.json","state":"https://pith.science/pith/YQWNL4LCL6OOVQVFYVUL2OIS5V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQWNL4LCL6OOVQVFYVUL2OIS5V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YQWNL4LCL6OOVQVFYVUL2OIS5V","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":"cba9249866995b6627da21f8deb7adebb4a050625c383b26ab3869de29fe47d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-01-13T13:55:03Z","title_canon_sha256":"6f5c0ddbc216dd9b888a8bee16952a1d2e025f6faa3e8cce3bfabb889a787d8d"},"schema_version":"1.0","source":{"id":"2301.05550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.05550","created_at":"2026-07-05T05:32:54Z"},{"alias_kind":"arxiv_version","alias_value":"2301.05550v1","created_at":"2026-07-05T05:32:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05550","created_at":"2026-07-05T05:32:54Z"},{"alias_kind":"pith_short_12","alias_value":"YQWNL4LCL6OO","created_at":"2026-07-05T05:32:54Z"},{"alias_kind":"pith_short_16","alias_value":"YQWNL4LCL6OOVQVF","created_at":"2026-07-05T05:32:54Z"},{"alias_kind":"pith_short_8","alias_value":"YQWNL4LC","created_at":"2026-07-05T05:32:54Z"}],"graph_snapshots":[{"event_id":"sha256:202066c742197b0fbb6270e6f64a58c5f8b38791a7ad6e233aeddf9dc308f974","target":"graph","created_at":"2026-07-05T05:32:54Z","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/2301.05550/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane $\\mathbb{R}^2$. Recognizing them is known to be $\\exists\\mathbb{R}$-complete, i.e., as hard as solving a system of polynomial inequalities. In this note we describe a simple framework to translate $\\exists\\mathbb{R}$-hardness reductions from the Euclidean plane $\\mathbb{R}^2$ to the hyperbolic plane $\\mathbb{H}^2$. We apply our framework to prove that the recognition of unit disk graphs in the hyperbolic plane is also $\\exists\\mathbb{R}$-complete.","authors_text":"Emil Dohse, Nicholas Bieker, Paul Jungeblut, Thomas Bl\\\"asius","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-01-13T13:55:03Z","title":"Recognizing Unit Disk Graphs in Hyperbolic Geometry is $\\exists\\mathbb{R}$-Complete"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05550","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:25f243613b0f18fbe4a5b8178193e8be8f37d0628dd8002316c16607dbf8e06e","target":"record","created_at":"2026-07-05T05:32:54Z","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":"cba9249866995b6627da21f8deb7adebb4a050625c383b26ab3869de29fe47d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-01-13T13:55:03Z","title_canon_sha256":"6f5c0ddbc216dd9b888a8bee16952a1d2e025f6faa3e8cce3bfabb889a787d8d"},"schema_version":"1.0","source":{"id":"2301.05550","kind":"arxiv","version":1}},"canonical_sha256":"c42cd5f1625f9ceac2a5c568bd3912ed7bf0a78c24299c52c34cff07f772254b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c42cd5f1625f9ceac2a5c568bd3912ed7bf0a78c24299c52c34cff07f772254b","first_computed_at":"2026-07-05T05:32:54.264360Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:32:54.264360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Myv9guGQ89UbcYiATG0WVx/UmvXPgKkjlIpCTjsQLOezYgaRt0AaCfSPfuYCRaytigQE0z6WFTrRrrhBaOH5Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:32:54.264698Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.05550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25f243613b0f18fbe4a5b8178193e8be8f37d0628dd8002316c16607dbf8e06e","sha256:202066c742197b0fbb6270e6f64a58c5f8b38791a7ad6e233aeddf9dc308f974"],"state_sha256":"6ed5366e9f484bdf170c5080f6406c9e2dde2a6cee70b73651427249d5a92c43"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hjuztao4qEcwwH+3/nz6hG6HW5L8xHaU2cRmZK1xyHW1zyua4c646c+Biit6Rqnz4yY6K9OiGua90ybHEfYfDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T14:51:28.443202Z","bundle_sha256":"7494c546e277c32d203f1bdb77b8df72f3911612ed504ffddf347692038d1708"}}