{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WF6UVYUEAQEF4IUBJ4UJ7R4HRF","short_pith_number":"pith:WF6UVYUE","canonical_record":{"source":{"id":"1707.02753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T08:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"b2a6a8c9914eba5d93a2aba301ee39136cb63c8ffbb946e16edcaf1a1af88e37","abstract_canon_sha256":"9b8b0cb0d5f1d8b026780bb3f195cd32fb566da35ac278fb1418c81261ab1a41"},"schema_version":"1.0"},"canonical_sha256":"b17d4ae28404085e22814f289fc7878940e90af9fbd8cd8d57090ea514dbc225","source":{"kind":"arxiv","id":"1707.02753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02753","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02753v1","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02753","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"WF6UVYUEAQEF","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WF6UVYUEAQEF4IUB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WF6UVYUE","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WF6UVYUEAQEF4IUBJ4UJ7R4HRF","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T08:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"b2a6a8c9914eba5d93a2aba301ee39136cb63c8ffbb946e16edcaf1a1af88e37","abstract_canon_sha256":"9b8b0cb0d5f1d8b026780bb3f195cd32fb566da35ac278fb1418c81261ab1a41"},"schema_version":"1.0"},"canonical_sha256":"b17d4ae28404085e22814f289fc7878940e90af9fbd8cd8d57090ea514dbc225","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:35.882146Z","signature_b64":"67qxP9bmsuHrzmNvrg3Yzp330xYgaknT75ZlZSHwXZkmnGcur4a40cZz5g3jD0KaBed3Wu1xpcUkhWVoYI6lCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b17d4ae28404085e22814f289fc7878940e90af9fbd8cd8d57090ea514dbc225","last_reissued_at":"2026-05-18T00:40:35.881400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:35.881400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02753","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-18T00:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HN0zYmdG80QdnW12HgDQq2ZZkZB90+nHOoUBkPoFqHO8soaNAr0KwAEzvUZ5LspN0KHKQpHorjsvoR8t928NAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:28:29.546350Z"},"content_sha256":"fd970cd7ef436dc99c94ef5f933bc2efabd4d3f62bfd049edfe344ec553bc5d0","schema_version":"1.0","event_id":"sha256:fd970cd7ef436dc99c94ef5f933bc2efabd4d3f62bfd049edfe344ec553bc5d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WF6UVYUEAQEF4IUBJ4UJ7R4HRF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Local-Search Algorithm for Steiner Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Kumar, Anupam Gupta, Daniel R. Schmidt, Jannik Matuschke, Jos\\'e Verschae, Martin Gro{\\ss}, Melanie Schmidt","submitted_at":"2017-07-10T08:54:22Z","abstract_excerpt":"In the Steiner Forest problem, we are given a graph and a collection of source-sink pairs, and the goal is to find a subgraph of minimum total length such that all pairs are connected. The problem is APX-Hard and can be 2-approximated by, e.g., the elegant primal-dual algorithm of Agrawal, Klein, and Ravi from 1995.\n  We give a local-search-based constant-factor approximation for the problem. Local search brings in new techniques to an area that has for long not seen any improvements and might be a step towards a combinatorial algorithm for the more general survivable network design problem. M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02753","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-18T00:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0J4ciNWMBHszCdSkMdHL/YMCnQwnWORDBaGzLYkM58Q+TSYcdv3eUTwWKhPtgktT42qrurJ9lrSjehEAMzAiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:28:29.546727Z"},"content_sha256":"2a12739ba1419b12e8d16f9dacb7b96b1927ce7863e70faad1bffbdd3fea811b","schema_version":"1.0","event_id":"sha256:2a12739ba1419b12e8d16f9dacb7b96b1927ce7863e70faad1bffbdd3fea811b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WF6UVYUEAQEF4IUBJ4UJ7R4HRF/bundle.json","state_url":"https://pith.science/pith/WF6UVYUEAQEF4IUBJ4UJ7R4HRF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WF6UVYUEAQEF4IUBJ4UJ7R4HRF/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-03T14:28:29Z","links":{"resolver":"https://pith.science/pith/WF6UVYUEAQEF4IUBJ4UJ7R4HRF","bundle":"https://pith.science/pith/WF6UVYUEAQEF4IUBJ4UJ7R4HRF/bundle.json","state":"https://pith.science/pith/WF6UVYUEAQEF4IUBJ4UJ7R4HRF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WF6UVYUEAQEF4IUBJ4UJ7R4HRF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WF6UVYUEAQEF4IUBJ4UJ7R4HRF","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":"9b8b0cb0d5f1d8b026780bb3f195cd32fb566da35ac278fb1418c81261ab1a41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T08:54:22Z","title_canon_sha256":"b2a6a8c9914eba5d93a2aba301ee39136cb63c8ffbb946e16edcaf1a1af88e37"},"schema_version":"1.0","source":{"id":"1707.02753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02753","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02753v1","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02753","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"WF6UVYUEAQEF","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WF6UVYUEAQEF4IUB","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WF6UVYUE","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:2a12739ba1419b12e8d16f9dacb7b96b1927ce7863e70faad1bffbdd3fea811b","target":"graph","created_at":"2026-05-18T00:40:35Z","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":"In the Steiner Forest problem, we are given a graph and a collection of source-sink pairs, and the goal is to find a subgraph of minimum total length such that all pairs are connected. The problem is APX-Hard and can be 2-approximated by, e.g., the elegant primal-dual algorithm of Agrawal, Klein, and Ravi from 1995.\n  We give a local-search-based constant-factor approximation for the problem. Local search brings in new techniques to an area that has for long not seen any improvements and might be a step towards a combinatorial algorithm for the more general survivable network design problem. M","authors_text":"Amit Kumar, Anupam Gupta, Daniel R. Schmidt, Jannik Matuschke, Jos\\'e Verschae, Martin Gro{\\ss}, Melanie Schmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T08:54:22Z","title":"A Local-Search Algorithm for Steiner Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02753","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:fd970cd7ef436dc99c94ef5f933bc2efabd4d3f62bfd049edfe344ec553bc5d0","target":"record","created_at":"2026-05-18T00:40:35Z","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":"9b8b0cb0d5f1d8b026780bb3f195cd32fb566da35ac278fb1418c81261ab1a41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-10T08:54:22Z","title_canon_sha256":"b2a6a8c9914eba5d93a2aba301ee39136cb63c8ffbb946e16edcaf1a1af88e37"},"schema_version":"1.0","source":{"id":"1707.02753","kind":"arxiv","version":1}},"canonical_sha256":"b17d4ae28404085e22814f289fc7878940e90af9fbd8cd8d57090ea514dbc225","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b17d4ae28404085e22814f289fc7878940e90af9fbd8cd8d57090ea514dbc225","first_computed_at":"2026-05-18T00:40:35.881400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:35.881400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"67qxP9bmsuHrzmNvrg3Yzp330xYgaknT75ZlZSHwXZkmnGcur4a40cZz5g3jD0KaBed3Wu1xpcUkhWVoYI6lCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:35.882146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd970cd7ef436dc99c94ef5f933bc2efabd4d3f62bfd049edfe344ec553bc5d0","sha256:2a12739ba1419b12e8d16f9dacb7b96b1927ce7863e70faad1bffbdd3fea811b"],"state_sha256":"f1034cfae09873497489b7927ec1566bb046196b91a9e5f34d1c6da799768857"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwxZrd/IYn56g36qzVgalPvlzao6maYHjhYIdgDtIShifhGm9L4inYl/3J4EgnxBlsuSdm8VD0rlx01n2Z8yBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:28:29.548639Z","bundle_sha256":"96a084e30e9c4f3877570f75641d92807f2d9222362ee1891f8261bfba877809"}}