{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MAROYABRVB7U5JAK76LICX2FYF","short_pith_number":"pith:MAROYABR","canonical_record":{"source":{"id":"1011.3770","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-16T17:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"18deeb310c52a3ab319ccfda7df59271898ddaddcb200fee94570f381b9f3aa4","abstract_canon_sha256":"75d4b5d9a1384467346a04946f4293f01f9dbeb4dbf80fe68f2aaa21598db894"},"schema_version":"1.0"},"canonical_sha256":"6022ec0031a87f4ea40aff96815f45c15d36a4c9ff169c248682421638c9fc40","source":{"kind":"arxiv","id":"1011.3770","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3770","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3770v2","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3770","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"pith_short_12","alias_value":"MAROYABRVB7U","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MAROYABRVB7U5JAK","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MAROYABR","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MAROYABRVB7U5JAK76LICX2FYF","target":"record","payload":{"canonical_record":{"source":{"id":"1011.3770","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-16T17:49:27Z","cross_cats_sorted":[],"title_canon_sha256":"18deeb310c52a3ab319ccfda7df59271898ddaddcb200fee94570f381b9f3aa4","abstract_canon_sha256":"75d4b5d9a1384467346a04946f4293f01f9dbeb4dbf80fe68f2aaa21598db894"},"schema_version":"1.0"},"canonical_sha256":"6022ec0031a87f4ea40aff96815f45c15d36a4c9ff169c248682421638c9fc40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:47.493114Z","signature_b64":"yueFCXDYEdU5Z8QM/sYGa0qUtFn0V7xs+0gfWZPdH77RV60+9eDqxa0T1Yr5Q2vO/j/vQqpD1fh9NBg8AdpTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6022ec0031a87f4ea40aff96815f45c15d36a4c9ff169c248682421638c9fc40","last_reissued_at":"2026-05-18T04:35:47.492559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:47.492559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.3770","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-05-18T04:35:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSF690ii6oDXtleQp6ic/sAzeOkW4BHslwRJt2IGndUvg08tea1pxKS0gZMfsrYvTO/KTZGByHFU4IIjhN0SBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:28.501484Z"},"content_sha256":"84cd6c91bff765a0a336ecb2d46cb35ce5baaa58a2b5495b34d098789570b79d","schema_version":"1.0","event_id":"sha256:84cd6c91bff765a0a336ecb2d46cb35ce5baaa58a2b5495b34d098789570b79d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MAROYABRVB7U5JAK76LICX2FYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna","submitted_at":"2010-11-16T17:49:27Z","abstract_excerpt":"Given a metric space on n points, an {\\alpha}-approximate universal algorithm for the Steiner tree problem outputs a distribution over rooted spanning trees such that for any subset X of vertices containing the root, the expected cost of the induced subtree is within an {\\alpha} factor of the optimal Steiner tree cost for X. An {\\alpha}-approximate differentially private algorithm for the Steiner tree problem takes as input a subset X of vertices, and outputs a tree distribution that induces a solution within an {\\alpha} factor of the optimal as before, and satisfies the additional property th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3770","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":""},"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-18T04:35:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4ATF4EJFYGZ9RFNrN6FzTI+o+Eejd0h/O9tWzaBPKEyd+UJV74nVuxoqR6yfzf/sVfXGLtcTrzfqx/wP+rZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:00:28.501839Z"},"content_sha256":"96527c8101b438d2908bf4d92562d572d38fcf35268a51bbff52c1d0727e417f","schema_version":"1.0","event_id":"sha256:96527c8101b438d2908bf4d92562d572d38fcf35268a51bbff52c1d0727e417f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF/bundle.json","state_url":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAROYABRVB7U5JAK76LICX2FYF/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-06-01T19:00:28Z","links":{"resolver":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF","bundle":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF/bundle.json","state":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAROYABRVB7U5JAK76LICX2FYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MAROYABRVB7U5JAK76LICX2FYF","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":"75d4b5d9a1384467346a04946f4293f01f9dbeb4dbf80fe68f2aaa21598db894","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-16T17:49:27Z","title_canon_sha256":"18deeb310c52a3ab319ccfda7df59271898ddaddcb200fee94570f381b9f3aa4"},"schema_version":"1.0","source":{"id":"1011.3770","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3770","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3770v2","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3770","created_at":"2026-05-18T04:35:47Z"},{"alias_kind":"pith_short_12","alias_value":"MAROYABRVB7U","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MAROYABRVB7U5JAK","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MAROYABR","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:96527c8101b438d2908bf4d92562d572d38fcf35268a51bbff52c1d0727e417f","target":"graph","created_at":"2026-05-18T04:35:47Z","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":"Given a metric space on n points, an {\\alpha}-approximate universal algorithm for the Steiner tree problem outputs a distribution over rooted spanning trees such that for any subset X of vertices containing the root, the expected cost of the induced subtree is within an {\\alpha} factor of the optimal Steiner tree cost for X. An {\\alpha}-approximate differentially private algorithm for the Steiner tree problem takes as input a subset X of vertices, and outputs a tree distribution that induces a solution within an {\\alpha} factor of the optimal as before, and satisfies the additional property th","authors_text":"Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-16T17:49:27Z","title":"Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3770","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:84cd6c91bff765a0a336ecb2d46cb35ce5baaa58a2b5495b34d098789570b79d","target":"record","created_at":"2026-05-18T04:35:47Z","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":"75d4b5d9a1384467346a04946f4293f01f9dbeb4dbf80fe68f2aaa21598db894","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-16T17:49:27Z","title_canon_sha256":"18deeb310c52a3ab319ccfda7df59271898ddaddcb200fee94570f381b9f3aa4"},"schema_version":"1.0","source":{"id":"1011.3770","kind":"arxiv","version":2}},"canonical_sha256":"6022ec0031a87f4ea40aff96815f45c15d36a4c9ff169c248682421638c9fc40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6022ec0031a87f4ea40aff96815f45c15d36a4c9ff169c248682421638c9fc40","first_computed_at":"2026-05-18T04:35:47.492559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:47.492559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yueFCXDYEdU5Z8QM/sYGa0qUtFn0V7xs+0gfWZPdH77RV60+9eDqxa0T1Yr5Q2vO/j/vQqpD1fh9NBg8AdpTCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:47.493114Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3770","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84cd6c91bff765a0a336ecb2d46cb35ce5baaa58a2b5495b34d098789570b79d","sha256:96527c8101b438d2908bf4d92562d572d38fcf35268a51bbff52c1d0727e417f"],"state_sha256":"c3117dd9c29daaa0237bc6e25278b381f55fc0acc782b18a65e688442573efff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EON5W/1E4v5lJAs1xg5fyMwzPKynA27InO4rOyyl8xpW8m/91uuU/vZdnUu1Xi70vZI4e1ru8htNMSyJElydAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:00:28.503701Z","bundle_sha256":"bac8d1234298c02eb615949a33f0a759933eba9195cff2074acc61935da8ce76"}}