{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:THF2QDRSR677MACMYBZUZ2H75X","short_pith_number":"pith:THF2QDRS","canonical_record":{"source":{"id":"1805.10678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-27T19:55:19Z","cross_cats_sorted":[],"title_canon_sha256":"9d0811c14c81b668f8eb443f69013fafbf5ae66757cd57678086f1b43b36ccd7","abstract_canon_sha256":"f850b85355532b677896b5fe3efc7f4c5c2a8ce521b09e7d82e85ad34c8b360a"},"schema_version":"1.0"},"canonical_sha256":"99cba80e328fbff6004cc0734ce8ffedebddc3df9fe82f72c563c7507260e81c","source":{"kind":"arxiv","id":"1805.10678","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10678","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10678v1","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10678","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"THF2QDRSR677","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"THF2QDRSR677MACM","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"THF2QDRS","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:THF2QDRSR677MACMYBZUZ2H75X","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-27T19:55:19Z","cross_cats_sorted":[],"title_canon_sha256":"9d0811c14c81b668f8eb443f69013fafbf5ae66757cd57678086f1b43b36ccd7","abstract_canon_sha256":"f850b85355532b677896b5fe3efc7f4c5c2a8ce521b09e7d82e85ad34c8b360a"},"schema_version":"1.0"},"canonical_sha256":"99cba80e328fbff6004cc0734ce8ffedebddc3df9fe82f72c563c7507260e81c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:51.751633Z","signature_b64":"NYe4dfxFaKZrRAzDjx74UtDi02dhYEFSa8sriK1PUDCG+t8hm3lVCwvUBljHph5aWAVEHQjSycBa7XDxp1a6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99cba80e328fbff6004cc0734ce8ffedebddc3df9fe82f72c563c7507260e81c","last_reissued_at":"2026-05-18T00:14:51.751126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:51.751126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10678","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-05-18T00:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSz7WiOJMicFax9eggsGKUwfi6IqX4GUl648yXa8gbPUBml+3J3UUaY+Kydp9UgEVN2uleutbQS4sUFBVG1yCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:47:38.500673Z"},"content_sha256":"978bb339c183933261af0fadacd7a281b973e4affad8f2610bfe3943ced2de14","schema_version":"1.0","event_id":"sha256:978bb339c183933261af0fadacd7a281b973e4affad8f2610bfe3943ced2de14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:THF2QDRSR677MACMYBZUZ2H75X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ADMM for combinatorial graph problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chuangchuang Sun, Ran Dai, Yifan Sun","submitted_at":"2018-05-27T19:55:19Z","abstract_excerpt":"We investigate a class of general combinatorial graph problems, including MAX-CUT and community detection, reformulated as quadratic objectives over nonconvex constraints and solved via the alternating direction method of multipliers (ADMM). We propose two reformulations: one using vector variables and a binary constraint, and the other further reformulating the Burer-Monteiro form for simpler subproblems. Despite the nonconvex constraint, we prove the ADMM iterates converge to a stationary point in both formulations, under mild assumptions. Additionally, recent work suggests that in this latt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10678","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":""},"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-05-18T00:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PwTmu7l9bS2vdU9QGedZjQhVhrtL0/JPXJ8Xws3Yab06EeQsGzS554q04OTQ/58fwR2W2mA7YsGO0U2bTr1cBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:47:38.501330Z"},"content_sha256":"8e2d062d16a3332d62dad8844a3dc0ebe66a04e0d3907da4bdbee1de449e79f7","schema_version":"1.0","event_id":"sha256:8e2d062d16a3332d62dad8844a3dc0ebe66a04e0d3907da4bdbee1de449e79f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THF2QDRSR677MACMYBZUZ2H75X/bundle.json","state_url":"https://pith.science/pith/THF2QDRSR677MACMYBZUZ2H75X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THF2QDRSR677MACMYBZUZ2H75X/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-05-31T20:47:38Z","links":{"resolver":"https://pith.science/pith/THF2QDRSR677MACMYBZUZ2H75X","bundle":"https://pith.science/pith/THF2QDRSR677MACMYBZUZ2H75X/bundle.json","state":"https://pith.science/pith/THF2QDRSR677MACMYBZUZ2H75X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THF2QDRSR677MACMYBZUZ2H75X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:THF2QDRSR677MACMYBZUZ2H75X","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":"f850b85355532b677896b5fe3efc7f4c5c2a8ce521b09e7d82e85ad34c8b360a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-27T19:55:19Z","title_canon_sha256":"9d0811c14c81b668f8eb443f69013fafbf5ae66757cd57678086f1b43b36ccd7"},"schema_version":"1.0","source":{"id":"1805.10678","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10678","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10678v1","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10678","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"THF2QDRSR677","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"THF2QDRSR677MACM","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"THF2QDRS","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:8e2d062d16a3332d62dad8844a3dc0ebe66a04e0d3907da4bdbee1de449e79f7","target":"graph","created_at":"2026-05-18T00:14:51Z","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"},"paper":{"abstract_excerpt":"We investigate a class of general combinatorial graph problems, including MAX-CUT and community detection, reformulated as quadratic objectives over nonconvex constraints and solved via the alternating direction method of multipliers (ADMM). We propose two reformulations: one using vector variables and a binary constraint, and the other further reformulating the Burer-Monteiro form for simpler subproblems. Despite the nonconvex constraint, we prove the ADMM iterates converge to a stationary point in both formulations, under mild assumptions. Additionally, recent work suggests that in this latt","authors_text":"Chuangchuang Sun, Ran Dai, Yifan Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-27T19:55:19Z","title":"ADMM for combinatorial graph problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10678","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:978bb339c183933261af0fadacd7a281b973e4affad8f2610bfe3943ced2de14","target":"record","created_at":"2026-05-18T00:14:51Z","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":"f850b85355532b677896b5fe3efc7f4c5c2a8ce521b09e7d82e85ad34c8b360a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-27T19:55:19Z","title_canon_sha256":"9d0811c14c81b668f8eb443f69013fafbf5ae66757cd57678086f1b43b36ccd7"},"schema_version":"1.0","source":{"id":"1805.10678","kind":"arxiv","version":1}},"canonical_sha256":"99cba80e328fbff6004cc0734ce8ffedebddc3df9fe82f72c563c7507260e81c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99cba80e328fbff6004cc0734ce8ffedebddc3df9fe82f72c563c7507260e81c","first_computed_at":"2026-05-18T00:14:51.751126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:51.751126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NYe4dfxFaKZrRAzDjx74UtDi02dhYEFSa8sriK1PUDCG+t8hm3lVCwvUBljHph5aWAVEHQjSycBa7XDxp1a6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:51.751633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10678","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:978bb339c183933261af0fadacd7a281b973e4affad8f2610bfe3943ced2de14","sha256:8e2d062d16a3332d62dad8844a3dc0ebe66a04e0d3907da4bdbee1de449e79f7"],"state_sha256":"5adad7e2c6427cf64cfafb032bb561c123743c17162dfe94637e5acc62dc048f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2OE6PaEuTVNXc5Tj9eMCtB1tqVyuAW5166cRwpNI8om/ZXm87lelkhpnYCcLqj4dSFHu7E3C6QJGaY1NPedrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:47:38.504900Z","bundle_sha256":"b1dc7e29d2e80308c984f0b6a4063e0cce15b85fb4bc86a972548039cd0a7154"}}