{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:W27MDRQO23MLC2FDJ55TM6DVQO","short_pith_number":"pith:W27MDRQO","schema_version":"1.0","canonical_sha256":"b6bec1c60ed6d8b168a34f7b36787583a8eee8fb3a67cabe9587167159970f16","source":{"kind":"arxiv","id":"1212.3403","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.3403","created_at":"2026-05-18T03:14:19.889677+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.3403v2","created_at":"2026-05-18T03:14:19.889677+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.3403","created_at":"2026-05-18T03:14:19.889677+00:00"},{"alias_kind":"pith_short_12","alias_value":"W27MDRQO23ML","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"W27MDRQO23MLC2FD","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"W27MDRQO","created_at":"2026-05-18T12:27:25.539911+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/W27MDRQO23MLC2FDJ55TM6DVQO","json":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO.json","graph_json":"https://pith.science/api/pith-number/W27MDRQO23MLC2FDJ55TM6DVQO/graph.json","events_json":"https://pith.science/api/pith-number/W27MDRQO23MLC2FDJ55TM6DVQO/events.json","paper":"https://pith.science/paper/W27MDRQO"},"agent_actions":{"view_html":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO","download_json":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO.json","view_paper":"https://pith.science/paper/W27MDRQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.3403&json=true","fetch_graph":"https://pith.science/api/pith-number/W27MDRQO23MLC2FDJ55TM6DVQO/graph.json","fetch_events":"https://pith.science/api/pith-number/W27MDRQO23MLC2FDJ55TM6DVQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO/action/storage_attestation","attest_author":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO/action/author_attestation","sign_citation":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO/action/citation_signature","submit_replication":"https://pith.science/pith/W27MDRQO23MLC2FDJ55TM6DVQO/action/replication_record"}},"created_at":"2026-05-18T03:14:19.889677+00:00","updated_at":"2026-05-18T03:14:19.889677+00:00"}