{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JVOD5DFWVPPJAUHZWRY23GRSBH","short_pith_number":"pith:JVOD5DFW","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"},"canonical_sha256":"4d5c3e8cb6abde9050f9b471ad9a3209c9e99d6c814d7d9b912a0c3d9d818a97","source":{"kind":"arxiv","id":"2401.07223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.07223","created_at":"2026-07-05T07:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"2401.07223v2","created_at":"2026-07-05T07:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07223","created_at":"2026-07-05T07:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"JVOD5DFWVPPJ","created_at":"2026-07-05T07:50:22Z"},{"alias_kind":"pith_short_16","alias_value":"JVOD5DFWVPPJAUHZ","created_at":"2026-07-05T07:50:22Z"},{"alias_kind":"pith_short_8","alias_value":"JVOD5DFW","created_at":"2026-07-05T07:50:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JVOD5DFWVPPJAUHZWRY23GRSBH","target":"record","payload":{"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"},"canonical_sha256":"4d5c3e8cb6abde9050f9b471ad9a3209c9e99d6c814d7d9b912a0c3d9d818a97","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"},"source_kind":"arxiv","source_id":"2401.07223","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBlkJxuTzANDje94/KSJLAYLx8c6r1dG0v6HtcTMOiq5wSCu/HhHagCCBm+U8pKBhU7B1A8bRaO+2SbMsZj9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T07:44:21.380973Z"},"content_sha256":"c3a5c160967ee9d21b82b3fddc22bdcf652dc87b5830fd6ae16a38f3f7efdf70","schema_version":"1.0","event_id":"sha256:c3a5c160967ee9d21b82b3fddc22bdcf652dc87b5830fd6ae16a38f3f7efdf70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JVOD5DFWVPPJAUHZWRY23GRSBH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xnJYr3PfRRul7yGxMWew/W9IwNA77KStsWsbcIazI4eB6wrsZNjkMmmIjKS1UVFpG6zJovIzlpaPkCgSvlNhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T07:44:21.381614Z"},"content_sha256":"bde316d13ef12453ff02108a1b400a391cf191b186175135bf0a75ec20116269","schema_version":"1.0","event_id":"sha256:bde316d13ef12453ff02108a1b400a391cf191b186175135bf0a75ec20116269"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/bundle.json","state_url":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T07:44:21Z","links":{"resolver":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH","bundle":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/bundle.json","state":"https://pith.science/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVOD5DFWVPPJAUHZWRY23GRSBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JVOD5DFWVPPJAUHZWRY23GRSBH","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":"a2a8bdaa28df07e79d5279f8e487030925cf9deec5c81cc74877e1c960dffa44","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-14T07:43:40Z","title_canon_sha256":"c6185c526027ecfd2dfe27c294151939eecf05210bfaa21b7d28817a91079887"},"schema_version":"1.0","source":{"id":"2401.07223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.07223","created_at":"2026-07-05T07:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"2401.07223v2","created_at":"2026-07-05T07:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07223","created_at":"2026-07-05T07:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"JVOD5DFWVPPJ","created_at":"2026-07-05T07:50:22Z"},{"alias_kind":"pith_short_16","alias_value":"JVOD5DFWVPPJAUHZ","created_at":"2026-07-05T07:50:22Z"},{"alias_kind":"pith_short_8","alias_value":"JVOD5DFW","created_at":"2026-07-05T07:50:22Z"}],"graph_snapshots":[{"event_id":"sha256:bde316d13ef12453ff02108a1b400a391cf191b186175135bf0a75ec20116269","target":"graph","created_at":"2026-07-05T07:50:22Z","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/2401.07223/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Dhroova Aiylam, Samuel Korsky, Tahsin Saffat","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-14T07:43:40Z","title":"Lipschitz Functions on Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07223","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:c3a5c160967ee9d21b82b3fddc22bdcf652dc87b5830fd6ae16a38f3f7efdf70","target":"record","created_at":"2026-07-05T07:50:22Z","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":"a2a8bdaa28df07e79d5279f8e487030925cf9deec5c81cc74877e1c960dffa44","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-14T07:43:40Z","title_canon_sha256":"c6185c526027ecfd2dfe27c294151939eecf05210bfaa21b7d28817a91079887"},"schema_version":"1.0","source":{"id":"2401.07223","kind":"arxiv","version":2}},"canonical_sha256":"4d5c3e8cb6abde9050f9b471ad9a3209c9e99d6c814d7d9b912a0c3d9d818a97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d5c3e8cb6abde9050f9b471ad9a3209c9e99d6c814d7d9b912a0c3d9d818a97","first_computed_at":"2026-07-05T07:50:22.895285Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:50:22.895285Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xbuPVunH+bqrpQqxwDfz/yeuNPoXzAnrL3Lm8zxVHeuJPPgcGv+gYwjEn4U2fwLaQAOp7F+DGdAAK9k8ujmiDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:50:22.895744Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.07223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3a5c160967ee9d21b82b3fddc22bdcf652dc87b5830fd6ae16a38f3f7efdf70","sha256:bde316d13ef12453ff02108a1b400a391cf191b186175135bf0a75ec20116269"],"state_sha256":"0d195a961354137cc2a58ad77c036ee66600d60305bb4813ce71871b82375b21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6aK55dNs6Gua5/id/5/I/OHvFLHzzUIDCqKUzSSQrjhCI/BQMWHnhNjQgxpy31fC/Lomlc43I3rsu6x/9TtnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T07:44:21.387663Z","bundle_sha256":"3ffa28fb8ed94a4c5de2b9971fbf807a52acd6e63961fb94c5737b6ee0536a8c"}}