{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DOEWID6ZLVYWXEG22GKZLFJLDM","short_pith_number":"pith:DOEWID6Z","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"},"canonical_sha256":"1b89640fd95d716b90dad19595952b1b3953f7749f3aeb7bc2fe828379a1e1ff","source":{"kind":"arxiv","id":"2406.14278","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.14278","created_at":"2026-07-05T08:34:41Z"},{"alias_kind":"arxiv_version","alias_value":"2406.14278v1","created_at":"2026-07-05T08:34:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14278","created_at":"2026-07-05T08:34:41Z"},{"alias_kind":"pith_short_12","alias_value":"DOEWID6ZLVYW","created_at":"2026-07-05T08:34:41Z"},{"alias_kind":"pith_short_16","alias_value":"DOEWID6ZLVYWXEG2","created_at":"2026-07-05T08:34:41Z"},{"alias_kind":"pith_short_8","alias_value":"DOEWID6Z","created_at":"2026-07-05T08:34:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DOEWID6ZLVYWXEG22GKZLFJLDM","target":"record","payload":{"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"},"canonical_sha256":"1b89640fd95d716b90dad19595952b1b3953f7749f3aeb7bc2fe828379a1e1ff","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"},"source_kind":"arxiv","source_id":"2406.14278","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:34:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3dXCB5AtXkmi6KO63u7kU417lZ0N6ezhCmb/muj9LTJly7CWb/lWG1BNeCLKTXo/E34RgeF/B7nafolZJQkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:37:04.015661Z"},"content_sha256":"56fa72a9d5029b7c41272dc23fe4a780a37732001e972e90152effada447c6be","schema_version":"1.0","event_id":"sha256:56fa72a9d5029b7c41272dc23fe4a780a37732001e972e90152effada447c6be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DOEWID6ZLVYWXEG22GKZLFJLDM","target":"graph","payload":{"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"},"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:34:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZKEr00sKKml+qwrc8SYg/lsgpanCaYA7Vb4k0dhLQWR8cNbduItYVwW6PRW2B5/4CCG///umy6xLO1tJDwGOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T12:37:04.016058Z"},"content_sha256":"cbb66bca4055af57958df5225ca42071c2df81fb8e806008df6c2262e381e8ed","schema_version":"1.0","event_id":"sha256:cbb66bca4055af57958df5225ca42071c2df81fb8e806008df6c2262e381e8ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/bundle.json","state_url":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/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-13T12:37:04Z","links":{"resolver":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM","bundle":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/bundle.json","state":"https://pith.science/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOEWID6ZLVYWXEG22GKZLFJLDM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DOEWID6ZLVYWXEG22GKZLFJLDM","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":"a04cc86b4c66239359d440f8454d0438b10fde8653692e86167ccf1398c680da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-06-20T12:59:53Z","title_canon_sha256":"85ff14cc327e7385f1698b53eb88255a7a37762242af99277089100fba191734"},"schema_version":"1.0","source":{"id":"2406.14278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.14278","created_at":"2026-07-05T08:34:41Z"},{"alias_kind":"arxiv_version","alias_value":"2406.14278v1","created_at":"2026-07-05T08:34:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.14278","created_at":"2026-07-05T08:34:41Z"},{"alias_kind":"pith_short_12","alias_value":"DOEWID6ZLVYW","created_at":"2026-07-05T08:34:41Z"},{"alias_kind":"pith_short_16","alias_value":"DOEWID6ZLVYWXEG2","created_at":"2026-07-05T08:34:41Z"},{"alias_kind":"pith_short_8","alias_value":"DOEWID6Z","created_at":"2026-07-05T08:34:41Z"}],"graph_snapshots":[{"event_id":"sha256:cbb66bca4055af57958df5225ca42071c2df81fb8e806008df6c2262e381e8ed","target":"graph","created_at":"2026-07-05T08:34:41Z","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/2406.14278/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jialin Zhang, Xiaoming Sun, Zhijie Zhang, Zongqi Wan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-06-20T12:59:53Z","title":"Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.14278","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:56fa72a9d5029b7c41272dc23fe4a780a37732001e972e90152effada447c6be","target":"record","created_at":"2026-07-05T08:34:41Z","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":"a04cc86b4c66239359d440f8454d0438b10fde8653692e86167ccf1398c680da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-06-20T12:59:53Z","title_canon_sha256":"85ff14cc327e7385f1698b53eb88255a7a37762242af99277089100fba191734"},"schema_version":"1.0","source":{"id":"2406.14278","kind":"arxiv","version":1}},"canonical_sha256":"1b89640fd95d716b90dad19595952b1b3953f7749f3aeb7bc2fe828379a1e1ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b89640fd95d716b90dad19595952b1b3953f7749f3aeb7bc2fe828379a1e1ff","first_computed_at":"2026-07-05T08:34:41.333599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:34:41.333599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dbc2xCknYDX/2j+5LOswCoHvbqUEqhjqBilo8Ds5d9405JJNw7vUlYhZxbg96GZVh+k/Bp09b3FYlo2iyJleCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:34:41.333999Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.14278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56fa72a9d5029b7c41272dc23fe4a780a37732001e972e90152effada447c6be","sha256:cbb66bca4055af57958df5225ca42071c2df81fb8e806008df6c2262e381e8ed"],"state_sha256":"d4c5384f6bb793815b2c80c19a4c163977e8c7f971f88a6d8e24a803884ea227"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70dvzL/AoIW4wvSO24+pRNAiJ/7J29RWl0GCJ6km1bXhUzhOtXDEaB9jwc+gQkFMHvfUwsnMLVnzmIn3Bg//Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T12:37:04.018815Z","bundle_sha256":"9acb98e9dbf98456fa40374fed5b1909b4c1bc4c6aa3216216a4464f82ee3a36"}}