{"as_of":"2026-08-23T03:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:35e2047694a283dc57433322c23e95a01da8ca0fe4159497b25f695e9d4f0cd8","coverage":[{"denominator":49,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":49,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T12:17:34.505819Z","state":"measured"},{"denominator":49,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":49,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2601.03946/citation-record","integrity":"/paper/2601.03946/integrity","json":"/paper/2601.03946/citation-record.json","paper":"/paper/2601.03946"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.214099Z","title":"[Accessed 24- 10-2025]","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.214099Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:9390554258f040e6796720d3947262bea76a2601ec30ab8f7a52e8e9126bffae","observation_id":"97d62e9c-857b-4d0d-9d7b-fefa069b234a","resolution":{"observed_at":"2026-08-03T12:17:31.214099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.250755Z","title":"Community detection and stochastic block models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.250755Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:04637a9af2efc5f87607ac2a543d0ee60bb8f0192d0c5da2d7ba8bd080456c59","observation_id":"8e533efe-e76c-430e-a43e-143d7c80b618","resolution":{"observed_at":"2026-08-03T12:17:31.250755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.318466Z","title":"Inapprox- imability of densestκ-subgraph from average case hardness.Unpublished manuscript, 1:6, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.318466Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:592da6a96d1b493cd73a0688533313cb3d773f649ad748da109075909a9dec61","observation_id":"0466d591-722d-4d79-8c7c-2580b05bff75","resolution":{"observed_at":"2026-08-03T12:17:31.318466Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.385656Z","title":"Finding a large hidden clique in a random graph.Random Structures & Algorithms, 13(3-4):457–466, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.385656Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:438f55b2c330535252dc59284d71ed87b1976a66f96ec01b60bb933adbe319e7","observation_id":"52f58c51-b784-4168-a561-1ce0a86d873e","resolution":{"observed_at":"2026-08-03T12:17:31.385656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.449228Z","title":"Guaranteed clustering and biclustering via semidefinite programming.Mathe- matical Programming, 147(1):429–465, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.449228Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:ca8d2f728dbc54ed156130fbda33ab491cbe3b098bae7cfe04f25627aefd60fe","observation_id":"de5b8040-58e7-4b1a-b2bf-9e7619a2774f","resolution":{"observed_at":"2026-08-03T12:17:31.449228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.511674Z","title":"Guaranteed recovery of planted cliques and dense subgraphs by convex relax- ation.Journal of Optimization Theory and Applications, 167(2):653–675, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.511674Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:f19e85634846c71ac653d5707e05ea6882182950dde10fe35ed7032b520d93af","observation_id":"bd28b4c2-5933-40a9-a05d-17538c243727","resolution":{"observed_at":"2026-08-03T12:17:31.511674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.574170Z","title":"Nuclear norm minimization for the planted clique and biclique problems.Mathematical programming, 129(1):69–89, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.574170Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:a57f774f513839a5a4c4d9e362d5247e5e28757600f6bc806ed1c5cf0df81644","observation_id":"53bf2ce0-891d-4d0d-82eb-7cd163379dfb","resolution":{"observed_at":"2026-08-03T12:17:31.574170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0702032","last_updated":"2007-02-05T19:29:38Z","snapshot_observed_at":"2026-08-15T10:48:38.319904Z","submitted_at":"2007-02-05T19:29:38Z","title":"Finding large and small dense subgraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0702032","snapshot_observed_at":"2026-08-03T12:17:31.630581Z","title":"Finding large and small dense subgraphs.arXiv preprint cs/0702032, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.630581Z"},"links":{"cited_paper":"/paper/cs/0702032","citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:2b779575e3580aa2ec457a3f68d21144be442d337bcf5d5e6310c87cef5be484","observation_id":"e2f7cb87-e1aa-4fed-831b-8d4103b77500","resolution":{"observed_at":"2026-08-03T12:17:31.630581Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.684059Z","title":"Clique relaxations in social network analysis: The maximum k-plex problem.Operations Research, 59(1):133–142, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.684059Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:f304816637def0c77dcd10c10d1ee11819bcbc8f4f27fb5caac14e142914eef6","observation_id":"947defea-54bd-47a2-842e-548c7563bf94","resolution":{"observed_at":"2026-08-03T12:17:31.684059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.737152Z","title":"Sharp nonasymptotic bounds on the norm of random matrices with independent entries","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.737152Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:e42e2785b49aaa2636191d565df425da211120c9612f71f21338d2ce90193e20","observation_id":"2f04e528-84a9-4531-915c-d4bfb76eea74","resolution":{"observed_at":"2026-08-03T12:17:31.737152Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.790733Z","title":"The game of Game of Thrones: Networked concordances and fractal dramaturgy","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.790733Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:bf6b634ae1bc27d2df16533555a16e36c21b29e7afa8a8d395e6da533a31e0ce","observation_id":"44ef71d0-9906-44af-a539-7488098557cd","resolution":{"observed_at":"2026-08-03T12:17:31.790733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.848070Z","title":"Network of Thrones.Math Horizons, 23(4):18–22, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.848070Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:59c0b888f22a72ddbe929b56b4758092046c9efefa47b70d826258afedad93e5","observation_id":"845471cc-edf7-476b-a40d-4c40578b8f9d","resolution":{"observed_at":"2026-08-03T12:17:31.848070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.912544Z","title":"Mining market data: A network ap- proach.Computers & Operations Research, 33(11):3171–3184, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.912544Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:7b68b8e28b7b7e1cf5fd9fb546878899d6f6f1772e42677e9376e348435d0561","observation_id":"45c9c65a-4279-4ba8-a2a7-948ae42410be","resolution":{"observed_at":"2026-08-03T12:17:31.912544Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:31.984058Z","title":"Convex optimization for the densest subgraph and densest submatrix problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:31.984058Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:975af9ed319dad8303e7978ddfa493addeca1087e5270a3c0450cd7958e7a98f","observation_id":"af8d2369-273b-4424-aae8-48db79525495","resolution":{"observed_at":"2026-08-03T12:17:31.984058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.059656Z","title":"Oxford university press, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.059656Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:3b65c82daff100986a7beda60a6710fdaceed880ef5c75ca9636f58dba85e62f","observation_id":"d1bdd4f7-3e18-4454-b60c-71a3f0b57f63","resolution":{"observed_at":"2026-08-03T12:17:32.059656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.163882Z","title":"Convex pptimization.Cambridge UP, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.163882Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:cb71388d13cf2170255591d43737adf15d4c8da534038e01d3378ee1fae1a1a6","observation_id":"cc004b90-0eb1-430a-aa94-6593d72fbea7","resolution":{"observed_at":"2026-08-03T12:17:32.163882Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.248853Z","title":"Distributed opti- mization and statistical learning via the alternating direction method of multipliers.Foundations and Trends®in Machine learning, 3(1):1–122, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.248853Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:bd8ad452b78692ec152ca4f864997906e449947c43007520a7e8fc7a7acbac9b","observation_id":"5da91404-4c81-41c2-a1cd-150ed7fec67e","resolution":{"observed_at":"2026-08-03T12:17:32.248853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.325409Z","title":"Algorithm 457: finding all cliques of an undirected graph.Commu- nications of the ACM, 16(9):575–577, 1973","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.325409Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:b12025ae5464eac01c21d4c549626edb972f68124a9b8dc9e9a547aaa907c8dd","observation_id":"49b3497b-e9cb-4676-b581-b15d593335f5","resolution":{"observed_at":"2026-08-03T12:17:32.325409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.394508Z","title":"Robust principal component analysis? Journal of the ACM (JACM), 58(3):1–37, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.394508Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:5fef8505d83e03334459d23089cff3313b31e0c89ff0d3c63227b8621526cc07","observation_id":"8d85e0cb-54b9-4499-8db9-406b2f539594","resolution":{"observed_at":"2026-08-03T12:17:32.394508Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.462229Z","title":"A note on the problem of reporting maximal cliques","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.462229Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:b9e6a01f865fc72b2049d743676d9ca9285c184a4c798829b0fc8ba96be90525","observation_id":"0a0142c5-994b-4f01-af90-11c3e0007037","resolution":{"observed_at":"2026-08-03T12:17:32.462229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.528338Z","title":"Rank-sparsity incoherence for matrix decomposition.SIAM Journal on Optimization, 21(2):572–596, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.528338Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:df401b1f3b450dfe66f81c23ba89c7b99ca3d67e0299ba2ce4b2e65bb86d10e1","observation_id":"0d9179aa-1f70-44db-b6dc-6f384aeb56cb","resolution":{"observed_at":"2026-08-03T12:17:32.528338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.595226Z","title":"Statistical-computational phase transitions in planted models: The high-dimensional setting","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.595226Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:16fbd85335fc503ecd2627831d9a98f18a6f0f303f4d41f1d493ce55a3464694","observation_id":"7bcf85d2-7d14-4168-a3a9-0e49326e6560","resolution":{"observed_at":"2026-08-03T12:17:32.595226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.665826Z","title":"Detection and recovery of hidden submatrices","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.665826Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:2b083c7f54d9ed77b01380a7effbcc759978d82039a89759bfc11a99d0e08327","observation_id":"0b59559f-bfa5-4c64-8403-d2e3d4b42156","resolution":{"observed_at":"2026-08-03T12:17:32.665826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.742444Z","title":"A generalization of the Sherman-Morrison-Woodbury formula.Applied Mathe- matics Letters, 24(9):1561–1564, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.742444Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:c14ddc78daf14c1179ccda868d075dd50b2e24b972ad11ad97c54971a97ffbe9","observation_id":"675beec8-cf21-401e-9370-d56afb912cdc","resolution":{"observed_at":"2026-08-03T12:17:32.742444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.819019Z","title":"Finding approximately rank-one submatrices with the nuclear norm andℓ 1-norm.SIAM Journal on Optimization, 23(4):2502–2540, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.819019Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:f8c7a117d25b4d2c361dab4f0b8f4b34cf1a2928c0eed54038e60cd77d2de1ea","observation_id":"860af8eb-7f56-4927-aafd-a31ea50e3821","resolution":{"observed_at":"2026-08-03T12:17:32.819019Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.890320Z","title":"Relations between average case complexity and approximation complexity","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.890320Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:980b87a86ec1528ead934d8459a8fed0eaae8b49bd4550c6fb2559bd9e653128","observation_id":"cdf4ff55-ee7c-4ffb-b620-774ee064e5de","resolution":{"observed_at":"2026-08-03T12:17:32.890320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:32.977582Z","title":"Finding and certifying a large hidden clique in a semirandom graph.Random Structures & Algorithms, 16(2):195–208, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:32.977582Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:bfe0081318c82a616ac7d57be23a4214723e35365db5e623cc61d9b2a6c69842","observation_id":"53edb7ee-224a-495c-9f99-85e129c76177","resolution":{"observed_at":"2026-08-03T12:17:32.977582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.065417Z","title":"Community structure in jazz.Advances in complex systems, 6(04):565–573, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.065417Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:cfe7ad07530e9748e20a8cc61b3c399b9a3c63557f3067a010389350a6c0edba","observation_id":"0affa2c1-9ebf-4310-8bba-5e4817775888","resolution":{"observed_at":"2026-08-03T12:17:33.065417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.133843Z","title":"JHU Press, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.133843Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:d35733b299a2e97941d5b7c234c352a926421174d08aff404001500917616260","observation_id":"2cd986bf-e574-4b8c-875a-98f97c427997","resolution":{"observed_at":"2026-08-03T12:17:33.133843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.212332Z","title":"Identification of a 5-protein biomarker molecular signa- ture for predicting Alzheimer’s disease.PloS One, 3(9):e3111, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.212332Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:e9d4cab7693edd322d910c19dd4c6beb5f8565bd02f126efd2105bb6a35c902e","observation_id":"ebaedd7d-9e5c-40a0-87ec-e4014e96db2b","resolution":{"observed_at":"2026-08-03T12:17:33.212332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.284983Z","title":"On the linear convergence of the alternating direction method of multipliers.Mathematical Programming, 162(1):165–199, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.284983Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:d7dd4a455751004116eca565daa1f68a07c2feed543517913682c1de582cd3c9","observation_id":"a4b0c7c4-374e-4112-97e9-bfa3f5232ce0","resolution":{"observed_at":"2026-08-03T12:17:33.284983Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.350194Z","title":"Impact of interference on multi-hop wireless network performance","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.350194Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:0b70e215cb1cfb3f1967a99c411696be9dbafa84f97113de85d7e9caee3a8036","observation_id":"9c2d6ed3-0cc9-47f6-8d49-7cb1c18e8d3e","resolution":{"observed_at":"2026-08-03T12:17:33.350194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.414756Z","title":"Reducibility among combinatorial problems","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.414756Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:844180fc1d6f113ca09084016f24eac2537dfe9cbd9ecbecd0f3b578ba0014b9","observation_id":"956cfcb3-ca91-4c3f-a3eb-6565684419a3","resolution":{"observed_at":"2026-08-03T12:17:33.414756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.475386Z","title":"Ruling out PTAs for graph min-bisection, densek-subgraph, and bipartite clique","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.475386Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:e4a7672009d09d839b67064c81c962f48c6a63d7eeae68687c9a47cb43b3ea3c","observation_id":"99b8ee45-103a-492e-baef-051e3ad2081f","resolution":{"observed_at":"2026-08-03T12:17:33.475386Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.548840Z","title":"AcM Press New York, 1993","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.548840Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:cc9fe51cd27bc26b2761b6b95752013587f3d4bb6661f82e6e7ef573e263aa16","observation_id":"8c6749c1-5d4a-46a1-a9ec-97fb1925b151","resolution":{"observed_at":"2026-08-03T12:17:33.548840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.624511Z","title":"A survey on the densest subgraph problem and its variants.ACM Computing Surveys, 56(8):1–40, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.624511Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:ff9473ac0a7ea1e52c79d47438ba23d54ddb39743364ce47dc889c748b3d2702","observation_id":"b6ea1551-1d15-4b08-952c-9948b7a41c15","resolution":{"observed_at":"2026-08-03T12:17:33.624511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.702633Z","title":"The dimension-free structure of nonhomoge- neous random matrices.Inventiones mathematicae, 214(3):1031–1080, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.702633Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:932433b49421fdcebd11730cbccc028e4601f7eee3bad851e20b1164460b4e38","observation_id":"b7940e20-8cc7-4978-bd8f-6beda1ad99ee","resolution":{"observed_at":"2026-08-03T12:17:33.702633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.785347Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.785347Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:9d703e8731f7a06ce48a81df27cede832788216c22d61c84d9ccf56adb92c83f","observation_id":"ccd8a6c3-9694-4396-b91b-7b090f998d7f","resolution":{"observed_at":"2026-08-03T12:17:33.785347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:33.867583Z","title":"Maximum cliques in protein structure comparison","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.867583Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:ea0a92e833c7e83cde5152af28d77809eaaa8c56880a30966bc087a8099e1f71","observation_id":"cb4b82d6-e2b9-4832-a920-0e6c7984fe1d","resolution":{"observed_at":"2026-08-03T12:17:33.867583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09022","last_updated":"2023-07-18T07:21:49Z","snapshot_observed_at":"2026-08-16T15:15:27.185193Z","submitted_at":"2023-07-18T07:21:49Z","title":"Harnessing the mathematics of matrix decomposition to solve planted and maximum clique problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09022","snapshot_observed_at":"2026-08-03T12:17:33.939223Z","title":"Harnessing the mathematics of matrix decomposition to solve planted and maximum clique problem.arXiv preprint arXiv:2307.09022, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:33.939223Z"},"links":{"cited_paper":"/paper/2307.09022","citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:fec36e7e3e473f97b3ef375ea7d4b3f92fdfa91d536bb8ad4115438475cec8db","observation_id":"d937ad82-e16e-48db-8e42-760336b93b8a","resolution":{"observed_at":"2026-08-03T12:17:33.939223Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:34.007872Z","title":"Maximum edge bi-clique via matrix decomposition.Journal of Industrial and Management Optimization, 21(11):6270–6294, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:34.007872Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:110c1cc78c4a05910c6f999366bb3452c8de5fbb816ffd5d38df004e13eb03b6","observation_id":"4106c591-8273-4da3-8fcb-9e98204b9ebe","resolution":{"observed_at":"2026-08-03T12:17:34.007872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:34.073072Z","title":"Clique relaxation models in social network analysis","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:34.073072Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:04636a035c3e46e3c822c4bdb77c3ee2f258a186bb4b3f304b237ccb7433746e","observation_id":"8c1ae675-89c2-495b-a64e-865c2fc10956","resolution":{"observed_at":"2026-08-03T12:17:34.073072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:34.129793Z","title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization.SIAM review, 52(3):471–501, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:34.129793Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:981b4ee0c2f43ca39092b97f918e8e3a5334deb9b0ed37fde41d108ac0ff552c","observation_id":"cb7639a4-e8c0-46fc-8c47-05476a618acd","resolution":{"observed_at":"2026-08-03T12:17:34.129793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:34.190233Z","title":"Graph clustering.Computer Science Review, 1(1):27–64, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:34.190233Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:c67ba13e9dd7e27436351fce21c12357de46ccd8d92ec95af163c526801d334c","observation_id":"2d68486e-9985-48ac-bf7b-b531139db097","resolution":{"observed_at":"2026-08-03T12:17:34.190233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:34.245689Z","title":"Sharp phase transitions in estimation with low-degree polynomials","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:34.245689Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:75c0d76c812c9a0f3f101208462ff34d10c4601faa9ad01fe9cc03456401c4ce","observation_id":"faddf3c8-a582-491a-b6dc-e69be63f2e06","resolution":{"observed_at":"2026-08-03T12:17:34.245689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:34.303925Z","title":"A semidefinite programming-based branch-and-cut algorithm for biclustering","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:34.303925Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:4b83d81a68cac93b597d8142bd1a018aa8065ae1b7cb117dbd2e63ae9323f9bb","observation_id":"2700c4e6-6ceb-46de-8568-cfaf2a8de252","resolution":{"observed_at":"2026-08-03T12:17:34.303925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:34.367981Z","title":"The worst-case time complexity for generat- ing all maximal cliques and computational experiments.Theoretical computer science, 363(1):28–42, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:34.367981Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:0433193932b6520bfbb43a62f25bb3f0e30d35bc02289c2807eee497fc1f957d","observation_id":"5b472798-e795-4a55-a8d6-aaa6b42ebca4","resolution":{"observed_at":"2026-08-03T12:17:34.367981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:34.432526Z","title":"User-friendly tail bounds for sums of random matrices.Foundations of computational mathematics, 12:389–434, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:34.432526Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:ef99c9331e594676597b5658339e1c2f60046c077e03d42a26db094921b20d01","observation_id":"6fbbb634-cd91-4b99-a018-d8cc66d9ffeb","resolution":{"observed_at":"2026-08-03T12:17:34.432526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T12:17:34.505819Z","title":"An information flow model for conflict and fission in small groups.Journal of anthropological research, 33(4):452–473, 1977","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T12:17:34.505819Z"},"links":{"citing_paper":"/paper/2601.03946"},"observation_digest":"sha256:f5c4ec53ae3822d3f8f32e98de0939e56ab97022549184af57d36730e7c36f96","observation_id":"01e5a685-9e9e-41b3-86fb-890c8a5d4286","resolution":{"observed_at":"2026-08-03T12:17:34.505819Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.03946","last_updated":"2026-07-02T17:12:53Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-15T00:29:32.281251Z","submitted_at":"2026-01-07T14:02:25Z","title":"Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming"},"reference_resolution":{"displayed":49,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":49,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":49},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 0 inbound Pith citation observations for arXiv:2601.03946."}