{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:Q77O7QPP7OX6LWABSDS4QNDQPW","short_pith_number":"pith:Q77O7QPP","canonical_record":{"source":{"id":"2211.03653","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-07T16:07:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d36ba3eed94117e2094b76dabedd2e16740710e141d2b22d723204d3b9ddfb5e","abstract_canon_sha256":"09745248769a88717383d4a8de0920ef37b7714caf035b5695b43965ebc608f9"},"schema_version":"1.0"},"canonical_sha256":"87feefc1effbafe5d80190e5c834707d826317dee4c7784a2b94fedce3833e72","source":{"kind":"arxiv","id":"2211.03653","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.03653","created_at":"2026-07-05T05:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"2211.03653v2","created_at":"2026-07-05T05:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.03653","created_at":"2026-07-05T05:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"Q77O7QPP7OX6","created_at":"2026-07-05T05:15:25Z"},{"alias_kind":"pith_short_16","alias_value":"Q77O7QPP7OX6LWAB","created_at":"2026-07-05T05:15:25Z"},{"alias_kind":"pith_short_8","alias_value":"Q77O7QPP","created_at":"2026-07-05T05:15:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:Q77O7QPP7OX6LWABSDS4QNDQPW","target":"record","payload":{"canonical_record":{"source":{"id":"2211.03653","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-07T16:07:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d36ba3eed94117e2094b76dabedd2e16740710e141d2b22d723204d3b9ddfb5e","abstract_canon_sha256":"09745248769a88717383d4a8de0920ef37b7714caf035b5695b43965ebc608f9"},"schema_version":"1.0"},"canonical_sha256":"87feefc1effbafe5d80190e5c834707d826317dee4c7784a2b94fedce3833e72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:15:25.027993Z","signature_b64":"5HWnPJOw48CpY3b4Y3j6Ga0m3xJCH68+KEowTXCF5/tg8E2VWZnDZ6Mx4VN8FP+hCNgs6/PamZlSB0Q8EHT3AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87feefc1effbafe5d80190e5c834707d826317dee4c7784a2b94fedce3833e72","last_reissued_at":"2026-07-05T05:15:25.027585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:15:25.027585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.03653","source_version":2,"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:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADKyh4JASgbMM7A9NbxaDj10f7eeLHIpTGKXF6pc3lE+BtWhEZ3ZUqbKRJT1JHRR5zYYN5Ibvab6fwEfmO8lCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:23:02.709121Z"},"content_sha256":"861d6cf2cdbf1e0a6edc96ce71b4812a6ec7b7957c339c063bdafaf13929d4cd","schema_version":"1.0","event_id":"sha256:861d6cf2cdbf1e0a6edc96ce71b4812a6ec7b7957c339c063bdafaf13929d4cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:Q77O7QPP7OX6LWABSDS4QNDQPW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation algorithms for Node-weighted Steiner Problems: Digraphs with Additive Prizes and Graphs with Submodular Prizes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Esmaeil Delfaraz, Gianlorenzo D'Angelo","submitted_at":"2022-11-07T16:07:03Z","abstract_excerpt":"In the \\emph{budgeted rooted node-weighted Steiner tree} problem, we are given a graph $G$ with $n$ nodes, a predefined node $r$, two weights associated to each node modelling costs and prizes. The aim is to find a tree in $G$ rooted at $r$ such that the total cost of its nodes is at most a given budget $B$ and the total prize is maximized. In the \\emph{quota rooted node-weighted Steiner tree} problem, we are given a real-valued quota $Q$, instead of the budget, and we aim at minimizing the cost of a tree rooted at $r$ whose overall prize is at least $Q$.\n  For the case of directed graphs with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.03653","kind":"arxiv","version":2},"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/2211.03653/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:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gf6EqjuI2dlwNyuty//bL+Fj+vvw0Zj+fpCsAW4F8SLq1barHjS0yOz+CVD/CP0ZV0ywcuLHY8bAjBIz9OYaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:23:02.709935Z"},"content_sha256":"9cdc53d3e114b9563f86cace5cdfd6d6aea8066579e64258f91eedb97ed9dff4","schema_version":"1.0","event_id":"sha256:9cdc53d3e114b9563f86cace5cdfd6d6aea8066579e64258f91eedb97ed9dff4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q77O7QPP7OX6LWABSDS4QNDQPW/bundle.json","state_url":"https://pith.science/pith/Q77O7QPP7OX6LWABSDS4QNDQPW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q77O7QPP7OX6LWABSDS4QNDQPW/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-11T02:23:02Z","links":{"resolver":"https://pith.science/pith/Q77O7QPP7OX6LWABSDS4QNDQPW","bundle":"https://pith.science/pith/Q77O7QPP7OX6LWABSDS4QNDQPW/bundle.json","state":"https://pith.science/pith/Q77O7QPP7OX6LWABSDS4QNDQPW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q77O7QPP7OX6LWABSDS4QNDQPW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:Q77O7QPP7OX6LWABSDS4QNDQPW","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":"09745248769a88717383d4a8de0920ef37b7714caf035b5695b43965ebc608f9","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-07T16:07:03Z","title_canon_sha256":"d36ba3eed94117e2094b76dabedd2e16740710e141d2b22d723204d3b9ddfb5e"},"schema_version":"1.0","source":{"id":"2211.03653","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.03653","created_at":"2026-07-05T05:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"2211.03653v2","created_at":"2026-07-05T05:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.03653","created_at":"2026-07-05T05:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"Q77O7QPP7OX6","created_at":"2026-07-05T05:15:25Z"},{"alias_kind":"pith_short_16","alias_value":"Q77O7QPP7OX6LWAB","created_at":"2026-07-05T05:15:25Z"},{"alias_kind":"pith_short_8","alias_value":"Q77O7QPP","created_at":"2026-07-05T05:15:25Z"}],"graph_snapshots":[{"event_id":"sha256:9cdc53d3e114b9563f86cace5cdfd6d6aea8066579e64258f91eedb97ed9dff4","target":"graph","created_at":"2026-07-05T05:15: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/2211.03653/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the \\emph{budgeted rooted node-weighted Steiner tree} problem, we are given a graph $G$ with $n$ nodes, a predefined node $r$, two weights associated to each node modelling costs and prizes. The aim is to find a tree in $G$ rooted at $r$ such that the total cost of its nodes is at most a given budget $B$ and the total prize is maximized. In the \\emph{quota rooted node-weighted Steiner tree} problem, we are given a real-valued quota $Q$, instead of the budget, and we aim at minimizing the cost of a tree rooted at $r$ whose overall prize is at least $Q$.\n  For the case of directed graphs with","authors_text":"Esmaeil Delfaraz, Gianlorenzo D'Angelo","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-07T16:07:03Z","title":"Approximation algorithms for Node-weighted Steiner Problems: Digraphs with Additive Prizes and Graphs with Submodular Prizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.03653","kind":"arxiv","version":2},"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:861d6cf2cdbf1e0a6edc96ce71b4812a6ec7b7957c339c063bdafaf13929d4cd","target":"record","created_at":"2026-07-05T05:15: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":"09745248769a88717383d4a8de0920ef37b7714caf035b5695b43965ebc608f9","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-07T16:07:03Z","title_canon_sha256":"d36ba3eed94117e2094b76dabedd2e16740710e141d2b22d723204d3b9ddfb5e"},"schema_version":"1.0","source":{"id":"2211.03653","kind":"arxiv","version":2}},"canonical_sha256":"87feefc1effbafe5d80190e5c834707d826317dee4c7784a2b94fedce3833e72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87feefc1effbafe5d80190e5c834707d826317dee4c7784a2b94fedce3833e72","first_computed_at":"2026-07-05T05:15:25.027585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:15:25.027585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5HWnPJOw48CpY3b4Y3j6Ga0m3xJCH68+KEowTXCF5/tg8E2VWZnDZ6Mx4VN8FP+hCNgs6/PamZlSB0Q8EHT3AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:15:25.027993Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.03653","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:861d6cf2cdbf1e0a6edc96ce71b4812a6ec7b7957c339c063bdafaf13929d4cd","sha256:9cdc53d3e114b9563f86cace5cdfd6d6aea8066579e64258f91eedb97ed9dff4"],"state_sha256":"bfff05bf9cca43a435a478d07b43e48eddabc9d406acc4261b3f955bffdf820b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wt1ZS36jkL4Jha+xgXkcTSiS0qLGuAqCFFT8fuFqNJ9yEVffwxZ433g5JoDZk5RFiEU2s/mSRqrMzqZJbdxiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:23:02.717409Z","bundle_sha256":"842bce8a85edacd104eb95ddb6a3edc587adce9f7abb77a3644f48c788f2973d"}}