{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KEABYDEB2MT3DHKB6PCUZFKJYG","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":"c2036be0a4d3853aa2b4720207394ac232315392bee752aa0917e5c4976ba1db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-21T21:19:31Z","title_canon_sha256":"4294eea39964ae1af4839edaef1c0b55aaa62bdc11c7eae3eda182ab73461a88"},"schema_version":"1.0","source":{"id":"2504.15445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.15445","created_at":"2026-07-05T10:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"2504.15445v1","created_at":"2026-07-05T10:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15445","created_at":"2026-07-05T10:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"KEABYDEB2MT3","created_at":"2026-07-05T10:52:24Z"},{"alias_kind":"pith_short_16","alias_value":"KEABYDEB2MT3DHKB","created_at":"2026-07-05T10:52:24Z"},{"alias_kind":"pith_short_8","alias_value":"KEABYDEB","created_at":"2026-07-05T10:52:24Z"}],"graph_snapshots":[{"event_id":"sha256:553f8650d7aa1e6caf195ff5a65b16c330fa44408c8d06fbea59354267f046b6","target":"graph","created_at":"2026-07-05T10:52:24Z","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.15445/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","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-21T21:19:31Z","title":"Prize-Collecting Forest with Submodular Penalties: Improved Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15445","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:02198ab46fb7ee7a285602344cffa0f22b16c07bc4e114f02944f8b1ef33db09","target":"record","created_at":"2026-07-05T10:52:24Z","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":"c2036be0a4d3853aa2b4720207394ac232315392bee752aa0917e5c4976ba1db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-21T21:19:31Z","title_canon_sha256":"4294eea39964ae1af4839edaef1c0b55aaa62bdc11c7eae3eda182ab73461a88"},"schema_version":"1.0","source":{"id":"2504.15445","kind":"arxiv","version":1}},"canonical_sha256":"51001c0c81d327b19d41f3c54c9549c180bb38fd2c0e8d79d9497ae6ea5018e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51001c0c81d327b19d41f3c54c9549c180bb38fd2c0e8d79d9497ae6ea5018e6","first_computed_at":"2026-07-05T10:52:24.713693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:24.713693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s3Z2jjI0agyR3yeM7d3JWX2d6DbN+6b5jaGEW+hfNvnxxEwVim9D7Hh9TgbveNBdt/NL4TMZEp+shsnFfHDTBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:24.714194Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.15445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02198ab46fb7ee7a285602344cffa0f22b16c07bc4e114f02944f8b1ef33db09","sha256:553f8650d7aa1e6caf195ff5a65b16c330fa44408c8d06fbea59354267f046b6"],"state_sha256":"4ed179325ca0899dc0a4837952e34c9db4c0a54f1db7c4f42d980f266d137acf"}