{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5HBPG66D577UR4P3VWUZBKMIEH","short_pith_number":"pith:5HBPG66D","schema_version":"1.0","canonical_sha256":"e9c2f37bc3efff48f1fbada990a98821f202818e4748f142d0850db051499bd5","source":{"kind":"arxiv","id":"1811.11700","version":2},"attestation_state":"computed","paper":{"title":"Approximation algorithms for the vertex-weighted grade-of-service Steiner tree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alon Efrat, Faryad Darabi Sahneh, Richard Spence, Spencer Krieger, Stephen Kobourov","submitted_at":"2018-11-28T17:37:13Z","abstract_excerpt":"Given a graph $G = (V,E)$ and a subset $T \\subseteq V$ of terminals, a \\emph{Steiner tree} of $G$ is a tree that spans $T$. In the vertex-weighted Steiner tree (VST) problem, each vertex is assigned a non-negative weight, and the goal is to compute a minimum weight Steiner tree of $G$.\n  We study a natural generalization of the VST problem motivated by multi-level graph construction, the \\emph{vertex-weighted grade-of-service Steiner tree problem} (V-GSST), which can be stated as follows: given a graph $G$ and terminals $T$, where each terminal $v \\in T$ requires a facility of a minimum grade "},"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":"1811.11700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-28T17:37:13Z","cross_cats_sorted":[],"title_canon_sha256":"bd4a40f37437e3b7c3ad142ff8a2f937e42387dae5205e688ad73396c79017af","abstract_canon_sha256":"992e6d5d5b3f9b216fce0a5bcb8270fea9cdc1e240fd0fc3e275e47af0e7a7d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:02.447231Z","signature_b64":"O6DQmlIRU736fKlPg8ZO57uEsuksiTfVNDvVqmesLsNOPC4guVIeX/ZsHdHbA5PhAi02/pWBOBB/Ru5kN5T7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9c2f37bc3efff48f1fbada990a98821f202818e4748f142d0850db051499bd5","last_reissued_at":"2026-05-17T23:47:02.446574Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:02.446574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms for the vertex-weighted grade-of-service Steiner tree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alon Efrat, Faryad Darabi Sahneh, Richard Spence, Spencer Krieger, Stephen Kobourov","submitted_at":"2018-11-28T17:37:13Z","abstract_excerpt":"Given a graph $G = (V,E)$ and a subset $T \\subseteq V$ of terminals, a \\emph{Steiner tree} of $G$ is a tree that spans $T$. In the vertex-weighted Steiner tree (VST) problem, each vertex is assigned a non-negative weight, and the goal is to compute a minimum weight Steiner tree of $G$.\n  We study a natural generalization of the VST problem motivated by multi-level graph construction, the \\emph{vertex-weighted grade-of-service Steiner tree problem} (V-GSST), which can be stated as follows: given a graph $G$ and terminals $T$, where each terminal $v \\in T$ requires a facility of a minimum grade "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11700","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":"1811.11700","created_at":"2026-05-17T23:47:02.446671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11700v2","created_at":"2026-05-17T23:47:02.446671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11700","created_at":"2026-05-17T23:47:02.446671+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HBPG66D577U","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HBPG66D577UR4P3","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HBPG66D","created_at":"2026-05-18T12:32:08.215937+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/5HBPG66D577UR4P3VWUZBKMIEH","json":"https://pith.science/pith/5HBPG66D577UR4P3VWUZBKMIEH.json","graph_json":"https://pith.science/api/pith-number/5HBPG66D577UR4P3VWUZBKMIEH/graph.json","events_json":"https://pith.science/api/pith-number/5HBPG66D577UR4P3VWUZBKMIEH/events.json","paper":"https://pith.science/paper/5HBPG66D"},"agent_actions":{"view_html":"https://pith.science/pith/5HBPG66D577UR4P3VWUZBKMIEH","download_json":"https://pith.science/pith/5HBPG66D577UR4P3VWUZBKMIEH.json","view_paper":"https://pith.science/paper/5HBPG66D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11700&json=true","fetch_graph":"https://pith.science/api/pith-number/5HBPG66D577UR4P3VWUZBKMIEH/graph.json","fetch_events":"https://pith.science/api/pith-number/5HBPG66D577UR4P3VWUZBKMIEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HBPG66D577UR4P3VWUZBKMIEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HBPG66D577UR4P3VWUZBKMIEH/action/storage_attestation","attest_author":"https://pith.science/pith/5HBPG66D577UR4P3VWUZBKMIEH/action/author_attestation","sign_citation":"https://pith.science/pith/5HBPG66D577UR4P3VWUZBKMIEH/action/citation_signature","submit_replication":"https://pith.science/pith/5HBPG66D577UR4P3VWUZBKMIEH/action/replication_record"}},"created_at":"2026-05-17T23:47:02.446671+00:00","updated_at":"2026-05-17T23:47:02.446671+00:00"}