{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PWBMCI3BVU74C3A27L6TFUCLSB","short_pith_number":"pith:PWBMCI3B","schema_version":"1.0","canonical_sha256":"7d82c12361ad3fc16c1afafd32d04b90405e5f0f296fbfebfe77da541fadae8e","source":{"kind":"arxiv","id":"2407.09362","version":2},"attestation_state":"computed","paper":{"title":"Structure and Independence in Hyperbolic Uniform Disk Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Geert van Wordragen, Jean-Pierre von der Heydt, Marcus Wilhelm, S\\'andor Kisfaludi-Bak, Thomas Bl\\\"asius","submitted_at":"2024-07-12T15:43:03Z","abstract_excerpt":"We consider intersection graphs of disks of radius $r$ in the hyperbolic plane. Unlike the Euclidean setting, these graph classes are different for different values of $r$, where very small $r$ corresponds to an almost-Euclidean setting and $r \\in \\Omega(\\log n)$ corresponds to a firmly hyperbolic setting. We observe that larger values of $r$ create simpler graph classes, at least in terms of separators and the computational complexity of the \\textsc{Independent Set} problem.\n  First, we show that intersection graphs of disks of radius $r$ in the hyperbolic plane can be separated with $\\mathca"},"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":"2407.09362","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2024-07-12T15:43:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a93537b9797faf2090c57014abc0ad462bfbf888a1258e61e15158e0b6c93b91","abstract_canon_sha256":"e9673c9f72d25d46923acdb9c571a6b7e9d9c310b05ef33df1b465493353a465"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:40:01.832123Z","signature_b64":"/mXad2nK/BxTuoWXSH9bI34jRIfisVLOjHjt9MqPk3aF6Uhap7WQOhs3KWIDG+R7JBs4sJMuohjt0r2Hn1rLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d82c12361ad3fc16c1afafd32d04b90405e5f0f296fbfebfe77da541fadae8e","last_reissued_at":"2026-07-05T10:40:01.831628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:40:01.831628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure and Independence in Hyperbolic Uniform Disk Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Geert van Wordragen, Jean-Pierre von der Heydt, Marcus Wilhelm, S\\'andor Kisfaludi-Bak, Thomas Bl\\\"asius","submitted_at":"2024-07-12T15:43:03Z","abstract_excerpt":"We consider intersection graphs of disks of radius $r$ in the hyperbolic plane. Unlike the Euclidean setting, these graph classes are different for different values of $r$, where very small $r$ corresponds to an almost-Euclidean setting and $r \\in \\Omega(\\log n)$ corresponds to a firmly hyperbolic setting. We observe that larger values of $r$ create simpler graph classes, at least in terms of separators and the computational complexity of the \\textsc{Independent Set} problem.\n  First, we show that intersection graphs of disks of radius $r$ in the hyperbolic plane can be separated with $\\mathca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.09362","kind":"arxiv","version":2},"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/2407.09362/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.09362","created_at":"2026-07-05T10:40:01.831681+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.09362v2","created_at":"2026-07-05T10:40:01.831681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09362","created_at":"2026-07-05T10:40:01.831681+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWBMCI3BVU74","created_at":"2026-07-05T10:40:01.831681+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWBMCI3BVU74C3A2","created_at":"2026-07-05T10:40:01.831681+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWBMCI3B","created_at":"2026-07-05T10:40:01.831681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12424","citing_title":"Layered tree-independence number and clique-based separators","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PWBMCI3BVU74C3A27L6TFUCLSB","json":"https://pith.science/pith/PWBMCI3BVU74C3A27L6TFUCLSB.json","graph_json":"https://pith.science/api/pith-number/PWBMCI3BVU74C3A27L6TFUCLSB/graph.json","events_json":"https://pith.science/api/pith-number/PWBMCI3BVU74C3A27L6TFUCLSB/events.json","paper":"https://pith.science/paper/PWBMCI3B"},"agent_actions":{"view_html":"https://pith.science/pith/PWBMCI3BVU74C3A27L6TFUCLSB","download_json":"https://pith.science/pith/PWBMCI3BVU74C3A27L6TFUCLSB.json","view_paper":"https://pith.science/paper/PWBMCI3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.09362&json=true","fetch_graph":"https://pith.science/api/pith-number/PWBMCI3BVU74C3A27L6TFUCLSB/graph.json","fetch_events":"https://pith.science/api/pith-number/PWBMCI3BVU74C3A27L6TFUCLSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWBMCI3BVU74C3A27L6TFUCLSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWBMCI3BVU74C3A27L6TFUCLSB/action/storage_attestation","attest_author":"https://pith.science/pith/PWBMCI3BVU74C3A27L6TFUCLSB/action/author_attestation","sign_citation":"https://pith.science/pith/PWBMCI3BVU74C3A27L6TFUCLSB/action/citation_signature","submit_replication":"https://pith.science/pith/PWBMCI3BVU74C3A27L6TFUCLSB/action/replication_record"}},"created_at":"2026-07-05T10:40:01.831681+00:00","updated_at":"2026-07-05T10:40:01.831681+00:00"}