{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OCCD2OCGANVNXTRL3A3UFFQMZE","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":"8e2e10a52813fcdec925f4b4f9e0306f5d3354d0f65819a464f837bbe5c16e17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-26T08:51:39Z","title_canon_sha256":"94b0312ef10ac20b1dcfacdd2ae4b0de4ccb930437ac65eb15c5abfedfc7d050"},"schema_version":"1.0","source":{"id":"2306.14520","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.14520","created_at":"2026-07-05T06:50:56Z"},{"alias_kind":"arxiv_version","alias_value":"2306.14520v3","created_at":"2026-07-05T06:50:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.14520","created_at":"2026-07-05T06:50:56Z"},{"alias_kind":"pith_short_12","alias_value":"OCCD2OCGANVN","created_at":"2026-07-05T06:50:56Z"},{"alias_kind":"pith_short_16","alias_value":"OCCD2OCGANVNXTRL","created_at":"2026-07-05T06:50:56Z"},{"alias_kind":"pith_short_8","alias_value":"OCCD2OCG","created_at":"2026-07-05T06:50:56Z"}],"graph_snapshots":[{"event_id":"sha256:81d51bc4d23dcb883854a9e06c88bd1d90496939c7daa313437e2d93bc9d9d39","target":"graph","created_at":"2026-07-05T06:50:56Z","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/2306.14520/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the problem of maximizing $k$-submodular functions subject to a knapsack constraint. For monotone objective functions, we present a $\\frac{1}{2}(1-e^{-2})\\approx 0.432$ greedy approximation algorithm. For the non-monotone case, we are the first to consider the knapsack problem and provide a greedy-type combinatorial algorithm with approximation ratio $\\frac{1}{3}(1-e^{-3})\\approx 0.317$.","authors_text":"Hao Xiao, Min Li, Qian Liu, Yang Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-26T08:51:39Z","title":"Approximation algorithms for $k$-submodular maximization subject to a knapsack constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.14520","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:abb749c91e79fc05244571a2c207cf854f640cc409dd48e828f6f12f0a6a5795","target":"record","created_at":"2026-07-05T06:50:56Z","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":"8e2e10a52813fcdec925f4b4f9e0306f5d3354d0f65819a464f837bbe5c16e17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-26T08:51:39Z","title_canon_sha256":"94b0312ef10ac20b1dcfacdd2ae4b0de4ccb930437ac65eb15c5abfedfc7d050"},"schema_version":"1.0","source":{"id":"2306.14520","kind":"arxiv","version":3}},"canonical_sha256":"70843d3846036adbce2bd83742960cc93b1e3112f5faaeb08e2321a6cbaebe46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70843d3846036adbce2bd83742960cc93b1e3112f5faaeb08e2321a6cbaebe46","first_computed_at":"2026-07-05T06:50:56.150073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:50:56.150073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8QjTeAHLi2S7/cjxM7nIc55Zdjbti4fzULeauq/J3zUFqTOvOzUSTpThgD6VnvI4yfL3U0YesfK0OzLrIR0OCw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:50:56.150473Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.14520","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abb749c91e79fc05244571a2c207cf854f640cc409dd48e828f6f12f0a6a5795","sha256:81d51bc4d23dcb883854a9e06c88bd1d90496939c7daa313437e2d93bc9d9d39"],"state_sha256":"42ee10e133241071654a83a24c0cfbdad1c7cb5bc0c3b126f91c165abe8312a4"}