{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3F2YC2NGT2NPLTR2KNUPWTTLZZ","short_pith_number":"pith:3F2YC2NG","schema_version":"1.0","canonical_sha256":"d9758169a69e9af5ce3a5368fb4e6bce59ec45fdb3789fdf59bc2653011fe73c","source":{"kind":"arxiv","id":"1703.01477","version":2},"attestation_state":"computed","paper":{"title":"Distance-Uniform Graphs with Large Diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arnau Messegu\\'e, Mikhail Lavrov, Po-Shen Loh","submitted_at":"2017-03-04T15:20:58Z","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"},"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":"1703.01477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-03-04T15:20:58Z","cross_cats_sorted":[],"title_canon_sha256":"cf24938be3f031ba815af74f6939503c3eb6e127ab717f64e36fbd5f3125198d","abstract_canon_sha256":"f6ceda7cf18345be8c83a857adb103f633d02e11ee2b2ecfced547cb47f42876"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:54.559532Z","signature_b64":"xFEPVpEgZ13YVTef0l38dFxc0HACNjC59kWBgN0V5gdzT6BrmnGNEGPxdLtrJ80BuExUCeb6SM5n+L8o2pJ+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9758169a69e9af5ce3a5368fb4e6bce59ec45fdb3789fdf59bc2653011fe73c","last_reissued_at":"2026-05-18T00:37:54.558931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:54.558931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance-Uniform Graphs with Large Diameter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arnau Messegu\\'e, Mikhail Lavrov, Po-Shen Loh","submitted_at":"2017-03-04T15:20:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01477","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":""},"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":"1703.01477","created_at":"2026-05-18T00:37:54.559005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01477v2","created_at":"2026-05-18T00:37:54.559005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01477","created_at":"2026-05-18T00:37:54.559005+00:00"},{"alias_kind":"pith_short_12","alias_value":"3F2YC2NGT2NP","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3F2YC2NGT2NPLTR2","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3F2YC2NG","created_at":"2026-05-18T12:30:58.224056+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/3F2YC2NGT2NPLTR2KNUPWTTLZZ","json":"https://pith.science/pith/3F2YC2NGT2NPLTR2KNUPWTTLZZ.json","graph_json":"https://pith.science/api/pith-number/3F2YC2NGT2NPLTR2KNUPWTTLZZ/graph.json","events_json":"https://pith.science/api/pith-number/3F2YC2NGT2NPLTR2KNUPWTTLZZ/events.json","paper":"https://pith.science/paper/3F2YC2NG"},"agent_actions":{"view_html":"https://pith.science/pith/3F2YC2NGT2NPLTR2KNUPWTTLZZ","download_json":"https://pith.science/pith/3F2YC2NGT2NPLTR2KNUPWTTLZZ.json","view_paper":"https://pith.science/paper/3F2YC2NG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01477&json=true","fetch_graph":"https://pith.science/api/pith-number/3F2YC2NGT2NPLTR2KNUPWTTLZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3F2YC2NGT2NPLTR2KNUPWTTLZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3F2YC2NGT2NPLTR2KNUPWTTLZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3F2YC2NGT2NPLTR2KNUPWTTLZZ/action/storage_attestation","attest_author":"https://pith.science/pith/3F2YC2NGT2NPLTR2KNUPWTTLZZ/action/author_attestation","sign_citation":"https://pith.science/pith/3F2YC2NGT2NPLTR2KNUPWTTLZZ/action/citation_signature","submit_replication":"https://pith.science/pith/3F2YC2NGT2NPLTR2KNUPWTTLZZ/action/replication_record"}},"created_at":"2026-05-18T00:37:54.559005+00:00","updated_at":"2026-05-18T00:37:54.559005+00:00"}