{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:ZOCSJX6BEVRDJQ3CGONLXWRYI5","short_pith_number":"pith:ZOCSJX6B","canonical_record":{"source":{"id":"2204.12162","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-26T09:02:40Z","cross_cats_sorted":[],"title_canon_sha256":"11662034305d768eaeeb89049e7d9bd4270136ca41c18adb998785aec5f1418e","abstract_canon_sha256":"008776592894dc9c11b3371aa8f098c5f4380c8847c22001042fb907088c54bf"},"schema_version":"1.0"},"canonical_sha256":"cb8524dfc1256234c362339abbda38476e3331800467be8e1050f16301529c49","source":{"kind":"arxiv","id":"2204.12162","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.12162","created_at":"2026-07-05T05:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"2204.12162v3","created_at":"2026-07-05T05:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.12162","created_at":"2026-07-05T05:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZOCSJX6BEVRD","created_at":"2026-07-05T05:02:25Z"},{"alias_kind":"pith_short_16","alias_value":"ZOCSJX6BEVRDJQ3C","created_at":"2026-07-05T05:02:25Z"},{"alias_kind":"pith_short_8","alias_value":"ZOCSJX6B","created_at":"2026-07-05T05:02:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:ZOCSJX6BEVRDJQ3CGONLXWRYI5","target":"record","payload":{"canonical_record":{"source":{"id":"2204.12162","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-26T09:02:40Z","cross_cats_sorted":[],"title_canon_sha256":"11662034305d768eaeeb89049e7d9bd4270136ca41c18adb998785aec5f1418e","abstract_canon_sha256":"008776592894dc9c11b3371aa8f098c5f4380c8847c22001042fb907088c54bf"},"schema_version":"1.0"},"canonical_sha256":"cb8524dfc1256234c362339abbda38476e3331800467be8e1050f16301529c49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:25.416645Z","signature_b64":"eMTRbdm1WcTsNdyM+Ef1AkPHtsrp61bV/yhlz7VSa+Vrov8TVAQ0s5f2XcpQoS3ccuXFmI95MRobgZOBBsrPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb8524dfc1256234c362339abbda38476e3331800467be8e1050f16301529c49","last_reissued_at":"2026-07-05T05:02:25.416180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:25.416180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.12162","source_version":3,"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-05T05:02:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3uaQlUszzlRBpPuI8pUdwhuCXkmwrqdR7P1bbnQYsucs2qB/TzyeWnRe2upfGStpqhOGbFYnG4IGZ00liAcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:42:26.218842Z"},"content_sha256":"2ea8c0554d7f750b1393c63a930f0fad04317e2e64a6e7d568ec7e456b4f4581","schema_version":"1.0","event_id":"sha256:2ea8c0554d7f750b1393c63a930f0fad04317e2e64a6e7d568ec7e456b4f4581"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:ZOCSJX6BEVRDJQ3CGONLXWRYI5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Budgeted Out-tree Maximization with Submodular Prizes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Esmaeil Delfaraz, Gianlorenzo D'Angelo, Hugo Gilbert","submitted_at":"2022-04-26T09:02:40Z","abstract_excerpt":"We consider a variant of the prize collecting Steiner tree problem in which we are given a \\emph{directed graph} $D=(V,A)$, a monotone submodular prize function $p:2^V \\rightarrow \\mathbb{R}^+ \\cup \\{0\\}$, a cost function $c:V \\rightarrow \\mathbb{Z}^{+}$, a root vertex $r \\in V$, and a budget $B$. The aim is to find an out-subtree $T$ of $D$ rooted at $r$ that costs at most $B$ and maximizes the prize function. We call this problem \\emph{Directed Rooted Submodular Tree} (\\textbf{DRSO}).\n  Very recently, Ghuge and Nagarajan [SODA\\ 2020] gave an optimal quasi-polynomial-time $O\\left(\\frac{\\log n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.12162","kind":"arxiv","version":3},"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/2204.12162/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-05T05:02:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/I4wE3zxBdkgmUv8UE7S2kQAVgWrOuzyC8EUenaF18XwniBro6KJq0Czp9WCinLkjpZmU1sKMGahoPHfczgvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T15:42:26.220074Z"},"content_sha256":"b46eff02df7445a53052184cc9805156dcb56580d7a86d70beb534203a49dab9","schema_version":"1.0","event_id":"sha256:b46eff02df7445a53052184cc9805156dcb56580d7a86d70beb534203a49dab9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZOCSJX6BEVRDJQ3CGONLXWRYI5/bundle.json","state_url":"https://pith.science/pith/ZOCSJX6BEVRDJQ3CGONLXWRYI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZOCSJX6BEVRDJQ3CGONLXWRYI5/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-08-05T15:42:26Z","links":{"resolver":"https://pith.science/pith/ZOCSJX6BEVRDJQ3CGONLXWRYI5","bundle":"https://pith.science/pith/ZOCSJX6BEVRDJQ3CGONLXWRYI5/bundle.json","state":"https://pith.science/pith/ZOCSJX6BEVRDJQ3CGONLXWRYI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZOCSJX6BEVRDJQ3CGONLXWRYI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ZOCSJX6BEVRDJQ3CGONLXWRYI5","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":"008776592894dc9c11b3371aa8f098c5f4380c8847c22001042fb907088c54bf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-26T09:02:40Z","title_canon_sha256":"11662034305d768eaeeb89049e7d9bd4270136ca41c18adb998785aec5f1418e"},"schema_version":"1.0","source":{"id":"2204.12162","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.12162","created_at":"2026-07-05T05:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"2204.12162v3","created_at":"2026-07-05T05:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.12162","created_at":"2026-07-05T05:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZOCSJX6BEVRD","created_at":"2026-07-05T05:02:25Z"},{"alias_kind":"pith_short_16","alias_value":"ZOCSJX6BEVRDJQ3C","created_at":"2026-07-05T05:02:25Z"},{"alias_kind":"pith_short_8","alias_value":"ZOCSJX6B","created_at":"2026-07-05T05:02:25Z"}],"graph_snapshots":[{"event_id":"sha256:b46eff02df7445a53052184cc9805156dcb56580d7a86d70beb534203a49dab9","target":"graph","created_at":"2026-07-05T05:02:25Z","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/2204.12162/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a variant of the prize collecting Steiner tree problem in which we are given a \\emph{directed graph} $D=(V,A)$, a monotone submodular prize function $p:2^V \\rightarrow \\mathbb{R}^+ \\cup \\{0\\}$, a cost function $c:V \\rightarrow \\mathbb{Z}^{+}$, a root vertex $r \\in V$, and a budget $B$. The aim is to find an out-subtree $T$ of $D$ rooted at $r$ that costs at most $B$ and maximizes the prize function. We call this problem \\emph{Directed Rooted Submodular Tree} (\\textbf{DRSO}).\n  Very recently, Ghuge and Nagarajan [SODA\\ 2020] gave an optimal quasi-polynomial-time $O\\left(\\frac{\\log n","authors_text":"Esmaeil Delfaraz, Gianlorenzo D'Angelo, Hugo Gilbert","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-26T09:02:40Z","title":"Budgeted Out-tree Maximization with Submodular Prizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.12162","kind":"arxiv","version":3},"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:2ea8c0554d7f750b1393c63a930f0fad04317e2e64a6e7d568ec7e456b4f4581","target":"record","created_at":"2026-07-05T05:02:25Z","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":"008776592894dc9c11b3371aa8f098c5f4380c8847c22001042fb907088c54bf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-04-26T09:02:40Z","title_canon_sha256":"11662034305d768eaeeb89049e7d9bd4270136ca41c18adb998785aec5f1418e"},"schema_version":"1.0","source":{"id":"2204.12162","kind":"arxiv","version":3}},"canonical_sha256":"cb8524dfc1256234c362339abbda38476e3331800467be8e1050f16301529c49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb8524dfc1256234c362339abbda38476e3331800467be8e1050f16301529c49","first_computed_at":"2026-07-05T05:02:25.416180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:02:25.416180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eMTRbdm1WcTsNdyM+Ef1AkPHtsrp61bV/yhlz7VSa+Vrov8TVAQ0s5f2XcpQoS3ccuXFmI95MRobgZOBBsrPAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:02:25.416645Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.12162","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ea8c0554d7f750b1393c63a930f0fad04317e2e64a6e7d568ec7e456b4f4581","sha256:b46eff02df7445a53052184cc9805156dcb56580d7a86d70beb534203a49dab9"],"state_sha256":"ab3a5ab76a55a736ad509f8f0d3a8ab40b8ad6036a08b857c4d6c953bb59fb88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8PSx+WO1k+Ml3P5+1rlGfoRqM7ifzusyX3amDhWTgIon2XBgOSx+tpOx7fh3vPvKyuH3awviFyraTjyTVHaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T15:42:26.227102Z","bundle_sha256":"ac3403f4e13c072cf4cfd373ab074173161d1d73e658b65aa720c5863f9f558d"}}