{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JAPQAY2F3ZRFF5O52BHSO3LYAD","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":"c4bc9e2bfa669dfa695765d5bb064778a27522f6ee3f3f589ca0cbe2d3ed357a","cross_cats_sorted":["cs.SI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-05-12T08:34:41Z","title_canon_sha256":"bda2a26f06efe7ff7f46a84bcdf6d3cfaf6af26e87c58bfe4c84be23fb3dc726"},"schema_version":"1.0","source":{"id":"2405.07217","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.07217","created_at":"2026-07-05T08:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"2405.07217v2","created_at":"2026-07-05T08:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.07217","created_at":"2026-07-05T08:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"JAPQAY2F3ZRF","created_at":"2026-07-05T08:18:53Z"},{"alias_kind":"pith_short_16","alias_value":"JAPQAY2F3ZRFF5O5","created_at":"2026-07-05T08:18:53Z"},{"alias_kind":"pith_short_8","alias_value":"JAPQAY2F","created_at":"2026-07-05T08:18:53Z"}],"graph_snapshots":[{"event_id":"sha256:6cc05515812e65a117ee11e490a9544b35dc25b9b77c31b4a0c21977fef6f52d","target":"graph","created_at":"2026-07-05T08:18:53Z","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/2405.07217/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study graph distances in the geometric random graph models scale-free percolation SFP, geometric inhomogeneous random graphs GIRG, and hyperbolic random graphs HRG. Despite the wide success of the models, the parameter regime in which graph distances are polylogarithmic is poorly understood. We provide new and improved lower bounds. In a certain portion of the parameter regime, those match the known upper bounds.\n  Compared to the best previous lower bounds by Hao and Heydenreich, our result has several advantages: it gives matching bounds for a larger range of parameters, th","authors_text":"Johannes Lengler, Kalina Petrova, Kostas Lakis, Leon Schiller","cross_cats":["cs.SI","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-05-12T08:34:41Z","title":"Improved bounds for polylogarithmic graph distances in scale-free percolation and related models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.07217","kind":"arxiv","version":2},"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:27bd8efa1060da1c752dbc9d206c512866e881f0e1aedebfa96670210b875e3a","target":"record","created_at":"2026-07-05T08:18:53Z","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":"c4bc9e2bfa669dfa695765d5bb064778a27522f6ee3f3f589ca0cbe2d3ed357a","cross_cats_sorted":["cs.SI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-05-12T08:34:41Z","title_canon_sha256":"bda2a26f06efe7ff7f46a84bcdf6d3cfaf6af26e87c58bfe4c84be23fb3dc726"},"schema_version":"1.0","source":{"id":"2405.07217","kind":"arxiv","version":2}},"canonical_sha256":"481f006345de6252f5ddd04f276d7800d9c1b980f658d05230cb92bbb2c5b690","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"481f006345de6252f5ddd04f276d7800d9c1b980f658d05230cb92bbb2c5b690","first_computed_at":"2026-07-05T08:18:53.233158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:18:53.233158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TR5OY/Rw30y7tcD7go2BtUYvMxhX803QlkMifBt3CgqEHGwUpdK3vsGHu8qfQVEo44zwhLXFkoQIQnGImuQWAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:18:53.233555Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.07217","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27bd8efa1060da1c752dbc9d206c512866e881f0e1aedebfa96670210b875e3a","sha256:6cc05515812e65a117ee11e490a9544b35dc25b9b77c31b4a0c21977fef6f52d"],"state_sha256":"3fb85d8c44b26f1bd1dff5d89711c2020e56691cf76a82de3877a0831635793f"}