{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Q3W2R43OHBTGOJK3BTVY6QVRLZ","short_pith_number":"pith:Q3W2R43O","canonical_record":{"source":{"id":"1412.7693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-24T15:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"6c4535ecc6e6420ecaa7c654e4b0721b0bde44e859e3ed34bdd62258bbd43590","abstract_canon_sha256":"c9e73591d9699be6d59f34eee4eaf90fb54bfefd8f2bd4d488b2e88321361bbc"},"schema_version":"1.0"},"canonical_sha256":"86eda8f36e386667255b0ceb8f42b15e4e00ee69764955a061bf4e761c9b179e","source":{"kind":"arxiv","id":"1412.7693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7693","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7693v1","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7693","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"Q3W2R43OHBTG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q3W2R43OHBTGOJK3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q3W2R43O","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Q3W2R43OHBTGOJK3BTVY6QVRLZ","target":"record","payload":{"canonical_record":{"source":{"id":"1412.7693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-24T15:48:24Z","cross_cats_sorted":[],"title_canon_sha256":"6c4535ecc6e6420ecaa7c654e4b0721b0bde44e859e3ed34bdd62258bbd43590","abstract_canon_sha256":"c9e73591d9699be6d59f34eee4eaf90fb54bfefd8f2bd4d488b2e88321361bbc"},"schema_version":"1.0"},"canonical_sha256":"86eda8f36e386667255b0ceb8f42b15e4e00ee69764955a061bf4e761c9b179e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:33.233939Z","signature_b64":"y9p2lN+sUttzKDJpSO2u3E7pwlinb/JnbwcMcQifiNNggDEnoGwCggMRpn4vukhyej1lxEESYBT/PhUq0KkiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86eda8f36e386667255b0ceb8f42b15e4e00ee69764955a061bf4e761c9b179e","last_reissued_at":"2026-05-18T02:30:33.233560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:33.233560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.7693","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:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FqfJmAdKW3UNo32qA1NzKLj1uyzr7fS2Kqrmnk3artVm/BYBmULvb/WQTvYNqCUB6m2oJHk5GMl2jT9iDf3rAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:40:18.513401Z"},"content_sha256":"69e4811050b5293cbb5ee44358c1b35c57fce5e5cc22aa051aad913a4f7a25bc","schema_version":"1.0","event_id":"sha256:69e4811050b5293cbb5ee44358c1b35c57fce5e5cc22aa051aad913a4f7a25bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Q3W2R43OHBTGOJK3BTVY6QVRLZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Algorithms 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","submitted_at":"2014-12-24T15:48:24Z","abstract_excerpt":"In the Steiner Forest problem, we are given terminal pairs $\\{s_i, t_i\\}$, and need to find the cheapest subgraph which connects each of the terminal pairs together. In 1991, Agrawal, Klein, and Ravi, and Goemans and Williamson gave primal-dual constant-factor approximation algorithms for this problem; until now, the only constant-factor approximations we know are via linear programming relaxations.\n  We consider the following greedy algorithm: Given terminal pairs in a metric space, call a terminal \"active\" if its distance to its partner is non-zero. Pick the two closest active terminals (say"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7693","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:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cN8sjyzmJ8u3i1+MnKaohbZLlrr5t1U1oEzH2FDm9ZGArS47g8BECdVHXBD3Lt/WHiVRg3MKAepHvhmxUKECBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:40:18.513753Z"},"content_sha256":"a59470db4ede94e1debfc739e503bb69793c8bb817aadef57be46656398d6a0b","schema_version":"1.0","event_id":"sha256:a59470db4ede94e1debfc739e503bb69793c8bb817aadef57be46656398d6a0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3W2R43OHBTGOJK3BTVY6QVRLZ/bundle.json","state_url":"https://pith.science/pith/Q3W2R43OHBTGOJK3BTVY6QVRLZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3W2R43OHBTGOJK3BTVY6QVRLZ/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-03T15:40:18Z","links":{"resolver":"https://pith.science/pith/Q3W2R43OHBTGOJK3BTVY6QVRLZ","bundle":"https://pith.science/pith/Q3W2R43OHBTGOJK3BTVY6QVRLZ/bundle.json","state":"https://pith.science/pith/Q3W2R43OHBTGOJK3BTVY6QVRLZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3W2R43OHBTGOJK3BTVY6QVRLZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q3W2R43OHBTGOJK3BTVY6QVRLZ","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":"c9e73591d9699be6d59f34eee4eaf90fb54bfefd8f2bd4d488b2e88321361bbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-24T15:48:24Z","title_canon_sha256":"6c4535ecc6e6420ecaa7c654e4b0721b0bde44e859e3ed34bdd62258bbd43590"},"schema_version":"1.0","source":{"id":"1412.7693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7693","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7693v1","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7693","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"Q3W2R43OHBTG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q3W2R43OHBTGOJK3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q3W2R43O","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:a59470db4ede94e1debfc739e503bb69793c8bb817aadef57be46656398d6a0b","target":"graph","created_at":"2026-05-18T02:30:33Z","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 terminal pairs $\\{s_i, t_i\\}$, and need to find the cheapest subgraph which connects each of the terminal pairs together. In 1991, Agrawal, Klein, and Ravi, and Goemans and Williamson gave primal-dual constant-factor approximation algorithms for this problem; until now, the only constant-factor approximations we know are via linear programming relaxations.\n  We consider the following greedy algorithm: Given terminal pairs in a metric space, call a terminal \"active\" if its distance to its partner is non-zero. Pick the two closest active terminals (say","authors_text":"Amit Kumar, Anupam Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-24T15:48:24Z","title":"Greedy Algorithms for Steiner Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7693","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:69e4811050b5293cbb5ee44358c1b35c57fce5e5cc22aa051aad913a4f7a25bc","target":"record","created_at":"2026-05-18T02:30:33Z","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":"c9e73591d9699be6d59f34eee4eaf90fb54bfefd8f2bd4d488b2e88321361bbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-24T15:48:24Z","title_canon_sha256":"6c4535ecc6e6420ecaa7c654e4b0721b0bde44e859e3ed34bdd62258bbd43590"},"schema_version":"1.0","source":{"id":"1412.7693","kind":"arxiv","version":1}},"canonical_sha256":"86eda8f36e386667255b0ceb8f42b15e4e00ee69764955a061bf4e761c9b179e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86eda8f36e386667255b0ceb8f42b15e4e00ee69764955a061bf4e761c9b179e","first_computed_at":"2026-05-18T02:30:33.233560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:33.233560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y9p2lN+sUttzKDJpSO2u3E7pwlinb/JnbwcMcQifiNNggDEnoGwCggMRpn4vukhyej1lxEESYBT/PhUq0KkiDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:33.233939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69e4811050b5293cbb5ee44358c1b35c57fce5e5cc22aa051aad913a4f7a25bc","sha256:a59470db4ede94e1debfc739e503bb69793c8bb817aadef57be46656398d6a0b"],"state_sha256":"8922fc73d4cb408011bb8aeb3eeec15700a419b923db9f60e8e4966c6718a01d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PiLDbNyoyLlUGl6SmkueP4rlC9KmY2DRUN0hDgT+hDOT4D3CNThk5lKMkVD+pBpWw6wwyaWJkIvLF/6djwV+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:40:18.515756Z","bundle_sha256":"85b4f4439ac68d72828af212e6924ce772b7b513b757d85edba7e1df1c071e57"}}