{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5HBPG66D577UR4P3VWUZBKMIEH","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":"992e6d5d5b3f9b216fce0a5bcb8270fea9cdc1e240fd0fc3e275e47af0e7a7d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-28T17:37:13Z","title_canon_sha256":"bd4a40f37437e3b7c3ad142ff8a2f937e42387dae5205e688ad73396c79017af"},"schema_version":"1.0","source":{"id":"1811.11700","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11700","created_at":"2026-05-17T23:47:02Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11700v2","created_at":"2026-05-17T23:47:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11700","created_at":"2026-05-17T23:47:02Z"},{"alias_kind":"pith_short_12","alias_value":"5HBPG66D577U","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5HBPG66D577UR4P3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5HBPG66D","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:8c407c686748a74c8bd378e5461d0c248a1e17a7a29f2af7b028eecf51f2e765","target":"graph","created_at":"2026-05-17T23:47:02Z","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":"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 ","authors_text":"Alon Efrat, Faryad Darabi Sahneh, Richard Spence, Spencer Krieger, Stephen Kobourov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-28T17:37:13Z","title":"Approximation algorithms for the vertex-weighted grade-of-service Steiner tree problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11700","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:c4b98affce3042e2c737e95867c9f50e1e24163b88e3b2a77365661b0886a8b1","target":"record","created_at":"2026-05-17T23:47:02Z","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":"992e6d5d5b3f9b216fce0a5bcb8270fea9cdc1e240fd0fc3e275e47af0e7a7d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-28T17:37:13Z","title_canon_sha256":"bd4a40f37437e3b7c3ad142ff8a2f937e42387dae5205e688ad73396c79017af"},"schema_version":"1.0","source":{"id":"1811.11700","kind":"arxiv","version":2}},"canonical_sha256":"e9c2f37bc3efff48f1fbada990a98821f202818e4748f142d0850db051499bd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9c2f37bc3efff48f1fbada990a98821f202818e4748f142d0850db051499bd5","first_computed_at":"2026-05-17T23:47:02.446574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:02.446574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O6DQmlIRU736fKlPg8ZO57uEsuksiTfVNDvVqmesLsNOPC4guVIeX/ZsHdHbA5PhAi02/pWBOBB/Ru5kN5T7CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:02.447231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11700","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4b98affce3042e2c737e95867c9f50e1e24163b88e3b2a77365661b0886a8b1","sha256:8c407c686748a74c8bd378e5461d0c248a1e17a7a29f2af7b028eecf51f2e765"],"state_sha256":"a2255a396c8ccb98816bc08063c63c5a2414c87a9d6eae98dd5447b2fb261f64"}