{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P75Q2XHN4T7NJAB5QCPVYNDWDU","short_pith_number":"pith:P75Q2XHN","schema_version":"1.0","canonical_sha256":"7ffb0d5cede4fed4803d809f5c34761d0f3bdb464a8122bc1b947ed3b72c969d","source":{"kind":"arxiv","id":"2504.05861","version":1},"attestation_state":"computed","paper":{"title":"Sparse Bounded Hop-Spanners for Geometric Intersection Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Csaba D. Toth, Shakhar Smorodinsky, Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang","submitted_at":"2025-04-08T09:40:14Z","abstract_excerpt":"We present new results on $2$- and $3$-hop spanners for geometric intersection graphs. These include improved upper and lower bounds for $2$- and $3$-hop spanners for many geometric intersection graphs in $\\mathbb{R}^d$. For example, we show that the intersection graph of $n$ balls in $\\mathbb{R}^d$ admits a $2$-hop spanner of size $O^*\\left(n^{\\frac{3}{2}-\\frac{1}{2(2\\lfloor d/2\\rfloor +1)}}\\right)$ and the intersection graph of $n$ fat axis-parallel boxes in $\\mathbb{R}^d$ admits a $2$-hop spanner of size $O(n \\log^{d+1}n)$.\n  Furthermore, we show that the intersection graph of general semi-"},"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":"2504.05861","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-04-08T09:40:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b322bb08f392594a160cc08b5eaaaf8b75ae55383c53823f80ce7a90ddd49b17","abstract_canon_sha256":"a50ba110cc3048367a8941fbd3ba52182d5ba06838d7dbfab4362f49ff740eb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:10.964732Z","signature_b64":"XQ8Whyx6x5G7x6Tm85McsFjKhA+6+feDPEyD+cW+gCQcN0nqbWXNWM4IVaiboxVmrieRPF0/AEDS3Y0WyHPSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ffb0d5cede4fed4803d809f5c34761d0f3bdb464a8122bc1b947ed3b72c969d","last_reissued_at":"2026-07-05T10:46:10.964206Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:10.964206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Bounded Hop-Spanners for Geometric Intersection Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Csaba D. Toth, Shakhar Smorodinsky, Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang","submitted_at":"2025-04-08T09:40:14Z","abstract_excerpt":"We present new results on $2$- and $3$-hop spanners for geometric intersection graphs. These include improved upper and lower bounds for $2$- and $3$-hop spanners for many geometric intersection graphs in $\\mathbb{R}^d$. For example, we show that the intersection graph of $n$ balls in $\\mathbb{R}^d$ admits a $2$-hop spanner of size $O^*\\left(n^{\\frac{3}{2}-\\frac{1}{2(2\\lfloor d/2\\rfloor +1)}}\\right)$ and the intersection graph of $n$ fat axis-parallel boxes in $\\mathbb{R}^d$ admits a $2$-hop spanner of size $O(n \\log^{d+1}n)$.\n  Furthermore, we show that the intersection graph of general semi-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.05861","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/2504.05861/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":"2504.05861","created_at":"2026-07-05T10:46:10.964273+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.05861v1","created_at":"2026-07-05T10:46:10.964273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.05861","created_at":"2026-07-05T10:46:10.964273+00:00"},{"alias_kind":"pith_short_12","alias_value":"P75Q2XHN4T7N","created_at":"2026-07-05T10:46:10.964273+00:00"},{"alias_kind":"pith_short_16","alias_value":"P75Q2XHN4T7NJAB5","created_at":"2026-07-05T10:46:10.964273+00:00"},{"alias_kind":"pith_short_8","alias_value":"P75Q2XHN","created_at":"2026-07-05T10:46:10.964273+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.00252","citing_title":"Compact Representation of Semilinear and Terrain-like Graphs","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P75Q2XHN4T7NJAB5QCPVYNDWDU","json":"https://pith.science/pith/P75Q2XHN4T7NJAB5QCPVYNDWDU.json","graph_json":"https://pith.science/api/pith-number/P75Q2XHN4T7NJAB5QCPVYNDWDU/graph.json","events_json":"https://pith.science/api/pith-number/P75Q2XHN4T7NJAB5QCPVYNDWDU/events.json","paper":"https://pith.science/paper/P75Q2XHN"},"agent_actions":{"view_html":"https://pith.science/pith/P75Q2XHN4T7NJAB5QCPVYNDWDU","download_json":"https://pith.science/pith/P75Q2XHN4T7NJAB5QCPVYNDWDU.json","view_paper":"https://pith.science/paper/P75Q2XHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.05861&json=true","fetch_graph":"https://pith.science/api/pith-number/P75Q2XHN4T7NJAB5QCPVYNDWDU/graph.json","fetch_events":"https://pith.science/api/pith-number/P75Q2XHN4T7NJAB5QCPVYNDWDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P75Q2XHN4T7NJAB5QCPVYNDWDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P75Q2XHN4T7NJAB5QCPVYNDWDU/action/storage_attestation","attest_author":"https://pith.science/pith/P75Q2XHN4T7NJAB5QCPVYNDWDU/action/author_attestation","sign_citation":"https://pith.science/pith/P75Q2XHN4T7NJAB5QCPVYNDWDU/action/citation_signature","submit_replication":"https://pith.science/pith/P75Q2XHN4T7NJAB5QCPVYNDWDU/action/replication_record"}},"created_at":"2026-07-05T10:46:10.964273+00:00","updated_at":"2026-07-05T10:46:10.964273+00:00"}