Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming | Paper Citation Record

Observation 97d62e9c-857b-4d0d-9d7b-fefa069b234a · outbound

This paper cites [Accessed 24- 10-2025].

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming [Accessed 24- 10-2025]

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.214099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8e533efe-e76c-430e-a43e-143d7c80b618 · outbound

This paper cites Community detection and stochastic block models, 2023.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Community detection and stochastic block models, 2023

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.250755Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0466d591-722d-4d79-8c7c-2580b05bff75 · outbound

This paper cites Inapprox- imability of densestκ-subgraph from average case hardness.Unpublished manuscript, 1:6, 2011.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Inapprox- imability of densestκ-subgraph from average case hardness.Unpublished manuscript, 1:6, 2011

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.318466Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 52f58c51-b784-4168-a561-1ce0a86d873e · outbound

This paper cites Finding a large hidden clique in a random graph.Random Structures & Algorithms, 13(3-4):457–466, 1998.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Finding a large hidden clique in a random graph.Random Structures & Algorithms, 13(3-4):457–466, 1998

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.385656Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de5b8040-58e7-4b1a-b2bf-9e7619a2774f · outbound

This paper cites Guaranteed clustering and biclustering via semidefinite programming.Mathe- matical Programming, 147(1):429–465, 2014.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Guaranteed clustering and biclustering via semidefinite programming.Mathe- matical Programming, 147(1):429–465, 2014

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.449228Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bd28b4c2-5933-40a9-a05d-17538c243727 · outbound

This paper cites Guaranteed recovery of planted cliques and dense subgraphs by convex relax- ation.Journal of Optimization Theory and Applications, 167(2):653–675, 2015.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Guaranteed recovery of planted cliques and dense subgraphs by convex relax- ation.Journal of Optimization Theory and Applications, 167(2):653–675, 2015

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.511674Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53bf2ce0-891d-4d0d-82eb-7cd163379dfb · outbound

This paper cites Nuclear norm minimization for the planted clique and biclique problems.Mathematical programming, 129(1):69–89, 2011.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Nuclear norm minimization for the planted clique and biclique problems.Mathematical programming, 129(1):69–89, 2011

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.574170Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e2f7cb87-e1aa-4fed-831b-8d4103b77500 · outbound

This paper cites Finding large and small dense subgraphs.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Finding large and small dense subgraphs

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.630581Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 947defea-54bd-47a2-842e-548c7563bf94 · outbound

This paper cites Clique relaxations in social network analysis: The maximum k-plex problem.Operations Research, 59(1):133–142, 2011.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Clique relaxations in social network analysis: The maximum k-plex problem.Operations Research, 59(1):133–142, 2011

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.684059Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f04e528-84a9-4531-915c-d4bfb76eea74 · outbound

This paper cites Sharp nonasymptotic bounds on the norm of random matrices with independent entries.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Sharp nonasymptotic bounds on the norm of random matrices with independent entries

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.737152Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 44ef71d0-9906-44af-a539-7488098557cd · outbound

This paper cites The game of Game of Thrones: Networked concordances and fractal dramaturgy.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming The game of Game of Thrones: Networked concordances and fractal dramaturgy

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.790733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 845471cc-edf7-476b-a40d-4c40578b8f9d · outbound

This paper cites Network of Thrones.Math Horizons, 23(4):18–22, 2016.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Network of Thrones.Math Horizons, 23(4):18–22, 2016

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.848070Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 45c9c65a-4279-4ba8-a2a7-948ae42410be · outbound

This paper cites Mining market data: A network ap- proach.Computers & Operations Research, 33(11):3171–3184, 2006.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Mining market data: A network ap- proach.Computers & Operations Research, 33(11):3171–3184, 2006

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.912544Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af8d2369-273b-4424-aae8-48db79525495 · outbound

This paper cites Convex optimization for the densest subgraph and densest submatrix problems.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Convex optimization for the densest subgraph and densest submatrix problems

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:31.984058Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d1bdd4f7-3e18-4454-b60c-71a3f0b57f63 · outbound

This paper cites Oxford university press, 2013.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Oxford university press, 2013

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.059656Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc004b90-0eb1-430a-aa94-6593d72fbea7 · outbound

This paper cites Convex pptimization.Cambridge UP, 2004.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Convex pptimization.Cambridge UP, 2004

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.163882Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5da91404-4c81-41c2-a1cd-150ed7fec67e · outbound

This paper cites Distributed opti- mization and statistical learning via the alternating direction method of multipliers.Foundations and Trends®in Machine learning, 3(1):1–122, 2011.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Distributed opti- mization and statistical learning via the alternating direction method of multipliers.Foundations and Trends®in Machine learning, 3(1):1–122, 2011

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.248853Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49b3497b-e9cb-4676-b581-b15d593335f5 · outbound

This paper cites Algorithm 457: finding all cliques of an undirected graph.Commu- nications of the ACM, 16(9):575–577, 1973.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Algorithm 457: finding all cliques of an undirected graph.Commu- nications of the ACM, 16(9):575–577, 1973

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.325409Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d85e0cb-54b9-4499-8db9-406b2f539594 · outbound

This paper cites Robust principal component analysis? Journal of the ACM (JACM), 58(3):1–37, 2011.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Robust principal component analysis? Journal of the ACM (JACM), 58(3):1–37, 2011

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.394508Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0a0142c5-994b-4f01-af90-11c3e0007037 · outbound

This paper cites A note on the problem of reporting maximal cliques.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming A note on the problem of reporting maximal cliques

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.462229Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0d9179aa-1f70-44db-b6dc-6f384aeb56cb · outbound

This paper cites Rank-sparsity incoherence for matrix decomposition.SIAM Journal on Optimization, 21(2):572–596, 2011.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Rank-sparsity incoherence for matrix decomposition.SIAM Journal on Optimization, 21(2):572–596, 2011

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.528338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7bcf85d2-7d14-4168-a3a9-0e49326e6560 · outbound

This paper cites Statistical-computational phase transitions in planted models: The high-dimensional setting.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Statistical-computational phase transitions in planted models: The high-dimensional setting

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.595226Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0b59559f-bfa5-4c64-8403-d2e3d4b42156 · outbound

This paper cites Detection and recovery of hidden submatrices.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Detection and recovery of hidden submatrices

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.665826Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 675beec8-cf21-401e-9370-d56afb912cdc · outbound

This paper cites A generalization of the Sherman-Morrison-Woodbury formula.Applied Mathe- matics Letters, 24(9):1561–1564, 2011.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming A generalization of the Sherman-Morrison-Woodbury formula.Applied Mathe- matics Letters, 24(9):1561–1564, 2011

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.742444Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 860af8eb-7f56-4927-aafd-a31ea50e3821 · outbound

This paper cites Finding approximately rank-one submatrices with the nuclear norm andℓ 1-norm.SIAM Journal on Optimization, 23(4):2502–2540, 2013.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Finding approximately rank-one submatrices with the nuclear norm andℓ 1-norm.SIAM Journal on Optimization, 23(4):2502–2540, 2013

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.819019Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cdf4ff55-ee7c-4ffb-b620-774ee064e5de · outbound

This paper cites Relations between average case complexity and approximation complexity.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Relations between average case complexity and approximation complexity

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.890320Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 53edb7ee-224a-495c-9f99-85e129c76177 · outbound

This paper cites Finding and certifying a large hidden clique in a semirandom graph.Random Structures & Algorithms, 16(2):195–208, 2000.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Finding and certifying a large hidden clique in a semirandom graph.Random Structures & Algorithms, 16(2):195–208, 2000

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:32.977582Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0affa2c1-9ebf-4310-8bba-5e4817775888 · outbound

This paper cites Community structure in jazz.Advances in complex systems, 6(04):565–573, 2003.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Community structure in jazz.Advances in complex systems, 6(04):565–573, 2003

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.065417Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2cd986bf-e574-4b8c-875a-98f97c427997 · outbound

This paper cites JHU Press, 2013.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming JHU Press, 2013

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.133843Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ebaedd7d-9e5c-40a0-87ec-e4014e96db2b · outbound

This paper cites Identification of a 5-protein biomarker molecular signa- ture for predicting Alzheimer’s disease.PloS One, 3(9):e3111, 2008.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Identification of a 5-protein biomarker molecular signa- ture for predicting Alzheimer’s disease.PloS One, 3(9):e3111, 2008

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.212332Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a4b0c7c4-374e-4112-97e9-bfa3f5232ce0 · outbound

This paper cites On the linear convergence of the alternating direction method of multipliers.Mathematical Programming, 162(1):165–199, 2017.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming On the linear convergence of the alternating direction method of multipliers.Mathematical Programming, 162(1):165–199, 2017

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.284983Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c2d6ed3-0cc9-47f6-8d49-7cb1c18e8d3e · outbound

This paper cites Impact of interference on multi-hop wireless network performance.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Impact of interference on multi-hop wireless network performance

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.350194Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 956cfcb3-ca91-4c3f-a3eb-6565684419a3 · outbound

This paper cites Reducibility among combinatorial problems.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Reducibility among combinatorial problems

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.414756Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 99b8ee45-103a-492e-baef-051e3ad2081f · outbound

This paper cites Ruling out PTAs for graph min-bisection, densek-subgraph, and bipartite clique.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Ruling out PTAs for graph min-bisection, densek-subgraph, and bipartite clique

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.475386Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c6749c1-5d4a-46a1-a9ec-97fb1925b151 · outbound

This paper cites AcM Press New York, 1993.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming AcM Press New York, 1993

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.548840Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b6ea1551-1d15-4b08-952c-9948b7a41c15 · outbound

This paper cites A survey on the densest subgraph problem and its variants.ACM Computing Surveys, 56(8):1–40, 2024.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming A survey on the densest subgraph problem and its variants.ACM Computing Surveys, 56(8):1–40, 2024

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.624511Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b7940e20-8cc7-4978-bd8f-6beda1ad99ee · outbound

This paper cites The dimension-free structure of nonhomoge- neous random matrices.Inventiones mathematicae, 214(3):1031–1080, 2018.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming The dimension-free structure of nonhomoge- neous random matrices.Inventiones mathematicae, 214(3):1031–1080, 2018

Reference 37

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.702633Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ccd8a6c3-9694-4396-b91b-7b090f998d7f · outbound

This paper cites an unresolved cited work.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.785347Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb4b82d6-e2b9-4832-a920-0e6c7984fe1d · outbound

This paper cites Maximum cliques in protein structure comparison.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Maximum cliques in protein structure comparison

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.867583Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d937ad82-e16e-48db-8e42-760336b93b8a · outbound

This paper cites Harnessing the mathematics of matrix decomposition to solve planted and maximum clique problem.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Harnessing the mathematics of matrix decomposition to solve planted and maximum clique problem

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:33.939223Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4106c591-8273-4da3-8fcb-9e98204b9ebe · outbound

This paper cites Maximum edge bi-clique via matrix decomposition.Journal of Industrial and Management Optimization, 21(11):6270–6294, 2025.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Maximum edge bi-clique via matrix decomposition.Journal of Industrial and Management Optimization, 21(11):6270–6294, 2025

Reference 41

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:34.007872Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8c1ae675-89c2-495b-a64e-865c2fc10956 · outbound

This paper cites Clique relaxation models in social network analysis.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Clique relaxation models in social network analysis

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:34.073072Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cb7639a4-e8c0-46fc-8c47-05476a618acd · outbound

This paper cites Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization.SIAM review, 52(3):471–501, 2010.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization.SIAM review, 52(3):471–501, 2010

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:34.129793Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2d68486e-9985-48ac-bf7b-b531139db097 · outbound

This paper cites Graph clustering.Computer Science Review, 1(1):27–64, 2007.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Graph clustering.Computer Science Review, 1(1):27–64, 2007

Reference 44

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:34.190233Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation faddf3c8-a582-491a-b6dc-e69be63f2e06 · outbound

This paper cites Sharp phase transitions in estimation with low-degree polynomials.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming Sharp phase transitions in estimation with low-degree polynomials

Reference 45

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:34.245689Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2700c4e6-6ceb-46de-8568-cfaf2a8de252 · outbound

This paper cites A semidefinite programming-based branch-and-cut algorithm for biclustering.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming A semidefinite programming-based branch-and-cut algorithm for biclustering

Reference 46

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:34.303925Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b472798-e795-4a55-a8d6-aaa6b42ebca4 · outbound

This paper cites The worst-case time complexity for generat- ing all maximal cliques and computational experiments.Theoretical computer science, 363(1):28–42, 2006.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming The worst-case time complexity for generat- ing all maximal cliques and computational experiments.Theoretical computer science, 363(1):28–42, 2006

Reference 47

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:34.367981Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6fbbb634-cd91-4b99-a018-d8cc66d9ffeb · outbound

This paper cites User-friendly tail bounds for sums of random matrices.Foundations of computational mathematics, 12:389–434, 2012.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming User-friendly tail bounds for sums of random matrices.Foundations of computational mathematics, 12:389–434, 2012

Reference 48

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:34.432526Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 01e5a685-9e9e-41b3-86fb-890c8a5d4286 · outbound

This paper cites An information flow model for conflict and fission in small groups.Journal of anthropological research, 33(4):452–473, 1977.

Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming An information flow model for conflict and fission in small groups.Journal of anthropological research, 33(4):452–473, 1977

Reference 49

Resolution: unresolved; no resolver link, observed 2026-08-03T12:17:34.505819Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers