{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6XFUWEVZOOQITLTQSYDVJBKS3M","short_pith_number":"pith:6XFUWEVZ","schema_version":"1.0","canonical_sha256":"f5cb4b12b973a089ae709607548552db2c3aee237bae57d314ced92356bef3c7","source":{"kind":"arxiv","id":"2506.17433","version":2},"attestation_state":"computed","paper":{"title":"Discrete Poincar\\'e inequalities and universal approximators for random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.MG","authors_text":"Dylan J. Altschuler, Konstantinos Tyros, Konstantin Tikhomirov, Pandelis Dodos","submitted_at":"2025-06-20T18:55:09Z","abstract_excerpt":"Nonlinear Poincar\\'e inequalities are indispensable tools in the study of dimension reduction and low-distortion embeddings of graphs into metric spaces, and have found remarkable algorithmic applications. A basic open problem, posed by Jon Kleinberg (2013), asks whether the optimal nonlinear Poincar\\'e constant for maps between two independent $3$-regular random graphs is dimension-free, i.e., independent of vertex-set sizes. We give a complete and affirmative resolution to Kleinberg's problem, also allowing for arbitrary graph degrees. As a corollary, we obtain a stochastic construction of $"},"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":"2506.17433","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2025-06-20T18:55:09Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"677e15fe43fc66cf788bca42ca3f7479096e76ea2141b63aa2fd0f7175be657c","abstract_canon_sha256":"9093d999bdcbc068e40f52090ccbe98bd52011a3ccdb829e143e5ab7be5de9af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:36.669761Z","signature_b64":"tc/o9XKIODqU/fdNpRTQ4AxdQROOFmWY3A80rvRMGcj5lV0t9ZphK7/Lb/7SApOV+B9rlRL8Pv06wtZHmSVSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5cb4b12b973a089ae709607548552db2c3aee237bae57d314ced92356bef3c7","last_reissued_at":"2026-07-05T11:45:36.669250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:36.669250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Poincar\\'e inequalities and universal approximators for random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.MG","authors_text":"Dylan J. Altschuler, Konstantinos Tyros, Konstantin Tikhomirov, Pandelis Dodos","submitted_at":"2025-06-20T18:55:09Z","abstract_excerpt":"Nonlinear Poincar\\'e inequalities are indispensable tools in the study of dimension reduction and low-distortion embeddings of graphs into metric spaces, and have found remarkable algorithmic applications. A basic open problem, posed by Jon Kleinberg (2013), asks whether the optimal nonlinear Poincar\\'e constant for maps between two independent $3$-regular random graphs is dimension-free, i.e., independent of vertex-set sizes. We give a complete and affirmative resolution to Kleinberg's problem, also allowing for arbitrary graph degrees. As a corollary, we obtain a stochastic construction of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.17433","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/2506.17433/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":"2506.17433","created_at":"2026-07-05T11:45:36.669307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.17433v2","created_at":"2026-07-05T11:45:36.669307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.17433","created_at":"2026-07-05T11:45:36.669307+00:00"},{"alias_kind":"pith_short_12","alias_value":"6XFUWEVZOOQI","created_at":"2026-07-05T11:45:36.669307+00:00"},{"alias_kind":"pith_short_16","alias_value":"6XFUWEVZOOQITLTQ","created_at":"2026-07-05T11:45:36.669307+00:00"},{"alias_kind":"pith_short_8","alias_value":"6XFUWEVZ","created_at":"2026-07-05T11:45:36.669307+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/6XFUWEVZOOQITLTQSYDVJBKS3M","json":"https://pith.science/pith/6XFUWEVZOOQITLTQSYDVJBKS3M.json","graph_json":"https://pith.science/api/pith-number/6XFUWEVZOOQITLTQSYDVJBKS3M/graph.json","events_json":"https://pith.science/api/pith-number/6XFUWEVZOOQITLTQSYDVJBKS3M/events.json","paper":"https://pith.science/paper/6XFUWEVZ"},"agent_actions":{"view_html":"https://pith.science/pith/6XFUWEVZOOQITLTQSYDVJBKS3M","download_json":"https://pith.science/pith/6XFUWEVZOOQITLTQSYDVJBKS3M.json","view_paper":"https://pith.science/paper/6XFUWEVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.17433&json=true","fetch_graph":"https://pith.science/api/pith-number/6XFUWEVZOOQITLTQSYDVJBKS3M/graph.json","fetch_events":"https://pith.science/api/pith-number/6XFUWEVZOOQITLTQSYDVJBKS3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6XFUWEVZOOQITLTQSYDVJBKS3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6XFUWEVZOOQITLTQSYDVJBKS3M/action/storage_attestation","attest_author":"https://pith.science/pith/6XFUWEVZOOQITLTQSYDVJBKS3M/action/author_attestation","sign_citation":"https://pith.science/pith/6XFUWEVZOOQITLTQSYDVJBKS3M/action/citation_signature","submit_replication":"https://pith.science/pith/6XFUWEVZOOQITLTQSYDVJBKS3M/action/replication_record"}},"created_at":"2026-07-05T11:45:36.669307+00:00","updated_at":"2026-07-05T11:45:36.669307+00:00"}