{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3F2YC2NGT2NPLTR2KNUPWTTLZZ","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":"f6ceda7cf18345be8c83a857adb103f633d02e11ee2b2ecfced547cb47f42876","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-04T15:20:58Z","title_canon_sha256":"cf24938be3f031ba815af74f6939503c3eb6e127ab717f64e36fbd5f3125198d"},"schema_version":"1.0","source":{"id":"1703.01477","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01477","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01477v2","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01477","created_at":"2026-05-18T00:37:54Z"},{"alias_kind":"pith_short_12","alias_value":"3F2YC2NGT2NP","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3F2YC2NGT2NPLTR2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3F2YC2NG","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:37022d1661a814e38b694a8aec7c5034f613198db9d53d37e85de252b49ae40b","target":"graph","created_at":"2026-05-18T00:37:54Z","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"},"paper":{"abstract_excerpt":"An $\\epsilon$-distance-uniform graph is one in which from every vertex, all but an $\\epsilon$-fraction of the remaining vertices are at some fixed distance $d$, called the critical distance. We consider the maximum possible value of $d$ in an $\\epsilon$-distance-uniform graph with $n$ vertices. We show that for $\\frac1n \\le \\epsilon \\le \\frac1{\\log n}$, there exist $\\epsilon$-distance-uniform graphs with critical distance $2^{\\Omega(\\frac{\\log n}{\\log \\epsilon^{-1}})}$, disproving a conjecture of Alon et al. that $d$ can be at most logarithmic in $n$. We also show that our construction is best","authors_text":"Arnau Messegu\\'e, Mikhail Lavrov, Po-Shen Loh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-04T15:20:58Z","title":"Distance-Uniform Graphs with Large Diameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01477","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:8eaf3e1577d4ed86d3990dd1fc7ba831bc476892a34050e681b3c0ad4aab0c10","target":"record","created_at":"2026-05-18T00:37:54Z","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":"f6ceda7cf18345be8c83a857adb103f633d02e11ee2b2ecfced547cb47f42876","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-04T15:20:58Z","title_canon_sha256":"cf24938be3f031ba815af74f6939503c3eb6e127ab717f64e36fbd5f3125198d"},"schema_version":"1.0","source":{"id":"1703.01477","kind":"arxiv","version":2}},"canonical_sha256":"d9758169a69e9af5ce3a5368fb4e6bce59ec45fdb3789fdf59bc2653011fe73c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9758169a69e9af5ce3a5368fb4e6bce59ec45fdb3789fdf59bc2653011fe73c","first_computed_at":"2026-05-18T00:37:54.558931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:54.558931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xFEPVpEgZ13YVTef0l38dFxc0HACNjC59kWBgN0V5gdzT6BrmnGNEGPxdLtrJ80BuExUCeb6SM5n+L8o2pJ+DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:54.559532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01477","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eaf3e1577d4ed86d3990dd1fc7ba831bc476892a34050e681b3c0ad4aab0c10","sha256:37022d1661a814e38b694a8aec7c5034f613198db9d53d37e85de252b49ae40b"],"state_sha256":"427f2fd940941e397349d95642b808e2fa137c965442edbdcd63f110ca7da5e7"}