{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:MAROYABRVB7U5JAK76LICX2FYF","short_pith_number":"pith:MAROYABR","schema_version":"1.0","canonical_sha256":"6022ec0031a87f4ea40aff96815f45c15d36a4c9ff169c248682421638c9fc40","source":{"kind":"arxiv","id":"1011.3770","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1011.3770","created_at":"2026-05-18T04:35:47.492638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3770v2","created_at":"2026-05-18T04:35:47.492638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3770","created_at":"2026-05-18T04:35:47.492638+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAROYABRVB7U","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAROYABRVB7U5JAK","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAROYABR","created_at":"2026-05-18T12:26:10.704358+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/MAROYABRVB7U5JAK76LICX2FYF","json":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF.json","graph_json":"https://pith.science/api/pith-number/MAROYABRVB7U5JAK76LICX2FYF/graph.json","events_json":"https://pith.science/api/pith-number/MAROYABRVB7U5JAK76LICX2FYF/events.json","paper":"https://pith.science/paper/MAROYABR"},"agent_actions":{"view_html":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF","download_json":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF.json","view_paper":"https://pith.science/paper/MAROYABR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3770&json=true","fetch_graph":"https://pith.science/api/pith-number/MAROYABRVB7U5JAK76LICX2FYF/graph.json","fetch_events":"https://pith.science/api/pith-number/MAROYABRVB7U5JAK76LICX2FYF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF/action/storage_attestation","attest_author":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF/action/author_attestation","sign_citation":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF/action/citation_signature","submit_replication":"https://pith.science/pith/MAROYABRVB7U5JAK76LICX2FYF/action/replication_record"}},"created_at":"2026-05-18T04:35:47.492638+00:00","updated_at":"2026-05-18T04:35:47.492638+00:00"}