{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RLIQSMWYQIR6G5R7IV5N2C366F","short_pith_number":"pith:RLIQSMWY","schema_version":"1.0","canonical_sha256":"8ad10932d88223e3763f457add0b7ef16ef8fe1df439e17fb33b27733676be24","source":{"kind":"arxiv","id":"1504.07912","version":1},"attestation_state":"computed","paper":{"title":"Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Adam Smith, Sofya Raskhodnikova","submitted_at":"2015-04-29T16:08:57Z","abstract_excerpt":"Lipschitz extensions were recently proposed as a tool for designing node differentially private algorithms. However, efficiently computable Lipschitz extensions were known only for 1-dimensional functions (that is, functions that output a single real value). In this paper, we study efficiently computable Lipschitz extensions for multi-dimensional (that is, vector-valued) functions on graphs. We show that, unlike for 1-dimensional functions, Lipschitz extensions of higher-dimensional functions on graphs do not always exist, even with a non-unit stretch. We design Lipschitz extensions with small"},"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":"1504.07912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-29T16:08:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3367cced53de51f17a4799f260dfe01d7db617ecb149b06f13a415e2d3fd2912","abstract_canon_sha256":"45c1e71a9b434bdfd816382b91485a1024e7209ca17e882720329c56ea1c0188"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:31.926889Z","signature_b64":"T/KlzaLI28UKsyl5lGx/MouJDPGE9lXLGOL0fc0JnsQaMVF3HGI/n9wuNW/AxaRMGjlzD8ug5GhpmzQG+OeXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ad10932d88223e3763f457add0b7ef16ef8fe1df439e17fb33b27733676be24","last_reissued_at":"2026-05-18T02:17:31.926206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:31.926206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Adam Smith, Sofya Raskhodnikova","submitted_at":"2015-04-29T16:08:57Z","abstract_excerpt":"Lipschitz extensions were recently proposed as a tool for designing node differentially private algorithms. However, efficiently computable Lipschitz extensions were known only for 1-dimensional functions (that is, functions that output a single real value). In this paper, we study efficiently computable Lipschitz extensions for multi-dimensional (that is, vector-valued) functions on graphs. We show that, unlike for 1-dimensional functions, Lipschitz extensions of higher-dimensional functions on graphs do not always exist, even with a non-unit stretch. We design Lipschitz extensions with small"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07912","kind":"arxiv","version":1},"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":"1504.07912","created_at":"2026-05-18T02:17:31.926302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.07912v1","created_at":"2026-05-18T02:17:31.926302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07912","created_at":"2026-05-18T02:17:31.926302+00:00"},{"alias_kind":"pith_short_12","alias_value":"RLIQSMWYQIR6","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RLIQSMWYQIR6G5R7","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RLIQSMWY","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15943","citing_title":"Node-private community estimation in stochastic block models: Tractable algorithms and lower bounds","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F","json":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F.json","graph_json":"https://pith.science/api/pith-number/RLIQSMWYQIR6G5R7IV5N2C366F/graph.json","events_json":"https://pith.science/api/pith-number/RLIQSMWYQIR6G5R7IV5N2C366F/events.json","paper":"https://pith.science/paper/RLIQSMWY"},"agent_actions":{"view_html":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F","download_json":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F.json","view_paper":"https://pith.science/paper/RLIQSMWY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.07912&json=true","fetch_graph":"https://pith.science/api/pith-number/RLIQSMWYQIR6G5R7IV5N2C366F/graph.json","fetch_events":"https://pith.science/api/pith-number/RLIQSMWYQIR6G5R7IV5N2C366F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F/action/storage_attestation","attest_author":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F/action/author_attestation","sign_citation":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F/action/citation_signature","submit_replication":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F/action/replication_record"}},"created_at":"2026-05-18T02:17:31.926302+00:00","updated_at":"2026-05-18T02:17:31.926302+00:00"}