{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:2ZGLKOPKDQEOBSXMBFJNJZDUHH","short_pith_number":"pith:2ZGLKOPK","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"},"canonical_sha256":"d64cb539ea1c08e0caec0952d4e47439d3139ecfc4a1ffcf68fa84e334427ade","source":{"kind":"arxiv","id":"1111.4766","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4766","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4766v5","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4766","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"2ZGLKOPKDQEO","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2ZGLKOPKDQEOBSXM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2ZGLKOPK","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:2ZGLKOPKDQEOBSXMBFJNJZDUHH","target":"record","payload":{"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"},"canonical_sha256":"d64cb539ea1c08e0caec0952d4e47439d3139ecfc4a1ffcf68fa84e334427ade","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"},"source_kind":"arxiv","source_id":"1111.4766","source_version":5,"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:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JzbXKb9DRwSfa1rwvpG7UizLrZgSXkP50Kjh5ICxvHtGeB7OOFrfyQ2W4hUoj8sy3P0p2ku7vHNX/NnaOYoqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:26:31.866568Z"},"content_sha256":"c7c454a56932ab167d6072d84fae130bfe999e4cae4b35bcc4bc72d8aabe527a","schema_version":"1.0","event_id":"sha256:c7c454a56932ab167d6072d84fae130bfe999e4cae4b35bcc4bc72d8aabe527a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:2ZGLKOPKDQEOBSXMBFJNJZDUHH","target":"graph","payload":{"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"},"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:26:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2R3h8GOA3/E/bdM72Wp8H91iFFor9eHC5tCrpqHcxW4BOXPqgiz9u50fMK7gTXtqgYdt/ZVMMe4IpDPNzyqKBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:26:31.867199Z"},"content_sha256":"603649c20d00edaaa34e88ce9d9efbdc5337933724b8c0b2034cd6d64e2accc4","schema_version":"1.0","event_id":"sha256:603649c20d00edaaa34e88ce9d9efbdc5337933724b8c0b2034cd6d64e2accc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/bundle.json","state_url":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/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-31T16:26:31Z","links":{"resolver":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH","bundle":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/bundle.json","state":"https://pith.science/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZGLKOPKDQEOBSXMBFJNJZDUHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:2ZGLKOPKDQEOBSXMBFJNJZDUHH","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":"5431fe7426f4c654b869610988d1aed92692f6dbdf0ca6feafc95c468fe1fd61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-21T06:03:45Z","title_canon_sha256":"6fedad4300801521bb3203a6275f37e449ed5dca090bbd9c1e7126cc04c684d7"},"schema_version":"1.0","source":{"id":"1111.4766","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.4766","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"arxiv_version","alias_value":"1111.4766v5","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.4766","created_at":"2026-05-18T02:26:01Z"},{"alias_kind":"pith_short_12","alias_value":"2ZGLKOPKDQEO","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"2ZGLKOPKDQEOBSXM","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"2ZGLKOPK","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:603649c20d00edaaa34e88ce9d9efbdc5337933724b8c0b2034cd6d64e2accc4","target":"graph","created_at":"2026-05-18T02:26:01Z","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":"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","authors_text":"Chinmoy Dutta, Costas Busch, Jaikumar Radhakrishnan, Rajmohan Rajaraman, Srivathsan Srinivasagopalan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-21T06:03:45Z","title":"On Strong Graph Partitions and Universal Steiner Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.4766","kind":"arxiv","version":5},"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:c7c454a56932ab167d6072d84fae130bfe999e4cae4b35bcc4bc72d8aabe527a","target":"record","created_at":"2026-05-18T02:26:01Z","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":"5431fe7426f4c654b869610988d1aed92692f6dbdf0ca6feafc95c468fe1fd61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-21T06:03:45Z","title_canon_sha256":"6fedad4300801521bb3203a6275f37e449ed5dca090bbd9c1e7126cc04c684d7"},"schema_version":"1.0","source":{"id":"1111.4766","kind":"arxiv","version":5}},"canonical_sha256":"d64cb539ea1c08e0caec0952d4e47439d3139ecfc4a1ffcf68fa84e334427ade","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d64cb539ea1c08e0caec0952d4e47439d3139ecfc4a1ffcf68fa84e334427ade","first_computed_at":"2026-05-18T02:26:01.331051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:01.331051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u/CceNBzb+zfc3aCKqMPO1yCsHK/anAINfK1xeq3YjiHmchg86Al/T+5cd/0tNxaB/Z3CrBOrT4oVKVEm0pDCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:01.331528Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.4766","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7c454a56932ab167d6072d84fae130bfe999e4cae4b35bcc4bc72d8aabe527a","sha256:603649c20d00edaaa34e88ce9d9efbdc5337933724b8c0b2034cd6d64e2accc4"],"state_sha256":"548719ab2fb5e91fc4d9b7b50182e823b19cdc60534b9a03538526a4d5dc9986"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tr475zktN0M+HCcE5EJZE1l8oTuhuOGKI3Tid9JbWcbyPQDjXjIqMP5caimWnyRSLgQl3duTrObtYqcykShCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:26:31.871131Z","bundle_sha256":"94b436a5ba68554d1092ce16660f5e32a056bbf7450393405bd82295a2728de8"}}