{"as_of":"2026-08-12T21:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea7e6e5c8b425ade7b7fea228c6203bea9c15b7b9b1a0d530543616fc3156f02","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-12T06:34:41.77262+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-08T03:33:04.935297Z","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:0a94e8d66a6b89a589849ea7c75ae686cabdf76fc98fc57afd9c7eb6db96fad9","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-08T03:33:04.935297Z","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:36e25d0163130ee0eacfbfa6f3357057c42fedadc1b9726f0bae01b8feac5b82","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-08T03:33:04.935297Z","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:ccf845cd9573685387456bce8a0faf276dcc86f4673d4a84984fd4ecb2ec9733","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-08T03:33:04.935297Z","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:96056ad2bd5d44e6eb044edc3a4eb58314ace3a7e4e80ce3545355d33923c917","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-08T03:33:04.935297Z","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:f53e64ed4be5d1b3113f48cd59fbddc4b3cdfd30a54be78eef33919641564c60","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-08T03:33:04.935297Z","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:cb59d270c16a600430e0ea98d3a2c3e8c626ba71d51a12f5cc651c852544acd4","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-07-06T06:10:06.376505Z","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-08T03:33:04.935297Z","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:caf12c53381aa3297a0fc76c494ff2ca711dd240fefbe1aac8e05a05bf049c1d","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T03:33:04.935297Z","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:344f9acb870fc07300b31e4dee301abbcc87384c6d1ca77eedb594a59eb4e41c","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-08T03:33:04.935297Z","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:33744aa61b3b40f8cbef7e04552379e4ba0db2d21202ae6174a563dbe7f04bf2","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-08T03:33:04.935297Z","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:e4ad06d1094de75d6200e0616466d21fd9f9aaa029cfad2262bbc8a1652673d7","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-08T03:33:04.935297Z","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:ae4cf38ce966651f6fff85ff3dc2bf7709cf31f3b6c293fa8087b3e2206f568b","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T03:33:04.935297Z","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:daf9e3ea056b1c573943a3599b9678d006f8498f2e05d658c189cd4e094538c5","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-08T03:33:04.935297Z","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:7cb67518ac655eac0c6c3c2380c40a8c551b43c581d1176774ac002f15ec2629","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-08T03:33:04.935297Z","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:e99c412bccf61d871003d3dcdd57be9928488f0cf56144922bd922243f7b7be2","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-08T03:33:04.935297Z","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:ec44d440be4425c779b042c077c6d3f8b284de8023064878caef6041444b01bd","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+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-12T06:34:36.333875+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-08T03:33:04.935297Z","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:fa23aa8147b03c7a753aaa22acaacb223c6258d14ed3879c394cbebaa542d1f8","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T03:33:04.935297Z","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:1677bef0302ea8e8b72615de974152b523f04970a29d2fa18705ea2bd2360f35","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-08T03:33:04.935297Z","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:10efcb4b63e5005d771c359f5f45a039bc9a29511b75f5753f064b21ef4aff1d","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-08T03:33:04.935297Z","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:0745125f6d0aa1d7da9ff1ec244ac6cb195acb5125f96f061195e527e0e09cef","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-09T16:19:41.564914Z","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-08T03:33:04.935297Z","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:2f32377706df21463695b96d587f7980a94c1016a03426cce8c4c9dfc5dbfd69","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T03:33:04.935297Z","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:3f2b0a5105cb1f210db8bd3975d84401633e18abbdd3e0bd87102c87f6f99c16","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-08T03:33:04.935297Z","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:4887dec8e7a29fcfeb34bce46a5e6f646b2a0b975d2909d318243412f1408e4b","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-08T03:33:04.935297Z","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:7d9325bf84c485fcbc03c930d8df1e6dda5769ef4b0d18038d2b30c3d7d20b10","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-08T03:33:04.935297Z","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:346eca5c542f64cfb4a2cf12149e6e925cf444585ed9c342f8e090994c01d400","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-08T03:33:04.935297Z","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:12d23de4063956a4f1bc50e6c2200789434e23f84973669543bc0db7a78eb272","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-08T03:33:04.935297Z","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:ea8f00fe2048090417666f256f187a6dd1e7bb69f9efe17ff29d7ff3723decac","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-08T03:33:04.935297Z","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:b989d2f34214337a1c659896972513869d6ed355a0ae873fc757ef7cf20f3ca2","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-08T03:33:04.935297Z","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:a1d207ab3030b0bd33f38b83a280ae249a15190b6b8d2bd42abc8cbc2ad3627d","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-08T03:33:04.935297Z","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:f7331c017fb69149725744fb6fb6a6462b19898d62a63e21532f6fdba43257cf","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-08T03:33:04.935297Z","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:4c995b51d8d74b7bf094557d11f2a45510dcc310fafe72a01d9c97654ad2177e","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-08T03:33:04.935297Z","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:03a85b272a46a0322f8d31088b8462ecb1b6e7efb26a503bb50fddb0228b65fd","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-08T03:33:04.935297Z","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:4d026086505d82c6a8737d8a3a5ecf4ea26cdcaf87ca596a1aec3d90cd065105","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-08T03:33:04.935297Z","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:7a524e321d16e3d96f09e1cfab9e5f7b372e7eb7e3014ba11ae96c50a89dffc4","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-08T03:33:04.935297Z","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:8290df9a5ecb485ee9c7e215efa5c0e7c142189375b0731e2a83a4813e0e53be","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-12T15:50:37.034026Z","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-08T03:33:04.935297Z","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:682e7d790377708595083bbc6ef2f73456920426fd2da3e61a5e9fb50f28358c","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-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T03:33:04.935297Z","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:ed8a175972b417c3479ac3764a3f926779042f092c34a07896af359a5ccb24fd","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-08T03:33:04.935297Z","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:dfc0b1a68c3521d45c08a4cb7eacfd0f2ba24d2da4a7cebaff2c1a44b538d3cc","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-08T03:33:04.935297Z","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:fde739b324b11b58cbc8f3f369e65977babb216e622e497a828cea8c6be34b32","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-08T03:33:04.935297Z","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:4cb3bfa5f02c841cca932400989d3b37d51a97ea7a8527b3303dddb2e6cbf974","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-08T03:33:04.935297Z","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:60dabadcb2f643df3605e15694b082301bdf3de7a45948bb8acc160dee5fbfd2","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-08T03:33:04.935297Z","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:88b35a07032f6cfebd5e05250d72f33ed86702ec603a5f8df2378834acacba82","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-08T03:33:04.935297Z","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:6c721764b1d805406d5d68b19a829f0996ec59148f002b8b571d92fb3f6350b2","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-08T03:33:04.935297Z","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:4dc6ed35a0b901089dac66824ead77d6c55ebe656ef35f049de2c412ddd8f3c4","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-08T03:33:04.935297Z","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:0b909ea4c381e7a2804ffd6675e56c9d9aacf28323e174c7ea7fc5d05a0b80f3","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-08T03:33:04.935297Z","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:02402f644282cd8b51f84eeaffe20c5ce3e55d701627ef6ec4f7af54a33a5180","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-08T03:33:04.935297Z","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:639ae5d968a1a729009515da96220b9550818cd94da0eec6248db4711bc87057","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-08T03:33:04.935297Z","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:163f03db5e053f1fefaf346212dfea1636b0da88f1481d052a55ce1e0eb417c1","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-08T03:33:04.935297Z","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:37475bfd89bd90f57a2ad29a40e25e738231ad6c255ec4aac8ca9d39c74debba","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-08T03:33:04.935297Z","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:aa096870a9629fff00c6a20c3c385f19ecd8326b01b81e402889fea2674e01ed","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-08T03:33:04.935297Z","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:4e44090a5402482ff0bd0a4d47c64744fec28b83c529c642c4a2f8df094defe2","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-08T03:33:04.935297Z","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:c1e86e0eac4cbda9588717333a5a585dc717158391686bb20968ae79e11621fa","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-08T03:33:04.935297Z","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:6df693fb4dbeb1acaa7dd76d41e8ef54c20ae159e87560362babdd9f64cc2bdc","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-08T03:33:04.935297Z","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:d914ca6bbbd8c94bffb4a0c2f20160b37b977960a74d515edfbe9e3c61a0cc54","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-08T03:33:04.935297Z","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:d1286eb4b2294179b9eb58c9ddbd150b0734a4ff0e78fadaa4cb7865bce9e788","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-08T03:33:04.935297Z","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:32ffcf801af33c3447e5ef465bb675629c4edcc3a6789c03224d9b243e1391bd","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-08T03:33:04.935297Z","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:a675689a92d9821a419c28ea9e3f5cab7bbdc96528005c76ecc0fa41e4cdfafe","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-08T03:33:04.935297Z","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:94126588898fe30da7bb768fdda470aef1d1405b2449e2d7889873f392759844","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-08T03:33:04.935297Z","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:41f025e3790c2bf02eec1cf0ca0e70eb597129fd0c70343b1553b6eca257d557","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-08T03:33:04.935297Z","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:a583e09aa8f5f95fd9b2d759633ed583d41bd4129020ea19b62a94357dd7c73c","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-08T03:33:04.935297Z","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:f6daea77aa56f84bed6a28b0be68cc16c83267fd591abaacc8a7ffe87538f9d4","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-08T03:33:04.935297Z","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:90c1bdce916aaf1a8ef8abac1347c3b4acb10c9feb883ac5932808b641c778c4","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-08T03:33:04.935297Z","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:8a015a7aa732f87f6fdb010372a145b852b7d2ff2118e765daf8e33f5f09acdc","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-08T03:33:04.935297Z","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:64109cf05681e2d3974beb5c71da65651b691ad03ea6ac222a8742266c6666a5","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-08T03:33:04.935297Z","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:1e91992b6be0cada6934f3cea9d06f7771d206aa1616969622d4c45e8df9b743","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-08T03:33:04.935297Z","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:770cc55056ab8437e8f3962038af698d87e62d9d0f4e3a85e2523b5610f4d8c2","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-08T03:33:04.935297Z","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:0f674577dc5b83239f381bf61fd369d39200cece59f3fec4be79681e12c1f641","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-08T03:33:04.935297Z","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:0aacac135d7bdc0b7fb8b3de36a1a06dce2ca7ae816f5039ec8e29b353e3074a","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-08T03:33:04.935297Z","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:cf6c6119c6308137a5b3925dec0175a5bfca5b2a716a798834e487fed0789ed0","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-08T03:33:04.935297Z","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:f89cee8ccdf367745903d53bec57f282d6fe523b801f1b40a8c9e8faf93e779f","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-08T03:33:04.935297Z","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:a411fca6c6c118bc3c12665e2e875e4e61164c3e4c47cd303caacccb8a463ae8","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-08T03:33:04.935297Z","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:c78aba8afb09072f8d7f40864aa3803f200d2780db053afaafc9c491dea22ee9","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-08T03:33:04.935297Z","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:4cdb2ba21c76d5bbf287ec4a7ddbcbf773233d333a82b63f6f67cab90089e8c3","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-08T03:33:04.935297Z","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:1addf95c385ecd313fa40786d881cff6debc199de09b2b7a2cea31796d8b1940","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-08T03:33:04.935297Z","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:e60e28034738a892bfdc8976ce173d5c3f3739bff58afd71609cb87a3b59520c","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-08T03:33:04.935297Z","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:c082a2ae6a626dcdf7cb77e0bd845e6ac88de63b730b1e0bfcc04e924b584674","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-08T03:33:04.935297Z","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:ec48631b35b25d87126f67419b22475008d3afe3916a9b24dcbd46418f820d5d","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-08T03:33:04.935297Z","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:a6619c388cc9f2f5e6f047fa9595b02cbc383eb419ad3943ab63c907430113c8","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-08T03:33:04.935297Z","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:acbc3f3f197ba42d41058227fdb629f7356c92cffea90127f01763c47861bf40","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-08T03:33:04.935297Z","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:e2d71f9b0d2a2b53f47623f8a1fe22c44a830a51733cc6161313596800f63c1b","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-08T03:33:04.935297Z","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:541e1679df16ce5f6b92ac0043dca25ed6f65387c020e40712503f58692bbbdc","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-08T03:33:04.935297Z","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:dd77b654c4b4e398a879bd9ac23ad5463edee800a1607f07d8ee7768d0911555","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-08T03:33:04.935297Z","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:2747ac1b2d9773bcb4aef45cdf0f91e4b29218fe6a519863e1f2a4102f16bfd0","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-08T03:33:04.935297Z","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:2dfbc8096fbc92bc7ef27f68cbb0626d7853c5ed0f16185492bbb9adf447cadf","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-08T03:33:04.935297Z","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:fd8a641a62594a50814714885be88893d53f731c48046f3e7d8884feabd1c5f8","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-08T03:33:04.935297Z","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:c619b3fb47c700c22ad13fbbdefc2b5ee64bf86853abc2979014fbf28dcdc603","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-08T03:33:04.935297Z","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:482e957048b0880fe7fbe4803c03d4b497141ace08a4ef884f529d087d46d1fe","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-08T03:33:04.935297Z","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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 86 of 86 outbound references and 0 inbound Pith citation observations for arXiv:2606.12879."}