{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KEABYDEB2MT3DHKB6PCUZFKJYG","short_pith_number":"pith:KEABYDEB","schema_version":"1.0","canonical_sha256":"51001c0c81d327b19d41f3c54c9549c180bb38fd2c0e8d79d9497ae6ea5018e6","source":{"kind":"arxiv","id":"2504.15445","version":1},"attestation_state":"computed","paper":{"title":"Prize-Collecting Forest with Submodular Penalties: Improved Approximation","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-21T21:19:31Z","abstract_excerpt":"Constrained forest problems form a class of graph problems where specific connectivity requirements for certain cuts within the graph must be satisfied by selecting the minimum-cost set of edges. The prize-collecting version of these problems introduces flexibility by allowing penalties to be paid to ignore some connectivity requirements.\n  Goemans and Williamson introduced a general technique and developed a 2-approximation algorithm for constrained forest problems. Further, Sharma, Swamy, and Williamson extended this work by developing a 2.54-approximation algorithm for the prize-collecting "},"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.15445","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-21T21:19:31Z","cross_cats_sorted":[],"title_canon_sha256":"4294eea39964ae1af4839edaef1c0b55aaa62bdc11c7eae3eda182ab73461a88","abstract_canon_sha256":"c2036be0a4d3853aa2b4720207394ac232315392bee752aa0917e5c4976ba1db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:24.714194Z","signature_b64":"s3Z2jjI0agyR3yeM7d3JWX2d6DbN+6b5jaGEW+hfNvnxxEwVim9D7Hh9TgbveNBdt/NL4TMZEp+shsnFfHDTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51001c0c81d327b19d41f3c54c9549c180bb38fd2c0e8d79d9497ae6ea5018e6","last_reissued_at":"2026-07-05T10:52:24.713693Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:24.713693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prize-Collecting Forest with Submodular Penalties: Improved Approximation","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-21T21:19:31Z","abstract_excerpt":"Constrained forest problems form a class of graph problems where specific connectivity requirements for certain cuts within the graph must be satisfied by selecting the minimum-cost set of edges. The prize-collecting version of these problems introduces flexibility by allowing penalties to be paid to ignore some connectivity requirements.\n  Goemans and Williamson introduced a general technique and developed a 2-approximation algorithm for constrained forest problems. Further, Sharma, Swamy, and Williamson extended this work by developing a 2.54-approximation algorithm for the prize-collecting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15445","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.15445/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.15445","created_at":"2026-07-05T10:52:24.713756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15445v1","created_at":"2026-07-05T10:52:24.713756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15445","created_at":"2026-07-05T10:52:24.713756+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEABYDEB2MT3","created_at":"2026-07-05T10:52:24.713756+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEABYDEB2MT3DHKB","created_at":"2026-07-05T10:52:24.713756+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEABYDEB","created_at":"2026-07-05T10:52:24.713756+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KEABYDEB2MT3DHKB6PCUZFKJYG","json":"https://pith.science/pith/KEABYDEB2MT3DHKB6PCUZFKJYG.json","graph_json":"https://pith.science/api/pith-number/KEABYDEB2MT3DHKB6PCUZFKJYG/graph.json","events_json":"https://pith.science/api/pith-number/KEABYDEB2MT3DHKB6PCUZFKJYG/events.json","paper":"https://pith.science/paper/KEABYDEB"},"agent_actions":{"view_html":"https://pith.science/pith/KEABYDEB2MT3DHKB6PCUZFKJYG","download_json":"https://pith.science/pith/KEABYDEB2MT3DHKB6PCUZFKJYG.json","view_paper":"https://pith.science/paper/KEABYDEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15445&json=true","fetch_graph":"https://pith.science/api/pith-number/KEABYDEB2MT3DHKB6PCUZFKJYG/graph.json","fetch_events":"https://pith.science/api/pith-number/KEABYDEB2MT3DHKB6PCUZFKJYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEABYDEB2MT3DHKB6PCUZFKJYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEABYDEB2MT3DHKB6PCUZFKJYG/action/storage_attestation","attest_author":"https://pith.science/pith/KEABYDEB2MT3DHKB6PCUZFKJYG/action/author_attestation","sign_citation":"https://pith.science/pith/KEABYDEB2MT3DHKB6PCUZFKJYG/action/citation_signature","submit_replication":"https://pith.science/pith/KEABYDEB2MT3DHKB6PCUZFKJYG/action/replication_record"}},"created_at":"2026-07-05T10:52:24.713756+00:00","updated_at":"2026-07-05T10:52:24.713756+00:00"}