{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IBZZTGXBKFHDS5LFVEKA6NWGA4","short_pith_number":"pith:IBZZTGXB","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"},"canonical_sha256":"4073999ae1514e397565a9140f36c607250c046e8f418f39d9fcb6fe0f833454","source":{"kind":"arxiv","id":"2407.14536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.14536","created_at":"2026-07-05T08:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"2407.14536v1","created_at":"2026-07-05T08:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14536","created_at":"2026-07-05T08:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"IBZZTGXBKFHD","created_at":"2026-07-05T08:46:29Z"},{"alias_kind":"pith_short_16","alias_value":"IBZZTGXBKFHDS5LF","created_at":"2026-07-05T08:46:29Z"},{"alias_kind":"pith_short_8","alias_value":"IBZZTGXB","created_at":"2026-07-05T08:46:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IBZZTGXBKFHDS5LFVEKA6NWGA4","target":"record","payload":{"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"},"canonical_sha256":"4073999ae1514e397565a9140f36c607250c046e8f418f39d9fcb6fe0f833454","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"},"source_kind":"arxiv","source_id":"2407.14536","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-05T08:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I5XjEFYEgXhh3W44HsJZ0LKEuhB0VmWFF3m+4FKbL0gKphgM5PiMF3MHUlYM7QrFBUw3Uwfve6OtxoBecGWSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T00:52:58.524228Z"},"content_sha256":"217206738594b7bfabd4069bef69bf801e2dbbf5431eacb369218ed0327ad6a6","schema_version":"1.0","event_id":"sha256:217206738594b7bfabd4069bef69bf801e2dbbf5431eacb369218ed0327ad6a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IBZZTGXBKFHDS5LFVEKA6NWGA4","target":"graph","payload":{"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"},"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-05T08:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYQNGCWQQl4GU4hJFrf10SyfSqRylIz1hk/G/fMux87+LdHzM2QdJwUHu9UtPOFsaWxfm2TKS89hLfmujFarBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T00:52:58.524899Z"},"content_sha256":"1a3401c362b9b5f9bffd6f9779b6ab0321f9effec03aa4aef70cac4e31ec2d7b","schema_version":"1.0","event_id":"sha256:1a3401c362b9b5f9bffd6f9779b6ab0321f9effec03aa4aef70cac4e31ec2d7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/bundle.json","state_url":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/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-07T00:52:58Z","links":{"resolver":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4","bundle":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/bundle.json","state":"https://pith.science/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBZZTGXBKFHDS5LFVEKA6NWGA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IBZZTGXBKFHDS5LFVEKA6NWGA4","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":"93c45526352809e040dc95d595e2243fbb204ce1e6a7141201b264f6f7e7469f","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-14T08:13:05Z","title_canon_sha256":"abdfa63549833abda3706123f2636aadced824ebd30185c3448e384907ea2109"},"schema_version":"1.0","source":{"id":"2407.14536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.14536","created_at":"2026-07-05T08:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"2407.14536v1","created_at":"2026-07-05T08:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14536","created_at":"2026-07-05T08:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"IBZZTGXBKFHD","created_at":"2026-07-05T08:46:29Z"},{"alias_kind":"pith_short_16","alias_value":"IBZZTGXBKFHDS5LF","created_at":"2026-07-05T08:46:29Z"},{"alias_kind":"pith_short_8","alias_value":"IBZZTGXB","created_at":"2026-07-05T08:46:29Z"}],"graph_snapshots":[{"event_id":"sha256:1a3401c362b9b5f9bffd6f9779b6ab0321f9effec03aa4aef70cac4e31ec2d7b","target":"graph","created_at":"2026-07-05T08:46:29Z","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/2407.14536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alipasha Montaseri, Christoph Lenzen, Corinna Coupette","cross_cats":["cs.CC","cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-14T08:13:05Z","title":"Model-Agnostic Approximation of Constrained Forest Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14536","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:217206738594b7bfabd4069bef69bf801e2dbbf5431eacb369218ed0327ad6a6","target":"record","created_at":"2026-07-05T08:46:29Z","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":"93c45526352809e040dc95d595e2243fbb204ce1e6a7141201b264f6f7e7469f","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-14T08:13:05Z","title_canon_sha256":"abdfa63549833abda3706123f2636aadced824ebd30185c3448e384907ea2109"},"schema_version":"1.0","source":{"id":"2407.14536","kind":"arxiv","version":1}},"canonical_sha256":"4073999ae1514e397565a9140f36c607250c046e8f418f39d9fcb6fe0f833454","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4073999ae1514e397565a9140f36c607250c046e8f418f39d9fcb6fe0f833454","first_computed_at":"2026-07-05T08:46:29.007030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:46:29.007030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"auEnDj3OeDmDW6iavsbpro/67wp2dEvDxFh3AnNHnbS9Oecl1bQip08SEbJ0HKFynTplZteGq3Nvtw8qq1hRCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:46:29.007380Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.14536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:217206738594b7bfabd4069bef69bf801e2dbbf5431eacb369218ed0327ad6a6","sha256:1a3401c362b9b5f9bffd6f9779b6ab0321f9effec03aa4aef70cac4e31ec2d7b"],"state_sha256":"81189d80fa14c7f7012ce60217e8d9cbdc65a3e989e4aa6ade1372c7abd73039"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoLzNwM7JFZYTWleDFKimMcMUcH8QXrAFrDjAaATHyCcHKSgQ7TrnJImYtetPxG2KAKHMbX+VTnL4dhC+0YgCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T00:52:58.527627Z","bundle_sha256":"2b2ef044d03b774e96c37a6a248bf857bfc86606aa0777e310ae3985bc54a115"}}