{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VSQ3F5B4ADCKALV7KASCHOUGQJ","short_pith_number":"pith:VSQ3F5B4","canonical_record":{"source":{"id":"1803.06496","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T12:29:19Z","cross_cats_sorted":["cs.NA","math.CO","math.NA"],"title_canon_sha256":"d3055e03eaadbce2147dcbd9ec23135e34a1ef10394f2c0009205cdc17758cd3","abstract_canon_sha256":"0685defe9c8e15d8c2d52f9198bc2fe4d02547e97364834dcdcedfeecf8bd0e4"},"schema_version":"1.0"},"canonical_sha256":"aca1b2f43c00c4a02ebf502423ba868277fcca9e903a2d84e5b3027b34e12246","source":{"kind":"arxiv","id":"1803.06496","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06496","created_at":"2026-07-05T08:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06496v3","created_at":"2026-07-05T08:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06496","created_at":"2026-07-05T08:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"VSQ3F5B4ADCK","created_at":"2026-07-05T08:46:13Z"},{"alias_kind":"pith_short_16","alias_value":"VSQ3F5B4ADCKALV7","created_at":"2026-07-05T08:46:13Z"},{"alias_kind":"pith_short_8","alias_value":"VSQ3F5B4","created_at":"2026-07-05T08:46:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VSQ3F5B4ADCKALV7KASCHOUGQJ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06496","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T12:29:19Z","cross_cats_sorted":["cs.NA","math.CO","math.NA"],"title_canon_sha256":"d3055e03eaadbce2147dcbd9ec23135e34a1ef10394f2c0009205cdc17758cd3","abstract_canon_sha256":"0685defe9c8e15d8c2d52f9198bc2fe4d02547e97364834dcdcedfeecf8bd0e4"},"schema_version":"1.0"},"canonical_sha256":"aca1b2f43c00c4a02ebf502423ba868277fcca9e903a2d84e5b3027b34e12246","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:13.896174Z","signature_b64":"x0B5owzi0o+DR6YBp4x+ltlp7w4NaOBdHXpGiwv0cAh3gB6bznH9guJbkTizhy9r+oYa+x49+15OgzOQLpHcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aca1b2f43c00c4a02ebf502423ba868277fcca9e903a2d84e5b3027b34e12246","last_reissued_at":"2026-07-05T08:46:13.895684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:13.895684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06496","source_version":3,"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:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5XrrMHFWE5m3cnkFaUX9Hl+Xf2jayuHWb9Bvth0MNC4eQM35iNzYDgMKx00tbK971Oe/EVgsdgjLedteAguTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:04:16.452900Z"},"content_sha256":"fc9df3924198b610acfa35ac27ee429b3b7d20bc80820b06fb3fbfdee9972f47","schema_version":"1.0","event_id":"sha256:fc9df3924198b610acfa35ac27ee429b3b7d20bc80820b06fb3fbfdee9972f47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VSQ3F5B4ADCKALV7KASCHOUGQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple iterative algorithm for maxcut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.CO","math.NA"],"primary_cat":"math.OC","authors_text":"Dong Zhang, Sihong Shao, Weixi Zhang","submitted_at":"2018-03-17T12:29:19Z","abstract_excerpt":"We propose a simple iterative (SI) algorithm for the maxcut problem through fully using an equivalent continuous formulation. It does not need rounding at all and has advantages that all subproblems have explicit analytic solutions, the cut values are monotonically updated and the iteration points converge to a local optima in finite steps via an appropriate subgradient selection. Numerical experiments on G-set demonstrate the performance. In particular, the ratios between the best cut values achieved by SI and those by some advanced combinatorial algorithms in [Ann. Oper. Res. 248 (2017) 365]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06496","kind":"arxiv","version":3},"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/1803.06496/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:46:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgxs3ZTujrKcKJyuOJHum8QNO3gQkvYLL/9wwKharA3imtsBcEnAT554SJhbeP9yzThC8HPfuo4g8g8HRHwmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:04:16.453269Z"},"content_sha256":"6114e93d4989814d05f98336c6b1b1d553cab4d428ad23e591b2f25f404b7258","schema_version":"1.0","event_id":"sha256:6114e93d4989814d05f98336c6b1b1d553cab4d428ad23e591b2f25f404b7258"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSQ3F5B4ADCKALV7KASCHOUGQJ/bundle.json","state_url":"https://pith.science/pith/VSQ3F5B4ADCKALV7KASCHOUGQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSQ3F5B4ADCKALV7KASCHOUGQJ/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-07-07T11:04:16Z","links":{"resolver":"https://pith.science/pith/VSQ3F5B4ADCKALV7KASCHOUGQJ","bundle":"https://pith.science/pith/VSQ3F5B4ADCKALV7KASCHOUGQJ/bundle.json","state":"https://pith.science/pith/VSQ3F5B4ADCKALV7KASCHOUGQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSQ3F5B4ADCKALV7KASCHOUGQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VSQ3F5B4ADCKALV7KASCHOUGQJ","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":"0685defe9c8e15d8c2d52f9198bc2fe4d02547e97364834dcdcedfeecf8bd0e4","cross_cats_sorted":["cs.NA","math.CO","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T12:29:19Z","title_canon_sha256":"d3055e03eaadbce2147dcbd9ec23135e34a1ef10394f2c0009205cdc17758cd3"},"schema_version":"1.0","source":{"id":"1803.06496","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06496","created_at":"2026-07-05T08:46:13Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06496v3","created_at":"2026-07-05T08:46:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06496","created_at":"2026-07-05T08:46:13Z"},{"alias_kind":"pith_short_12","alias_value":"VSQ3F5B4ADCK","created_at":"2026-07-05T08:46:13Z"},{"alias_kind":"pith_short_16","alias_value":"VSQ3F5B4ADCKALV7","created_at":"2026-07-05T08:46:13Z"},{"alias_kind":"pith_short_8","alias_value":"VSQ3F5B4","created_at":"2026-07-05T08:46:13Z"}],"graph_snapshots":[{"event_id":"sha256:6114e93d4989814d05f98336c6b1b1d553cab4d428ad23e591b2f25f404b7258","target":"graph","created_at":"2026-07-05T08:46:13Z","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/1803.06496/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a simple iterative (SI) algorithm for the maxcut problem through fully using an equivalent continuous formulation. It does not need rounding at all and has advantages that all subproblems have explicit analytic solutions, the cut values are monotonically updated and the iteration points converge to a local optima in finite steps via an appropriate subgradient selection. Numerical experiments on G-set demonstrate the performance. In particular, the ratios between the best cut values achieved by SI and those by some advanced combinatorial algorithms in [Ann. Oper. Res. 248 (2017) 365]","authors_text":"Dong Zhang, Sihong Shao, Weixi Zhang","cross_cats":["cs.NA","math.CO","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T12:29:19Z","title":"A simple iterative algorithm for maxcut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06496","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:fc9df3924198b610acfa35ac27ee429b3b7d20bc80820b06fb3fbfdee9972f47","target":"record","created_at":"2026-07-05T08:46:13Z","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":"0685defe9c8e15d8c2d52f9198bc2fe4d02547e97364834dcdcedfeecf8bd0e4","cross_cats_sorted":["cs.NA","math.CO","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T12:29:19Z","title_canon_sha256":"d3055e03eaadbce2147dcbd9ec23135e34a1ef10394f2c0009205cdc17758cd3"},"schema_version":"1.0","source":{"id":"1803.06496","kind":"arxiv","version":3}},"canonical_sha256":"aca1b2f43c00c4a02ebf502423ba868277fcca9e903a2d84e5b3027b34e12246","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aca1b2f43c00c4a02ebf502423ba868277fcca9e903a2d84e5b3027b34e12246","first_computed_at":"2026-07-05T08:46:13.895684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:46:13.895684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x0B5owzi0o+DR6YBp4x+ltlp7w4NaOBdHXpGiwv0cAh3gB6bznH9guJbkTizhy9r+oYa+x49+15OgzOQLpHcDA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:46:13.896174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06496","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc9df3924198b610acfa35ac27ee429b3b7d20bc80820b06fb3fbfdee9972f47","sha256:6114e93d4989814d05f98336c6b1b1d553cab4d428ad23e591b2f25f404b7258"],"state_sha256":"bed3c7d1a58cd9582b8085bc1e91652052bbe9d6ca68b91e59a7f35cd6365586"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gT5+/M5S0RwkydhO1AJT23rTYMduuCVIatDgKev7O+y9LpPH4ep7loTz+fwRvxeCpUDVlSNFeZ4rcfJ8hJcLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:04:16.455776Z","bundle_sha256":"969cd2e07c121e2364940fb30296c347420fc5d41da8d11b7b5cbaff08833a23"}}