{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:S4ML3NARW7BBRDQYBEDQINMMUT","short_pith_number":"pith:S4ML3NAR","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"},"canonical_sha256":"9718bdb411b7c2188e18090704358ca4c91e2345003f59a2e6c0d54159935f4a","source":{"kind":"arxiv","id":"2504.11398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.11398","created_at":"2026-07-05T10:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"2504.11398v1","created_at":"2026-07-05T10:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11398","created_at":"2026-07-05T10:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"S4ML3NARW7BB","created_at":"2026-07-05T10:49:33Z"},{"alias_kind":"pith_short_16","alias_value":"S4ML3NARW7BBRDQY","created_at":"2026-07-05T10:49:33Z"},{"alias_kind":"pith_short_8","alias_value":"S4ML3NAR","created_at":"2026-07-05T10:49:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:S4ML3NARW7BBRDQYBEDQINMMUT","target":"record","payload":{"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"},"canonical_sha256":"9718bdb411b7c2188e18090704358ca4c91e2345003f59a2e6c0d54159935f4a","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"},"source_kind":"arxiv","source_id":"2504.11398","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-07-05T10:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Repi4y2YmL8m+Q+XTc4LCav0OYSOuHtCMFO+1e14zxbooE7s5lCshYhb9opeSSZT6I984t5eHcVyj9bT59ooAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T15:14:33.451507Z"},"content_sha256":"218e3adb4814c125bfb204adb20d9eee536c916115ab4dd4762f210a113a5b89","schema_version":"1.0","event_id":"sha256:218e3adb4814c125bfb204adb20d9eee536c916115ab4dd4762f210a113a5b89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:S4ML3NARW7BBRDQYBEDQINMMUT","target":"graph","payload":{"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"},"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-07-05T10:49:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oU6NmZOFVtNqwzDvynGBgOQM7gT/dTqH1KaI1X2CY6QwmkXxZLGRnrdhKCw/wuIqF4HU0/cpSnQokdKJuNcmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T15:14:33.451952Z"},"content_sha256":"e71549db4ffbaaaf088d9282d9a00f0d0bd93550d3d88f278e51ec8c8f3ca705","schema_version":"1.0","event_id":"sha256:e71549db4ffbaaaf088d9282d9a00f0d0bd93550d3d88f278e51ec8c8f3ca705"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT/bundle.json","state_url":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4ML3NARW7BBRDQYBEDQINMMUT/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-07-31T15:14:33Z","links":{"resolver":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT","bundle":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT/bundle.json","state":"https://pith.science/pith/S4ML3NARW7BBRDQYBEDQINMMUT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4ML3NARW7BBRDQYBEDQINMMUT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:S4ML3NARW7BBRDQYBEDQINMMUT","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":"a1cdf6525f549977eadc513f4bddd104ca2d40e7d783eb27c89424ff3b1a2ba7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-15T17:13:48Z","title_canon_sha256":"ba5a65aa537c00d43740c58bdc7e21b1bba4869ef74c5fc0a8c6ae776d9c43dd"},"schema_version":"1.0","source":{"id":"2504.11398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.11398","created_at":"2026-07-05T10:49:33Z"},{"alias_kind":"arxiv_version","alias_value":"2504.11398v1","created_at":"2026-07-05T10:49:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11398","created_at":"2026-07-05T10:49:33Z"},{"alias_kind":"pith_short_12","alias_value":"S4ML3NARW7BB","created_at":"2026-07-05T10:49:33Z"},{"alias_kind":"pith_short_16","alias_value":"S4ML3NARW7BBRDQY","created_at":"2026-07-05T10:49:33Z"},{"alias_kind":"pith_short_8","alias_value":"S4ML3NAR","created_at":"2026-07-05T10:49:33Z"}],"graph_snapshots":[{"event_id":"sha256:e71549db4ffbaaaf088d9282d9a00f0d0bd93550d3d88f278e51ec8c8f3ca705","target":"graph","created_at":"2026-07-05T10:49: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.11398/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ali Ahmadi, Iman Gholami, Mohammad Mahdavi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-15T17:13:48Z","title":"Breaking a Long-Standing Barrier: 2-$\\varepsilon$ Approximation for Steiner Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11398","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:218e3adb4814c125bfb204adb20d9eee536c916115ab4dd4762f210a113a5b89","target":"record","created_at":"2026-07-05T10:49: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":"a1cdf6525f549977eadc513f4bddd104ca2d40e7d783eb27c89424ff3b1a2ba7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-15T17:13:48Z","title_canon_sha256":"ba5a65aa537c00d43740c58bdc7e21b1bba4869ef74c5fc0a8c6ae776d9c43dd"},"schema_version":"1.0","source":{"id":"2504.11398","kind":"arxiv","version":1}},"canonical_sha256":"9718bdb411b7c2188e18090704358ca4c91e2345003f59a2e6c0d54159935f4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9718bdb411b7c2188e18090704358ca4c91e2345003f59a2e6c0d54159935f4a","first_computed_at":"2026-07-05T10:49:33.241238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:49:33.241238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jHDxRw2OJBdS3uCOH8mWeWjM7DyEqfbjNgy+RnxkH0EAEsVtMYEH37u44A4pA5/U+PrTfARK9ReRlUkToN6hCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:49:33.241854Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.11398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:218e3adb4814c125bfb204adb20d9eee536c916115ab4dd4762f210a113a5b89","sha256:e71549db4ffbaaaf088d9282d9a00f0d0bd93550d3d88f278e51ec8c8f3ca705"],"state_sha256":"db36b97459d342a52e75bf892b0dde1ac428d2af5673858d625d78e715698ea5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xq5n/U2YoFEzUJXM5LgnOiqCBUr7Bl/PpnX/PF6mii+NEoHIOVhS7aXtxp3kp1G3rG8S1FguNlc0xcLHUQzrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T15:14:33.454864Z","bundle_sha256":"c421a480985212b2887806d09d3207e9628d912cf34edd4ec3d5e04b91f06119"}}