{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CNRRGG3Q3J37JG2TDIJAQHG2GO","short_pith_number":"pith:CNRRGG3Q","canonical_record":{"source":{"id":"1307.3822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-15T05:56:54Z","cross_cats_sorted":[],"title_canon_sha256":"85b9a1bf8f0dfafeffcc4cf52f4def3a9b88d74e7d431c5cd5268e806980e121","abstract_canon_sha256":"09a67006b653e8b234a33afb23ac0fed6e0c203df936228057ad034369a7a8c7"},"schema_version":"1.0"},"canonical_sha256":"1363131b70da77f49b531a12081cda3384d0160044df6bef7b193cc42b894bc0","source":{"kind":"arxiv","id":"1307.3822","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3822","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3822v2","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3822","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"CNRRGG3Q3J37","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CNRRGG3Q3J37JG2T","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CNRRGG3Q","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CNRRGG3Q3J37JG2TDIJAQHG2GO","target":"record","payload":{"canonical_record":{"source":{"id":"1307.3822","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-15T05:56:54Z","cross_cats_sorted":[],"title_canon_sha256":"85b9a1bf8f0dfafeffcc4cf52f4def3a9b88d74e7d431c5cd5268e806980e121","abstract_canon_sha256":"09a67006b653e8b234a33afb23ac0fed6e0c203df936228057ad034369a7a8c7"},"schema_version":"1.0"},"canonical_sha256":"1363131b70da77f49b531a12081cda3384d0160044df6bef7b193cc42b894bc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:18.049254Z","signature_b64":"myvGTolVUz4/aqAueWpkX8KdnR4RZcNoPHWgcJizwerVXoz1vqx67okOrJRAmbhURu/QFIa3l9waSsl85vyqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1363131b70da77f49b531a12081cda3384d0160044df6bef7b193cc42b894bc0","last_reissued_at":"2026-05-18T03:18:18.048570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:18.048570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.3822","source_version":2,"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-05-18T03:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bAyDtQ8X/DvY73KgqGA7FDF51H4MY1Ow4z41OqffmH7QlDn5o/KyeXTl0YHpkrDw4ZsdKK3rLrJXsnn/BQaaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:30:07.561026Z"},"content_sha256":"684574dc0b83c602061aefc07362701548292775f4391234f61f259d31fdd8e5","schema_version":"1.0","event_id":"sha256:684574dc0b83c602061aefc07362701548292775f4391234f61f259d31fdd8e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CNRRGG3Q3J37JG2TDIJAQHG2GO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple approximation algorithm for the internal Steiner minimum tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bang Ye Wu","submitted_at":"2013-07-15T05:56:54Z","abstract_excerpt":"For a metric graph $G=(V,E)$ and $R\\subset V$, the internal Steiner minimum tree problem asks for a minimum weight Steiner tree spanning $R$ such that every vertex in $R$ is not a leaf. This note shows a simple polynomial-time $2\\rho$-approximation algorithm, in which $\\rho$ is the approximation ratio for the Steiner minimum tree problem. The result improves the previous best approximation ratio $2\\rho+1$ for the problem. The ratio is not currently best but the algorithm is very simple."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3822","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T03:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OGQTSdKoRtFFSQOx3OX4TN1B9HvMm44o55ajvtzJ/jFqL2H2b1AsSO1oQ59mZi9JaXYMuNo8JL9sWYTQnYTlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:30:07.561373Z"},"content_sha256":"e76e5dccfaba02e39fc47505385998e8b706838d61681cbbb0c29508166aacfd","schema_version":"1.0","event_id":"sha256:e76e5dccfaba02e39fc47505385998e8b706838d61681cbbb0c29508166aacfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNRRGG3Q3J37JG2TDIJAQHG2GO/bundle.json","state_url":"https://pith.science/pith/CNRRGG3Q3J37JG2TDIJAQHG2GO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNRRGG3Q3J37JG2TDIJAQHG2GO/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-06-25T20:30:07Z","links":{"resolver":"https://pith.science/pith/CNRRGG3Q3J37JG2TDIJAQHG2GO","bundle":"https://pith.science/pith/CNRRGG3Q3J37JG2TDIJAQHG2GO/bundle.json","state":"https://pith.science/pith/CNRRGG3Q3J37JG2TDIJAQHG2GO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNRRGG3Q3J37JG2TDIJAQHG2GO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CNRRGG3Q3J37JG2TDIJAQHG2GO","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":"09a67006b653e8b234a33afb23ac0fed6e0c203df936228057ad034369a7a8c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-15T05:56:54Z","title_canon_sha256":"85b9a1bf8f0dfafeffcc4cf52f4def3a9b88d74e7d431c5cd5268e806980e121"},"schema_version":"1.0","source":{"id":"1307.3822","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3822","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3822v2","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3822","created_at":"2026-05-18T03:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"CNRRGG3Q3J37","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CNRRGG3Q3J37JG2T","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CNRRGG3Q","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:e76e5dccfaba02e39fc47505385998e8b706838d61681cbbb0c29508166aacfd","target":"graph","created_at":"2026-05-18T03:18:18Z","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":"For a metric graph $G=(V,E)$ and $R\\subset V$, the internal Steiner minimum tree problem asks for a minimum weight Steiner tree spanning $R$ such that every vertex in $R$ is not a leaf. This note shows a simple polynomial-time $2\\rho$-approximation algorithm, in which $\\rho$ is the approximation ratio for the Steiner minimum tree problem. The result improves the previous best approximation ratio $2\\rho+1$ for the problem. The ratio is not currently best but the algorithm is very simple.","authors_text":"Bang Ye Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-15T05:56:54Z","title":"A simple approximation algorithm for the internal Steiner minimum tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3822","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:684574dc0b83c602061aefc07362701548292775f4391234f61f259d31fdd8e5","target":"record","created_at":"2026-05-18T03:18:18Z","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":"09a67006b653e8b234a33afb23ac0fed6e0c203df936228057ad034369a7a8c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-15T05:56:54Z","title_canon_sha256":"85b9a1bf8f0dfafeffcc4cf52f4def3a9b88d74e7d431c5cd5268e806980e121"},"schema_version":"1.0","source":{"id":"1307.3822","kind":"arxiv","version":2}},"canonical_sha256":"1363131b70da77f49b531a12081cda3384d0160044df6bef7b193cc42b894bc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1363131b70da77f49b531a12081cda3384d0160044df6bef7b193cc42b894bc0","first_computed_at":"2026-05-18T03:18:18.048570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:18.048570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"myvGTolVUz4/aqAueWpkX8KdnR4RZcNoPHWgcJizwerVXoz1vqx67okOrJRAmbhURu/QFIa3l9waSsl85vyqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:18.049254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3822","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:684574dc0b83c602061aefc07362701548292775f4391234f61f259d31fdd8e5","sha256:e76e5dccfaba02e39fc47505385998e8b706838d61681cbbb0c29508166aacfd"],"state_sha256":"6ef28fa76c0c4da7d66e3f91c56fb512aa11c74fa6e55e081565d5e8d8f0768d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4NLXUp/MOgzqCNwgF9m3W5MVb7Nrynt2tAOsaLyN2qrDwKBqttvP8YvYuyq9Y+3PMO2f9FKZseyICsXgiibFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:30:07.563277Z","bundle_sha256":"30533950448b7bf55946e74c7126140ae8230f3372da13a3e653830a158a6be0"}}