{"as_of":"2026-08-15T22:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d3d1915458b46c989f7d9798d0583d27ba7b031e42b1095bb0e56ee37b785289","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:50:46.278639Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T14:25:49.037114Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20954","snapshot_observed_at":"2026-07-30T14:25:49.037114Z","title":"Barbier, arXiv preprint arXiv:2505.20954 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27000","last_updated":"2026-07-29T14:57:26Z","snapshot_observed_at":"2026-08-03T16:30:28.238940Z","submitted_at":"2026-07-29T14:57:26Z","title":"On the robustness of noisy solutions in non-convex neural networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-30T14:25:49.037114Z"},"links":{"cited_paper":"/paper/2505.20954","citing_paper":"/paper/2607.27000"},"observation_digest":"sha256:d7d840a4494a3a577f7f25f8e3fce75339d5881d861117d29e400728c744b9bb","observation_id":"ce61b18f-7237-4f82-a332-7ec7a2a375f1","resolution":{"observed_at":"2026-07-30T14:25:49.037114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2505.20954/citation-record","integrity":"/paper/2505.20954/integrity","json":"/paper/2505.20954/citation-record.json","paper":"/paper/2505.20954"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:50:40.456851Z","title":"World Scientific Publishing Company, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:40.456851Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:f4f6af046e6d18915a667f000110cad6d015bc839c9ac4a7945daf5348503cc3","observation_id":"c35bbc58-7c32-4ba7-b7f6-7a9eb16223e1","resolution":{"observed_at":"2026-08-07T13:50:40.456851Z","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-07T13:50:40.500855Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:40.500855Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:67694512bd20e495115bed321bdba3cbb23a875c9c49e83dd21590a002b0a68a","observation_id":"3c092942-2be2-41e0-8498-fd952dfa86df","resolution":{"observed_at":"2026-08-07T13:50:40.500855Z","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-07T13:50:40.580420Z","title":"Dynamical instantons and activated processes in mean-field glass models.SciPost Physics, 10:002, 1 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:40.580420Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:fff4f37ebb9639bfb86273268cd8c52b1dc20dbc57c93aaa585a0ae03d2b992d","observation_id":"f6d5f5b3-3e5f-493c-961e-7f4686183163","resolution":{"observed_at":"2026-08-07T13:50:40.580420Z","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-07T13:50:40.693503Z","title":"Gibbs states and the set of solutions of random constraint satisfaction problems.Proceedings of the National Academy of Sciences, 104(25):10318–10323, 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:40.693503Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:3c9647af62ba65e2420644c714ede9c7c23d8fc46fa4e6accce41a0ef0dbd5bb","observation_id":"418552ea-9a06-4246-ae8b-fdbad467f179","resolution":{"observed_at":"2026-08-07T13:50:40.693503Z","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-07T13:50:40.761573Z","title":"Fear and Trevor Price","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:40.761573Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:a425958d2abbddfe01867d7e210bff93de37b82c95b050985f1c635613c93782","observation_id":"1a6b7618-13a7-4ec9-beec-f4eb450e31d4","resolution":{"observed_at":"2026-08-07T13:50:40.761573Z","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-07T13:50:40.850558Z","title":"Hatton, Onofrio Mazzarisi, Ada Altieri, and Matteo Smerlak","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:40.850558Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:fa222e0f5f46d7910d57d3fd45eeaf56ba5c1e94a2b48112b3d9f6c7546f1ff8","observation_id":"6ba7c442-58fe-4b78-aba1-627073aa1f7e","resolution":{"observed_at":"2026-08-07T13:50:40.850558Z","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-07T13:50:40.960779Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:40.960779Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:0991b4e5cef23d465bd7a333a4d38ac679d3db5b76ae5b645c2fba4dfc70049c","observation_id":"8019c15e-52a1-400d-b1a4-c36f226b7c45","resolution":{"observed_at":"2026-08-07T13:50:40.960779Z","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-07T13:50:41.062794Z","title":"Transition paths in potts-like energy landscapes: General properties and application to protein sequence models.Physical Review E, 108:024141, 8 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.062794Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:2572325f4ff4f7cf48bbe1a33c43e59e20284724943b3110fadbb05bf3b88de5","observation_id":"50802f0e-935e-4c63-b77c-e8b183d49e3c","resolution":{"observed_at":"2026-08-07T13:50:41.062794Z","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-07T13:50:41.134507Z","title":"Adaptation in protein fitness landscapes is facilitated by indirect paths.eLife, 5:e16965, 7 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.134507Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:1b005be81992b2e247cbfe5814248617ead5c29ab9c10f3a5675b2fd2db9465f","observation_id":"da22c0c8-89e3-4581-a98e-dd6ba87dca1d","resolution":{"observed_at":"2026-08-07T13:50:41.134507Z","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-07T13:50:41.217873Z","title":"Disordered systems insights on computational hardness.Journal of Statistical Mechanics: Theory and Experiment, 2022:114015, 11 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.217873Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:982b86b0bda604362bc385b56f60df116d6cae1d693f548ccf9333ac4f9a1c00","observation_id":"1aba7a0e-04e1-495d-bf8f-7245d8c05749","resolution":{"observed_at":"2026-08-07T13:50:41.217873Z","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-07T13:50:41.332078Z","title":"Analytic and algorithmic solution of random satisfiability problems.Science, 297(5582):812–815, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.332078Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:9da0742247590a49379d917c470a2941e8a6f33b4bcc03914dda5f1d6f6d4ddf","observation_id":"62acd6a3-abd9-4f66-9965-e93369c5543e","resolution":{"observed_at":"2026-08-07T13:50:41.332078Z","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-07T13:50:41.389589Z","title":"Donoho, Arian Maleki, and Andrea Montanari","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.389589Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:72283f57602e899592b8c540e48904d5f47f45644e6d42614eb795b7c3582518","observation_id":"3478de22-66db-4fc5-aa6c-8c7912b6896b","resolution":{"observed_at":"2026-08-07T13:50:41.389589Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05129","last_updated":"2019-07-03T20:53:42Z","snapshot_observed_at":"2026-08-14T18:16:05.734717Z","submitted_at":"2018-10-11T17:21:55Z","title":"The algorithmic hardness threshold for continuous random energy models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05129","snapshot_observed_at":"2026-08-07T13:50:41.455229Z","title":"The algorithmic hardness threshold for continuous random energy models.arXiv:1810.05129, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.455229Z"},"links":{"cited_paper":"/paper/1810.05129","citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:f615699e7773d7dbefa80e59375b9ef198c57fabbfc9710b0e97c46a43dc6880","observation_id":"17df1831-29d8-496c-a8ad-2da091f27687","resolution":{"observed_at":"2026-08-07T13:50:41.455229Z","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-07T13:50:41.559237Z","title":"A rugged yet easily navigable fitness landscape of antibiotic resistance.bioRxiv, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.559237Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:8df7192300ba9c196028f8798561f5728d2e7e4f80fddef53cd7c7c462a29055","observation_id":"bef420ee-db6c-45dd-9327-fcc036e2b5ab","resolution":{"observed_at":"2026-08-07T13:50:41.559237Z","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-07T13:50:41.720659Z","title":"The structure of genotype-phenotype maps makes fitness landscapes navigable.Nature Ecology and Evolution, 6:1742–1752, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.720659Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:fd00d3a747721ec33bef7cc7fc6aa6ace91a10008d076d912010545d582f7d39","observation_id":"c406b7a5-9c72-4fa5-b626-c73de34774d0","resolution":{"observed_at":"2026-08-07T13:50:41.720659Z","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-07T13:50:41.827686Z","title":"Macadangdang, Sara K","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.827686Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:218918c01d9de0aab8e7d6bd668a4d72f0341bae5a80f26c09db87353d6a7bb8","observation_id":"cfb43f5c-a77e-4344-876e-8eea1fb633b4","resolution":{"observed_at":"2026-08-07T13:50:41.827686Z","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-07T13:50:41.929595Z","title":"Infinite number of order parameters for spin-glasses.Physical Review Letters, 43(23):1754, 1979","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.929595Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:1b2c1ebf96b3baf83bca718957a162c605a043185b8484982f7af4f08c43b490","observation_id":"0b4e5491-4127-43e8-b06c-04d5bcdb9515","resolution":{"observed_at":"2026-08-07T13:50:41.929595Z","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-07T13:50:41.979331Z","title":"Thouless, Philip W","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:41.979331Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:e85b0374db5deca8cb256f2b9eaa82510afffb97f7e653bf66088c9f82ffdcfb","observation_id":"a2859b01-582a-4c02-9712-ca0a6250c794","resolution":{"observed_at":"2026-08-07T13:50:41.979331Z","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-07T13:50:42.052124Z","title":null,"venue":null,"work_id":null,"year":1932},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.052124Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:a7209a3f48a7988e021f6d77750e108aac3abed8496b918da753544a8af2ad47","observation_id":"b03f511e-eb20-4ba3-a8b7-99cd746efb78","resolution":{"observed_at":"2026-08-07T13:50:42.052124Z","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-07T13:50:42.167753Z","title":"Neural networks and physical systems with emergent collective computational abilities.Proceedings of the National Academy of Sciences, 79:2554–2558, 4 1982","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.167753Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:b414f752b9270950c7a16887ce51021cef6082911e2319595d13520782e33fad","observation_id":"f18c1d92-429f-4f47-94e4-7596ed4dcd18","resolution":{"observed_at":"2026-08-07T13:50:42.167753Z","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-07T13:50:42.243896Z","title":"Optimal storage properties of neural network models","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.243896Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:4a4137919a9429095fc1422daedcf800eb52221c509a58f136ec4d4b3405480d","observation_id":"774c8412-e80e-4401-a69e-8f33672ae63a","resolution":{"observed_at":"2026-08-07T13:50:42.243896Z","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-07T13:50:42.315357Z","title":"The overlap gap property: A topological barrier to optimizing over random structures.Proceedings of the National Academy of Sciences, 118(41), 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.315357Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:4db485a28c6fd759e5a8605f2519d68b7fec6717e1abfbcbb028d3e843a2c463","observation_id":"9f625eba-00d4-4110-b4cc-e84572f102d2","resolution":{"observed_at":"2026-08-07T13:50:42.315357Z","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-07T13:50:42.416046Z","title":"On the solution-space geometry of random constraint satisfaction problems.Random Structures & Algorithms, 38:251–268, 5 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.416046Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:0bf444e6d16fecea19fbaa3651beaa47fa0efcb2341b5a59536606c681d08675","observation_id":"9b4f146e-ca18-4e4e-8792-03de8e95a64c","resolution":{"observed_at":"2026-08-07T13:50:42.416046Z","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-07T13:50:42.478252Z","title":"Limits of local algorithms over sparse random graphs","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.478252Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:2d1c8fb24f45c63fad584a1157c4f489e9c2a1f6a5067437eaf2da19bc27a65e","observation_id":"facc0b5b-11c6-4bcb-b007-f59def07e3d7","resolution":{"observed_at":"2026-08-07T13:50:42.478252Z","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-07T13:50:42.555323Z","title":"Probability distribution of molecular evolutionary trees: A new method of phylogenetic inference.Journal of Molecular Evolution, 43:304–311, 9 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.555323Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:4e495192a2dc43f9bf5d23cd6575021d4dd252df054b8689d94aedab048deae7","observation_id":"450de66c-aa44-4a61-9392-22e27fbaa3c1","resolution":{"observed_at":"2026-08-07T13:50:42.555323Z","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-07T13:50:42.651337Z","title":"Huelsenbeck, Fredrik Ronquist, Rasmus Nielsen, and Jonathan P","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.651337Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:2b73af82ad428c4a118698a9c61b6fff57fc1c05fcf9eafc4414d39c6fc78df9","observation_id":"97798e41-0980-4800-b1e3-64587c29eaea","resolution":{"observed_at":"2026-08-07T13:50:42.651337Z","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-07T13:50:42.750790Z","title":"Malatesta, Gabriele Perugini, Fabrizio Pittorino, and Luca Saglietti","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.750790Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:912d8243fb88970e86632cd917d7468b5a9c6fb3570383529ba5fab02e46ac2e","observation_id":"f71777cb-0ed4-474f-8dd6-bb2675a291e0","resolution":{"observed_at":"2026-08-07T13:50:42.750790Z","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-07T13:50:42.845226Z","title":"Storage capacity of memory networks with binary couplings","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.845226Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:d1ac08d4c37acf662584988fc04cd805cab6d4c8cde5c97132701fb256ced135","observation_id":"41610513-8438-4042-a857-b60eb072f1d6","resolution":{"observed_at":"2026-08-07T13:50:42.845226Z","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-07T13:50:42.936299Z","title":"Clustering of solutions in the symmetric binary perceptron.Journal of Statistical Mechanics: Theory and Experiment, 2020(7):073303, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:42.936299Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:a478a24b8e910426ce348603dde487e753381f6a4059a2b52dd993ebabf169ef","observation_id":"5811c034-5cfa-4aeb-b1c8-97cb8b04c6e0","resolution":{"observed_at":"2026-08-07T13:50:42.936299Z","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-07T13:50:43.034884Z","title":"Storage capacity in symmetric binary perceptrons.Journal of Physics A: Mathematical and Theoretical, 52(29):294003, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:43.034884Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:98cac6b16f22e5c1fd255801ff7a44ba512ad4799146a9405da8df8840c53702","observation_id":"4a553858-eea8-4ab7-8082-5eadf0b4fd64","resolution":{"observed_at":"2026-08-07T13:50:43.034884Z","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-07T13:50:43.135648Z","title":"Learning by message passing in networks of discrete synapses.Physical review letters, 96(3):030201, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:43.135648Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:d0976ab5df233b07961530b7acb93d477efec256ca34b9ecb2b5f319ba989be2","observation_id":"7b2dcab7-355a-4b5a-b41b-f2da2b0bbc10","resolution":{"observed_at":"2026-08-07T13:50:43.135648Z","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-07T13:50:43.236107Z","title":"On-line balancing of random inputs.Random Structures & Algorithms, 57(4):879–891, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:43.236107Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:5466e16cfb4d06ab948e07c066165df3ca051a0d74c438ea99867f3d6d002570","observation_id":"93374dc2-e345-46f7-931c-658112ad962b","resolution":{"observed_at":"2026-08-07T13:50:43.236107Z","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-07T13:50:43.333526Z","title":"On the atypical solutions of the symmetric binary perceptron.Journal of Physics A: Mathematical and Theoretical, 57(19):195202, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:43.333526Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:cb532538be6516bfba9d3d3dad21e5f559284c1a45bc78a4cf10dfdf8b12b7a0","observation_id":"846cbf6c-154a-4006-a143-c609ab4a9c35","resolution":{"observed_at":"2026-08-07T13:50:43.333526Z","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-07T13:50:43.442953Z","title":"Capacity threshold for the ising perceptron","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:43.442953Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:6a30d6c7e727e93b8591aa1d2615ccd8e8cecdcde82f038630765ef748a3ffec","observation_id":"646df74b-645c-4075-8ead-d22f19539812","resolution":{"observed_at":"2026-08-07T13:50:43.442953Z","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-07T13:50:43.599087Z","title":"Recipes for metastable states in spin glasses.Journal de Physique I, 5(11):1401–1415, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:43.599087Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:89850ec0d96b3804d8a49a38263c5bc3f103bcee3097a6dda3ebd6f114f42590","observation_id":"a5827909-6fcc-40eb-9852-b7aa9fab1d01","resolution":{"observed_at":"2026-08-07T13:50:43.599087Z","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-07T13:50:43.728018Z","title":"Quasi-equilibrium in glassy dynamics: an algebraic view","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:43.728018Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:e98443cf5bb34f1bed784b0a7578232203fd6a01523857563804cc01faebde9d","observation_id":"6e2f4435-f26c-40e2-98d6-ed701dc8e31d","resolution":{"observed_at":"2026-08-07T13:50:43.728018Z","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-07T13:50:43.804006Z","title":"Quasi equilibrium construction for the long time limit of glassy dynamics.Journal of Statistical Mechanics: Theory and Experiment, 2015(10):P10010, oct 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:43.804006Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:c8b0fd43fffa501ab8444194d0c5ce4bc6a5618b087345f6d80596760e070e63","observation_id":"8dc73f2b-b7a1-4eb9-86f4-42583e45bd59","resolution":{"observed_at":"2026-08-07T13:50:43.804006Z","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-07T13:50:43.998546Z","title":"How to escape atypical regions in the symmetric binary perceptron: A journey through connected-solutions states.SciPost Physics, 18:115, 3 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:43.998546Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:56773373dcd87689ba53834f8ad5c8e47779b2b75b04328e3d73bf7fe85f1da5","observation_id":"3115680d-dedc-45aa-9115-f27bfd73a057","resolution":{"observed_at":"2026-08-07T13:50:43.998546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1109.4424","last_updated":"2012-06-06T15:00:59Z","snapshot_observed_at":"2026-08-15T04:34:42.059468Z","submitted_at":"2011-09-20T20:16:02Z","title":"Statistical physics-based reconstruction in compressed sensing","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1109.4424","snapshot_observed_at":"2026-08-07T13:50:44.076061Z","title":"Krzakala, M","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:44.076061Z"},"links":{"cited_paper":"/paper/1109.4424","citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:30b13770ab7951763d064667d4372b59beacf9b6cde38edd0e931d8c34db7f8d","observation_id":"7751a9eb-d6da-4d00-8c0d-abbfc651df7d","resolution":{"observed_at":"2026-08-07T13:50:44.076061Z","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-07T13:50:44.170033Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:44.170033Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:ab240071e8ac5d1fed97134ea928db63ec94df197fe0df6e7089b33eedec9c15","observation_id":"1288dbf9-ccc5-402f-9031-b69a35c9ae51","resolution":{"observed_at":"2026-08-07T13:50:44.170033Z","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-07T13:50:44.342186Z","title":"Barbier, C","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:44.342186Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:1e597460435482a03612df3bf063e65c0a95d7abb80a24238698f77325974d3a","observation_id":"f76afebe-8620-4ddc-9644-1081126bf570","resolution":{"observed_at":"2026-08-07T13:50:44.342186Z","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-07T13:50:44.447644Z","title":"Marvels and pitfalls of the langevin algorithm in noisy high-dimensional inference.Physical Review X, 10:011057, 3 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:44.447644Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:5f113a5f99a95e6fcc49ae0e1ce5b1ee9b88ff20b275c001b01b0ffb284ada39","observation_id":"2619f56a-4fc5-43b7-8ad0-376c24258261","resolution":{"observed_at":"2026-08-07T13:50:44.447644Z","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-07T13:50:44.551740Z","title":"Local entropy as a measure for sampling solutions in constraint satisfaction problems.Journal of Statistical Mechanics: Theory and Experiment, 2016(2):023301, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:44.551740Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:6eaa11254462b90dbbd1a2c1d82d2910800fe2071545482157f114f206e2c7e4","observation_id":"7cd69b4e-50e5-4e21-b152-a68445a52ae0","resolution":{"observed_at":"2026-08-07T13:50:44.551740Z","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-07T13:50:44.630153Z","title":"Subdominant dense clusters allow for simple learning and high computational performance in neural networks with discrete synapses.Physical review letters, 115(12):128101, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:44.630153Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:aeb0187947cd07123b54bd53d45a569ccdc207fccbbbbb1a1caad8bf827d87ec","observation_id":"a1339310-373f-433f-8e2a-87d7e0847d11","resolution":{"observed_at":"2026-08-07T13:50:44.630153Z","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-07T13:50:44.732838Z","title":"Unveiling the structure of wide flat minima in neural networks.Physical Review Letters, 127(27):278301, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:44.732838Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:6a7ebbc3874f2ddfa7b66cc30772ada0772a3d67553839de0f0533fa41389aa7","observation_id":"a07e56ea-cbaa-45d0-9032-fa702cb938e5","resolution":{"observed_at":"2026-08-07T13:50:44.732838Z","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-07T13:50:44.865025Z","title":"Wide flat minima and optimal generalization in classifying high-dimensional gaussian mixtures.Journal of Statistical Mechanics: Theory and Experiment, 2020:124012, 12 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:44.865025Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:b1164866856f6a3ded3d3a2f4b80b4264cf18e6445349d7524e14b380d209c08","observation_id":"2f8a5be3-1b84-476a-90cc-1769c3af42f5","resolution":{"observed_at":"2026-08-07T13:50:44.865025Z","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-07T13:50:44.965528Z","title":"Clustering of solutions in the symmetric binary perceptron.Journal of Statistical Mechanics: Theory and Experiment, 2020:073303, 7 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:44.965528Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:9ec4e518cf68e9bd338f5d1e16a9919fb8b2c20ceaebde95534dc053771a0dec","observation_id":"8dca4a38-c209-4e41-99eb-da55be065008","resolution":{"observed_at":"2026-08-07T13:50:44.965528Z","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-07T13:50:45.067575Z","title":"Shaping the learning landscape in neural networks around wide flat minima.Proceedings of the National Academy of Sciences, 117:161–170, 1 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:45.067575Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:44c22e6e4275c850795f1278b06f16e9de811f05ad2d94bbbf3cc19ec4be4389","observation_id":"09cd87cb-8b5b-4e02-b9d3-557f0a7766ce","resolution":{"observed_at":"2026-08-07T13:50:45.067575Z","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-07T13:50:45.138847Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:45.138847Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:b5ffdadc232c26f82489055dd5a8e0ccc12a09a40cd1bb2d59044eae492c3a1e","observation_id":"273f4d02-4eaa-45d2-8c36-9617e47900fb","resolution":{"observed_at":"2026-08-07T13:50:45.138847Z","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-07T13:50:45.252750Z","title":"Efficiency of quantum vs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:45.252750Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:a76803fd405ed48ec2b7165adab1b16edccf4301247624aabbeeef26e171c0cf","observation_id":"281169f4-afac-4de0-bbc8-dd23719831c5","resolution":{"observed_at":"2026-08-07T13:50:45.252750Z","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-07T13:50:45.381537Z","title":"Frozen glass phase in the multi-index matching problem.Physical review letters, 93(21):217205, 2004","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:45.381537Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:cb7ce58183b251d1986dc3ad907f1f0080e9758f1a6e27ee058b52d62b07a950","observation_id":"338e0350-54ea-44d6-b7d3-bcaea38973f5","resolution":{"observed_at":"2026-08-07T13:50:45.381537Z","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-07T13:50:45.420098Z","title":"Locked constraint satisfaction problems.Physical review letters, 101(7):078702, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:45.420098Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:b686fc7b15eb3fa118809ba765128e5d22799adab43f4b3311f535e0b52654bb","observation_id":"0b0b63de-1e17-4cab-9877-f25bedb93177","resolution":{"observed_at":"2026-08-07T13:50:45.420098Z","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-07T13:50:45.523977Z","title":"Entropy landscape of solutions in the binary perceptron problem.Journal of Physics A: Mathematical and Theoretical, 46(37):375002, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:45.523977Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:1bb02e4b2f2468d0b36fdbf9fab7172433fcd41735e9c7ed75fda97d0857ee16","observation_id":"724f25e0-ed35-4ab6-a3af-e725d4470b29","resolution":{"observed_at":"2026-08-07T13:50:45.523977Z","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-07T13:50:45.644443Z","title":"Origin of the computational hardness for learning with binary synapses.Physical Review E, 90(5):052813, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:45.644443Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:10f10c71dd3f2114163e0265073cb410b78632e0ae39b80531681f65a9ab582f","observation_id":"14923a02-f18d-457d-aa2c-4a31c665fc6e","resolution":{"observed_at":"2026-08-07T13:50:45.644443Z","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-07T13:50:45.725284Z","title":"The asymptotics of the clustering transition for random constraint satisfaction problems.Journal of Statistical Physics, 181, 12 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:45.725284Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:ff957cce3a39815a72d732c9e9740baf52e0e520571079aea1e781c71587705a","observation_id":"a08a5b54-1b8c-4e60-b070-eb8755e344f4","resolution":{"observed_at":"2026-08-07T13:50:45.725284Z","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-07T13:50:45.845646Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:45.845646Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:2e3b65f2b43c91cde1ec24a5f05d54bcd54e37411d18b0398bfd77bcf9baf97b","observation_id":"d11a0f20-4083-43dd-a6df-9348748e0d55","resolution":{"observed_at":"2026-08-07T13:50:45.845646Z","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-07T13:50:45.946511Z","title":"Diversity-generating retroelements.Current Opinion in Microbiology, 10:388–395, 8 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:45.946511Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:e7c18fbbc32d88051078ada4fdb1f43879f2b0215db8c9e45e6ebb936084622a","observation_id":"6b32f219-079c-4ff2-829d-a1dbebfe1ec4","resolution":{"observed_at":"2026-08-07T13:50:45.946511Z","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-07T13:50:46.063514Z","title":"Harnessing diversity generating retroelements for in vivo targeted hyper-mutagenesis","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:46.063514Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:ca132a08a2faa37456f8033390646afcef3013ffe5db323683c5df63b53f3355","observation_id":"7db7455d-102c-490e-860f-27dea3cf238e","resolution":{"observed_at":"2026-08-07T13:50:46.063514Z","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-07T13:50:46.171854Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:46.171854Z"},"links":{"citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:920f482e931442e3516edc5adf4194a342adba37205d6b5ee73e6411bb0c3d4a","observation_id":"e9bb0a11-33c9-486f-a8ad-ab85a6af2ef6","resolution":{"observed_at":"2026-08-07T13:50:46.171854Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15667","last_updated":"2022-03-29T15:29:49Z","snapshot_observed_at":"2026-08-14T07:27:05.357186Z","submitted_at":"2022-03-29T15:29:49Z","title":"Algorithms and Barriers in the Symmetric Binary Perceptron Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15667","snapshot_observed_at":"2026-08-07T13:50:46.278639Z","title":"Algorithms and barriers in the symmetric binary perceptron model.arXiv preprint arXiv:2203.15667, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems","version":5},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T13:50:46.278639Z"},"links":{"cited_paper":"/paper/2203.15667","citing_paper":"/paper/2505.20954"},"observation_digest":"sha256:fa71aaef02c12f8d3fafe594b53ec4552767ad091c9e3d0811c274e593bb6567","observation_id":"491bb43c-a71b-4e9e-ab98-c96d55ef5422","resolution":{"observed_at":"2026-08-07T13:50:46.278639Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.20954","last_updated":"2026-06-26T23:37:47Z","latest_version":5,"primary_category":"cond-mat.dis-nn","snapshot_observed_at":"2026-08-10T20:09:21.561737Z","submitted_at":"2025-05-27T09:50:00Z","title":"Finding the right path: statistical mechanics of connected solutions in constraint satisfaction problems"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":60,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":60},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 1 inbound Pith citation observation for arXiv:2505.20954."}