{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OZDY7INENAAQ3QLGVRUTOZ5HWY","short_pith_number":"pith:OZDY7INE","canonical_record":{"source":{"id":"1405.2011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-08T16:42:29Z","cross_cats_sorted":[],"title_canon_sha256":"91bdc04f485457a802f9264d3b056964f70734d46c080f89993a0247d7ec3a76","abstract_canon_sha256":"f8b52ab5382a8268f5277750a380bcc13a4e741a27ca5d6eb67bafeac70c16d2"},"schema_version":"1.0"},"canonical_sha256":"76478fa1a468010dc166ac693767a7b60eb24b866b79f7585e489bbab93eee0d","source":{"kind":"arxiv","id":"1405.2011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2011","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2011v1","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2011","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"OZDY7INENAAQ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZDY7INENAAQ3QLG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZDY7INE","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OZDY7INENAAQ3QLGVRUTOZ5HWY","target":"record","payload":{"canonical_record":{"source":{"id":"1405.2011","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-08T16:42:29Z","cross_cats_sorted":[],"title_canon_sha256":"91bdc04f485457a802f9264d3b056964f70734d46c080f89993a0247d7ec3a76","abstract_canon_sha256":"f8b52ab5382a8268f5277750a380bcc13a4e741a27ca5d6eb67bafeac70c16d2"},"schema_version":"1.0"},"canonical_sha256":"76478fa1a468010dc166ac693767a7b60eb24b866b79f7585e489bbab93eee0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:14.786527Z","signature_b64":"ABBzYpmlBd6VlNzk87lsCrfQr3fGt1JH6TX2x4F/GkFRfyPDNp2SluYD+TV0fAEmxwEmTLKFX87KAL6Wl+esDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76478fa1a468010dc166ac693767a7b60eb24b866b79f7585e489bbab93eee0d","last_reissued_at":"2026-05-18T02:52:14.785988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:14.785988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.2011","source_version":1,"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-18T02:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V9ylaRRBAnCV2BZawNMVct6ODNAvtRjAjA5d3yFIJX6jN49IE5OCX0Ft1R6b6CAYbPukcjDJ6HD7qTPbWo5AAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:14:03.240078Z"},"content_sha256":"d836d873ec8fb3750c9aa94339aa0e24ec92fe6896a64b8487145a7e25f6cc3e","schema_version":"1.0","event_id":"sha256:d836d873ec8fb3750c9aa94339aa0e24ec92fe6896a64b8487145a7e25f6cc3e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OZDY7INENAAQ3QLGVRUTOZ5HWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Distributed Steiner Forest Construction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Boaz Patt-Shamir, Christoph Lenzen","submitted_at":"2014-05-08T16:42:29Z","abstract_excerpt":"We present new distributed algorithms for constructing a Steiner Forest in the CONGEST model. Our deterministic algorithm finds, for any given constant $\\epsilon>0$, a $(2+\\epsilon)$-approximation in $\\tilde{O}(sk+\\sqrt{\\min(st,n)})$ rounds, where $s$ is the shortest path diameter, $t$ is the number of terminals, $k$ is the number of terminal components in the input, and $n$ is the number of nodes. Our randomized algorithm finds, with high probability, an $O(\\log n)$- approximation in time $\\tilde{O}(k+\\min(s,\\sqrt n)+D)$, where $D$ is the unweighted diameter of the network. We also prove a ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2011","kind":"arxiv","version":1},"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-18T02:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jaoKPsz/apALPC9EErlaTy3JJZtL6heN5aKYMIyqmwEmy9bwlT68rIoqfOa9ZVl2gfNwZ6hFB4gbl4SoQtzJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:14:03.240442Z"},"content_sha256":"a35e331739dbceb0d170f802d01beb324ea6a83d33a13ef0abe94e21890eb08c","schema_version":"1.0","event_id":"sha256:a35e331739dbceb0d170f802d01beb324ea6a83d33a13ef0abe94e21890eb08c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZDY7INENAAQ3QLGVRUTOZ5HWY/bundle.json","state_url":"https://pith.science/pith/OZDY7INENAAQ3QLGVRUTOZ5HWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZDY7INENAAQ3QLGVRUTOZ5HWY/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-05-30T21:14:03Z","links":{"resolver":"https://pith.science/pith/OZDY7INENAAQ3QLGVRUTOZ5HWY","bundle":"https://pith.science/pith/OZDY7INENAAQ3QLGVRUTOZ5HWY/bundle.json","state":"https://pith.science/pith/OZDY7INENAAQ3QLGVRUTOZ5HWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZDY7INENAAQ3QLGVRUTOZ5HWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OZDY7INENAAQ3QLGVRUTOZ5HWY","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":"f8b52ab5382a8268f5277750a380bcc13a4e741a27ca5d6eb67bafeac70c16d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-08T16:42:29Z","title_canon_sha256":"91bdc04f485457a802f9264d3b056964f70734d46c080f89993a0247d7ec3a76"},"schema_version":"1.0","source":{"id":"1405.2011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2011","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2011v1","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2011","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"OZDY7INENAAQ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OZDY7INENAAQ3QLG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OZDY7INE","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:a35e331739dbceb0d170f802d01beb324ea6a83d33a13ef0abe94e21890eb08c","target":"graph","created_at":"2026-05-18T02:52:14Z","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":"We present new distributed algorithms for constructing a Steiner Forest in the CONGEST model. Our deterministic algorithm finds, for any given constant $\\epsilon>0$, a $(2+\\epsilon)$-approximation in $\\tilde{O}(sk+\\sqrt{\\min(st,n)})$ rounds, where $s$ is the shortest path diameter, $t$ is the number of terminals, $k$ is the number of terminal components in the input, and $n$ is the number of nodes. Our randomized algorithm finds, with high probability, an $O(\\log n)$- approximation in time $\\tilde{O}(k+\\min(s,\\sqrt n)+D)$, where $D$ is the unweighted diameter of the network. We also prove a ma","authors_text":"Boaz Patt-Shamir, Christoph Lenzen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-08T16:42:29Z","title":"Improved Distributed Steiner Forest Construction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2011","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:d836d873ec8fb3750c9aa94339aa0e24ec92fe6896a64b8487145a7e25f6cc3e","target":"record","created_at":"2026-05-18T02:52:14Z","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":"f8b52ab5382a8268f5277750a380bcc13a4e741a27ca5d6eb67bafeac70c16d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-05-08T16:42:29Z","title_canon_sha256":"91bdc04f485457a802f9264d3b056964f70734d46c080f89993a0247d7ec3a76"},"schema_version":"1.0","source":{"id":"1405.2011","kind":"arxiv","version":1}},"canonical_sha256":"76478fa1a468010dc166ac693767a7b60eb24b866b79f7585e489bbab93eee0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76478fa1a468010dc166ac693767a7b60eb24b866b79f7585e489bbab93eee0d","first_computed_at":"2026-05-18T02:52:14.785988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:14.785988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ABBzYpmlBd6VlNzk87lsCrfQr3fGt1JH6TX2x4F/GkFRfyPDNp2SluYD+TV0fAEmxwEmTLKFX87KAL6Wl+esDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:14.786527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d836d873ec8fb3750c9aa94339aa0e24ec92fe6896a64b8487145a7e25f6cc3e","sha256:a35e331739dbceb0d170f802d01beb324ea6a83d33a13ef0abe94e21890eb08c"],"state_sha256":"602d07a1387714fb5ce2bbb2675c99355bf41ec2ae2c9ea50d876479f9f5eb95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1cDZfA6NOP9Mbu6L/1Npc5p16zyPaJML0yzZJKcH5zRGwg+6AFG7J4pZ9VMK/VeZpQp6ROZEH/mCo+oJ0oK/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:14:03.242399Z","bundle_sha256":"455a7414cf94e143f7dfcc611a57f73c92af967423c084d34e1093609ec1f22a"}}