{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7QXEW4Q5E7XI4BLPAXKYCGSWC7","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":"217610038a15887cd43ee45c23bce30452ef8738de26e8f10564c8326a7f47f4","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-01T22:48:08Z","title_canon_sha256":"f1b815b9d1c502fee61b518fffada100bac5c174e2fdaeaa0cd16b05f6777d34"},"schema_version":"1.0","source":{"id":"1904.01135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01135","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01135v1","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01135","created_at":"2026-05-17T23:49:35Z"},{"alias_kind":"pith_short_12","alias_value":"7QXEW4Q5E7XI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7QXEW4Q5E7XI4BLP","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7QXEW4Q5","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:7c8e438b50038f3410d44257d8f3dd166aa736df6b827da062c86e922fcc688a","target":"graph","created_at":"2026-05-17T23:49:35Z","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 weighted graph $G(V,E)$ and $t \\ge 1$, a subgraph $H$ is a \\emph{$t$--spanner} of $G$ if the lengths of shortest paths in $G$ are preserved in $H$ up to a multiplicative factor of $t$. The \\emph{subsetwise spanner} problem aims to preserve distances in $G$ for only a subset of the vertices. We generalize the minimum-cost subsetwise spanner problem to one where vertices appear on multiple levels, which we call the \\emph{multi-level graph spanner} (MLGS) problem, and describe two simple heuristics. Applications of this problem include road/network building and multi-level graph visualiza","authors_text":"Faryad Darabi Sahneh, Keaton Hamm, Mohammad Javad Latifi Jebelli, Reyan Ahmed, Richard Spence, Stephen Kobourov","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-01T22:48:08Z","title":"Approximation algorithms and an integer program for multi-level graph spanners"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01135","kind":"arxiv","version":1},"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:e959be130e60e4317f33d7b13547961b67ef3be09387a71909fd37ad8536436f","target":"record","created_at":"2026-05-17T23:49:35Z","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":"217610038a15887cd43ee45c23bce30452ef8738de26e8f10564c8326a7f47f4","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-01T22:48:08Z","title_canon_sha256":"f1b815b9d1c502fee61b518fffada100bac5c174e2fdaeaa0cd16b05f6777d34"},"schema_version":"1.0","source":{"id":"1904.01135","kind":"arxiv","version":1}},"canonical_sha256":"fc2e4b721d27ee8e056f05d5811a5617e0f96d0b32fe8700bce91fbf9a08f10b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc2e4b721d27ee8e056f05d5811a5617e0f96d0b32fe8700bce91fbf9a08f10b","first_computed_at":"2026-05-17T23:49:35.806351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:35.806351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EKZ4y5caGPGOE8NezHJCI4gE0tKM9yp/8NNrPsTjsQdrJ/tnJicA5/GKovTu18BQRnIdg8ts19SmVyDtXdnXAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:35.806840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.01135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e959be130e60e4317f33d7b13547961b67ef3be09387a71909fd37ad8536436f","sha256:7c8e438b50038f3410d44257d8f3dd166aa736df6b827da062c86e922fcc688a"],"state_sha256":"c2446d8b4a6913d88a5f3c9fce55deb5a6b743288313d281a9153a5b54063e71"}