{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HA3BDQVI6GARC3OPPMW3QISJSL","short_pith_number":"pith:HA3BDQVI","schema_version":"1.0","canonical_sha256":"383611c2a8f181116dcf7b2db8224992f84d6459ef9f07d383afb3c481b1f519","source":{"kind":"arxiv","id":"2411.16578","version":1},"attestation_state":"computed","paper":{"title":"Forest Covers and Bounded Forest Covers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Barun Gorain, Daya Ram Gaur, Rishi Ranjan Singh, Shaswati Patra","submitted_at":"2024-11-25T17:07:19Z","abstract_excerpt":"We study approximation algorithms for the forest cover and bounded forest cover problems. A probabilistic $2+\\epsilon$ approximation algorithm for the forest cover problem is given using the method of dual fitting. A deterministic algorithm with a 2-approximation ratio that rounds the optimal solution to a linear program is given next. The 2-approximation for the forest cover is then used to give a 6-approximation for the bounded forest cover problem. The use of the probabilistic method to develop the $2+\\epsilon$ approximation algorithm may be of independent interest."},"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":"2411.16578","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-25T17:07:19Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"8854de5ce7109a829318f802a3aeed093b1b6aed6d3d998df4c7eed3da47ee4e","abstract_canon_sha256":"48144620c3044cdf5b6aab589eda8c3ee73664bb9d122730752d445c84c94898"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:11.391086Z","signature_b64":"XshXOQ18SJifY73BZtobt7wao/S0Wnewu/Q6+Src1/K6CnNUGCCcgC+MEUYo5OFV59MbwAWWL3c3+YsoBleaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"383611c2a8f181116dcf7b2db8224992f84d6459ef9f07d383afb3c481b1f519","last_reissued_at":"2026-07-05T09:40:11.390630Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:11.390630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forest Covers and Bounded Forest Covers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Barun Gorain, Daya Ram Gaur, Rishi Ranjan Singh, Shaswati Patra","submitted_at":"2024-11-25T17:07:19Z","abstract_excerpt":"We study approximation algorithms for the forest cover and bounded forest cover problems. A probabilistic $2+\\epsilon$ approximation algorithm for the forest cover problem is given using the method of dual fitting. A deterministic algorithm with a 2-approximation ratio that rounds the optimal solution to a linear program is given next. The 2-approximation for the forest cover is then used to give a 6-approximation for the bounded forest cover problem. The use of the probabilistic method to develop the $2+\\epsilon$ approximation algorithm may be of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16578","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/2411.16578/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":"2411.16578","created_at":"2026-07-05T09:40:11.390689+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16578v1","created_at":"2026-07-05T09:40:11.390689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16578","created_at":"2026-07-05T09:40:11.390689+00:00"},{"alias_kind":"pith_short_12","alias_value":"HA3BDQVI6GAR","created_at":"2026-07-05T09:40:11.390689+00:00"},{"alias_kind":"pith_short_16","alias_value":"HA3BDQVI6GARC3OP","created_at":"2026-07-05T09:40:11.390689+00:00"},{"alias_kind":"pith_short_8","alias_value":"HA3BDQVI","created_at":"2026-07-05T09:40:11.390689+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/HA3BDQVI6GARC3OPPMW3QISJSL","json":"https://pith.science/pith/HA3BDQVI6GARC3OPPMW3QISJSL.json","graph_json":"https://pith.science/api/pith-number/HA3BDQVI6GARC3OPPMW3QISJSL/graph.json","events_json":"https://pith.science/api/pith-number/HA3BDQVI6GARC3OPPMW3QISJSL/events.json","paper":"https://pith.science/paper/HA3BDQVI"},"agent_actions":{"view_html":"https://pith.science/pith/HA3BDQVI6GARC3OPPMW3QISJSL","download_json":"https://pith.science/pith/HA3BDQVI6GARC3OPPMW3QISJSL.json","view_paper":"https://pith.science/paper/HA3BDQVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16578&json=true","fetch_graph":"https://pith.science/api/pith-number/HA3BDQVI6GARC3OPPMW3QISJSL/graph.json","fetch_events":"https://pith.science/api/pith-number/HA3BDQVI6GARC3OPPMW3QISJSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HA3BDQVI6GARC3OPPMW3QISJSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HA3BDQVI6GARC3OPPMW3QISJSL/action/storage_attestation","attest_author":"https://pith.science/pith/HA3BDQVI6GARC3OPPMW3QISJSL/action/author_attestation","sign_citation":"https://pith.science/pith/HA3BDQVI6GARC3OPPMW3QISJSL/action/citation_signature","submit_replication":"https://pith.science/pith/HA3BDQVI6GARC3OPPMW3QISJSL/action/replication_record"}},"created_at":"2026-07-05T09:40:11.390689+00:00","updated_at":"2026-07-05T09:40:11.390689+00:00"}