{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:W27MDRQO23MLC2FDJ55TM6DVQO","short_pith_number":"pith:W27MDRQO","canonical_record":{"source":{"id":"1212.3403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-14T07:23:08Z","cross_cats_sorted":[],"title_canon_sha256":"acfd461bd93ce404ff0c5b5537028c78d5c506c1133bc428130079bebb00a907","abstract_canon_sha256":"4137462cb5b55e6b8f9585033578af9f65b00137bf122c86ff7d4e7c0e99dcf7"},"schema_version":"1.0"},"canonical_sha256":"b6bec1c60ed6d8b168a34f7b36787583a8eee8fb3a67cabe9587167159970f16","source":{"kind":"arxiv","id":"1212.3403","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3403","created_at":"2026-05-18T03:14:19Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3403v2","created_at":"2026-05-18T03:14:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3403","created_at":"2026-05-18T03:14:19Z"},{"alias_kind":"pith_short_12","alias_value":"W27MDRQO23ML","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W27MDRQO23MLC2FD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W27MDRQO","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:W27MDRQO23MLC2FDJ55TM6DVQO","target":"record","payload":{"canonical_record":{"source":{"id":"1212.3403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-14T07:23:08Z","cross_cats_sorted":[],"title_canon_sha256":"acfd461bd93ce404ff0c5b5537028c78d5c506c1133bc428130079bebb00a907","abstract_canon_sha256":"4137462cb5b55e6b8f9585033578af9f65b00137bf122c86ff7d4e7c0e99dcf7"},"schema_version":"1.0"},"canonical_sha256":"b6bec1c60ed6d8b168a34f7b36787583a8eee8fb3a67cabe9587167159970f16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:19.890387Z","signature_b64":"zUE1xpAGNbRF8XJpyvueO7ZWjKU+PdIJG0cKBRZEDJGFYR78mNa4IGYBDiMb5qimFwB7H8CVGbCr9gwNANLwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6bec1c60ed6d8b168a34f7b36787583a8eee8fb3a67cabe9587167159970f16","last_reissued_at":"2026-05-18T03:14:19.889522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:19.889522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.3403","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-18T03:14:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xSyRoo08/I/1WCX4FOBwcRACkrC9a3DhYtdNiebn13x4Ih4G5zdx3pNFsxKPRBkjaf3x+tqjIp648Id0/ZBpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:24:42.786476Z"},"content_sha256":"02f95e551d75f12303c2db7308d097a5d1b9772fe2ca97dc47180533b4e9642f","schema_version":"1.0","event_id":"sha256:02f95e551d75f12303c2db7308d097a5d1b9772fe2ca97dc47180533b4e9642f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:W27MDRQO23MLC2FDJ55TM6DVQO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parameterized Approximation Algorithm for The Shallow-Light Steiner Tree Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kewen Liao, Longkun Guo","submitted_at":"2012-12-14T07:23:08Z","abstract_excerpt":"For a given graph $G=(V,\\, E)$ with a terminal set $S$ and a selected root $r\\in S$, a positive integer cost and a delay on every edge and a delay constraint $D\\in Z^{+}$, the shallow-light Steiner tree (\\emph{SLST}) problem is to compute a minimum cost tree spanning the terminals of $S$, in which the delay between root and every vertex is restrained by $D$. This problem is NP-hard and very hard to approximate. According to known inapproximability results, this problem admits no approximation with ratio better than factor $(1,\\, O(\\log^{2}n))$ unless $NP\\subseteq DTIME(n^{\\log\\log n})$ \\cite{k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3403","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-18T03:14:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGCvfLZLiBWyK3ekqBMisn4EvOjBMRy1lAgixK4+8Seswtk0oaovSAF2teKePxizAsb2Y+sYm/ebbO4bSO+0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:24:42.787102Z"},"content_sha256":"f18cca5e4b8e0b6e1e9e5c1c423a331f0a31b545cf3fd10ad83b5c3859f54c24","schema_version":"1.0","event_id":"sha256:f18cca5e4b8e0b6e1e9e5c1c423a331f0a31b545cf3fd10ad83b5c3859f54c24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO/bundle.json","state_url":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W27MDRQO23MLC2FDJ55TM6DVQO/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-25T13:24:42Z","links":{"resolver":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO","bundle":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO/bundle.json","state":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W27MDRQO23MLC2FDJ55TM6DVQO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:W27MDRQO23MLC2FDJ55TM6DVQO","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":"4137462cb5b55e6b8f9585033578af9f65b00137bf122c86ff7d4e7c0e99dcf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-14T07:23:08Z","title_canon_sha256":"acfd461bd93ce404ff0c5b5537028c78d5c506c1133bc428130079bebb00a907"},"schema_version":"1.0","source":{"id":"1212.3403","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.3403","created_at":"2026-05-18T03:14:19Z"},{"alias_kind":"arxiv_version","alias_value":"1212.3403v2","created_at":"2026-05-18T03:14:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3403","created_at":"2026-05-18T03:14:19Z"},{"alias_kind":"pith_short_12","alias_value":"W27MDRQO23ML","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W27MDRQO23MLC2FD","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W27MDRQO","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:f18cca5e4b8e0b6e1e9e5c1c423a331f0a31b545cf3fd10ad83b5c3859f54c24","target":"graph","created_at":"2026-05-18T03:14:19Z","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":"For a given graph $G=(V,\\, E)$ with a terminal set $S$ and a selected root $r\\in S$, a positive integer cost and a delay on every edge and a delay constraint $D\\in Z^{+}$, the shallow-light Steiner tree (\\emph{SLST}) problem is to compute a minimum cost tree spanning the terminals of $S$, in which the delay between root and every vertex is restrained by $D$. This problem is NP-hard and very hard to approximate. According to known inapproximability results, this problem admits no approximation with ratio better than factor $(1,\\, O(\\log^{2}n))$ unless $NP\\subseteq DTIME(n^{\\log\\log n})$ \\cite{k","authors_text":"Kewen Liao, Longkun Guo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-14T07:23:08Z","title":"A Parameterized Approximation Algorithm for The Shallow-Light Steiner Tree Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.3403","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:02f95e551d75f12303c2db7308d097a5d1b9772fe2ca97dc47180533b4e9642f","target":"record","created_at":"2026-05-18T03:14:19Z","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":"4137462cb5b55e6b8f9585033578af9f65b00137bf122c86ff7d4e7c0e99dcf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-14T07:23:08Z","title_canon_sha256":"acfd461bd93ce404ff0c5b5537028c78d5c506c1133bc428130079bebb00a907"},"schema_version":"1.0","source":{"id":"1212.3403","kind":"arxiv","version":2}},"canonical_sha256":"b6bec1c60ed6d8b168a34f7b36787583a8eee8fb3a67cabe9587167159970f16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6bec1c60ed6d8b168a34f7b36787583a8eee8fb3a67cabe9587167159970f16","first_computed_at":"2026-05-18T03:14:19.889522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:19.889522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zUE1xpAGNbRF8XJpyvueO7ZWjKU+PdIJG0cKBRZEDJGFYR78mNa4IGYBDiMb5qimFwB7H8CVGbCr9gwNANLwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:19.890387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.3403","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02f95e551d75f12303c2db7308d097a5d1b9772fe2ca97dc47180533b4e9642f","sha256:f18cca5e4b8e0b6e1e9e5c1c423a331f0a31b545cf3fd10ad83b5c3859f54c24"],"state_sha256":"3836a5b252a1d7bfef1fa45a148f1cd1ff0b1301c21491014fa2f41c094836eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QefHcT/HkfQqg3WbAiNBrKwUsU5Ys5LjmdbRZH492UqnRcoVGGeTJKqaxFkTtTUQLnLaPod41ie3W+yndJpMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:24:42.790669Z","bundle_sha256":"9ed1ea1d0056a0cfb2720de10603b0244cc7c1d814519e686e19398bafd02056"}}