{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SIVSMZCLWNRTOXSQ3O4X4KNLLT","short_pith_number":"pith:SIVSMZCL","schema_version":"1.0","canonical_sha256":"922b26644bb363375e50dbb97e29ab5cec509b0388b32649abcb9d22bbf1a02b","source":{"kind":"arxiv","id":"1801.05496","version":3},"attestation_state":"computed","paper":{"title":"Algorithmic aspects of $M$-Lipschitz mappings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Bok","submitted_at":"2018-01-16T22:17:52Z","abstract_excerpt":"$M$-Lipschitz mappings of graphs (or equivalently graph-indexed random walks) are a generalization of standard random walk on $\\mathbb{Z}$. For $M \\in \\N$, an \\emph{$M$-Lipschitz mapping} of a connected rooted graph $G = (V,E)$ is a mapping $f: V \\to \\Z$ such that root is mapped to zero and for every edge $(u,v) \\in E$ we have $|f(u) - f(v)| \\le M$.\n  We study two natural problems regarding graph-indexed random walks. - Computing the maximum range of a graph-indexed random walk for a given graph. - Deciding if we can extend a partial GI random walk into a full GI random walk for a given graph."},"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":"1801.05496","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-16T22:17:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e26fe179bf3010157cc05efb5e95f7bb3fa5a76b22484c6b66943d3adb4a4312","abstract_canon_sha256":"2afa72702f021dbe515d97670a3e409d988b0e4b955e0243333124bf8f2cc584"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:32.907879Z","signature_b64":"dGlnDk9aFW9nW6bZWVLbXjejkeMhnpmqoNzWfVCqmw2SOrtcwKtTUyojcAPRgC1HIsaHLXWdWn15I1avW7CdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"922b26644bb363375e50dbb97e29ab5cec509b0388b32649abcb9d22bbf1a02b","last_reissued_at":"2026-05-18T00:17:32.907308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:32.907308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic aspects of $M$-Lipschitz mappings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Bok","submitted_at":"2018-01-16T22:17:52Z","abstract_excerpt":"$M$-Lipschitz mappings of graphs (or equivalently graph-indexed random walks) are a generalization of standard random walk on $\\mathbb{Z}$. For $M \\in \\N$, an \\emph{$M$-Lipschitz mapping} of a connected rooted graph $G = (V,E)$ is a mapping $f: V \\to \\Z$ such that root is mapped to zero and for every edge $(u,v) \\in E$ we have $|f(u) - f(v)| \\le M$.\n  We study two natural problems regarding graph-indexed random walks. - Computing the maximum range of a graph-indexed random walk for a given graph. - Deciding if we can extend a partial GI random walk into a full GI random walk for a given graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05496","kind":"arxiv","version":3},"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":"1801.05496","created_at":"2026-05-18T00:17:32.907435+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05496v3","created_at":"2026-05-18T00:17:32.907435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05496","created_at":"2026-05-18T00:17:32.907435+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIVSMZCLWNRT","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIVSMZCLWNRTOXSQ","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIVSMZCL","created_at":"2026-05-18T12:32:53.628368+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/SIVSMZCLWNRTOXSQ3O4X4KNLLT","json":"https://pith.science/pith/SIVSMZCLWNRTOXSQ3O4X4KNLLT.json","graph_json":"https://pith.science/api/pith-number/SIVSMZCLWNRTOXSQ3O4X4KNLLT/graph.json","events_json":"https://pith.science/api/pith-number/SIVSMZCLWNRTOXSQ3O4X4KNLLT/events.json","paper":"https://pith.science/paper/SIVSMZCL"},"agent_actions":{"view_html":"https://pith.science/pith/SIVSMZCLWNRTOXSQ3O4X4KNLLT","download_json":"https://pith.science/pith/SIVSMZCLWNRTOXSQ3O4X4KNLLT.json","view_paper":"https://pith.science/paper/SIVSMZCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05496&json=true","fetch_graph":"https://pith.science/api/pith-number/SIVSMZCLWNRTOXSQ3O4X4KNLLT/graph.json","fetch_events":"https://pith.science/api/pith-number/SIVSMZCLWNRTOXSQ3O4X4KNLLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIVSMZCLWNRTOXSQ3O4X4KNLLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIVSMZCLWNRTOXSQ3O4X4KNLLT/action/storage_attestation","attest_author":"https://pith.science/pith/SIVSMZCLWNRTOXSQ3O4X4KNLLT/action/author_attestation","sign_citation":"https://pith.science/pith/SIVSMZCLWNRTOXSQ3O4X4KNLLT/action/citation_signature","submit_replication":"https://pith.science/pith/SIVSMZCLWNRTOXSQ3O4X4KNLLT/action/replication_record"}},"created_at":"2026-05-18T00:17:32.907435+00:00","updated_at":"2026-05-18T00:17:32.907435+00:00"}