{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:AHRUZUBREV5IQK7LHYP647XKYQ","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":"5eb7081599df4662b0d90fd3abac32379b9f461c83dd03aad8a2d5690c19b906","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-30T22:37:37Z","title_canon_sha256":"c86d8f116665d854ef851425dc9694608bea6f05cffa1c4e718f29863088124a"},"schema_version":"1.0","source":{"id":"2011.00131","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.00131","created_at":"2026-07-05T02:28:53Z"},{"alias_kind":"arxiv_version","alias_value":"2011.00131v4","created_at":"2026-07-05T02:28:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.00131","created_at":"2026-07-05T02:28:53Z"},{"alias_kind":"pith_short_12","alias_value":"AHRUZUBREV5I","created_at":"2026-07-05T02:28:53Z"},{"alias_kind":"pith_short_16","alias_value":"AHRUZUBREV5IQK7L","created_at":"2026-07-05T02:28:53Z"},{"alias_kind":"pith_short_8","alias_value":"AHRUZUBR","created_at":"2026-07-05T02:28:53Z"}],"graph_snapshots":[{"event_id":"sha256:98af4f291604a2832f16dd7a7828f025e10b00a7a5d172796d2d384ef972c707","target":"graph","created_at":"2026-07-05T02:28:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.00131/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a complete graph $G=(V,E)$, with nonnegative edge costs, two subsets $R \\subset V$ and $R^{\\prime} \\subset R$, a partition $\\mathcal{R}=\\{R_1,R_2,\\ldots,R_k\\}$ of $R$, $R_i \\cap R_j=\\phi$, $i \\neq j$ and $\\mathcal{R}^{\\prime}=\\{R^{\\prime}_1,R^{\\prime}_2,\\ldots,R^{\\prime}_k\\}$ of $R^{\\prime}$, $R^{\\prime}_i \\subset R_i$, a clustered Steiner tree is a tree $T$ of $G$ that spans all vertices in $R$ such that $T$ can be cut into $k$ subtrees $T_i$ by removing $k-1$ edges and each subtree $T_i$ spanning all vertices in $R_i$, $1 \\leq i \\leq k$. The cost of a clustered Steiner tree is defined ","authors_text":"Yen Hung Chen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-30T22:37:37Z","title":"The clustered selected-internal Steiner tree problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.00131","kind":"arxiv","version":4},"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:7dab2347d6b858a4de98895b63409dd29ea448405808c59a7f65d19075a2bb2d","target":"record","created_at":"2026-07-05T02:28:53Z","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":"5eb7081599df4662b0d90fd3abac32379b9f461c83dd03aad8a2d5690c19b906","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-30T22:37:37Z","title_canon_sha256":"c86d8f116665d854ef851425dc9694608bea6f05cffa1c4e718f29863088124a"},"schema_version":"1.0","source":{"id":"2011.00131","kind":"arxiv","version":4}},"canonical_sha256":"01e34cd031257a882beb3e1fee7eeac4304893d92f205f6ea0147b2cadfa0b6d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01e34cd031257a882beb3e1fee7eeac4304893d92f205f6ea0147b2cadfa0b6d","first_computed_at":"2026-07-05T02:28:53.068600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:28:53.068600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rcq9ObWTGrRFnu5QIR9Ra+JCEC39fh9ShXO+z7nOJiJB/fl165TPEzTCBeMk9b0YJ3SdZWcw05VJNYtApMg7Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:28:53.068989Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.00131","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dab2347d6b858a4de98895b63409dd29ea448405808c59a7f65d19075a2bb2d","sha256:98af4f291604a2832f16dd7a7828f025e10b00a7a5d172796d2d384ef972c707"],"state_sha256":"ccecb96173cd5f4d622b49b4feabb9450850d8f5d2e1fe98aaa56a7947a58bb8"}