{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FTFDJQJBQQDX522RBUQQLGVVTH","short_pith_number":"pith:FTFDJQJB","canonical_record":{"source":{"id":"2412.05146","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-06T16:02:02Z","cross_cats_sorted":[],"title_canon_sha256":"48573cc0544367632cff8870c515b43f28134f95bfc564fa107e7e0181e3f3a7","abstract_canon_sha256":"a3d29ca15cb1b31c6413efbafb825a12cc2ec256c9118d17353c8c994f9295f9"},"schema_version":"1.0"},"canonical_sha256":"2cca34c12184077eeb510d21059ab599ce7eca2ae5d9750e278264c41fe561c0","source":{"kind":"arxiv","id":"2412.05146","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.05146","created_at":"2026-07-05T11:19:50Z"},{"alias_kind":"arxiv_version","alias_value":"2412.05146v2","created_at":"2026-07-05T11:19:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.05146","created_at":"2026-07-05T11:19:50Z"},{"alias_kind":"pith_short_12","alias_value":"FTFDJQJBQQDX","created_at":"2026-07-05T11:19:50Z"},{"alias_kind":"pith_short_16","alias_value":"FTFDJQJBQQDX522R","created_at":"2026-07-05T11:19:50Z"},{"alias_kind":"pith_short_8","alias_value":"FTFDJQJB","created_at":"2026-07-05T11:19:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FTFDJQJBQQDX522RBUQQLGVVTH","target":"record","payload":{"canonical_record":{"source":{"id":"2412.05146","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-06T16:02:02Z","cross_cats_sorted":[],"title_canon_sha256":"48573cc0544367632cff8870c515b43f28134f95bfc564fa107e7e0181e3f3a7","abstract_canon_sha256":"a3d29ca15cb1b31c6413efbafb825a12cc2ec256c9118d17353c8c994f9295f9"},"schema_version":"1.0"},"canonical_sha256":"2cca34c12184077eeb510d21059ab599ce7eca2ae5d9750e278264c41fe561c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:50.230500Z","signature_b64":"lvHZtw+CN9GP9bCJPcE5Z7yarkxSrokr/Q2xBpZATlse3K7Ch+hMC3hMCbGMyNq+YuXd8ASMo+Xqt46jemI2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cca34c12184077eeb510d21059ab599ce7eca2ae5d9750e278264c41fe561c0","last_reissued_at":"2026-07-05T11:19:50.230028Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:50.230028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.05146","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-05T11:19:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XHYUUWBsTt4YnJy09PKMEgNiNDjgNP1EmWL4u29lNP7FJC3a+rpPq235Cl+hhqPBwHGWoIghdWZfXhGS/lHRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:00:15.266800Z"},"content_sha256":"4ded0e39469bb651afab6d12021c74aa4c972d29e1d2df2932a9ab31ad8a28fb","schema_version":"1.0","event_id":"sha256:4ded0e39469bb651afab6d12021c74aa4c972d29e1d2df2932a9ab31ad8a28fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FTFDJQJBQQDX522RBUQQLGVVTH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Akang Wang, Qingjiang Shi, Yeqing Qiu, Ye Xue, Yiheng Wang, Zhi-Quan Luo","submitted_at":"2024-12-06T16:02:02Z","abstract_excerpt":"The Max-k-Cut problem is a fundamental combinatorial optimization challenge that generalizes the classic NP-complete Max-Cut problem. While relaxation techniques are commonly employed to tackle Max-k-Cut, they often lack guarantees of equivalence between the solutions of the original problem and its relaxation. To address this issue, we introduce the Relax-Optimize-and-Sample (ROS) framework. In particular, we begin by relaxing the discrete constraints to the continuous probability simplex form. Next, we pre-train and fine-tune a graph neural network model to efficiently optimize the relaxed p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.05146","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/2412.05146/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-05T11:19:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mq5inzIkx/CbrV+OSfvcyLv+0LDUKJplz0bUCx869vQDayS2IGPSigxXgxVw2fWOHZOQRIjMJAPzxUz00JVUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:00:15.267189Z"},"content_sha256":"1ea8e60705c2738b0023f4d80c1b371b136ca152a869a2cb510f6f0694e5891b","schema_version":"1.0","event_id":"sha256:1ea8e60705c2738b0023f4d80c1b371b136ca152a869a2cb510f6f0694e5891b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTFDJQJBQQDX522RBUQQLGVVTH/bundle.json","state_url":"https://pith.science/pith/FTFDJQJBQQDX522RBUQQLGVVTH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTFDJQJBQQDX522RBUQQLGVVTH/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-19T13:00:15Z","links":{"resolver":"https://pith.science/pith/FTFDJQJBQQDX522RBUQQLGVVTH","bundle":"https://pith.science/pith/FTFDJQJBQQDX522RBUQQLGVVTH/bundle.json","state":"https://pith.science/pith/FTFDJQJBQQDX522RBUQQLGVVTH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTFDJQJBQQDX522RBUQQLGVVTH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FTFDJQJBQQDX522RBUQQLGVVTH","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":"a3d29ca15cb1b31c6413efbafb825a12cc2ec256c9118d17353c8c994f9295f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-06T16:02:02Z","title_canon_sha256":"48573cc0544367632cff8870c515b43f28134f95bfc564fa107e7e0181e3f3a7"},"schema_version":"1.0","source":{"id":"2412.05146","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.05146","created_at":"2026-07-05T11:19:50Z"},{"alias_kind":"arxiv_version","alias_value":"2412.05146v2","created_at":"2026-07-05T11:19:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.05146","created_at":"2026-07-05T11:19:50Z"},{"alias_kind":"pith_short_12","alias_value":"FTFDJQJBQQDX","created_at":"2026-07-05T11:19:50Z"},{"alias_kind":"pith_short_16","alias_value":"FTFDJQJBQQDX522R","created_at":"2026-07-05T11:19:50Z"},{"alias_kind":"pith_short_8","alias_value":"FTFDJQJB","created_at":"2026-07-05T11:19:50Z"}],"graph_snapshots":[{"event_id":"sha256:1ea8e60705c2738b0023f4d80c1b371b136ca152a869a2cb510f6f0694e5891b","target":"graph","created_at":"2026-07-05T11:19:50Z","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/2412.05146/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Max-k-Cut problem is a fundamental combinatorial optimization challenge that generalizes the classic NP-complete Max-Cut problem. While relaxation techniques are commonly employed to tackle Max-k-Cut, they often lack guarantees of equivalence between the solutions of the original problem and its relaxation. To address this issue, we introduce the Relax-Optimize-and-Sample (ROS) framework. In particular, we begin by relaxing the discrete constraints to the continuous probability simplex form. Next, we pre-train and fine-tune a graph neural network model to efficiently optimize the relaxed p","authors_text":"Akang Wang, Qingjiang Shi, Yeqing Qiu, Ye Xue, Yiheng Wang, Zhi-Quan Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-06T16:02:02Z","title":"ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.05146","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:4ded0e39469bb651afab6d12021c74aa4c972d29e1d2df2932a9ab31ad8a28fb","target":"record","created_at":"2026-07-05T11:19:50Z","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":"a3d29ca15cb1b31c6413efbafb825a12cc2ec256c9118d17353c8c994f9295f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-06T16:02:02Z","title_canon_sha256":"48573cc0544367632cff8870c515b43f28134f95bfc564fa107e7e0181e3f3a7"},"schema_version":"1.0","source":{"id":"2412.05146","kind":"arxiv","version":2}},"canonical_sha256":"2cca34c12184077eeb510d21059ab599ce7eca2ae5d9750e278264c41fe561c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cca34c12184077eeb510d21059ab599ce7eca2ae5d9750e278264c41fe561c0","first_computed_at":"2026-07-05T11:19:50.230028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:50.230028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lvHZtw+CN9GP9bCJPcE5Z7yarkxSrokr/Q2xBpZATlse3K7Ch+hMC3hMCbGMyNq+YuXd8ASMo+Xqt46jemI2AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:50.230500Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.05146","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ded0e39469bb651afab6d12021c74aa4c972d29e1d2df2932a9ab31ad8a28fb","sha256:1ea8e60705c2738b0023f4d80c1b371b136ca152a869a2cb510f6f0694e5891b"],"state_sha256":"a369c6222f43f18ed9279e0c7f676f99f02eb641aeb8eab0f338c80a73b06b42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8Gcsa3hBpKRvMuFQGRfY1IZ4BNcUTurg7EN0afIQlSQkwBl/9Ea2LhMyxkk7LQ2J1K652ViRdrEg76JVWu3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T13:00:15.270680Z","bundle_sha256":"2023ea8188339fd8b9afd845e008639154acdc66d07d4ee24da1f4a43b519bdf"}}