{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2ZGLKOPKDQEOBSXMBFJNJZDUHH","short_pith_number":"pith:2ZGLKOPK","schema_version":"1.0","canonical_sha256":"d64cb539ea1c08e0caec0952d4e47439d3139ecfc4a1ffcf68fa84e334427ade","source":{"kind":"arxiv","id":"1111.4766","version":5},"attestation_state":"computed","paper":{"title":"On Strong Graph Partitions and Universal Steiner Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chinmoy Dutta, Costas Busch, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srivathsan Srinivasagopalan","submitted_at":"2011-11-21T06:03:45Z","abstract_excerpt":"We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum {\\em stretch}, where the stretch of $T$ is defined to be the maximum ratio, over all terminal sets $X$, of the cost of the minimal sub-tree $T_X$ of $T$ that connects $X$ to $r$ to the cost of an optimal Steiner tree connecting $X$ to $r$ in $G$. Universal Steiner trees (USTs) are important for data aggregation problems where computing the Steiner tree from scratch for every input instance of terminals is costly, as for example"},"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":"1111.4766","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-21T06:03:45Z","cross_cats_sorted":[],"title_canon_sha256":"6fedad4300801521bb3203a6275f37e449ed5dca090bbd9c1e7126cc04c684d7","abstract_canon_sha256":"5431fe7426f4c654b869610988d1aed92692f6dbdf0ca6feafc95c468fe1fd61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:01.331528Z","signature_b64":"u/CceNBzb+zfc3aCKqMPO1yCsHK/anAINfK1xeq3YjiHmchg86Al/T+5cd/0tNxaB/Z3CrBOrT4oVKVEm0pDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d64cb539ea1c08e0caec0952d4e47439d3139ecfc4a1ffcf68fa84e334427ade","last_reissued_at":"2026-05-18T02:26:01.331051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:01.331051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Strong Graph Partitions and Universal Steiner Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chinmoy Dutta, Costas Busch, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srivathsan Srinivasagopalan","submitted_at":"2011-11-21T06:03:45Z","abstract_excerpt":"We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum {\\em stretch}, where the stretch of $T$ is defined to be the maximum ratio, over all terminal sets $X$, of the cost of the minimal sub-tree $T_X$ of $T$ that connects $X$ to $r$ to the cost of an optimal Steiner tree connecting $X$ to $r$ in $G$. Universal Steiner trees (USTs) are important for data aggregation problems where computing the Steiner tree from scratch for every input instance of terminals is costly, as for example"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4766","kind":"arxiv","version":5},"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":"1111.4766","created_at":"2026-05-18T02:26:01.331117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.4766v5","created_at":"2026-05-18T02:26:01.331117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4766","created_at":"2026-05-18T02:26:01.331117+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZGLKOPKDQEO","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZGLKOPKDQEOBSXM","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZGLKOPK","created_at":"2026-05-18T12:26:18.847500+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/2ZGLKOPKDQEOBSXMBFJNJZDUHH","json":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH.json","graph_json":"https://pith.science/api/pith-number/2ZGLKOPKDQEOBSXMBFJNJZDUHH/graph.json","events_json":"https://pith.science/api/pith-number/2ZGLKOPKDQEOBSXMBFJNJZDUHH/events.json","paper":"https://pith.science/paper/2ZGLKOPK"},"agent_actions":{"view_html":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH","download_json":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH.json","view_paper":"https://pith.science/paper/2ZGLKOPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.4766&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZGLKOPKDQEOBSXMBFJNJZDUHH/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZGLKOPKDQEOBSXMBFJNJZDUHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/action/storage_attestation","attest_author":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/action/author_attestation","sign_citation":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/action/citation_signature","submit_replication":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/action/replication_record"}},"created_at":"2026-05-18T02:26:01.331117+00:00","updated_at":"2026-05-18T02:26:01.331117+00:00"}