{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S4ML3NARW7BBRDQYBEDQINMMUT","short_pith_number":"pith:S4ML3NAR","schema_version":"1.0","canonical_sha256":"9718bdb411b7c2188e18090704358ca4c91e2345003f59a2e6c0d54159935f4a","source":{"kind":"arxiv","id":"2504.11398","version":1},"attestation_state":"computed","paper":{"title":"Breaking a Long-Standing Barrier: 2-$\\varepsilon$ Approximation for Steiner Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Ahmadi, Iman Gholami, Mohammad Mahdavi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade","submitted_at":"2025-04-15T17:13:48Z","abstract_excerpt":"The Steiner Forest problem, also known as the Generalized Steiner Tree problem, is a fundamental optimization problem on edge-weighted graphs where, given a set of vertex pairs, the goal is to select a minimum-cost subgraph such that each pair is connected. This problem generalizes the Steiner Tree problem, first introduced in 1811, for which the best known approximation factor is 1.39 [Byrka, Grandoni, Rothvo{\\ss}, and Sanit\\`a, 2010] (Best Paper award, STOC 2010).\n  The celebrated work of [Agrawal, Klein, and Ravi, 1989] (30-Year Test-of-Time award, STOC 2023), along with refinements by [Goe"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2504.11398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-15T17:13:48Z","cross_cats_sorted":[],"title_canon_sha256":"ba5a65aa537c00d43740c58bdc7e21b1bba4869ef74c5fc0a8c6ae776d9c43dd","abstract_canon_sha256":"a1cdf6525f549977eadc513f4bddd104ca2d40e7d783eb27c89424ff3b1a2ba7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:33.241854Z","signature_b64":"jHDxRw2OJBdS3uCOH8mWeWjM7DyEqfbjNgy+RnxkH0EAEsVtMYEH37u44A4pA5/U+PrTfARK9ReRlUkToN6hCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9718bdb411b7c2188e18090704358ca4c91e2345003f59a2e6c0d54159935f4a","last_reissued_at":"2026-07-05T10:49:33.241238Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:33.241238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Breaking a Long-Standing Barrier: 2-$\\varepsilon$ Approximation for Steiner Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Ahmadi, Iman Gholami, Mohammad Mahdavi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade","submitted_at":"2025-04-15T17:13:48Z","abstract_excerpt":"The Steiner Forest problem, also known as the Generalized Steiner Tree problem, is a fundamental optimization problem on edge-weighted graphs where, given a set of vertex pairs, the goal is to select a minimum-cost subgraph such that each pair is connected. This problem generalizes the Steiner Tree problem, first introduced in 1811, for which the best known approximation factor is 1.39 [Byrka, Grandoni, Rothvo{\\ss}, and Sanit\\`a, 2010] (Best Paper award, STOC 2010).\n  The celebrated work of [Agrawal, Klein, and Ravi, 1989] (30-Year Test-of-Time award, STOC 2023), along with refinements by [Goe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11398","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.11398/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.11398","created_at":"2026-07-05T10:49:33.241311+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.11398v1","created_at":"2026-07-05T10:49:33.241311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11398","created_at":"2026-07-05T10:49:33.241311+00:00"},{"alias_kind":"pith_short_12","alias_value":"S4ML3NARW7BB","created_at":"2026-07-05T10:49:33.241311+00:00"},{"alias_kind":"pith_short_16","alias_value":"S4ML3NARW7BBRDQY","created_at":"2026-07-05T10:49:33.241311+00:00"},{"alias_kind":"pith_short_8","alias_value":"S4ML3NAR","created_at":"2026-07-05T10:49:33.241311+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00843","citing_title":"Submodular Maximization over Many Matroids via Ordered Local Search","ref_index":114,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT","json":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT.json","graph_json":"https://pith.science/api/pith-number/S4ML3NARW7BBRDQYBEDQINMMUT/graph.json","events_json":"https://pith.science/api/pith-number/S4ML3NARW7BBRDQYBEDQINMMUT/events.json","paper":"https://pith.science/paper/S4ML3NAR"},"agent_actions":{"view_html":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT","download_json":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT.json","view_paper":"https://pith.science/paper/S4ML3NAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.11398&json=true","fetch_graph":"https://pith.science/api/pith-number/S4ML3NARW7BBRDQYBEDQINMMUT/graph.json","fetch_events":"https://pith.science/api/pith-number/S4ML3NARW7BBRDQYBEDQINMMUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT/action/storage_attestation","attest_author":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT/action/author_attestation","sign_citation":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT/action/citation_signature","submit_replication":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT/action/replication_record"}},"created_at":"2026-07-05T10:49:33.241311+00:00","updated_at":"2026-07-05T10:49:33.241311+00:00"}