{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZDXG2WNML473IRVVIUBDTUICOH","short_pith_number":"pith:ZDXG2WNM","schema_version":"1.0","canonical_sha256":"c8ee6d59ac5f3fb446b5450239d10271d203fa057b0fe53a950f5be95f52db11","source":{"kind":"arxiv","id":"2608.10164","version":1},"attestation_state":"computed","paper":{"title":"Quasi-isometries, contractions, and intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.MG"],"primary_cat":"math.CO","authors_text":"Agelos Georgakopoulos, Chiara Molinari","submitted_at":"2026-08-10T19:32:27Z","abstract_excerpt":"We prove that a graph $G$ is quasi-planar - i.e. quasi-isometric to a planar graph - if and only if it can be obtained by iterating the following two operations a bounded number of times: a) subdividing each edge into a path of bounded length, and b) taking the intersection graph of a family of connected subgraphs covering $G$. This applies both to infinite graphs, and to families of finite graphs with uniform constants.\n  The backward implication relies on, and generalises, a deep result of Davies, partly proved independently by Chang, Conroy, Tan & Zheng, saying that every string graph is qu"},"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":"2608.10164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-10T19:32:27Z","cross_cats_sorted":["math.GR","math.MG"],"title_canon_sha256":"42f720e9680c4f419f959d78061417516b91d5e12a3eb265f718575763587f36","abstract_canon_sha256":"8714039aefe6049c9e9604de7db5563c156bb265322e7cb2b68610c3672474f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-12T00:22:57.311505Z","signature_b64":"5zVMhKNTUutstEMG/5kbQsYaufX+5/T0k7ABVaXleQ+E2xtwoXJTVCpGRITJfU2ar4Zfaa6vZVyUxPeD2WpLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8ee6d59ac5f3fb446b5450239d10271d203fa057b0fe53a950f5be95f52db11","last_reissued_at":"2026-08-12T00:22:57.309780Z","signature_status":"signed_v1","first_computed_at":"2026-08-12T00:22:57.309780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-isometries, contractions, and intersection graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.MG"],"primary_cat":"math.CO","authors_text":"Agelos Georgakopoulos, Chiara Molinari","submitted_at":"2026-08-10T19:32:27Z","abstract_excerpt":"We prove that a graph $G$ is quasi-planar - i.e. quasi-isometric to a planar graph - if and only if it can be obtained by iterating the following two operations a bounded number of times: a) subdividing each edge into a path of bounded length, and b) taking the intersection graph of a family of connected subgraphs covering $G$. This applies both to infinite graphs, and to families of finite graphs with uniform constants.\n  The backward implication relies on, and generalises, a deep result of Davies, partly proved independently by Chang, Conroy, Tan & Zheng, saying that every string graph is qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.10164","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/2608.10164/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":"2608.10164","created_at":"2026-08-12T00:22:57.312618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.10164v1","created_at":"2026-08-12T00:22:57.312618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.10164","created_at":"2026-08-12T00:22:57.312618+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZDXG2WNML473","created_at":"2026-08-12T00:22:57.312618+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZDXG2WNML473IRVV","created_at":"2026-08-12T00:22:57.312618+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZDXG2WNM","created_at":"2026-08-12T00:22:57.312618+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/ZDXG2WNML473IRVVIUBDTUICOH","json":"https://pith.science/pith/ZDXG2WNML473IRVVIUBDTUICOH.json","graph_json":"https://pith.science/api/pith-number/ZDXG2WNML473IRVVIUBDTUICOH/graph.json","events_json":"https://pith.science/api/pith-number/ZDXG2WNML473IRVVIUBDTUICOH/events.json","paper":"https://pith.science/paper/ZDXG2WNM"},"agent_actions":{"view_html":"https://pith.science/pith/ZDXG2WNML473IRVVIUBDTUICOH","download_json":"https://pith.science/pith/ZDXG2WNML473IRVVIUBDTUICOH.json","view_paper":"https://pith.science/paper/ZDXG2WNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.10164&json=true","fetch_graph":"https://pith.science/api/pith-number/ZDXG2WNML473IRVVIUBDTUICOH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZDXG2WNML473IRVVIUBDTUICOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZDXG2WNML473IRVVIUBDTUICOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZDXG2WNML473IRVVIUBDTUICOH/action/storage_attestation","attest_author":"https://pith.science/pith/ZDXG2WNML473IRVVIUBDTUICOH/action/author_attestation","sign_citation":"https://pith.science/pith/ZDXG2WNML473IRVVIUBDTUICOH/action/citation_signature","submit_replication":"https://pith.science/pith/ZDXG2WNML473IRVVIUBDTUICOH/action/replication_record"}},"created_at":"2026-08-12T00:22:57.312618+00:00","updated_at":"2026-08-12T00:22:57.312618+00:00"}