{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IBZZTGXBKFHDS5LFVEKA6NWGA4","short_pith_number":"pith:IBZZTGXB","schema_version":"1.0","canonical_sha256":"4073999ae1514e397565a9140f36c607250c046e8f418f39d9fcb6fe0f833454","source":{"kind":"arxiv","id":"2407.14536","version":1},"attestation_state":"computed","paper":{"title":"Model-Agnostic Approximation of Constrained Forest Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"cs.DC","authors_text":"Alipasha Montaseri, Christoph Lenzen, Corinna Coupette","submitted_at":"2024-07-14T08:13:05Z","abstract_excerpt":"Constrained Forest Problems (CFPs) as introduced by Goemans and Williamson in 1995 capture a wide range of network design problems with edge subsets as solutions, such as Minimum Spanning Tree, Steiner Forest, and Point-to-Point Connection. While individual CFPs have been studied extensively in individual computational models, a unified approach to solving general CFPs in multiple computational models has been lacking. Against this background, we present the shell-decomposition algorithm, a model-agnostic meta-algorithm that efficiently computes a $(2+\\epsilon)$-approximation to CFPs for a bro"},"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":"2407.14536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-14T08:13:05Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"abdfa63549833abda3706123f2636aadced824ebd30185c3448e384907ea2109","abstract_canon_sha256":"93c45526352809e040dc95d595e2243fbb204ce1e6a7141201b264f6f7e7469f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:29.007380Z","signature_b64":"auEnDj3OeDmDW6iavsbpro/67wp2dEvDxFh3AnNHnbS9Oecl1bQip08SEbJ0HKFynTplZteGq3Nvtw8qq1hRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4073999ae1514e397565a9140f36c607250c046e8f418f39d9fcb6fe0f833454","last_reissued_at":"2026-07-05T08:46:29.007030Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:29.007030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-Agnostic Approximation of Constrained Forest Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"cs.DC","authors_text":"Alipasha Montaseri, Christoph Lenzen, Corinna Coupette","submitted_at":"2024-07-14T08:13:05Z","abstract_excerpt":"Constrained Forest Problems (CFPs) as introduced by Goemans and Williamson in 1995 capture a wide range of network design problems with edge subsets as solutions, such as Minimum Spanning Tree, Steiner Forest, and Point-to-Point Connection. While individual CFPs have been studied extensively in individual computational models, a unified approach to solving general CFPs in multiple computational models has been lacking. Against this background, we present the shell-decomposition algorithm, a model-agnostic meta-algorithm that efficiently computes a $(2+\\epsilon)$-approximation to CFPs for a bro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14536","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/2407.14536/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":"2407.14536","created_at":"2026-07-05T08:46:29.007085+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.14536v1","created_at":"2026-07-05T08:46:29.007085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14536","created_at":"2026-07-05T08:46:29.007085+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBZZTGXBKFHD","created_at":"2026-07-05T08:46:29.007085+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBZZTGXBKFHDS5LF","created_at":"2026-07-05T08:46:29.007085+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBZZTGXB","created_at":"2026-07-05T08:46:29.007085+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/IBZZTGXBKFHDS5LFVEKA6NWGA4","json":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4.json","graph_json":"https://pith.science/api/pith-number/IBZZTGXBKFHDS5LFVEKA6NWGA4/graph.json","events_json":"https://pith.science/api/pith-number/IBZZTGXBKFHDS5LFVEKA6NWGA4/events.json","paper":"https://pith.science/paper/IBZZTGXB"},"agent_actions":{"view_html":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4","download_json":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4.json","view_paper":"https://pith.science/paper/IBZZTGXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.14536&json=true","fetch_graph":"https://pith.science/api/pith-number/IBZZTGXBKFHDS5LFVEKA6NWGA4/graph.json","fetch_events":"https://pith.science/api/pith-number/IBZZTGXBKFHDS5LFVEKA6NWGA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/action/storage_attestation","attest_author":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/action/author_attestation","sign_citation":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/action/citation_signature","submit_replication":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/action/replication_record"}},"created_at":"2026-07-05T08:46:29.007085+00:00","updated_at":"2026-07-05T08:46:29.007085+00:00"}