{"as_of":"2026-08-20T18:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de753ff86a1669ab1d9056681d75fd562b82d108d2ae45a62794afec97b8a8fc","coverage":[{"denominator":86,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":86,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T05:46:05.715937Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2606.12879/citation-record","integrity":"/paper/2606.12879/integrity","json":"/paper/2606.12879/citation-record.json","paper":"/paper/2606.12879"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:46:05.715937Z","title":"De-anonymizing social networks,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:c967c737878915b7e1dec7c19032ce8eb6bfd70bd6938c2ebcc48c3de5289469","observation_id":"f7cd8396-e57a-4af1-a07f-a3086c2929b2","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"An efficient reconciliation algorithm for social networks,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:86a0fda2ad5ac8a0e8233e4cccf6c3b7897ecfec56d8319c8bcc69901dde718d","observation_id":"9537a2c5-efd8-4500-965b-f6693c84e9cf","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Pairwise global alignment of protein interaction networks by matching neighborhood topology,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:73551a9df9f748c3fd45aee4bbb4b16d34361cb66b918fe623b594cb2ddfc02f","observation_id":"f963d1d2-4705-45d9-b1dc-95a49622ea66","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Robust textual inference via graph matching,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:909e8d2ad9a6a8ef9bfdbecd6225ee0a5985738be5f509181eeb4b5478fd7991","observation_id":"eb2d46da-81a6-4972-9e90-eb8ec63f1f08","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"On the privacy of anonymized networks,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:743774d52912002463240dc94af97f262e7e4b8649ec623f410528b799cfa589","observation_id":"ba33bd04-848b-403d-81c4-ff6c44e042a7","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Improved achievability and converse bounds for Erd ˝os-R´enyi graph matching,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:53a00ac8c5f68c611506c35c9b8b46fc90b9d0e9ab7239c3e1957e27c00596e3","observation_id":"0855e7c8-c6e6-404a-b9a9-4b7cc23d3fc4","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.06783","last_updated":"2018-05-14T04:27:12Z","snapshot_observed_at":"2026-08-16T07:38:32.245373Z","submitted_at":"2017-11-18T00:57:18Z","title":"Exact alignment recovery for correlated Erd\\H{o}s-R\\'enyi graphs","version":2},"cited_work":{"arxiv_id":"1711.06783","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.06783","snapshot_observed_at":"2026-07-03T16:28:38.790966Z","title":"Exact alignment recovery for correlated Erd\\H{o}s-R\\'enyi graphs","venue":"cs.IT","work_id":"c2b5bab0-5f93-4201-bf02-c62c9ed66cef","year":2017},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"cited_paper":"/paper/1711.06783","citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:e2b93819b1ae7f669269b35bfbfbe5563fb42211d51851867e71e5d4e8bd2824","observation_id":"2ea68cce-d6b6-4298-9372-ce3b71be9d72","resolution":{"observed_at":"2026-07-03T16:28:38.792172Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:46:05.715937Z","title":"Settling the sharp reconstruction thresholds of random graph matching,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:714348f458f903f9e6237fe381b977ba55fd12ac3e221cb4ed27ec41d3b843ef","observation_id":"197267ff-c21e-469c-8ad8-f23305e621d9","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Matching recovery threshold for correlated random graphs,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:835d2e41d7468d788e64036a137086777c293683e3ded58329c76e8afadc1101","observation_id":"58d5df47-1ba1-404a-a813-827c87d242e7","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"The number of trees,","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:f091464d957d8a219b963d82f65a43417a78186f61499ec6a5187c1b578fa694","observation_id":"f7d0e238-a12b-46fa-a602-19577b681ee5","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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":"2023.0574","doi":"10.1287/opre.2023.0574","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Random graph matching at otter’s threshold via counting chandeliers,","venue":"Operations Research","work_id":"e2025754-9bc7-4551-ae6b-3bd9a9375fe3","year":2026},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:94b19e6c5273d22017e19c37d7759ef630d55c7d90338261f12c35a78628aa74","observation_id":"86bc338b-83cc-45ec-a866-6a7adbd59b0d","resolution":{"observed_at":"2026-06-27T05:50:36.063374Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:46:05.715937Z","title":"Correlation detection in trees for planted graph alignment,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:90e451d871697800f625a6bebe10051016d96eb9f39c1fba7f08c70a98bf857e","observation_id":"31889f00-333b-4c0a-a2cb-4a9a95d82958","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Statistical limits of correlation detection in trees,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:a0f39b5872326626bf0307de60d534650819d4d0602588b60ee4c14992ddd112","observation_id":"f1ca7ba0-24ea-4862-bae5-8218934d1cde","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:7f8406f2bde6367ee8d75d613fdc5d7b6d886c4586a727ef52fd3818702dfd70","observation_id":"473902f5-233f-4236-8794-d58321c56d84","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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":"6750.956769","doi":"10.1145/956750.956769","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Kempe, J","venue":null,"work_id":"90fbc1a5-e1f6-4335-a8de-fc72ee0d6f8a","year":1916},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:3b3a09d468b4018bfdfe2420882cc290002f992f6d316d9d8bb41f0636292ce3","observation_id":"b809e87e-e019-4e92-83d1-b4bb5ee76d92","resolution":{"observed_at":"2026-06-27T05:50:36.066036Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-24T18:23:13.779913+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T18:23:13.779913+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2504.02299","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T16:28:38.795908Z","title":"Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing,","venue":null,"work_id":"8df902ec-2aad-48c9-9f38-705fe7a420eb","year":2025},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:13f54ee60a501cceaad433f842a4e803538710720173064494872f5d4188fc6a","observation_id":"a920a416-5a61-4709-b3b0-2cae857faf31","resolution":{"observed_at":"2026-07-03T16:28:38.797564Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:46:05.715937Z","title":"Ix. on the problem of the most efficient tests of statistical hypotheses,","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:5597b1405cbdcb738770498fc94ef4a5513c0dd9db017c84435a0c0ceb877599","observation_id":"0e777308-2b76-4543-b1b3-b92e5f652c13","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:a0953f5ca10e23249bb757fb2aeb26009b517d9fbe5c3fe5181be3f876035a53","observation_id":"c144952b-2f65-4ec4-8133-9dd2ed60882e","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Frieze and M","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:3ee25ced6191af6316ed13a2dd91e521bd7a08651da0fe6089927ff7c0fe3cc4","observation_id":"7c4e0524-c0a1-43a0-8f20-3111dbd3ea05","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","snapshot_observed_at":"2026-08-19T21:45:24.659192Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs","version":1},"cited_work":{"arxiv_id":"2502.12077","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.12077","snapshot_observed_at":"2026-07-03T16:28:38.795130Z","title":"Optimal recovery of correlated Erd˝ os-R´ enyi graphs.arXiv preprint arXiv:2502.12077","venue":null,"work_id":"ba1b87ec-00af-41b6-9d98-15e7be9e485f","year":2025},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"cited_paper":"/paper/2502.12077","citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:34c4b490c4b53b00e1bfdefa354d2d80979329c927ac0f948262a8e43eefac65","observation_id":"9be7fbd5-1b1c-474d-aae7-0285a5d7d31f","resolution":{"observed_at":"2026-07-03T16:28:38.796540Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:46:05.715937Z","title":"Partial recovery of erd ˝os-r´enyi graph alignment via k-core alignment,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:25dc169aaea77469cc7d89274511b6eeeb7fffda834daf87450e3c33dbc03a6d","observation_id":"a14eca3a-3bdf-4ed6-9e2f-91e6809ec1ee","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Impossibility of partial recovery in the graph alignment problem,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:9da5a9d0346e2591aa53cd63fac9dabd0222475b22742a249999ad6d5b0eb62d","observation_id":"867c7ad8-2904-4fff-a6cd-e9d1712e2a9e","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Partial recovery in the graph alignment problem,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:b238197a0d69bd7487675789fd0d5bfb780bbf3580c27b11d4c3067e75647e40","observation_id":"745ece4a-687a-435b-9746-af010c222637","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Spectral graph matching and regularized quadratic relaxations: Algorithm and theory,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:f93a9b83d0be0766d0bb108f9284ef7fe7794adb1260713c9bced2142908817b","observation_id":"545d457f-1a71-4612-9168-5f2fbde249e8","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Analysis of a canonical labeling algorithm for the alignment of correlated erd ˝os-r´enyi graphs,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:3fc3a612aea9f85bdf36693bd30733867f04e19ad01fa308f9545f56f6ee5a1e","observation_id":"a7efc77d-95c9-4a74-b1a6-19a4aff31479","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Exact matching of random graphs with constant correlation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:cdbda7ff0b8084a9ef96304cfa7a311bb6233bc6fc8a507d160a22763231bde3","observation_id":"85982a96-ff87-4099-b12e-4542dde0a188","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"A polynomial-time iterative algorithm for random graph matching with nonvanishing correlation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:28f87dc8e27798fabfed3cb7b7f5569dce102b6d071fca3a42ae66f7dbe680f0","observation_id":"1b5745cd-7793-444c-b094-d300499a4899","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Exact community recovery in correlated stochastic block models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:fe45c2e740c274df37e01b3d276c049722ce77ca35886aaef1561f88625deed7","observation_id":"bd588477-71ae-46ac-909b-0e72df02d277","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Efficient graph matching for correlated stochastic block models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:57b50f5fa1b278cd3386a3bef09556467bfad8bdbf6a263418ea474d09ede345","observation_id":"4d5dc9d4-4673-46ab-a62d-17169b6f5eba","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Attributed graph alignment,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:4d29adb4197aa8cb57e232d9dc75322f2b6b67ed6078b6c2e82f0b6ed9dd2ed2","observation_id":"b9795a4b-e697-4254-990d-d00b40f315d8","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"On the feasible region of efficient algorithms for attributed graph alignment,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:19391e7cf01a7736e83f9ec99f4cce23acaa0cbb1fcdd75f808f1960c3fbb0e6","observation_id":"27f4296e-092a-4c07-afd0-64a57b7c1195","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Efficient algorithms for attributed graph alignment with vanishing edge correlation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:2b3f29ee1679824108385b7a316cfe0da44bb920385e8a098fc4a5ff9509a57b","observation_id":"000d931f-c460-4371-9334-799f3e8e36bf","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Exact graph matching in correlated gaussian-attributed erd ˝os-r´enyi model,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:d172b3c7edb7561f3cde960968666a74953f4088636cdfeb49314ad744179e28","observation_id":"494ef5b9-3634-4ac9-81ea-4440f29fe65a","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Information-theoretic thresholds for the alignments of partially correlated graphs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:6e5cbbd3469534aca80486778d15fc1a886689b2c64d2c6386a3311d5105c827","observation_id":"ad1cc5ab-21a4-4239-b57a-e450749a705f","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12293","last_updated":"2025-06-29T21:18:24Z","snapshot_observed_at":"2026-08-18T16:47:02.626604Z","submitted_at":"2024-05-20T18:01:11Z","title":"Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery","version":2},"cited_work":{"arxiv_id":"2405.12293","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.12293","snapshot_observed_at":"2026-07-03T16:28:38.789613Z","title":"and Hajek, B","venue":null,"work_id":"6c356315-6a95-4e89-aa61-9e1b6bf488ab","year":2024},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"cited_paper":"/paper/2405.12293","citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:cc02c93359a24f625363fe84aa09c3f8b2f75a1261e4cc8b32009c108c87f006","observation_id":"70daf101-212d-4779-a316-1a7716ed7340","resolution":{"observed_at":"2026-07-03T16:28:38.791172Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T05:46:05.715937Z","title":"Taming verification hardness: an efficient algorithm for testing subgraph isomorphism,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:e1d44a06d37bd6b8e8e80b969b4677219d6ae17a75bd62c448aa12683ff70fed","observation_id":"2403c0d1-55c0-4a9c-baab-f5ca8d1f4ec6","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Graphs-at-a-time: query language and access methods for graph databases,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:b11b7b6a52c2a79b3ebd575f2cfae9265b81d7707fc964fd60d9cf12239fe79b","observation_id":"ae2efa3c-f355-4c97-904c-9f75623acb5e","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"On the information-theoretic limit of subgraph alignment,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:a2d2069b58b5726af6a8ec7e8ab01b483542d2153f33e7e64715841a1563f8c2","observation_id":"cbce2e97-81ba-488b-a8b8-dbc5760afe67","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Cliques in random graphs,","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:98ddb638696be88e0412646ab2805da541f96f2e8cdf98034570dc07f9ec3d70","observation_id":"f930bc04-ccfe-47e1-9ca0-25193808f316","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Finding a large hidden clique in a random graph,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:ce865bee161a172b2ce0b0ad9614d58efdf7c0b583ee956be16a1088d1a68aed","observation_id":"271d512b-e85e-4bae-bb96-6f9939ba34c9","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Sharp thresholds in inference of planted subgraphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:06e41c82de615f37b4fe807507cdcefd59edf3190eb81d82c47c43d5ca8b8613","observation_id":"14df9640-13df-473d-a45a-62b9c5e2200e","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"The fundamental limits of recovering planted subgraphs (extended abstract),","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:3cab10c1232dd4431387ee4a62ff9fe1c55918af8921f96cede3cfb863de08d3","observation_id":"5e4a6074-ad19-4b49-a18b-1b9e7b1d09a6","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"A lower bound for the critical probability in a certain percolation process,","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:ffe9345c3db2d92ace7764505a5337f3f0108ce5efbe16bde98b385ef50ab988","observation_id":"6f41fbcf-1f4c-4ed3-9d53-c6d9b2edb988","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:8afa6210c7df096a06be78785024f09e9741cf8c8b1b605397e08284fbd9c329","observation_id":"f1fc87b2-4fb5-4236-8661-2ab0deeefa0f","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Probability inequalities for the sum of independent random variables,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:c9ce05c90e427845da38c52b544aa0d3fc81e4c05c2ab7ec06176ae903c1462a","observation_id":"0ac5b177-57ff-4bdb-afb6-bf556042e3e7","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:bf884b9a56370cabb683445e94cf2c62535d09d0c31e2f6a26079429cb15e5e4","observation_id":"40df7046-38ca-4636-ad2b-97f649f90a44","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Reconstruction and estimation in the planted partition model,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:775cd3bfa96c09b36c78e659eaca197b1d2569ad6a9c88aae9c70216fd1b73ab","observation_id":"f22410c6-2e34-4b3d-87a4-e3a591328b18","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"The poisson approximation to the poisson binomial distribution,","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:85a5e1993a822d9964e33c291426cd57979843f1742310c1404357dcadd94ca0","observation_id":"1b736cb3-4da4-497c-9831-4511a0daf2b1","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:2b57bc70eb441b69a8912035988ee0692e462725835e8bf2eda0c8bef828a1f0","observation_id":"23120689-0a78-4952-82e8-162d1f494a14","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Moreover, the canonical order of vertices at each depth in the two trees are defined in the same way","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:e52b135163e85a05aee468d43bde933316ccb2264ab9d2d6fd9c024ffbea036c","observation_id":"73695e8f-042d-4487-bced-f7d9682a7e88","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":",˜z˜t)of length ˜t∈[l]withz 1 =j 1 andz ˜t =xin graph ˜G2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:d7759cc7dcb1d009f581692dbecbc0c07add743be5fcdacafd2f2711db14e708","observation_id":"1ccb282d-b29b-40e8-ba10-3d7c03e0bf10","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":", d}and depthd∈[d max], P(E c 1 |v∈V d) =O(n −ϵ/3).(15) Lemma 4.Supposeλsq >1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:eefadc4bbef4e59e2ddd9dba422354254a904195dda91e4a888537e5d6313835","observation_id":"f28b736d-f158-4aa7-92c0-f5e5251c0b5b","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":", d}and depthd∈[d max], P(E c 2 |v∈V d) = ˜O(n−1/3).(17) We prove these two propositions in the next two subsections respectively","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:11ef0e529389fa11f0aee7cfd87956dc3d3753ec1cdbf7b33f5d4c09945967f0","observation_id":"282ecd47-c08c-4014-9c3e-312ebd510bd5","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"By Lemma 1, we know thatV ≤d =N G′ 1(1, d)for eachd≥0","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:88229c318f9a90751b576a55aa03c91d73a3139dc9efa3dc1e10750a42c7f491","observation_id":"7528f567-fa2f-41d1-8356-2cc49a197ac0","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:6531d2144004782e7c2fdbf802ef93f533c34d8ec0eabe8dc70a6648c21e9683","observation_id":"62e42998-4bc3-445c-b170-9d3a16026331","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":", vd)and 26 p′ = (v′ 0, v′ 1,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:6c65b1d147f726de4c9f0aa6a981e4176ad205d52bbfb9b0dd23f3ec60628c51","observation_id":"c615a8ac-4792-4cb2-ac1e-6c19f9135bea","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"With the definitions of these two collections and their corresponding total ordering, we have the following lemma","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:2ea927157370dc595fa9268c4ac9cc3d01d46cd2509d24dc2b0de2da494bced3","observation_id":"ee490c12-bae8-4fe2-9880-79a5d891c990","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"ThenH p,p′ must satisfy the following two properties: 1)H p,p′ is a tree","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:ddaf1eee4edbcf68cfe5257cc4ae6d9239a0864e41b9a0be869af46f5aaef170","observation_id":"5c8fee59-a8ee-408c-891f-c4748b401992","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Proof of Lemma 5.To prove the lemma, we consider two separate case:k=dandk̸=d","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:0add04c642aee28c6df0213b2a22d0161c2ecd8385a79c5632bdac003f0bce4a","observation_id":"6a2782f8-ca4a-47ef-897a-53bbe9d1bc2a","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:e6db55c69425f8a770d3a32828ee989f602f23961ebb02ad327c8364445d4f41","observation_id":"ae66467a-91a9-48f4-b1cf-27d786af8bdc","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Then we have P(the2 p logn-neighborhood ofiinGcontains a cycle| H ⊂ G) =O(n −1+γ)(23) for any constantγ >0","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:e24120b11d6fbe67c6712ac7d82584daa9f31fcb49660610c4b964d6c50fda9c","observation_id":"28e0a97d-f090-4926-b4d6-1c7057a35022","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":", d max}, we define event Ak ={|N G′ 1(1, k)| ≤K(λq) k logn} and E1,k ={∄i∈[n] :i∈S G′ 1(1, k)and the2l-neighborhood of ¯iin ¯Gcontains a cycle}","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:f030d9238b06ed91f267f6e727410aa0b20ce17de8abb78ae527c138eecf502d","observation_id":"8b03a6bb-c7b9-40a0-b4b2-3ee40ad972c7","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"It now suffices to show that for eachk∈ {0,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:f64aab9a7b74e09c3e74499940ab946768357b516f494ab3e4e2211674de5d16","observation_id":"798988ba-2a9d-4856-b762-f5ca7e3486e7","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"To simplify the notation, we useθto denote the likelihood thresholdexp (λsq)l−1 logn in this proof","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:4db7723136a661c92e900d98024ad7325ea1cb9530db25fcb8aa38888411c660","observation_id":"268351c3-9eeb-4ac1-8103-9c4d669121a7","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:21f1d794e71888ad11418686731d3e645b242a3a0b44eb8b2b2dddb7c318d532","observation_id":"7dc429bc-bab9-45ee-b924-755d73ebc08f","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:da70861e06011e3b8b18ae50967ded079ce235f04a68178a4cb4a90075ee64c1","observation_id":"45b3bf1d-86aa-4496-9055-dc2768381be8","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:5131fa5b284768a35f5c9eae5c4d2da506e5c3e33972dd352901d3ab08993301","observation_id":"27d4e3d4-f671-4788-8a22-75fc001b69b0","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"We have P(E c 2 |V d ̸=∅)≥P(E c 2 ∩ {v∈V d} |V d ̸=∅) =P(v∈V d |V d ̸=∅)·P(E c 2 |v∈V d) ≥ 1 n ·P(E c 2 |v∈V d), where the last inequality follows by symmetry","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:18bcab14bd3654df47338f42938fa04ad966dd449deb33e367e6eeaf84211a9a","observation_id":"3bcf99f1-75ed-4602-92bd-7e4935eef7f1","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Therefore, to complete the proof of (17), it suffices to show thatP(V d ̸=∅) = Θ(1)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:8c543bdcd37348b7116e64f4b18ed37faf71b2035f309e57e078a44c98603485","observation_id":"8a6462f8-f293-47dc-bf8c-7aa2813bfe3f","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:2571099e8b8ada621342b410e8c4b22af8d0acd60f5c15e2e251a0ce18be41fa","observation_id":"aa5ab3ef-838c-480b-bbc2-8faccdbab107","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:e1c021c79d735982bb409a8fe466a5553bc227bb715e7444dcd6f41a5f0d95cf","observation_id":"25fe7a78-9616-450e-b29e-cf6bfa67eed2","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"This algorithm starts at depthdof both trees","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:c9ab93898edd8ad757cded44104b7107d3e417c1fca1a65d67341ca29852308d","observation_id":"582d9813-9191-41c4-a172-66b9c008900f","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"3)H=T IC v,dmax−d+l, whereT IC v,dmax−d+l is the subtree inT IC rooted atvwith depth up tod max −d+l","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:7bab9f5d1c8b7c364144bba8eaac045fec5811ae51a1ce8f25e1a91b8f80031f","observation_id":"88cad733-e92f-45ba-97ff-b7147847240a","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"LetA={|N ↑| ≤ n1−2ϵ/3}","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:6f04df3366f9ae6f8bd406f7d709cbc663445500886bdee291b931180abd3597","observation_id":"4352784f-4cfd-4acf-943f-656cb311401a","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Notice thatd max −d+l=o(logn)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:c9e4a270ddab97765c1b7bd8932960e691a812607d902cca9f311ec8b924bbb6","observation_id":"967148c1-43ff-44d0-a8c2-dad8f1e221b1","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"DefineS=∪ i∈Vd\\{v}Si","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:71d9974db4734197f67f1630402ca55f2f51373ab5f978a5022f4b9aa02eb53b","observation_id":"f1f1c2f7-f4f6-4205-ad23-bb975b61ca08","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"3)H=T IC v,l+l+, whereT IC i,l+l+ is the subtree inT IC rooted atiwith depth up tod max −d+l","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:e846e266acd2dd08b4b76fd24fcaecfaf4144bec07944b277848d7b82a10101a","observation_id":"b94533a5-c42c-408a-a40a-47882196d624","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"48 Since we want to find a coupling under whichP(H ∼= T, ˜H ∼= ˜T)≥1− ˜O(n−3γ/4)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:f5166511ee767a357e8613882d21f5fa6311292cb4fa9fa2fa3c397efd9091b4","observation_id":"b46bcc76-284d-49dc-829d-4060d13b5132","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:f1c8b69bb5a96a1f8bcefbf0ea764b08f714a65c135d8e6db1840aa5cf6bf323","observation_id":"13737a04-2907-4f45-aa87-31de6ba77a5a","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":"Proof of Lemma 9.Notice that under eventsE k−1,A c k andB c k, bothH k and ˜Hk are trees","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:3664494de9c5880dc8ffd1d591960cb67ef7fd3ed9cc09c63f383610be34f94d","observation_id":"18608611-2374-4869-a111-c933280ed32a","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","resolver_source":null,"status":"malformed_identifier"},"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-06-27T05:46:05.715937Z","title":"Then we have P(the2 p logn-neighborhood ofiinGcontains a cycle| H ⊂ G) =O(n −1+γ)(23) for any constantγ >0","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:663715d122d898c11e27274869a06a6df8600b61577b023be7515fb7248daa26","observation_id":"a1f41da7-e292-4b19-8529-8ad6855b2836","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:f90c5350d502a6866e3439f01f88b03142719220cdb98533bff155b19928299a","observation_id":"e763a5d5-8429-405d-81a1-54faf82935bf","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:dca57f4b81137bd8066c58a0e4fc9ce66c26a77813fdb9f96582b1235214f8e9","observation_id":"c7890f28-52f9-4c1d-9d9a-07ef072a4a7f","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:7b96d2921d97d152dab63e1a4908927597a1344cf476ba8d9398c5578ca011f9","observation_id":"481b9007-0b3f-4098-b7d4-37afe24acc47","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:d927a195275c04db99fd64055b60461b8ac6e84614ecf69a38cf158062f41505","observation_id":"db2f0a98-a7cb-4491-9a3f-c6750cbbc3bf","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","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-06-27T05:46:05.715937Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-06-27T05:46:05.715937Z"},"links":{"citing_paper":"/paper/2606.12879"},"observation_digest":"sha256:5b52432de5d51b2bc8ae1839b471785f4b2a79546c1a05ea1e7b2d9c5faff96b","observation_id":"43284a54-ab43-4e15-9435-0bba7118b4d5","resolution":{"observed_at":"2026-06-27T05:46:05.715937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.12879","last_updated":"2026-06-11T04:08:39Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T03:54:07.485871Z","submitted_at":"2026-06-11T04:08:39Z","title":"Diffusion-Network Alignment: An Efficient Algorithm and Explicit Probability Bounds"},"reference_resolution":{"displayed":86,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":79,"verified_exact":4,"verified_fuzzy":0},"total_outbound_references":86},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 86 of 86 outbound references and 0 inbound Pith citation observations for arXiv:2606.12879."}