{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QASCPFNR7HKXHBGGUBIV2OBETD","short_pith_number":"pith:QASCPFNR","schema_version":"1.0","canonical_sha256":"80242795b1f9d57384c6a0515d382498e5565abe23ac5823a50a24b013c77e67","source":{"kind":"arxiv","id":"2202.07293","version":2},"attestation_state":"computed","paper":{"title":"Asymptotic dimension of intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Norin, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2022-02-15T10:18:33Z","abstract_excerpt":"We show that intersection graphs of compact convex sets in R^n of bounded aspect ratio have asymptotic dimension at most 2n+1. More generally, we show this is the case for intersection graphs of systems of subsets of any metric space of Assouad-Nagata dimension n that satisfy the following condition: For each r,s>0 and every point p, the number of pairwise-disjoint elements of diameter at least s in the system that are at distance at most r from p is bounded by a function of r/s."},"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":"2202.07293","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-02-15T10:18:33Z","cross_cats_sorted":[],"title_canon_sha256":"8ecf4578b948954ab2f398d07f7b0d109dc150bd297fdaa60264ce5f7f8d7aad","abstract_canon_sha256":"1d34868da36a451e30d34ed1094e6ecc39bed8cafa3d8c46ed9e3dd705aa60a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:57.992212Z","signature_b64":"q0JdmdylwvCyZf+ftguqvT+Xy8LGH4ew/pfMRaG20gNxKIhb/aSqhSA9DDq/9HvsQwH3DNMz82K9VdutQzYaBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80242795b1f9d57384c6a0515d382498e5565abe23ac5823a50a24b013c77e67","last_reissued_at":"2026-07-05T05:02:57.991798Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:57.991798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic dimension of intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Norin, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2022-02-15T10:18:33Z","abstract_excerpt":"We show that intersection graphs of compact convex sets in R^n of bounded aspect ratio have asymptotic dimension at most 2n+1. More generally, we show this is the case for intersection graphs of systems of subsets of any metric space of Assouad-Nagata dimension n that satisfy the following condition: For each r,s>0 and every point p, the number of pairwise-disjoint elements of diameter at least s in the system that are at distance at most r from p is bounded by a function of r/s."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.07293","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/2202.07293/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":"2202.07293","created_at":"2026-07-05T05:02:57.991854+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.07293v2","created_at":"2026-07-05T05:02:57.991854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.07293","created_at":"2026-07-05T05:02:57.991854+00:00"},{"alias_kind":"pith_short_12","alias_value":"QASCPFNR7HKX","created_at":"2026-07-05T05:02:57.991854+00:00"},{"alias_kind":"pith_short_16","alias_value":"QASCPFNR7HKXHBGG","created_at":"2026-07-05T05:02:57.991854+00:00"},{"alias_kind":"pith_short_8","alias_value":"QASCPFNR","created_at":"2026-07-05T05:02:57.991854+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QASCPFNR7HKXHBGGUBIV2OBETD","json":"https://pith.science/pith/QASCPFNR7HKXHBGGUBIV2OBETD.json","graph_json":"https://pith.science/api/pith-number/QASCPFNR7HKXHBGGUBIV2OBETD/graph.json","events_json":"https://pith.science/api/pith-number/QASCPFNR7HKXHBGGUBIV2OBETD/events.json","paper":"https://pith.science/paper/QASCPFNR"},"agent_actions":{"view_html":"https://pith.science/pith/QASCPFNR7HKXHBGGUBIV2OBETD","download_json":"https://pith.science/pith/QASCPFNR7HKXHBGGUBIV2OBETD.json","view_paper":"https://pith.science/paper/QASCPFNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.07293&json=true","fetch_graph":"https://pith.science/api/pith-number/QASCPFNR7HKXHBGGUBIV2OBETD/graph.json","fetch_events":"https://pith.science/api/pith-number/QASCPFNR7HKXHBGGUBIV2OBETD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QASCPFNR7HKXHBGGUBIV2OBETD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QASCPFNR7HKXHBGGUBIV2OBETD/action/storage_attestation","attest_author":"https://pith.science/pith/QASCPFNR7HKXHBGGUBIV2OBETD/action/author_attestation","sign_citation":"https://pith.science/pith/QASCPFNR7HKXHBGGUBIV2OBETD/action/citation_signature","submit_replication":"https://pith.science/pith/QASCPFNR7HKXHBGGUBIV2OBETD/action/replication_record"}},"created_at":"2026-07-05T05:02:57.991854+00:00","updated_at":"2026-07-05T05:02:57.991854+00:00"}