{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JVOD5DFWVPPJAUHZWRY23GRSBH","short_pith_number":"pith:JVOD5DFW","schema_version":"1.0","canonical_sha256":"4d5c3e8cb6abde9050f9b471ad9a3209c9e99d6c814d7d9b912a0c3d9d818a97","source":{"kind":"arxiv","id":"2401.07223","version":2},"attestation_state":"computed","paper":{"title":"Lipschitz Functions on Sparse Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhroova Aiylam, Samuel Korsky, Tahsin Saffat","submitted_at":"2024-01-14T07:43:40Z","abstract_excerpt":"In this work we attempt to count the number of integer-valued $h$-Lipschitz functions (functions that change by at most $h$ along edges) on two classes of sparse graphs; grid graphs $L_{m,n}$, and sparse random graphs $G(n,d/n)$. We find that for all $n$-vertex graphs $G$ with $k$ connected components, the number of such functions grows as $(ch)^{n - k}$ for some $1 \\le c \\le 2$. In particular, letting $\\alpha \\approx 1.16234$ be the largest solution to $\\tan{(1/x)} = x$, we prove that as $n \\to \\infty$ $$ c = \\alpha\\sqrt{2} \\approx 1.6438\\ \\ \\text{when}\\ \\ G = L_{2,n} $$ and $$ 1.351 \\approx "},"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":"2401.07223","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-14T07:43:40Z","cross_cats_sorted":[],"title_canon_sha256":"c6185c526027ecfd2dfe27c294151939eecf05210bfaa21b7d28817a91079887","abstract_canon_sha256":"a2a8bdaa28df07e79d5279f8e487030925cf9deec5c81cc74877e1c960dffa44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:22.895744Z","signature_b64":"xbuPVunH+bqrpQqxwDfz/yeuNPoXzAnrL3Lm8zxVHeuJPPgcGv+gYwjEn4U2fwLaQAOp7F+DGdAAK9k8ujmiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d5c3e8cb6abde9050f9b471ad9a3209c9e99d6c814d7d9b912a0c3d9d818a97","last_reissued_at":"2026-07-05T07:50:22.895285Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:22.895285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lipschitz Functions on Sparse Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhroova Aiylam, Samuel Korsky, Tahsin Saffat","submitted_at":"2024-01-14T07:43:40Z","abstract_excerpt":"In this work we attempt to count the number of integer-valued $h$-Lipschitz functions (functions that change by at most $h$ along edges) on two classes of sparse graphs; grid graphs $L_{m,n}$, and sparse random graphs $G(n,d/n)$. We find that for all $n$-vertex graphs $G$ with $k$ connected components, the number of such functions grows as $(ch)^{n - k}$ for some $1 \\le c \\le 2$. In particular, letting $\\alpha \\approx 1.16234$ be the largest solution to $\\tan{(1/x)} = x$, we prove that as $n \\to \\infty$ $$ c = \\alpha\\sqrt{2} \\approx 1.6438\\ \\ \\text{when}\\ \\ G = L_{2,n} $$ and $$ 1.351 \\approx "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07223","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/2401.07223/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":"2401.07223","created_at":"2026-07-05T07:50:22.895350+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07223v2","created_at":"2026-07-05T07:50:22.895350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07223","created_at":"2026-07-05T07:50:22.895350+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVOD5DFWVPPJ","created_at":"2026-07-05T07:50:22.895350+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVOD5DFWVPPJAUHZ","created_at":"2026-07-05T07:50:22.895350+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVOD5DFW","created_at":"2026-07-05T07:50:22.895350+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.25515","citing_title":"Lipschitz Functions on Sparse Graphs II","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH","json":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH.json","graph_json":"https://pith.science/api/pith-number/JVOD5DFWVPPJAUHZWRY23GRSBH/graph.json","events_json":"https://pith.science/api/pith-number/JVOD5DFWVPPJAUHZWRY23GRSBH/events.json","paper":"https://pith.science/paper/JVOD5DFW"},"agent_actions":{"view_html":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH","download_json":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH.json","view_paper":"https://pith.science/paper/JVOD5DFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07223&json=true","fetch_graph":"https://pith.science/api/pith-number/JVOD5DFWVPPJAUHZWRY23GRSBH/graph.json","fetch_events":"https://pith.science/api/pith-number/JVOD5DFWVPPJAUHZWRY23GRSBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/action/storage_attestation","attest_author":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/action/author_attestation","sign_citation":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/action/citation_signature","submit_replication":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/action/replication_record"}},"created_at":"2026-07-05T07:50:22.895350+00:00","updated_at":"2026-07-05T07:50:22.895350+00:00"}