{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RLIQSMWYQIR6G5R7IV5N2C366F","short_pith_number":"pith:RLIQSMWY","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"},"canonical_sha256":"8ad10932d88223e3763f457add0b7ef16ef8fe1df439e17fb33b27733676be24","source":{"kind":"arxiv","id":"1504.07912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07912","created_at":"2026-05-18T02:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07912v1","created_at":"2026-05-18T02:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07912","created_at":"2026-05-18T02:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"RLIQSMWYQIR6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RLIQSMWYQIR6G5R7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RLIQSMWY","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RLIQSMWYQIR6G5R7IV5N2C366F","target":"record","payload":{"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"},"canonical_sha256":"8ad10932d88223e3763f457add0b7ef16ef8fe1df439e17fb33b27733676be24","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"},"source_kind":"arxiv","source_id":"1504.07912","source_version":1,"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-05-18T02:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ci0ZWpxe5IwAeJmLowLsp6XvhNtECjydrKlqHwFRtanRQ7shG2MCEs6qvMAXZ6TBzF2wHZMEQO0qiPVsYR7BAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T16:39:43.612958Z"},"content_sha256":"195d33493b81e14e9388cc8934deaf0c027d2f99df3ca7911a0ed5b2d8c53b71","schema_version":"1.0","event_id":"sha256:195d33493b81e14e9388cc8934deaf0c027d2f99df3ca7911a0ed5b2d8c53b71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RLIQSMWYQIR6G5R7IV5N2C366F","target":"graph","payload":{"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"},"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-05-18T02:17:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sUCgQhuimvC3NOTx2H2nvGUVTgoDUlylek6YloxhlB0CvD4Gpw1dGX+yl1g+soAxcWUJL0cGzhseg9CbsYSCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T16:39:43.613471Z"},"content_sha256":"14a926a759ab633f8514a9f685ce6a25f498cf0b9b31a716405a98ca29663774","schema_version":"1.0","event_id":"sha256:14a926a759ab633f8514a9f685ce6a25f498cf0b9b31a716405a98ca29663774"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F/bundle.json","state_url":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLIQSMWYQIR6G5R7IV5N2C366F/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-05-21T16:39:43Z","links":{"resolver":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F","bundle":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F/bundle.json","state":"https://pith.science/pith/RLIQSMWYQIR6G5R7IV5N2C366F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLIQSMWYQIR6G5R7IV5N2C366F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RLIQSMWYQIR6G5R7IV5N2C366F","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":"45c1e71a9b434bdfd816382b91485a1024e7209ca17e882720329c56ea1c0188","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-29T16:08:57Z","title_canon_sha256":"3367cced53de51f17a4799f260dfe01d7db617ecb149b06f13a415e2d3fd2912"},"schema_version":"1.0","source":{"id":"1504.07912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.07912","created_at":"2026-05-18T02:17:31Z"},{"alias_kind":"arxiv_version","alias_value":"1504.07912v1","created_at":"2026-05-18T02:17:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.07912","created_at":"2026-05-18T02:17:31Z"},{"alias_kind":"pith_short_12","alias_value":"RLIQSMWYQIR6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RLIQSMWYQIR6G5R7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RLIQSMWY","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:14a926a759ab633f8514a9f685ce6a25f498cf0b9b31a716405a98ca29663774","target":"graph","created_at":"2026-05-18T02:17:31Z","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"},"paper":{"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","authors_text":"Adam Smith, Sofya Raskhodnikova","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-29T16:08:57Z","title":"Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.07912","kind":"arxiv","version":1},"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:195d33493b81e14e9388cc8934deaf0c027d2f99df3ca7911a0ed5b2d8c53b71","target":"record","created_at":"2026-05-18T02:17:31Z","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":"45c1e71a9b434bdfd816382b91485a1024e7209ca17e882720329c56ea1c0188","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-29T16:08:57Z","title_canon_sha256":"3367cced53de51f17a4799f260dfe01d7db617ecb149b06f13a415e2d3fd2912"},"schema_version":"1.0","source":{"id":"1504.07912","kind":"arxiv","version":1}},"canonical_sha256":"8ad10932d88223e3763f457add0b7ef16ef8fe1df439e17fb33b27733676be24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ad10932d88223e3763f457add0b7ef16ef8fe1df439e17fb33b27733676be24","first_computed_at":"2026-05-18T02:17:31.926206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:31.926206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T/KlzaLI28UKsyl5lGx/MouJDPGE9lXLGOL0fc0JnsQaMVF3HGI/n9wuNW/AxaRMGjlzD8ug5GhpmzQG+OeXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:31.926889Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.07912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:195d33493b81e14e9388cc8934deaf0c027d2f99df3ca7911a0ed5b2d8c53b71","sha256:14a926a759ab633f8514a9f685ce6a25f498cf0b9b31a716405a98ca29663774"],"state_sha256":"0783f264e7f7e478e9d16bade166b6b226d8a4f20414668b0f64cd54080a3483"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yzTkVtR4rJgufpDEU2WzQkDoDNyTIElO7Xqduvm4v1xA5HHkaQ4YBWuIfWttQr8E6a/Ry1Fq5usEgVusUQCbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T16:39:43.616140Z","bundle_sha256":"7f140b049a3d45c8bfa34f7e482870d90947f19105d820cac6fd022410aaf847"}}