{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4NFDQYAVD64EF6GCXO6Q3WNF2M","short_pith_number":"pith:4NFDQYAV","canonical_record":{"source":{"id":"1803.06566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T20:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"8ac636daa0bfbd2a3960852267072f818a88d11e139c0907286b5f115b514def","abstract_canon_sha256":"ff6bddb00da66fda68be3f60d7c41cd3faa17ff30d96ebde4fde00f61dc7c87e"},"schema_version":"1.0"},"canonical_sha256":"e34a3860151fb842f8c2bbbd0dd9a5d30772a36d2864317c547c29351a717dba","source":{"kind":"arxiv","id":"1803.06566","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06566","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06566v1","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06566","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"pith_short_12","alias_value":"4NFDQYAVD64E","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4NFDQYAVD64EF6GC","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4NFDQYAV","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4NFDQYAVD64EF6GCXO6Q3WNF2M","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06566","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T20:12:03Z","cross_cats_sorted":[],"title_canon_sha256":"8ac636daa0bfbd2a3960852267072f818a88d11e139c0907286b5f115b514def","abstract_canon_sha256":"ff6bddb00da66fda68be3f60d7c41cd3faa17ff30d96ebde4fde00f61dc7c87e"},"schema_version":"1.0"},"canonical_sha256":"e34a3860151fb842f8c2bbbd0dd9a5d30772a36d2864317c547c29351a717dba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:45.578250Z","signature_b64":"XA978tVmGvbirvm5NHXmv+RSP4APzZAK5GWix0PnYLGe29gYE/mbcKsniq4Ht9RxPobK3GgE/3wTS5PjCd4cCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e34a3860151fb842f8c2bbbd0dd9a5d30772a36d2864317c547c29351a717dba","last_reissued_at":"2026-05-18T00:20:45.577635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:45.577635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06566","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:20:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqDLZMNNZ/Wft174V8jBr8514MVpLtVpCqvG9YbSZQDyAh9sxBSW+ivP3pFUA3U8KCv0xmhZqboZc1UodDEQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:42:04.836668Z"},"content_sha256":"702e4bb12f82e50d0ade9fb6262045068f9a34be14467444c765164ff7e76930","schema_version":"1.0","event_id":"sha256:702e4bb12f82e50d0ade9fb6262045068f9a34be14467444c765164ff7e76930"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4NFDQYAVD64EF6GCXO6Q3WNF2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the Best Approximation Over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Defeng Sun, Kim-Chuan Toh, Ying Cui","submitted_at":"2018-03-17T20:12:03Z","abstract_excerpt":"This paper introduces an efficient algorithm for computing the best approximation of a given matrix onto the intersection of linear equalities, inequalities and the doubly nonnegative cone (the cone of all positive semidefinite matrices whose elements are nonnegative). In contrast to directly applying the block coordinate descent type methods, we propose an inexact accelerated (two-)block coordinate descent algorithm to tackle the four-block unconstrained nonsmooth dual program. The proposed algorithm hinges on the efficient semismooth Newton method to solve the subproblems, which have no clos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06566","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:20:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BUEqx/d8gnSX0B2QXUNn74/rxdD8BdIevpe/BJk+gqv3zRe7Sekl4i9/sAjEaRq6ISFwSz5nHEfvdw+LhB6vCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:42:04.837312Z"},"content_sha256":"5686d03b238a2ffa3ee17a45442537aee3ec085ffc64aafaf946b96b052ef88e","schema_version":"1.0","event_id":"sha256:5686d03b238a2ffa3ee17a45442537aee3ec085ffc64aafaf946b96b052ef88e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NFDQYAVD64EF6GCXO6Q3WNF2M/bundle.json","state_url":"https://pith.science/pith/4NFDQYAVD64EF6GCXO6Q3WNF2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NFDQYAVD64EF6GCXO6Q3WNF2M/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-25T11:42:04Z","links":{"resolver":"https://pith.science/pith/4NFDQYAVD64EF6GCXO6Q3WNF2M","bundle":"https://pith.science/pith/4NFDQYAVD64EF6GCXO6Q3WNF2M/bundle.json","state":"https://pith.science/pith/4NFDQYAVD64EF6GCXO6Q3WNF2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NFDQYAVD64EF6GCXO6Q3WNF2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4NFDQYAVD64EF6GCXO6Q3WNF2M","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":"ff6bddb00da66fda68be3f60d7c41cd3faa17ff30d96ebde4fde00f61dc7c87e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T20:12:03Z","title_canon_sha256":"8ac636daa0bfbd2a3960852267072f818a88d11e139c0907286b5f115b514def"},"schema_version":"1.0","source":{"id":"1803.06566","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06566","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06566v1","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06566","created_at":"2026-05-18T00:20:45Z"},{"alias_kind":"pith_short_12","alias_value":"4NFDQYAVD64E","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4NFDQYAVD64EF6GC","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4NFDQYAV","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:5686d03b238a2ffa3ee17a45442537aee3ec085ffc64aafaf946b96b052ef88e","target":"graph","created_at":"2026-05-18T00:20:45Z","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":"This paper introduces an efficient algorithm for computing the best approximation of a given matrix onto the intersection of linear equalities, inequalities and the doubly nonnegative cone (the cone of all positive semidefinite matrices whose elements are nonnegative). In contrast to directly applying the block coordinate descent type methods, we propose an inexact accelerated (two-)block coordinate descent algorithm to tackle the four-block unconstrained nonsmooth dual program. The proposed algorithm hinges on the efficient semismooth Newton method to solve the subproblems, which have no clos","authors_text":"Defeng Sun, Kim-Chuan Toh, Ying Cui","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T20:12:03Z","title":"Computing the Best Approximation Over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06566","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:702e4bb12f82e50d0ade9fb6262045068f9a34be14467444c765164ff7e76930","target":"record","created_at":"2026-05-18T00:20:45Z","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":"ff6bddb00da66fda68be3f60d7c41cd3faa17ff30d96ebde4fde00f61dc7c87e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-17T20:12:03Z","title_canon_sha256":"8ac636daa0bfbd2a3960852267072f818a88d11e139c0907286b5f115b514def"},"schema_version":"1.0","source":{"id":"1803.06566","kind":"arxiv","version":1}},"canonical_sha256":"e34a3860151fb842f8c2bbbd0dd9a5d30772a36d2864317c547c29351a717dba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e34a3860151fb842f8c2bbbd0dd9a5d30772a36d2864317c547c29351a717dba","first_computed_at":"2026-05-18T00:20:45.577635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:45.577635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XA978tVmGvbirvm5NHXmv+RSP4APzZAK5GWix0PnYLGe29gYE/mbcKsniq4Ht9RxPobK3GgE/3wTS5PjCd4cCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:45.578250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06566","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:702e4bb12f82e50d0ade9fb6262045068f9a34be14467444c765164ff7e76930","sha256:5686d03b238a2ffa3ee17a45442537aee3ec085ffc64aafaf946b96b052ef88e"],"state_sha256":"d03efbdd9dc3e4191944e850b1936d99fd33a2f3ebed8b444523b90bc046ebb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtZvoL912OFKPQZ2m5oaTxOmczfY20nxrIBU2YtS5cS8+zjYr92sYhrBT8yL6GPhRfSREIC179rq7PzpTMpbBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:42:04.840821Z","bundle_sha256":"9465dcccbe2c4589ece5b18e311d6de8a724358f1e0e5d1df3da197eecb708fd"}}