{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:A2IG2WPDLEKOHKTS6OO7BA5L5C","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":"a8b3d4a3bdd9d0126a06c19f079ce851ab1a818584bebd34ba74601121639f2b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-05T20:47:07Z","title_canon_sha256":"78a0e9d7f0b0320528653235e947955a5e46a809cca8b0d9409f056e760e8e9f"},"schema_version":"1.0","source":{"id":"1904.03272","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03272","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03272v1","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03272","created_at":"2026-05-17T23:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"A2IG2WPDLEKO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"A2IG2WPDLEKOHKTS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"A2IG2WPD","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:e65d3596ee33a8dfee17c425e968251b7a07d819ac9495edff9f8a5712fd7ef6","target":"graph","created_at":"2026-05-17T23:49:08Z","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 consider the densest $k$-subgraph problem, which seeks to identify the $k$-node subgraph of a given input graph with maximum number of edges. This problem is well-known to be NP-hard, by reduction to the maximum clique problem. We propose a new convex relaxation for the densest $k$-subgraph problem, based on a nuclear norm relaxation of a low-rank plus sparse decomposition of the adjacency matrices of $k$-node subgraphs to partially address this intractability. We establish that the densest $k$-subgraph can be recovered with high probability from the optimal solution of this convex relaxati","authors_text":"Brendan Ames, Polina Bombina","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-05T20:47:07Z","title":"Convex optimization for the densest subgraph and densest submatrix problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03272","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:85f70a06a5c2f915100feefdfc25f6205f0b8182e1526bbf54d6f684fc9af9b7","target":"record","created_at":"2026-05-17T23:49:08Z","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":"a8b3d4a3bdd9d0126a06c19f079ce851ab1a818584bebd34ba74601121639f2b","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-04-05T20:47:07Z","title_canon_sha256":"78a0e9d7f0b0320528653235e947955a5e46a809cca8b0d9409f056e760e8e9f"},"schema_version":"1.0","source":{"id":"1904.03272","kind":"arxiv","version":1}},"canonical_sha256":"06906d59e35914e3aa72f39df083abe8b24f55920913154bdb44f155f6f0b8f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06906d59e35914e3aa72f39df083abe8b24f55920913154bdb44f155f6f0b8f4","first_computed_at":"2026-05-17T23:49:08.480790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:08.480790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v9+NK2pPTbwcqV9kMaghfnY4xNqryGDjIwWnOZLLMtkj6m7YMUoiGEE3p/C1dE1wM/45QN7eIhfAZ/PjOevZDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:08.481465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03272","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85f70a06a5c2f915100feefdfc25f6205f0b8182e1526bbf54d6f684fc9af9b7","sha256:e65d3596ee33a8dfee17c425e968251b7a07d819ac9495edff9f8a5712fd7ef6"],"state_sha256":"2f5faa073cb5cfe50db8cfaeb11dec78e6240991d96d0707ba6141d6b44b70c7"}