{"as_of":"2026-08-09T09:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:71c52c73787a5b1edabfcc6e8a7f92b421982bbf02a49ab5cc93c157f63c75ff","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T04:42:49.188754Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.22480/citation-record","integrity":"/paper/2607.22480/integrity","json":"/paper/2607.22480/citation-record.json","paper":"/paper/2607.22480"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T04:42:44.808190Z","title":"Abdalla, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:44.808190Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:7736f0a6f07b560bccaf8ebfd0db4a8794068b4b669328d6b7c6e3a57d986f4b","observation_id":"54c28782-4d07-4202-a3f2-6627567bca2a","resolution":{"observed_at":"2026-08-01T04:42:44.808190Z","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-01T04:42:44.946597Z","title":"Balogh, B","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:44.946597Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:f7e22e24803e1199793f40ef81b95aafbf4cad8cc23fd9f6c0908c6260a08f2e","observation_id":"95f42abc-f70c-4e1b-a378-400320d37ca1","resolution":{"observed_at":"2026-08-01T04:42:44.946597Z","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-01T04:42:45.107013Z","title":"Bangachev and G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:45.107013Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:e93b28c5fd35db24cf57002f9e9041c59442c2d0f41f43c7a8c9b3c42c47195f","observation_id":"f0e8d634-82bd-482e-a8b2-7d4ec13eda5f","resolution":{"observed_at":"2026-08-01T04:42:45.107013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12589","last_updated":"2024-02-19T22:55:56Z","snapshot_observed_at":"2026-08-07T11:52:58.611320Z","submitted_at":"2024-02-19T22:55:56Z","title":"On The Fourier Coefficients of High-Dimensional Random Geometric Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12589","snapshot_observed_at":"2026-08-01T04:42:45.262989Z","title":"Bangachev and G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:45.262989Z"},"links":{"cited_paper":"/paper/2402.12589","citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:712a3f9465d45e0c8951121a0af44f432b5abe12525f310560174431f9a81f4b","observation_id":"8b2c844b-8545-4e8d-9e1c-24c62e69fc07","resolution":{"observed_at":"2026-08-01T04:42:45.262989Z","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-01T04:42:45.379219Z","title":null,"venue":null,"work_id":null,"year":1942},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:45.379219Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:cc3f434d9ea141b69a980e2ee1f63cf3f4bb22e0131c711ae8471ae961b40ed0","observation_id":"6c9ece48-7eb2-43f4-ae7a-80af2cc4aaf1","resolution":{"observed_at":"2026-08-01T04:42:45.379219Z","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-01T04:42:45.495364Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:45.495364Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:fd4b34a640a4b544bc2f5d9abaeb268b093e406e99b2cb73d3b090496ec8b30d","observation_id":"c423341f-cf20-47ba-9c8d-53d23eca0ad8","resolution":{"observed_at":"2026-08-01T04:42:45.495364Z","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-01T04:42:45.634988Z","title":"Brennan, G","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:45.634988Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:8bc02a77b3aa9aee0119cca4ee2727382acbe8dd1bff511cc6a75b001ed00eb6","observation_id":"f855beb2-3a9b-4965-9bbd-8e6b36d70915","resolution":{"observed_at":"2026-08-01T04:42:45.634988Z","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-01T04:42:45.771109Z","title":"Brennan, G","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:45.771109Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:168981a6704125423f3fc6306a8ca5fd14bc23b739297e3e0f63183c9f688382","observation_id":"a439771f-8973-410e-a756-23274c52f3ae","resolution":{"observed_at":"2026-08-01T04:42:45.771109Z","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-01T04:42:45.926915Z","title":"Bubeck, J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:45.926915Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:ef60c3b2e6b5f5bd02c48e4145bc67ff36f69f74b2d571dc0c3d4daccf8b7ef2","observation_id":"532343cc-034d-4dc0-b74b-909a4f6fc5de","resolution":{"observed_at":"2026-08-01T04:42:45.926915Z","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-01T04:42:46.096070Z","title":"Chatterjee.A generalization of the Lindeberg principle.Ann","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:46.096070Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:efb7787254c8a6922fb8cc643dd798fabeefcfbc5e8a49630056c18e7f1d8e46","observation_id":"4cf66274-a3ee-4673-8038-a841c8f1894b","resolution":{"observed_at":"2026-08-01T04:42:46.096070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.06556","last_updated":"2026-07-13T06:28:08Z","snapshot_observed_at":"2026-08-06T18:58:09.180976Z","submitted_at":"2025-07-09T05:23:13Z","title":"Spectra of high-dimensional sparse random geometric graphs","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.06556","snapshot_observed_at":"2026-08-01T04:42:46.228099Z","title":"Cao and Y","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:46.228099Z"},"links":{"cited_paper":"/paper/2507.06556","citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:7346767c8ef8ceb1c2551a5a813fd4ab68ff09c606612641fe831397c01d01c7","observation_id":"f7037ddc-6c79-48fe-981a-829fe3d8b837","resolution":{"observed_at":"2026-08-01T04:42:46.228099Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15351","last_updated":"2022-08-24T08:31:07Z","snapshot_observed_at":"2026-07-06T12:54:04.223109Z","submitted_at":"2022-03-29T08:48:55Z","title":"Random Geometric Graph: Some recent developments and perspectives","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15351","snapshot_observed_at":"2026-08-01T04:42:46.346956Z","title":"Duchemin and Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:46.346956Z"},"links":{"cited_paper":"/paper/2203.15351","citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:63e4c1c864cd5ef23fe676b77293d8e106344602b0b8adc891aa6282a7d2880c","observation_id":"0e9c881f-444c-489b-bb6e-51f2e9131ee5","resolution":{"observed_at":"2026-08-01T04:42:46.346956Z","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-01T04:42:46.465003Z","title":"Devroye, A","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:46.465003Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:4aae71b8dd4a69876243ec11d5a8dc5f4f7557f86464c0b39204adff1dc67a2b","observation_id":"59170e57-33bf-4307-a783-9fbc6d332d90","resolution":{"observed_at":"2026-08-01T04:42:46.465003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.02013","last_updated":"2026-07-02T10:45:46Z","snapshot_observed_at":"2026-08-02T08:45:30.250062Z","submitted_at":"2026-07-02T10:45:46Z","title":"Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d>n$ Regime","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.02013","snapshot_observed_at":"2026-08-01T04:42:46.615336Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:46.615336Z"},"links":{"cited_paper":"/paper/2607.02013","citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:e185ba2d0572e92ba0116a122a24b8952ae2a31c9883c06621b043b6671500d8","observation_id":"97b33292-bcec-4590-a0b2-a30e35e847ae","resolution":{"observed_at":"2026-08-01T04:42:46.615336Z","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-01T04:42:46.789387Z","title":"Eldan and D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:46.789387Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:8e39ac0cffb7655ea3f2066ac84a449e84f3cebee8950781c182c8a88cd74281","observation_id":"58a98fea-7519-4a77-a855-87915cf6b6a0","resolution":{"observed_at":"2026-08-01T04:42:46.789387Z","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-01T04:42:46.927741Z","title":"Erd˝ os and A","venue":null,"work_id":null,"year":1959},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:46.927741Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:b63e6d9485e2e4a36a8ebbb86da3cf75f666260d658e0667dbebfef31cbf0b2c","observation_id":"c4347e83-9802-43ae-b465-c20f26468993","resolution":{"observed_at":"2026-08-01T04:42:46.927741Z","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-01T04:42:47.038926Z","title":"Erd˝ os.Some remarks on the theory of graphs.Bull","venue":null,"work_id":null,"year":1947},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.038926Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:469839457f31790c01a9ceb9b47c00d64c52ef459cd176669a6e57047bc41dc3","observation_id":"4f20943d-5383-4de8-828b-5d7fc868e74d","resolution":{"observed_at":"2026-08-01T04:42:47.038926Z","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-01T04:42:47.154703Z","title":null,"venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.154703Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:4f65dd03757f19c99b1407f5b04f1774deb1079c59b002a84586028b85148724","observation_id":"e7fd614e-c2a1-410f-953e-514974b6b1f0","resolution":{"observed_at":"2026-08-01T04:42:47.154703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.17718","last_updated":"2026-05-18T11:42:37Z","snapshot_observed_at":"2026-08-06T02:24:48.407908Z","submitted_at":"2025-12-19T15:52:01Z","title":"Gaussian random graphs and Ramsey numbers","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.17718","snapshot_observed_at":"2026-08-01T04:42:47.273732Z","title":"Hunter, A","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.273732Z"},"links":{"cited_paper":"/paper/2512.17718","citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:cab5440ea8414f9409744b0d469ed86b2056436a4f48ccfdd5ee92a51a8bbc46","observation_id":"405c3c67-01e2-414a-b394-f839f4deeac6","resolution":{"observed_at":"2026-08-01T04:42:47.273732Z","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-01T04:42:47.381245Z","title":"Janson, T","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.381245Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:ed9421c11b30bd177a07442bb26b9c40d66bba7163043ed021dbdd484e9e7a1b","observation_id":"4ac30225-5ccd-478b-988b-c4d6c3fd1578","resolution":{"observed_at":"2026-08-01T04:42:47.381245Z","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-01T04:42:47.515842Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.515842Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:8008a13034507ec82a62d70b9372821bacf9673e00bc5bc6b29af57f01883d2a","observation_id":"eebaef8c-9dcd-46b6-8266-5c35397fbe4c","resolution":{"observed_at":"2026-08-01T04:42:47.515842Z","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-01T04:42:47.568059Z","title":"Laurent and P","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.568059Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:d745f97c048d30b97e12bdad8cc9fbe17b858accf71cf66b759f591d59bf432a","observation_id":"3e347df5-8b2c-4f95-a5cc-eff1d99c9ad1","resolution":{"observed_at":"2026-08-01T04:42:47.568059Z","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-01T04:42:47.626173Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.626173Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:1c6b54f7ee10ed42b32eeabd607612fd36968d675e597fb8547c2e9e1b2aa925","observation_id":"fd5f434b-e676-4d76-9d10-1db23d6b71ba","resolution":{"observed_at":"2026-08-01T04:42:47.626173Z","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-01T04:42:47.699324Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.699324Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:d2a5c489fc9a111caaab3cef9a21c496771063d4debb1725865e9b4bc3c84b53","observation_id":"8de9584e-9126-4d24-8578-5304c1bcbc4c","resolution":{"observed_at":"2026-08-01T04:42:47.699324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.15249","last_updated":"2021-03-28T23:57:38Z","snapshot_observed_at":"2026-07-06T10:54:11.548426Z","submitted_at":"2021-03-28T23:57:38Z","title":"Phase transition in noisy high-dimensional random geometric graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.15249","snapshot_observed_at":"2026-08-01T04:42:47.755401Z","title":"Liu and M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.755401Z"},"links":{"cited_paper":"/paper/2103.15249","citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:27c38fc87ace8c3ccfbb86e57cc7fc11765ca0a1d148465f1cf05ce9a482a495","observation_id":"55f6f2fc-5b1c-48c7-b358-c1cb751b9a12","resolution":{"observed_at":"2026-08-01T04:42:47.755401Z","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-01T04:42:47.835592Z","title":"Liu and M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.835592Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:8eef7008c1706519cf36ef68df183a6c980b5377672303f371b3d82978f8ca87","observation_id":"78a9751f-1297-4f69-89a1-cbcaac622033","resolution":{"observed_at":"2026-08-01T04:42:47.835592Z","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-01T04:42:47.856230Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.856230Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:5bcc6e3d3920301f66c51957f870e84ccc9b994dd4d6876943a5fac2bc7ca16d","observation_id":"2f733742-a589-463e-8eb2-887edba550ae","resolution":{"observed_at":"2026-08-01T04:42:47.856230Z","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-01T04:42:47.927930Z","title":"McDiarmid and T","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.927930Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:0fac1a8525bd7924185e147421e05ae4836056dafd3fa5c10839d8d8eee8077b","observation_id":"532935be-4923-4d53-8f20-9edd56865190","resolution":{"observed_at":"2026-08-01T04:42:47.927930Z","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-01T04:42:47.982121Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:47.982121Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:625668d4d9b0a2d0178c1e22c39d7ebe0fdd5f14de5559fb5fd8aba7f435df9e","observation_id":"082f1bbb-789b-4abe-b353-e9b86568f9d3","resolution":{"observed_at":"2026-08-01T04:42:47.982121Z","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-01T04:42:48.072011Z","title":"M¨ uller.Two-point concentration in random geometric graphs.Combinatorica 28(5) (2008), 529–545","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.072011Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:ac865e116553682e04ed69422f4bca4a0f00f7bd8ebf74ca8aa7e4bb23567493","observation_id":"39fefe1b-75e1-4692-953e-12bba5fd6de9","resolution":{"observed_at":"2026-08-01T04:42:48.072011Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.10785","last_updated":"2021-10-20T21:25:09Z","snapshot_observed_at":"2026-08-03T15:44:50.024306Z","submitted_at":"2021-10-20T21:25:09Z","title":"Random geometric graphs and the spherical Wishart matrix","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.10785","snapshot_observed_at":"2026-08-01T04:42:48.162819Z","title":"Paquette and E","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.162819Z"},"links":{"cited_paper":"/paper/2110.10785","citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:f0f37cb15ae454d0d35803d87e3e898381cd9e11f3668137749a5b21c5279e15","observation_id":"b730fae5-df54-4cf9-a6d7-3d550617e53b","resolution":{"observed_at":"2026-08-01T04:42:48.162819Z","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-01T04:42:48.255276Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.255276Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:a01fde5925949fe5ffd60f9f864bdf13ba506f498fbd5ee8375fa8308f49faa0","observation_id":"df918360-a454-498e-b790-0faafffcff78","resolution":{"observed_at":"2026-08-01T04:42:48.255276Z","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-01T04:42:48.339584Z","title":"Penrose.Random geometric graphs.Oxford Studies in Probability 5, Oxford University Press, Oxford, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.339584Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:335bc2c9634c401e7e23088a7e854331d1e4ac837488c0665b6764f2f34617ba","observation_id":"39c91793-7e02-4b99-a00a-a3ca3da5553c","resolution":{"observed_at":"2026-08-01T04:42:48.339584Z","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-01T04:42:48.427712Z","title":"Rudelson and R","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.427712Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:3d34ed588807daaab1ca7aa52e68cda47ff5c562943a151fd2c58ec727f8b15e","observation_id":"d5389941-5fd4-4e98-bef5-62e15783d4f0","resolution":{"observed_at":"2026-08-01T04:42:48.427712Z","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-01T04:42:48.514235Z","title":null,"venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.514235Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:3e76dfeae74a0e1b2cd27210c10bd6a974a5ec44fe0582fd2330f98fc7ebe330","observation_id":"0a99449a-7743-46af-9d4a-2df911c44be8","resolution":{"observed_at":"2026-08-01T04:42:48.514235Z","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-01T04:42:48.598728Z","title":null,"venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.598728Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:66c0eaffd1e39a5127d13ed5143547a4ae210aa591d8a841b4c3f0a9843019f0","observation_id":"ab39b731-fa18-4f03-a590-7e58617f52b8","resolution":{"observed_at":"2026-08-01T04:42:48.598728Z","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-01T04:42:48.686773Z","title":"Vershynin.High-dimensional probability","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.686773Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:2a2f4ee3b80f8cd3f412f9731d972c99a9d8f9e7b6b86845a0d09d9410ebe7d1","observation_id":"36c4ca87-28dd-40e9-9bdd-f585d125dce5","resolution":{"observed_at":"2026-08-01T04:42:48.686773Z","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-01T04:42:48.746301Z","title":"ν(x)” to denote what is−λ(x) in our notation, and “λ(x) =ν ′(x)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.746301Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:4b45dc0c7c0cc97f51be93866120e43f2a2744d6e251969531df973a81b9f7bb","observation_id":"a73d7747-7802-4d2f-bf0e-44c630b442b2","resolution":{"observed_at":"2026-08-01T04:42:48.746301Z","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-01T04:42:48.834228Z","title":"Here, we give its simplified statement, in the regime wheremandℓare constant, and p≥n −1/2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.834228Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:1a94dcb76e2d7a5f26ac41613172f45d6799c65266bd7ff00a6cbb297b744126","observation_id":"908b6361-d41e-4ee4-86de-8ddfc03b80c7","resolution":{"observed_at":"2026-08-01T04:42:48.834228Z","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-01T04:42:48.894947Z","title":"Hence, the standard Gaussian tail estimate gives P |⟨πs(gi), πs(gj)⟩| ≥3 p 2nlogn gi ≤2 exp(−9(logn)/2)≤n −4","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.894947Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:9a8193cb5b0e19068bf2a1200f0e09fac89fe567d014ba99aa74714d759c9748","observation_id":"28feaef1-4dc5-41c6-a453-2553d2e78177","resolution":{"observed_at":"2026-08-01T04:42:48.894947Z","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-01T04:42:48.953360Z","title":"Namely, they have shown that ifδ >0 is chosen such thatP[G(n, d, p) =△] =p 3(1 +δ), then Var[N △(G)]≤O(n 3p3(1 + δ) +p 5δ2n4 +p 6δn4)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:48.953360Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:0ee1d4c8f5cad1e191af42eb842d9387d99ddb0eaef1aa75602297c4ff229238","observation_id":"3cebe48f-7a45-49a1-bd7c-a068dd8e763b","resolution":{"observed_at":"2026-08-01T04:42:48.953360Z","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-01T04:42:49.004583Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:49.004583Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:243b97afa03c0e5cb6ef72e5375958185c8c2e12705a42a5aa1fbf23d6528f4e","observation_id":"b278af74-3f8c-4ee6-9230-3da115ee3228","resolution":{"observed_at":"2026-08-01T04:42:49.004583Z","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-01T04:42:49.090838Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:49.090838Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:fb874da450f476a80a2054b41779dca8f17df71c43ac0be1ffc524de04b2e2d5","observation_id":"abb5c2e2-dc66-4514-8bd4-66551b9667b5","resolution":{"observed_at":"2026-08-01T04:42:49.090838Z","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-01T04:42:49.188754Z","title":"On the other hand, using the Taylor series of the functionA7→log detA, we find that when∥M ′∥op is sufficiently small, then we have log det(I−2M ′) =− P∞ k=1 tr((2M ′)k)/k","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T04:42:49.188754Z"},"links":{"citing_paper":"/paper/2607.22480"},"observation_digest":"sha256:78c8402ba888cd77e5deb1c1446ce283e8148113365517137fa35143c59f7acc","observation_id":"9d456a31-d176-43cc-920c-d9cf051ca0cc","resolution":{"observed_at":"2026-08-01T04:42:49.188754Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22480","last_updated":"2026-07-24T16:49:51Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-06T03:17:20.832246Z","submitted_at":"2026-07-24T16:49:51Z","title":"Distinguishability threshold for random geometric graphs"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":44},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2607.22480."}