{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:AHRUZUBREV5IQK7LHYP647XKYQ","short_pith_number":"pith:AHRUZUBR","schema_version":"1.0","canonical_sha256":"01e34cd031257a882beb3e1fee7eeac4304893d92f205f6ea0147b2cadfa0b6d","source":{"kind":"arxiv","id":"2011.00131","version":4},"attestation_state":"computed","paper":{"title":"The clustered selected-internal Steiner tree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Yen Hung Chen","submitted_at":"2020-10-30T22:37:37Z","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 "},"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":"2011.00131","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-10-30T22:37:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c86d8f116665d854ef851425dc9694608bea6f05cffa1c4e718f29863088124a","abstract_canon_sha256":"5eb7081599df4662b0d90fd3abac32379b9f461c83dd03aad8a2d5690c19b906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:53.068989Z","signature_b64":"Rcq9ObWTGrRFnu5QIR9Ra+JCEC39fh9ShXO+z7nOJiJB/fl165TPEzTCBeMk9b0YJ3SdZWcw05VJNYtApMg7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01e34cd031257a882beb3e1fee7eeac4304893d92f205f6ea0147b2cadfa0b6d","last_reissued_at":"2026-07-05T02:28:53.068600Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:53.068600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The clustered selected-internal Steiner tree problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Yen Hung Chen","submitted_at":"2020-10-30T22:37:37Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.00131","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.00131/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.00131","created_at":"2026-07-05T02:28:53.068657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.00131v4","created_at":"2026-07-05T02:28:53.068657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.00131","created_at":"2026-07-05T02:28:53.068657+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHRUZUBREV5I","created_at":"2026-07-05T02:28:53.068657+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHRUZUBREV5IQK7L","created_at":"2026-07-05T02:28:53.068657+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHRUZUBR","created_at":"2026-07-05T02:28:53.068657+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06941","citing_title":"Calibration of Quantum Devices via Robust Statistical Methods","ref_index":78,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ","json":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ.json","graph_json":"https://pith.science/api/pith-number/AHRUZUBREV5IQK7LHYP647XKYQ/graph.json","events_json":"https://pith.science/api/pith-number/AHRUZUBREV5IQK7LHYP647XKYQ/events.json","paper":"https://pith.science/paper/AHRUZUBR"},"agent_actions":{"view_html":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ","download_json":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ.json","view_paper":"https://pith.science/paper/AHRUZUBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.00131&json=true","fetch_graph":"https://pith.science/api/pith-number/AHRUZUBREV5IQK7LHYP647XKYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AHRUZUBREV5IQK7LHYP647XKYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ/action/storage_attestation","attest_author":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ/action/author_attestation","sign_citation":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ/action/citation_signature","submit_replication":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ/action/replication_record"}},"created_at":"2026-07-05T02:28:53.068657+00:00","updated_at":"2026-07-05T02:28:53.068657+00:00"}