{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DOEWID6ZLVYWXEG22GKZLFJLDM","short_pith_number":"pith:DOEWID6Z","schema_version":"1.0","canonical_sha256":"1b89640fd95d716b90dad19595952b1b3953f7749f3aeb7bc2fe828379a1e1ff","source":{"kind":"arxiv","id":"2406.14278","version":1},"attestation_state":"computed","paper":{"title":"Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jialin Zhang, Xiaoming Sun, Zhijie Zhang, Zongqi Wan","submitted_at":"2024-06-20T12:59:53Z","abstract_excerpt":"Symmetric submodular maximization is an important class of combinatorial optimization problems, including MAX-CUT on graphs and hyper-graphs. The state-of-the-art algorithm for the problem over general constraints has an approximation ratio of $0.432$. The algorithm applies the canonical continuous greedy technique that involves a sampling process. It, therefore, suffers from high query complexity and is inherently randomized. In this paper, we present several efficient deterministic algorithms for maximizing a symmetric submodular function under various constraints. Specifically, for the card"},"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":"2406.14278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-06-20T12:59:53Z","cross_cats_sorted":[],"title_canon_sha256":"85ff14cc327e7385f1698b53eb88255a7a37762242af99277089100fba191734","abstract_canon_sha256":"a04cc86b4c66239359d440f8454d0438b10fde8653692e86167ccf1398c680da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:41.333999Z","signature_b64":"dbc2xCknYDX/2j+5LOswCoHvbqUEqhjqBilo8Ds5d9405JJNw7vUlYhZxbg96GZVh+k/Bp09b3FYlo2iyJleCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b89640fd95d716b90dad19595952b1b3953f7749f3aeb7bc2fe828379a1e1ff","last_reissued_at":"2026-07-05T08:34:41.333599Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:41.333599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jialin Zhang, Xiaoming Sun, Zhijie Zhang, Zongqi Wan","submitted_at":"2024-06-20T12:59:53Z","abstract_excerpt":"Symmetric submodular maximization is an important class of combinatorial optimization problems, including MAX-CUT on graphs and hyper-graphs. The state-of-the-art algorithm for the problem over general constraints has an approximation ratio of $0.432$. The algorithm applies the canonical continuous greedy technique that involves a sampling process. It, therefore, suffers from high query complexity and is inherently randomized. In this paper, we present several efficient deterministic algorithms for maximizing a symmetric submodular function under various constraints. Specifically, for the card"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14278","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/2406.14278/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":"2406.14278","created_at":"2026-07-05T08:34:41.333654+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.14278v1","created_at":"2026-07-05T08:34:41.333654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14278","created_at":"2026-07-05T08:34:41.333654+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOEWID6ZLVYW","created_at":"2026-07-05T08:34:41.333654+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOEWID6ZLVYWXEG2","created_at":"2026-07-05T08:34:41.333654+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOEWID6Z","created_at":"2026-07-05T08:34:41.333654+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10248","citing_title":"Bicriteria Submodular Maximization","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM","json":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM.json","graph_json":"https://pith.science/api/pith-number/DOEWID6ZLVYWXEG22GKZLFJLDM/graph.json","events_json":"https://pith.science/api/pith-number/DOEWID6ZLVYWXEG22GKZLFJLDM/events.json","paper":"https://pith.science/paper/DOEWID6Z"},"agent_actions":{"view_html":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM","download_json":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM.json","view_paper":"https://pith.science/paper/DOEWID6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.14278&json=true","fetch_graph":"https://pith.science/api/pith-number/DOEWID6ZLVYWXEG22GKZLFJLDM/graph.json","fetch_events":"https://pith.science/api/pith-number/DOEWID6ZLVYWXEG22GKZLFJLDM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/action/storage_attestation","attest_author":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/action/author_attestation","sign_citation":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/action/citation_signature","submit_replication":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/action/replication_record"}},"created_at":"2026-07-05T08:34:41.333654+00:00","updated_at":"2026-07-05T08:34:41.333654+00:00"}