{"as_of":"2026-08-14T17:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:58751538d23c1961406cbcd3ad0b00df417e231f2a8ab95200df8d132555d401","coverage":[{"denominator":300,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T19:10:23.858378Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2607.17118/citation-record","integrity":"/paper/2607.17118/integrity","json":"/paper/2607.17118/citation-record.json","paper":"/paper/2607.17118"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T19:10:13.124843Z","title":"Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:13.124843Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:4c349087b592a558767653403cbe4a33a3692e967a31a10a1e48dc60bc35adbb","observation_id":"2394e30c-38e4-4d27-b8a2-ac4f2b6ce8e8","resolution":{"observed_at":"2026-08-01T19:10:13.124843Z","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-01T19:10:13.284533Z","title":"In Proceedings of the 31st Conference On Learning Theory , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:13.284533Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:e8e893455403032fcdf684fbf464fec6101b93403a4591a49c14bfe37ba3331a","observation_id":"e69aa119-edc2-4350-8c05-742482c1db67","resolution":{"observed_at":"2026-08-01T19:10:13.284533Z","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-01T19:10:13.436235Z","title":"In Proceedings of The 28th Conference on Learning Theory , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:13.436235Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:f8ac694807105f3bbcfc495c8ac7e88e39a39a76558cffb4037ba76bcc42ebf7","observation_id":"c8e740cf-342a-4ee4-b652-38b905442a35","resolution":{"observed_at":"2026-08-01T19:10:13.436235Z","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-01T19:10:13.555132Z","title":"Proceedings of the Thirty Eighth Conference on Learning Theory , series =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:13.555132Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:7613fe9f906b04a7d93ea7d543cb28e193c79a8cba0f6175ea981a2d15045144","observation_id":"a8602cd5-b488-493f-bac4-a12a70ce296d","resolution":{"observed_at":"2026-08-01T19:10:13.555132Z","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-01T19:10:13.719296Z","title":"IEEE Transactions on Signal and Information Processing over Networks , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:13.719296Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:12f97e8cc96ba29570cf2ca451fff5702f5ec7e975c261bbbec8aaf2ed4585e0","observation_id":"49d95653-87e8-443d-8176-395c8261cbc1","resolution":{"observed_at":"2026-08-01T19:10:13.719296Z","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-01T19:10:13.863490Z","title":"Proceedings of the Thirty-Second Conference on Learning Theory , pages =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:13.863490Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:94e2c1445c3d9294d6923dc5788fe7dfd9ac34b0426f44415b16e3f4e25be1bd","observation_id":"bd2ee05f-da37-4e09-8130-4fd6760b9d53","resolution":{"observed_at":"2026-08-01T19:10:13.863490Z","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-01T19:10:14.041762Z","title":"Random Structures & Algorithms , volume=","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:14.041762Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:e86f15530756f355fa16d25463c0aa95dd9dc12a5695975738200b7a3d722e79","observation_id":"c5082123-f8ff-423f-8ed7-3c3ceb971363","resolution":{"observed_at":"2026-08-01T19:10:14.041762Z","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-01T19:10:14.155060Z","title":"Testing k-wise and almost k-wise independence , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:14.155060Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:728627eafca6dd9cd47bfe54161b7e8e46aa2ce141ee71b44fae76a900cc40a8","observation_id":"c756b1b5-923f-491b-a532-d3a5bddf4fb4","resolution":{"observed_at":"2026-08-01T19:10:14.155060Z","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-01T19:10:14.292801Z","title":"Computational and statistical boundaries for submatrix localization in a large noisy matrix","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:14.292801Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:168e15348d73adf621c4c4b75863399439206254b6fa685effbd7751a68f4fb3","observation_id":"e7704f13-3aaa-4d86-88ed-4068df52c5a1","resolution":{"observed_at":"2026-08-01T19:10:14.292801Z","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-01T19:10:14.394273Z","title":"Sparse pca via covariance thresholding , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:14.394273Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:58434a70f602b30361dd5cba6e3920e69b9223cc889476ec4624cad3e7c622d3","observation_id":"91b78903-17ab-47f2-8adc-4f46e4ddaac0","resolution":{"observed_at":"2026-08-01T19:10:14.394273Z","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-01T19:10:14.554764Z","title":"Large cliques elude the Metropolis process , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:14.554764Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:54859fe42b184cccd3e80e5d036b27ad39f44f64090c9b2d593b1cc82503a3be","observation_id":"175ae32a-1723-4b89-8a64-fbdf719513ae","resolution":{"observed_at":"2026-08-01T19:10:14.554764Z","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-01T19:10:14.722241Z","title":"Finite exchangeable sequences , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:14.722241Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:e10060589a127e483bdbb0aff66b6772bee56b9152b2985383b9f61234655d1c","observation_id":"78a3bfbc-a038-40ff-9726-ee9bf989192f","resolution":{"observed_at":"2026-08-01T19:10:14.722241Z","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-01T19:10:14.825483Z","title":"Finding hidden cliques of size","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:14.825483Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:0fc1893670a86436428dbe066baa22228f1e84f2f5a5318fa9107ed84a18060d","observation_id":"d684e22a-c056-498f-b9dc-51688004eda6","resolution":{"observed_at":"2026-08-01T19:10:14.825483Z","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-01T19:10:14.962785Z","title":"Using More Data to Speed-up Training Time","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:14.962785Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:b2b4a92e18a7782fcea4f37eb6f1283acf676abff9150f65d3d435eafd806d4d","observation_id":"0cae9d72-6c59-4191-854a-faac353eb01a","resolution":{"observed_at":"2026-08-01T19:10:14.962785Z","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-01T19:10:15.118193Z","title":"Bulletin of the American Mathematical Society , number =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:15.118193Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:4c649fedfe43dca81837f647b418cb9b4cb9cb40720256db2a6c8f25b9ec2731","observation_id":"e98c6ec7-99d3-422e-8f93-27d226d676d1","resolution":{"observed_at":"2026-08-01T19:10:15.118193Z","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-01T19:10:15.272654Z","title":"Minimax Rates of Estimation for Sparse PCA in High Dimensions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:15.272654Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:a17f9fd9d666ec58ee6c7daf3d89ac7d475c9cb2f041976c7672e34c1ffb98e0","observation_id":"f1179abf-450f-403d-b707-b309645f4e59","resolution":{"observed_at":"2026-08-01T19:10:15.272654Z","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-01T19:10:15.392483Z","title":"Do semidefinite relaxations solve sparse PCA up to the information limit? , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:15.392483Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:3be07e7ab7109437e281ad069a6c393f239225b4a6b956884eeef4f8f63ca7f1","observation_id":"600d73cd-bb8a-4d9a-9aae-9d6272c9aa8a","resolution":{"observed_at":"2026-08-01T19:10:15.392483Z","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-01T19:10:15.518492Z","title":"Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:15.518492Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:26f2daa02e36e4cb071a9bbea0e30cbed06f5b8405fb06c9369e9521a40ceb73","observation_id":"e106841a-51bc-4531-9a6c-482a96d528f7","resolution":{"observed_at":"2026-08-01T19:10:15.518492Z","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-01T19:10:15.644792Z","title":"Regularized estimation of large covariance matrices , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:15.644792Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:872e3ee48f09be3c63e48fd4030d2f13fe7d05e2680098fd64462a05f59900c5","observation_id":"9b7a1f83-72c5-4824-add5-e4829d7bfd0a","resolution":{"observed_at":"2026-08-01T19:10:15.644792Z","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-01T19:10:15.809716Z","title":"Adaptive thresholding for sparse covariance matrix estimation , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:15.809716Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:d06692cd28e7df5dd9576e38aa2027e9b0213f826e050cded5fd804e449f59fa","observation_id":"d2fd5d3b-b6c8-4d0d-af57-dab310208d10","resolution":{"observed_at":"2026-08-01T19:10:15.809716Z","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-01T19:10:15.923505Z","title":"On information plus noise kernel random matrices , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:15.923505Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:4c91e84523b529f09e6905127afa9cfaafcc439ada32a1940fe072413952fab7","observation_id":"f8d50894-96f2-4373-9022-ab2bba7cdf78","resolution":{"observed_at":"2026-08-01T19:10:15.923505Z","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-01T19:10:16.107636Z","title":"Optimal solutions for sparse principal component analysis , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:16.107636Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:c8060696ba54aeaaaf7435ec4956d31ef8b18d9f2ba30306488bd70cdfda1b5f","observation_id":"0bc62f6e-ebd8-4f19-a9a7-502c5f7afdbb","resolution":{"observed_at":"2026-08-01T19:10:16.107636Z","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-01T19:10:16.269114Z","title":"Unpublished manuscript , Title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:16.269114Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:02044e8a1d5e8e8e22dfdb61d9026c0b76dce52ba0b0fb9bab8b93fdb30300b4","observation_id":"89245ca7-256c-4838-9350-64c6df1ea7d4","resolution":{"observed_at":"2026-08-01T19:10:16.269114Z","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-01T19:10:16.400282Z","title":"Asymptotics of sample eigenstructure for a large dimensional spiked covariance model , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:16.400282Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:c7a8c58803029c3a755b2cbd72e4be4f6b9e149f64f51875488243c378e63118","observation_id":"bbfd25ea-6ca1-4d30-b80f-5ff706741d95","resolution":{"observed_at":"2026-08-01T19:10:16.400282Z","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-01T19:10:16.542368Z","title":"Detecting positive correlations in a multivariate sample , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:16.542368Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:5deab674c1b3bee74ffda70e271377add8a3c9af7b1c15963b55bf73f498b0dd","observation_id":"0c0ae085-2212-43c5-9ef3-f401eb0c038d","resolution":{"observed_at":"2026-08-01T19:10:16.542368Z","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-01T19:10:16.681809Z","title":"Detection of correlations , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:16.681809Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:a230dbc7b9b5a5097fdffb63553d15d1f9689af7cee22aaf1c010ebc16cb4796","observation_id":"37118b69-c082-4f38-a495-39e63f298203","resolution":{"observed_at":"2026-08-01T19:10:16.681809Z","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-01T19:10:16.799173Z","title":"On combinatorial testing problems , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:16.799173Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:9dd352934168a715248b2440805a3d76544f87ca8ef7e797dea92285a9a009af","observation_id":"efd683fa-663c-4b29-a39a-b68f24ce8c6b","resolution":{"observed_at":"2026-08-01T19:10:16.799173Z","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-01T19:10:16.919359Z","title":"Finding a large hidden clique in a random graph , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:16.919359Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:1e32678897809fa15d6c4db4120a196ad0f234b486980f60215790bfc5b8cec7","observation_id":"d60ec69b-c321-4eea-9a45-2217a4866354","resolution":{"observed_at":"2026-08-01T19:10:16.919359Z","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-01T19:10:17.044898Z","title":"High-dimensional analysis of semidefinite relaxations for sparse principal components , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.044898Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:51228dd713d2ca69bfcbfb1af31ee97d99c6205c316a52975fbf2fe83c269401","observation_id":"1bc6c1b1-24dd-45ce-85a6-b367dcd8a1c8","resolution":{"observed_at":"2026-08-01T19:10:17.044898Z","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-01T19:10:17.137923Z","title":"Detection of a sparse submatrix of a high-dimensional noisy matrix , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.137923Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:2351be5692798a4b6ec203f3d7abe030514e60867fa5eee40dd67e32257c97e8","observation_id":"8bc05c53-94df-4350-9eaa-64e6b13849c5","resolution":{"observed_at":"2026-08-01T19:10:17.137923Z","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-01T19:10:17.213150Z","title":"Computational and statistical tradeoffs via convex relaxation , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.213150Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:48d9c288a08534f8958a08d1785f75dabb23534c73263884cd7297b72a177f54","observation_id":"d7c97d8f-e863-444d-b319-189189e40328","resolution":{"observed_at":"2026-08-01T19:10:17.213150Z","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-01T19:10:17.317380Z","title":"A Direct Formulation for Sparse PCA Using Semidefinite Programming","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.317380Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:c354961f76613c2056eb23f73df672d73e521a4ae2319583a1782f04090a79d6","observation_id":"b105b8e8-5b1c-45de-9ef5-1234876638bd","resolution":{"observed_at":"2026-08-01T19:10:17.317380Z","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-01T19:10:17.392232Z","title":"Optimal rates of convergence for covariance matrix estimation , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.392232Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:9c122eefe6b54f3ccbf5ff81e1aff66caa20454fb2d969f5b0664a6e015b4454","observation_id":"0d29c6b0-bf1e-41aa-8ad0-8deb7b51e526","resolution":{"observed_at":"2026-08-01T19:10:17.392232Z","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-01T19:10:17.461468Z","title":"On consistency and sparsity for principal components analysis in high dimensions , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.461468Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:62463b1b884dc84c7c657c4e4ea57020c1e326f56a8023129b09590ed6c74b89","observation_id":"964c6659-14b4-447b-b4a7-d42ea4f04d70","resolution":{"observed_at":"2026-08-01T19:10:17.461468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.07449","last_updated":"2016-04-25T21:08:48Z","snapshot_observed_at":"2026-07-06T04:54:03.876286Z","submitted_at":"2016-04-25T21:08:48Z","title":"Distribution-free Detection of a Submatrix","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.07449","snapshot_observed_at":"2026-08-01T19:10:17.602683Z","title":"arXiv preprint arXiv:1604.07449 , Title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.602683Z"},"links":{"cited_paper":"/paper/1604.07449","citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:046281697e939392307c9789234ba37a47282f4c9c5a8da97d596b97e0ccc2c7","observation_id":"49931576-997d-471a-ab0d-d2266b79667f","resolution":{"observed_at":"2026-08-01T19:10:17.602683Z","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-01T19:10:17.706741Z","title":"Wein , Journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.706741Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:b02d51e3fa5efc0c1948b6cff87db6d858b0443b379d59791e5b072c6c0e60c9","observation_id":"8016ec99-2b5e-4c84-a2df-bca66b5e6eaa","resolution":{"observed_at":"2026-08-01T19:10:17.706741Z","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-01T19:10:17.784959Z","title":"Resource Allocation for Statistical Estimation , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.784959Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:1ba4c6c5001c1f8b76f622cbe5c6bd7454390fb5a111e99dd7180dcbf038cd4d","observation_id":"84361462-da15-4c62-9150-9b74f8824f19","resolution":{"observed_at":"2026-08-01T19:10:17.784959Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.02435","last_updated":"2016-08-01T14:24:26Z","snapshot_observed_at":"2026-07-06T05:02:55.603844Z","submitted_at":"2016-07-08T16:12:47Z","title":"Optimal Rates of Statistical Seriation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.02435","snapshot_observed_at":"2026-08-01T19:10:17.851014Z","title":"arXiv preprint arXiv:1607.02435 , Title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.851014Z"},"links":{"cited_paper":"/paper/1607.02435","citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:4223dad9b279a82217976181e6261394a02baebe2d65eafa302ed3822777030b","observation_id":"0a1b2618-02d7-4567-aadd-16017108ed53","resolution":{"observed_at":"2026-08-01T19:10:17.851014Z","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-01T19:10:17.930130Z","title":"Volume ratio, sparsity, and minimaxity under unitarily invariant norms , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.930130Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:6546a6c1340b56a7a47f3380679a416d6dd7d44b4063e21f18e953d6d4a8d588","observation_id":"9f724f6e-3fb4-4925-904c-6b7fcf99799a","resolution":{"observed_at":"2026-08-01T19:10:17.930130Z","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-01T19:10:17.997648Z","title":"Sparse PCA via Covariance Thresholding , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:17.997648Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:c8da6dca48a06a3c5ccd43da623dc47f203f002d49783d6725d8188714316961","observation_id":"63a863ee-3ff1-40ac-8f15-ddf2af49dc39","resolution":{"observed_at":"2026-08-01T19:10:17.997648Z","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-01T19:10:18.055348Z","title":"Lower bounds on the performance of polynomial-time algorithms for sparse linear regression","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.055348Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:9223fc0badadd84bcb1c3629600a4a033f7020d2f2d625605fe86675a4664f92","observation_id":"625df5c8-6980-4320-b625-c9dca7f96099","resolution":{"observed_at":"2026-08-01T19:10:18.055348Z","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-01T19:10:18.125201Z","title":"Sparse principal component analysis and iterative thresholding , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.125201Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:05250df18fc06ba0869f08361ab5b959f88444cc40baccd08d178cbef8f6821d","observation_id":"ff2b2482-b137-4f86-82d2-a627e447e206","resolution":{"observed_at":"2026-08-01T19:10:18.125201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1311.0851","last_updated":"2017-06-04T20:46:43Z","snapshot_observed_at":"2026-07-06T03:27:21.656129Z","submitted_at":"2013-11-04T20:55:31Z","title":"Optimal Shrinkage of Eigenvalues in the Spiked Covariance Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.0851","snapshot_observed_at":"2026-08-01T19:10:18.196387Z","title":"arXiv preprint arXiv:1311.0851 , Title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.196387Z"},"links":{"cited_paper":"/paper/1311.0851","citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:814950db00a84d17162a7ba9f7d603f87b9ce5393a37ea345357eebab647b268","observation_id":"73d6f4a9-358f-4938-ad6f-67df798ea74a","resolution":{"observed_at":"2026-08-01T19:10:18.196387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1509.07269","last_updated":"2018-02-03T14:53:09Z","snapshot_observed_at":"2026-07-06T04:30:56.493270Z","submitted_at":"2015-09-24T08:20:38Z","title":"Testing in high-dimensional spiked models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1509.07269","snapshot_observed_at":"2026-08-01T19:10:18.273566Z","title":"arXiv preprint arXiv:1509.07269 , Title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.273566Z"},"links":{"cited_paper":"/paper/1509.07269","citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:09a1e549c245d0c96c5e61fae6b3271c0c6d5802a3716454785b3ae64cad6ce7","observation_id":"49bbb9a5-7843-4afc-a119-d3262521bf5d","resolution":{"observed_at":"2026-08-01T19:10:18.273566Z","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-01T19:10:18.361870Z","title":"Joint density of eigenvalues in spiked multivariate models , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.361870Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:1f382bc72efd6976d23a7ca0e003cc73b3377dbf3822e56eb10c3216724011f4","observation_id":"2ccc7b84-2ba3-49b3-acff-77d72fea4cfb","resolution":{"observed_at":"2026-08-01T19:10:18.361870Z","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-01T19:10:18.427005Z","title":"Testing for high-dimensional geometry in random graphs , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.427005Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:96064c1bca4cf0cfb7d8dfa2c68eab8aee6d929a286b37c83d445951d7d5629b","observation_id":"a5dcc946-fb9d-4c1b-b8a7-668bafc08d05","resolution":{"observed_at":"2026-08-01T19:10:18.427005Z","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-01T19:10:18.472659Z","title":"Minimax estimation in sparse canonical correlation analysis , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.472659Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:16ed584ffb729252df387691f37dce9afe54ff925ce91999069cec30e1ba2a08","observation_id":"01362d76-c3f3-4fb8-bdaa-406163ff1fd0","resolution":{"observed_at":"2026-08-01T19:10:18.472659Z","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-01T19:10:18.518125Z","title":"Sum-of-squares lower bounds for sparse pca , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.518125Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:0a239970cd3e8c36bbfe91ed2c85aebe6ef37bd27c9cc5c9e85feb986246d7d9","observation_id":"ea45554d-f52a-4a14-b93d-dca97a29d27e","resolution":{"observed_at":"2026-08-01T19:10:18.518125Z","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-01T19:10:18.583444Z","title":"ETH hardness for densest-k-subgraph with perfect completeness , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.583444Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:71f249a974ce8ad0a64302d15962a8e5adad7f8a01291861ffb689fee34cb16c","observation_id":"571a33d3-188c-4725-9a8b-2244638a7e84","resolution":{"observed_at":"2026-08-01T19:10:18.583444Z","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-01T19:10:18.633907Z","title":"On the limitation of spectral methods: From the gaussian hidden clique problem to rank-one perturbations of gaussian tensors , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.633907Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:cb020d0455d9434f2cb3d9fe317007429416f9cf5c5fba555438efb4c35264f5","observation_id":"e3f45498-557b-402b-9a35-27e6c8d5c1dc","resolution":{"observed_at":"2026-08-01T19:10:18.633907Z","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-01T19:10:18.726215Z","title":"Tensor principal component analysis via sum-of-square proofs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.726215Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:e39f4e6e31a90bb79abe433e2a50d961923d9fe7aa4679438c430149b45419b4","observation_id":"0fc696a1-1564-4704-b739-a0901c5e5f47","resolution":{"observed_at":"2026-08-01T19:10:18.726215Z","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-01T19:10:18.731398Z","title":"Computational Limits for Matrix Completion","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.731398Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:d6980eeaef0a8f81d17f981a622940a92dfdc46d1299d136244d99c3a484a2e7","observation_id":"32b0bb4a-ea30-4cfc-b161-f413b893283a","resolution":{"observed_at":"2026-08-01T19:10:18.731398Z","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-01T19:10:18.736328Z","title":"Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.736328Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:dee5f4ee1fabd8cdfa20ebec181574193f996d6916d905d96cc044b0049bafdc","observation_id":"f92c5d66-b71d-4464-84da-5e6981cedc36","resolution":{"observed_at":"2026-08-01T19:10:18.736328Z","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-01T19:10:18.815615Z","title":"Proceedings of The 28th Conference on Learning Theory , pages =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.815615Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:0498e6ed1a42ab3b8667869ecf76289f7a2071216006a2b3b42d7ada9fadbd27","observation_id":"45f6da5f-b367-4d71-9783-d871057890e9","resolution":{"observed_at":"2026-08-01T19:10:18.815615Z","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-01T19:10:18.892159Z","title":"Optimal estimation and rank detection for sparse spiked covariance matrices , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.892159Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:0fb4030417f1d21a247febbf55d9ffbdec45dd7196be5d35b399d399dc38a1a9","observation_id":"fd66b44c-5f94-4d27-8e30-f3d332dac7c6","resolution":{"observed_at":"2026-08-01T19:10:18.892159Z","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-01T19:10:18.976457Z","title":"Computational barriers in minimax submatrix detection , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:18.976457Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:29ca07bc67907d7e182734560d0551d33cb45ef86bdb6616107d8ddea8e5ad70","observation_id":"bbd03cdf-ab36-41f6-86ee-b10a65e4db8d","resolution":{"observed_at":"2026-08-01T19:10:18.976457Z","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-01T19:10:19.062299Z","title":"Estimation of functionals of sparse covariance matrices , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:19.062299Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:22ba5dca2cfde090cc1a04ab2d7e7692ce38bba0e4ba4cbb222666a678c85c87","observation_id":"da9002eb-ea9e-4956-a254-997b90cd2e93","resolution":{"observed_at":"2026-08-01T19:10:19.062299Z","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-01T19:10:19.180609Z","title":"Average-case hardness of RIP certification , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:19.180609Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:9f7abd7ac96c31c71661bcd27399c855af00d2e1b71f85230028ab8c6b00e32b","observation_id":"090ad9c6-0f54-4ccc-8c09-15aac5ab82b7","resolution":{"observed_at":"2026-08-01T19:10:19.180609Z","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-01T19:10:19.313043Z","title":"Statistical and computational trade-offs in estimation of sparse principal components , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:19.313043Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:d3c492547132484cfde706be07c4ca45ec892784c6a440ae941ec67ac6bf95f1","observation_id":"1667d7b9-e664-4324-a8a8-b803e6510453","resolution":{"observed_at":"2026-08-01T19:10:19.313043Z","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-01T19:10:19.462199Z","title":"Optimal detection of sparse principal components in high dimension , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:19.462199Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:61b493f54677fe2d5be4cfce775ced0ba411b7e6b58600b38b9e8a26d7984ab9","observation_id":"df30e6eb-7816-40d0-af93-8eaf7127b735","resolution":{"observed_at":"2026-08-01T19:10:19.462199Z","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-01T19:10:19.611547Z","title":"Proceedings of the 26th Annual Conference on Learning Theory , pages =","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:19.611547Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:75dce890fa63a3c1c2e7859e03a559a1b83f6d58cd939cae1af787bd8b233341","observation_id":"c80f59fe-6f8c-4e67-98af-14ee8269a15e","resolution":{"observed_at":"2026-08-01T19:10:19.611547Z","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-01T19:10:19.714464Z","title":"Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:19.714464Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:74f2fc2f7d6599bace4969cb71a6a85a1a5855e8bc5f3c12bff6f139bc14cf8e","observation_id":"1fa22ec1-7c98-496d-be93-8244026681de","resolution":{"observed_at":"2026-08-01T19:10:19.714464Z","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-01T19:10:19.875464Z","title":"Fourier pca , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:19.875464Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:34bf1cb5b8f449579b5e02bb54fc2b7f612dace0bb085006f0a99abba99ea01f","observation_id":"9ab62804-e05d-40d4-b76a-eba650b090a4","resolution":{"observed_at":"2026-08-01T19:10:19.875464Z","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-01T19:10:20.038811Z","title":"Improved approximation of linear threshold functions , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:20.038811Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:9a87210fa649ca4c0b195cd2a6e632266d6f879ebf5aaf30aafff016e20973ea","observation_id":"0c39b92a-fcc8-4576-8ce2-799daef7be6d","resolution":{"observed_at":"2026-08-01T19:10:20.038811Z","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-01T19:10:20.203379Z","title":", Date-Added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:20.203379Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:e18e38edf0a61ae3504906f71d531e90abc61f39d520fce3a582c56eca728978","observation_id":"fce921f1-b64d-4a4b-a120-247ba8ab21f0","resolution":{"observed_at":"2026-08-01T19:10:20.203379Z","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-01T19:10:20.350040Z","title":"CoSaMP: Iterative signal recovery from incomplete and inaccurate samples , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:20.350040Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:e58d4fe77bc609cd45d2522d197fd8b718f175e588fdfb6d8f4a3038b5aa5eaf","observation_id":"3eb73ed8-7130-4d80-9a60-ffbeea86065a","resolution":{"observed_at":"2026-08-01T19:10:20.350040Z","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-01T19:10:20.473309Z","title":"Subspace pursuit for compressive sensing signal reconstruction , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:20.473309Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:45ee7937088bb659ab51922f7374ed6f01c54e70acf9422cba809545c200b50b","observation_id":"bd1674d4-adff-410f-9eb4-77a042493a11","resolution":{"observed_at":"2026-08-01T19:10:20.473309Z","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-01T19:10:20.639385Z","title":"Adaptive forward-backward greedy algorithm for learning sparse representations , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:20.639385Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:896373339a9036b62c63d0427f45039723efc905351c284b8ddc41e90aa82342","observation_id":"e7c122c5-4128-4933-a62a-2d4065c384d0","resolution":{"observed_at":"2026-08-01T19:10:20.639385Z","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-01T19:10:20.807728Z","title":"On the consistency of feature selection using greedy least squares regression , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:20.807728Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:309890688400a35b2e982ff2cb3fc5161b663c5dd19ec3e1e27735e56cc57c0b","observation_id":"feb9c2e0-0c1e-4332-8b74-a475595259b6","resolution":{"observed_at":"2026-08-01T19:10:20.807728Z","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-01T19:10:20.953773Z","title":"Atomic decomposition by basis pursuit , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:20.953773Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:91545f9719441820d7b6748b3ddf7d51da82a761187a916821c182d0a17cd99f","observation_id":"51faaa9a-db57-4a4b-824a-52c2ad9b3be0","resolution":{"observed_at":"2026-08-01T19:10:20.953773Z","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-01T19:10:21.083020Z","title":"Greedy approximation , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:21.083020Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:48b9912581511af62be2674aa011427b883baf48c5dddebb6ad4796a6650406c","observation_id":"16cfecbb-d6ba-46f3-8815-50c1c118a537","resolution":{"observed_at":"2026-08-01T19:10:21.083020Z","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-01T19:10:21.198257Z","title":"Additive logistic regression: a statistical view of boosting (with discussion and a rejoinder by the authors) , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:21.198257Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:b8203758c2c65a1331ccd0c3593e54e0473fa242782b5e08a63b48cb3811c4d0","observation_id":"2def44a7-d978-4cc1-aa69-e7bca58085d5","resolution":{"observed_at":"2026-08-01T19:10:21.198257Z","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-01T19:10:21.302935Z","title":"High dimensional variable selection , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:21.302935Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:22c77c8207752e06ffe65893cc1414d59746624dcebdee0db5a0e37c6ef81574","observation_id":"8b9cf60e-a530-41f0-b19b-89c88d87ca71","resolution":{"observed_at":"2026-08-01T19:10:21.302935Z","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-01T19:10:21.402617Z","title":", Date-Added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:21.402617Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:a5d7147fe9cf65d19d7e702be252fe762c4360df06c61ee2747196988936b9d3","observation_id":"6fb3af5f-1e32-4775-a62b-0e1705c90c1d","resolution":{"observed_at":"2026-08-01T19:10:21.402617Z","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-01T19:10:21.518397Z","title":"and Banavar, J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:21.518397Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:7632a73224d2ecc10ed7da962e1b060e08800e242fcb753a618671d9605b7eeb","observation_id":"9f5fda40-76fd-4fe9-b441-ab994205e7db","resolution":{"observed_at":"2026-08-01T19:10:21.518397Z","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-01T19:10:21.588019Z","title":"and Ollion, C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:21.588019Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:9f66c55f7af39fe61537c2bd5b65a18f2664316c6a6a1e7f2b5d07e8d21841cd","observation_id":"b7edba93-7a1e-4652-b66f-29453296c3ec","resolution":{"observed_at":"2026-08-01T19:10:21.588019Z","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-01T19:10:21.708383Z","title":"Constraint satisfaction problems and neural networks: A statistical physics perspective , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:21.708383Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:65c50a1f9eb5b5af415d8a4295b78e83ae767a7ce1725d48bb19c0fe99428712","observation_id":"2ab686d0-7559-4240-a416-02dacc406433","resolution":{"observed_at":"2026-08-01T19:10:21.708383Z","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-01T19:10:21.820180Z","title":", Date-Added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:21.820180Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:3214705af4f67bc2b0f12268567c433a66aebf502fc60fdb5618bfa6fbd93065","observation_id":"02302c3f-cc11-4e8b-996a-79e53ab84273","resolution":{"observed_at":"2026-08-01T19:10:21.820180Z","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-01T19:10:21.938157Z","title":"and Sejnowski, T","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:21.938157Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:500bc897d06860f6041a1f2d4a2faab1f385a6d79da276959abb2a0b46e2a6e2","observation_id":"c3477298-23fd-4650-8cc6-134a4131912b","resolution":{"observed_at":"2026-08-01T19:10:21.938157Z","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-01T19:10:22.033467Z","title":"and Hinton, G","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:22.033467Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:6619188e5f6fc999ba9453340b18b21822b4ce9a5b1d270f3c11da431c2b0e17","observation_id":"581b8ede-4c3d-491d-9417-236820647e8d","resolution":{"observed_at":"2026-08-01T19:10:22.033467Z","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-01T19:10:22.158123Z","title":"Evolutionary information for specifying a protein fold , Volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:22.158123Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:0f3f0ee8911b7609842c4d456d2bd1eb0e12b98d76e1f37a7a90563f7b663447","observation_id":"e745db1c-26bd-4e21-8336-8f7d35f59676","resolution":{"observed_at":"2026-08-01T19:10:22.158123Z","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-01T19:10:22.253251Z","title":"and Monasson, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:22.253251Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:ca7f2ac9c6f3f2d240da9b1ffc2c48b2a74ba63b73347ea837ad5a17be499374","observation_id":"040bb45b-b385-410b-947d-6881dd3eaafc","resolution":{"observed_at":"2026-08-01T19:10:22.253251Z","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-01T19:10:22.363977Z","title":"and Walczak, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:22.363977Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:a892213541305569dbda0df55c39fffbdc1c876a585d200334197033fc21a68c","observation_id":"f4cd8b7c-a2d3-484f-bc92-7feef43cee14","resolution":{"observed_at":"2026-08-01T19:10:22.363977Z","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-01T19:10:22.514566Z","title":"and Aurell, E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:22.514566Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:e8812979d9f89a71646397c0761baa7f8910dff07c58dd72f38ca03010f96aeb","observation_id":"55bfcbe0-ba49-4d56-8944-da805528db4f","resolution":{"observed_at":"2026-08-01T19:10:22.514566Z","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-01T19:10:22.605359Z","title":"and Ricci-Tersenghi, F","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:22.605359Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:41d082f716f81b221c96201530fe1f1254cd6a71083c32530c321cd7ba578767","observation_id":"179b93c6-d53a-4aa5-9bbb-3dc8fbffba72","resolution":{"observed_at":"2026-08-01T19:10:22.605359Z","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-01T19:10:22.710044Z","title":"Advanced mean field methods: Theory and practice , Year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:22.710044Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:cb9b88ba82eca12553199d7323510845325dfb445d4ef5071759ae553e048d59","observation_id":"1e659a70-ca49-4646-bc7c-6e2cc40a6b79","resolution":{"observed_at":"2026-08-01T19:10:22.710044Z","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-01T19:10:22.811530Z","title":"and White, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:22.811530Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:f691dab4be2c2a5ee1a47e75ad00657b5da3bd503b6417ff65271a691561de6c","observation_id":"e2b18e30-e515-46d4-b995-7e24c02d2033","resolution":{"observed_at":"2026-08-01T19:10:22.811530Z","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-01T19:10:22.883893Z","title":"and Leibler, S","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:22.883893Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:09c875af0940e5b264c256ae46a94a4fae71a7cf03a35f2a44958bfa9f649298","observation_id":"033597d4-6b3e-4f16-a2f3-c1aa41562b88","resolution":{"observed_at":"2026-08-01T19:10:22.883893Z","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-01T19:10:22.953287Z","title":"and Berry, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:22.953287Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:d5c8fcb68cfdc000722fcaea904327e8421fe56c5dfb7d2e93dabd39e82bae16","observation_id":"0514ba0a-12d7-4b53-a37b-7f5666ffff77","resolution":{"observed_at":"2026-08-01T19:10:22.953287Z","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-01T19:10:23.029656Z","title":"and Samorodnitsky, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.029656Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:f9abd4b10596867b4fcd51d8f2c30d0a747220936f98ee1edaf9a84ba4671599","observation_id":"27e6ed50-f76e-4151-a8fa-56c2db0d9417","resolution":{"observed_at":"2026-08-01T19:10:23.029656Z","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-01T19:10:23.108498Z","title":", Date-Added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.108498Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:a9e0ba51b55ada55dd010be3fc398b092576235885aac42c9c2e195feb4aa16c","observation_id":"64a3be8d-56d5-4923-979a-90e62cbda32d","resolution":{"observed_at":"2026-08-01T19:10:23.108498Z","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-01T19:10:23.171130Z","title":", Date-Added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.171130Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:1f1d6ebf19ab696ee938cb0b795c5096f0d0f0ef0c93e131da29b79422674e57","observation_id":"35a55940-8228-44ff-8891-5049d006a46b","resolution":{"observed_at":"2026-08-01T19:10:23.171130Z","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-01T19:10:23.280961Z","title":", Date-Added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.280961Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:7f29c88ff855fef4a26d0f5207979605993f1cbe2343a8dd60c54c168b3ca15b","observation_id":"5d028a87-2ee0-4895-9554-86d4e7870418","resolution":{"observed_at":"2026-08-01T19:10:23.280961Z","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-01T19:10:23.362909Z","title":", Booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.362909Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:16b6008ecfa92d79e7f9c218c70da77c933f404c3a6e75d259d9426b0c6ae5b2","observation_id":"2e669179-e0ad-436f-88f8-f9d1be10e201","resolution":{"observed_at":"2026-08-01T19:10:23.362909Z","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-01T19:10:23.457319Z","title":"and Srikant, R","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.457319Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:9553fa7beecc343be50f9956e459d1368dbbbc3d5de4ea6c49c335174995a3a6","observation_id":"3322d0a0-dae5-494b-a24e-c9a0241f617a","resolution":{"observed_at":"2026-08-01T19:10:23.457319Z","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-01T19:10:23.519631Z","title":"and Wainwright, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.519631Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:5d623ce2434d2c64f9e38b313fb3cacce0f402366e52f0040a362f8b06e77c20","observation_id":"c4722e0f-969b-4877-a8a4-2c5c5b7d9a4a","resolution":{"observed_at":"2026-08-01T19:10:23.519631Z","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-01T19:10:23.600896Z","title":"and Ravikumar, P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.600896Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:3d28ac9a41184a78048563000c3cc7d539c842893dc40d33ffefb0cea184c7f8","observation_id":"65102260-ae06-4e99-9ff8-9897f7868765","resolution":{"observed_at":"2026-08-01T19:10:23.600896Z","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-01T19:10:23.748428Z","title":"and B\\\"uhlmann, P","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.748428Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:2a983d49167e698004e73e7e43c32e044d9f324882a0b5ded5eeeadb53a53454","observation_id":"e361655c-0758-4ba6-88bf-12c90a724c91","resolution":{"observed_at":"2026-08-01T19:10:23.748428Z","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-01T19:10:23.831195Z","title":", Date-Added =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.831195Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:b62fcf53a7fc00d920a7b5c32023b3a11d9072c5b68af59c2d4cca08bac57aee","observation_id":"0e9c50c0-b10f-441c-88c1-0d90e1d801ab","resolution":{"observed_at":"2026-08-01T19:10:23.831195Z","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-01T19:10:23.858378Z","title":"and Jerrum, M","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:23.858378Z"},"links":{"citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:59bb424207fa1ac62d4c2f1f3bdb0d7670f1d62b724fd171787d65af85943778","observation_id":"13814b54-1552-4b23-8bf7-3a3da28e54e3","resolution":{"observed_at":"2026-08-01T19:10:23.858378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":300},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 100 of 300 outbound references and 0 inbound Pith citation observations for arXiv:2607.17118."}