{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:AHRUZUBREV5IQK7LHYP647XKYQ","short_pith_number":"pith:AHRUZUBR","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"},"canonical_sha256":"01e34cd031257a882beb3e1fee7eeac4304893d92f205f6ea0147b2cadfa0b6d","source":{"kind":"arxiv","id":"2011.00131","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:AHRUZUBREV5IQK7LHYP647XKYQ","target":"record","payload":{"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"},"canonical_sha256":"01e34cd031257a882beb3e1fee7eeac4304893d92f205f6ea0147b2cadfa0b6d","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"},"source_kind":"arxiv","source_id":"2011.00131","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:28:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oklcr1Dl3DqG7R+lYAtapij5fq8HDc821TDqtKBSh1HtCGSoo5jUNcfKbVJ5wJb0RUN/04R1/l7nlTysTRaUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:25:06.814996Z"},"content_sha256":"7dab2347d6b858a4de98895b63409dd29ea448405808c59a7f65d19075a2bb2d","schema_version":"1.0","event_id":"sha256:7dab2347d6b858a4de98895b63409dd29ea448405808c59a7f65d19075a2bb2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:AHRUZUBREV5IQK7LHYP647XKYQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:28:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jaOknPeWEPGMuwXJXqmdvb3yTKp9ZKiWHFJWuAiAGViNVI4GUK3MGOUwZVVUOg1a+rr5OUA8g/97AXzPQkYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T19:25:06.815784Z"},"content_sha256":"98af4f291604a2832f16dd7a7828f025e10b00a7a5d172796d2d384ef972c707","schema_version":"1.0","event_id":"sha256:98af4f291604a2832f16dd7a7828f025e10b00a7a5d172796d2d384ef972c707"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ/bundle.json","state_url":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHRUZUBREV5IQK7LHYP647XKYQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T19:25:06Z","links":{"resolver":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ","bundle":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ/bundle.json","state":"https://pith.science/pith/AHRUZUBREV5IQK7LHYP647XKYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHRUZUBREV5IQK7LHYP647XKYQ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a30Q/CvhksNcnB/SxJkW6FISeCl3kn5UgovhpaOvvixRBk50Wc4KsUHXdqvsopbrZDrmNfWXj0bpGdKeR4C8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T19:25:06.820634Z","bundle_sha256":"cfedc370b32ba7a31debb9d855349f3ccaa891568854d8c7107ecb8ad4cfecef"}}