{"as_of":"2026-08-08T10:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee3d81371b3f8433a76320de7d07c8d532d61fc54a70c845ff98815d6389bf9f","coverage":[{"denominator":78,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":78,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:25:48.287535Z","state":"measured"},{"denominator":79,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":79,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-09T23:35:44.587588Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T14:06:03.675356Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"cited_work":{"arxiv_id":"2506.02825","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.02825","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","venue":null,"work_id":"5ab4110e-e2f2-45af-a014-53fd13ada490","year":2025},"citing_paper":{"arxiv_id":"2604.20072","last_updated":"2026-04-22T00:37:21Z","snapshot_observed_at":"2026-07-06T23:06:35.507008Z","submitted_at":"2026-04-22T00:37:21Z","title":"Vertex misalignment and changepoint localization in network time series","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-09T23:35:44.587588Z"},"links":{"cited_paper":"/paper/2506.02825","citing_paper":"/paper/2604.20072"},"observation_digest":"sha256:a1c990c0b93343805e5b316b7dee4264bb3913738fd48362dfcfe8abe6828e3b","observation_id":"14931eb3-259e-46ee-8065-efab6df33732","resolution":{"observed_at":"2026-05-11T14:06:03.679577Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.02825/citation-record","integrity":"/paper/2506.02825/integrity","json":"/paper/2506.02825/citation-record.json","paper":"/paper/2506.02825"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2003.14250","last_updated":"2020-03-31T14:41:02Z","snapshot_observed_at":"2026-07-06T09:08:46.282299Z","submitted_at":"2020-03-31T14:41:02Z","title":"On Two Distinct Sources of Nonidentifiability in Latent Position Random Graph Models","version":1},"cited_work":{"arxiv_id":"2003.14250","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.14250","snapshot_observed_at":"2026-08-07T11:25:49.079886Z","title":"On Two Distinct Sources of Nonidentifiability in Latent Position Random Graph Models","venue":"math.ST","work_id":"e81a389c-d377-4406-9114-9c12e34ef815","year":2020},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:40.373005Z"},"links":{"cited_paper":"/paper/2003.14250","citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:1654f546156ed4361a1e0e040a648a89f014cded2426a47575140e37779edf4c","observation_id":"a302f6be-7a6c-44a9-bfd9-5d789fcf2ede","resolution":{"observed_at":"2026-08-07T11:25:49.216664Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.06381","last_updated":"2024-10-08T21:28:17Z","snapshot_observed_at":"2026-07-06T19:30:04.518857Z","submitted_at":"2024-10-08T21:28:17Z","title":"Statistical Inference for Low-Rank Tensors: Heteroskedasticity, Subgaussianity, and Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.06381","snapshot_observed_at":"2026-08-07T11:25:40.761104Z","title":"Statistical inference for low-rank tensors: Het- eroskedasticity, subgaussianity, and applications","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:40.761104Z"},"links":{"cited_paper":"/paper/2410.06381","citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:0df9e8eee7ca1af9d403db94c8b44d549c77a94686a7ac1b4cea7ff907bea4e9","observation_id":"e4788304-c9c5-4c94-8cfd-535a71d1c814","resolution":{"observed_at":"2026-08-07T11:25:40.761104Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:03.955879Z","title":null,"venue":null,"work_id":"102b0d1a-7a29-4694-b961-eed0372cabc3","year":2024},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:41.300093Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:fe98ad36ffd51f954a95c46caad2cb12f2f19475c642f24b4c02a3debc105543","observation_id":"fc5ddd9f-068f-4684-8ba3-f0acfd1a492f","resolution":{"observed_at":"2026-08-07T11:26:04.092272Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:03.735691Z","title":"Arroyo, A","venue":null,"work_id":"e289ca95-9c80-447a-a133-9645ab4dd0a0","year":2021},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:41.366199Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:2e3169bb27e05dde832e136471b83ce24148b78a3f365b11832767a708637f78","observation_id":"3901993f-6e2b-4790-ac80-4ba078e34057","resolution":{"observed_at":"2026-08-07T11:26:03.842481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:03.470778Z","title":"Asta and C","venue":null,"work_id":"bc8fd86b-538e-4b2e-8d6f-f2117aefe089","year":2015},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:41.442464Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:8217a90c11a55d16f5c59ef1d14227bd6bc0c13a90bec2727a9517e8e10d3986","observation_id":"3e1a51ef-c1be-46b9-8e20-c6e86871c4c1","resolution":{"observed_at":"2026-08-07T11:26:03.625698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:03.176888Z","title":"Athreya, D","venue":null,"work_id":"843ea435-fcb3-4631-a35f-c0bc6b3cd2d4","year":2018},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:41.535443Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:5b2939dac0e0e9162a6c96ba4d817bb2a5857a1ca83d8cbf6715fc7d244b619c","observation_id":"9607d426-4c7c-4b8e-bbcc-6bc141bf536f","resolution":{"observed_at":"2026-08-07T11:26:03.351419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:02.946041Z","title":null,"venue":null,"work_id":"8e97b67f-923f-43f3-9697-f6fb65978ba7","year":2020},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:41.591352Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:42e79aeeb70cb50fdc4071cb7aa93f6d93187338d581f676146578148af63a49","observation_id":"d0e8f83d-148f-4bac-8a17-e3620959cc76","resolution":{"observed_at":"2026-08-07T11:26:03.056659Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:02.641903Z","title":"Barak, C","venue":null,"work_id":"fa471c16-6745-423d-be48-fc02b03d9a67","year":2019},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:41.680027Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:65033be23814964f35c0e03fb71ce7de99494aa3767d885c0268b498bc3b8f9f","observation_id":"b46d74bd-26e7-4159-87c5-4ac8acafdc14","resolution":{"observed_at":"2026-08-07T11:26:02.787774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:02.378895Z","title":"Bento and S","venue":null,"work_id":"db244984-e196-4797-9ba2-3c188a980b80","year":2018},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:41.756059Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:8a763ce202924c8d11f5e2ee0d5d4589f3abacc84b2b70e4660dbb94ec7b69cc","observation_id":"ec4ac491-b683-4f94-8e8f-d66ae8f52779","resolution":{"observed_at":"2026-08-07T11:26:02.502348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:02.092011Z","title":"Chatterjee","venue":null,"work_id":"21d25e15-68fe-4e79-bd94-29f20bc57517","year":2014},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:41.824676Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:655fd70fb0134894f7f7dd3fe5fd5dbe92f250852cf4e38acebf6dd0d2f0f093","observation_id":"cbd54005-86ef-4acf-b79c-34ff13a68977","resolution":{"observed_at":"2026-08-07T11:26:02.214417Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T11:25:41.974637Z","title":"Estimating graph dimension with cross-validated eigenvalues","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:41.974637Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:f4e8710ec573975709c7e0b85cd5f250fc501bcf072cbe6d8bc33c590e4d4ec6","observation_id":"9e76666c-ca51-465f-926d-360d547e3cd2","resolution":{"observed_at":"2026-08-07T11:25:41.974637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:01.894242Z","title":"Chung, R","venue":null,"work_id":"57291731-5a6e-403a-b599-492549a8a003","year":2021},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:42.256881Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:9a911e380bbe09eae49153a2ea92efecbebdc0c977a559165847119add4c50f7","observation_id":"9718e373-3f7b-47eb-9469-02c5610e92a7","resolution":{"observed_at":"2026-08-07T11:26:01.992603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:01.732137Z","title":"Conte, P","venue":null,"work_id":"85aa92dd-fbb1-42f9-8071-f784997ed995","year":2004},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:42.584065Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:4948e3a59bb5d9c77284263c0fe45fa6af12f1d086e3f217c75641e3b789c230","observation_id":"67383c5b-dfa8-4ee6-8bfd-e4d1ead7bf98","resolution":{"observed_at":"2026-08-07T11:26:01.796024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:01.560200Z","title":"Cullina and N","venue":null,"work_id":"9c7b6461-4e55-4b9c-b589-b3645d848c7c","year":2016},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:42.874364Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:f1f7c9c5acf26401037a081a003d8f5b36ff89ef6b02edd9f059fc4f0693631f","observation_id":"bcf97037-c7a0-46ca-a5c5-b7507d11bf5b","resolution":{"observed_at":"2026-08-07T11:26:01.632410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.06783","snapshot_observed_at":"2026-08-07T11:25:42.900416Z","title":"Cullina and N","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:42.900416Z"},"links":{"cited_paper":"/paper/1711.06783","citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:29d8197a3c954befa3d4e48f552b5bca05c99c3b284d533d3c52db24e0325211","observation_id":"234c4f88-2605-4e7d-b4e2-a56ef8cce874","resolution":{"observed_at":"2026-08-07T11:25:42.900416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:01.358664Z","title":"Hypothesis testing for equality of latent positions in random graphs","venue":null,"work_id":"256c38ec-2aaf-4de5-b772-7314d999fca3","year":2023},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:42.957964Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:3a837b80dd6029557bf4f2b56844c2995696ecefff4d135e299d3dca7774e41b","observation_id":"1f6ad4d4-a80e-4175-9ef0-91483aa04ad9","resolution":{"observed_at":"2026-08-07T11:26:01.465127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:01.114855Z","title":"Fifty years of graph match- ing, network alignment and network comparison","venue":null,"work_id":"2ee1c13a-ab8d-416b-855b-2f69d84fcc8a","year":2016},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:43.114704Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:2bfeecb72ea0bfedec9e6b751b72077930f62bcb2137644077295767e1cde217","observation_id":"9f7ab361-d96b-4fd6-972b-2055770563b3","resolution":{"observed_at":"2026-08-07T11:26:01.238938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:00.838564Z","title":null,"venue":null,"work_id":"f765a398-99b5-4af6-a22e-d13424f413db","year":null},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:43.278869Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:cea23afad90ea2cd2b36db3774113b621e852e15925e26ba7df367e9e0df6b86","observation_id":"165577a0-2ed8-4f5a-8a94-c1a67a27253b","resolution":{"observed_at":"2026-08-07T11:26:00.935765Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:00.688778Z","title":"Functional connectome fingerprinting: identifying individuals using patterns of brain connectivity","venue":null,"work_id":"e391051e-98f2-484b-bdc8-a41c41137561","year":2015},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:43.401369Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:f44699189d044bb2f32490bf44837b9099f12d88ad58170b2c5a598624bafefd","observation_id":"cd12a902-bafb-4268-9def-3484e199a161","resolution":{"observed_at":"2026-08-07T11:26:00.762399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:00.415381Z","title":null,"venue":null,"work_id":"6d673e3a-0756-4cde-be2b-6f32fa587104","year":2019},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:43.559961Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:f6a01b22c8971992a03487d5677d403a74330c6321d7467fc810b288a235de71","observation_id":"21c06f89-f4bf-43dd-a698-5c0232c73dc7","resolution":{"observed_at":"2026-08-07T11:26:00.577563Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:26:00.208642Z","title":null,"venue":null,"work_id":"54c3da4b-a5b7-4a54-b1cc-f1ee3146b602","year":2019},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:43.784914Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:f040ce38b994044d47559e9e4972b233c9689e1f0de14157582490775b6f8059","observation_id":"45b51893-c0e4-4b44-8591-f0db13ee38d4","resolution":{"observed_at":"2026-08-07T11:26:00.326585Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:59.995947Z","title":null,"venue":null,"work_id":"b0b2a224-947a-4bd6-b20e-5cd5266b5cfe","year":2021},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:43.983657Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:34b98de23ae44cf4edf33c39763ccc10df1819a4ae67140d89e7d3b2ee71ee4b","observation_id":"1a3107d0-ada8-46a9-b8b8-84350c35b864","resolution":{"observed_at":"2026-08-07T11:26:00.080483Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:59.771577Z","title":"Two-sample hypothesis testing for inhomogeneous random graphs","venue":null,"work_id":"48a5428b-aa7d-44f0-83cf-2c9b5d86355d","year":2020},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:44.154111Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:c30be110e51a88606e6127860188c54b3220ea21c85f844d54f86cacb5e25939","observation_id":"81fa44e5-bc31-4001-aa01-5cbe2d4cbebe","resolution":{"observed_at":"2026-08-07T11:25:59.886014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:59.525305Z","title":"Practical methods for graph two- sample testing","venue":null,"work_id":"b25ae597-1445-49c5-b7c4-5e4aea2b78a9","year":2018},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:44.315298Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:766bd75cffb16dbe53281329a1cc449bef09b6de3efba1d7cbc88f6e519d3516","observation_id":"89713ca5-a5ba-4cbc-84eb-8ce56318b0d3","resolution":{"observed_at":"2026-08-07T11:25:59.664412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:59.359612Z","title":null,"venue":null,"work_id":"2db75678-c97e-446b-9980-43c4717eea1e","year":2013},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:44.392263Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:4a4a2346bef51c450ace68bfb0d106125f6b22289d2e5403b758cf6613d5bf47","observation_id":"acf44b8f-96b1-4a88-a0b3-08a3b02cc9d0","resolution":{"observed_at":"2026-08-07T11:25:59.421113Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:59.161894Z","title":null,"venue":null,"work_id":"5a4e7e7c-095d-4977-a924-f826080b815a","year":2010},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:44.484358Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:4c146888956c3f097f7d2db038ac4b621e6f25e35e41299320295de7cd4a43fc","observation_id":"53a7cd1c-c5f8-4e58-91bb-5513f24555f8","resolution":{"observed_at":"2026-08-07T11:25:59.278412Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:58.788774Z","title":null,"venue":null,"work_id":"9ba23b76-7d17-42d2-b731-6f174a1bf226","year":2002},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:44.573202Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:d8c509ffd0995499b1af6d66b99d6b394c90b93b881118a8ace6066b0757fe8b","observation_id":"dbcf84d3-2bf7-4892-8f26-dd64987340f1","resolution":{"observed_at":"2026-08-07T11:25:58.949330Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.04457","last_updated":"2020-02-10T06:19:50Z","snapshot_observed_at":"2026-07-06T08:56:27.577413Z","submitted_at":"2020-02-10T06:19:50Z","title":"Community Detection on Mixture Multi-layer Networks via Regularized Tensor Decomposition","version":1},"cited_work":{"arxiv_id":"2002.04457","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.04457","snapshot_observed_at":"2026-08-07T11:25:48.713463Z","title":"Community Detection on Mixture Multi-layer Networks via Regularized Tensor Decomposition","venue":"cs.SI","work_id":"2d655081-1220-4cbe-9291-b9d799eaa73c","year":2020},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:44.671522Z"},"links":{"cited_paper":"/paper/2002.04457","citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:32992c1e15cdd72b5b8e5212f4612ca64eadb2cf617eea071917ca27800fa756","observation_id":"6207870f-9433-40b4-a24e-345505a3bb7f","resolution":{"observed_at":"2026-08-07T11:25:48.844844Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:58.395622Z","title":"Josephs, W","venue":null,"work_id":"6be6da6d-f2bc-4ea2-838e-73469347347a","year":2021},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:44.753031Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:c4ccf671d3d873de00e40b5fd14358790deb2c6edcc9c0c530e027de16a849c5","observation_id":"9cbaca5e-638e-404c-b337-f1d5893c0076","resolution":{"observed_at":"2026-08-07T11:25:58.553191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:58.018333Z","title":null,"venue":null,"work_id":"51e0b69c-3e98-48de-8030-12d8ead84f41","year":2020},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:44.845279Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:aa48f429ad37937c3b6027305a97525c96488606c90509d4ce1995dcda965849","observation_id":"f3c66cc8-5b69-49a0-aae5-0ed5c60bf0d2","resolution":{"observed_at":"2026-08-07T11:25:58.129521Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:57.767437Z","title":null,"venue":null,"work_id":"2e771269-4aca-4ffa-ae23-99fbb37476bf","year":1955},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:44.940635Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:95703d50500d9247ec634afdce8cb6f28659e796db4211bef5c5f22a70aa4a2e","observation_id":"c283f40c-0ea7-4cfc-b99c-c5b4d8a9548c","resolution":{"observed_at":"2026-08-07T11:25:57.902830Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.09355","last_updated":"2019-06-26T01:49:26Z","snapshot_observed_at":"2026-07-06T05:44:20.438335Z","submitted_at":"2017-05-25T20:48:15Z","title":"A central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.09355","snapshot_observed_at":"2026-08-07T11:25:45.026587Z","title":"Levin, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.026587Z"},"links":{"cited_paper":"/paper/1705.09355","citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:051a89b2cfbbe6681dc03f6a18ce15d2f1694cc55556c4b99a15c5fef61b2971","observation_id":"19b589db-99cc-4f58-a8f2-d405f913f025","resolution":{"observed_at":"2026-08-07T11:25:45.026587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:57.463643Z","title":"Levin and E","venue":null,"work_id":"e8b02897-7cb8-4109-83da-9882f98d6f92","year":2025},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.102159Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:b7e345d73fd7b0bed7b09406d5ff4c1b14ea0aa075920acd19db6c01d7c70db7","observation_id":"685d2e81-221f-437c-b7ef-49a9163167c6","resolution":{"observed_at":"2026-08-07T11:25:57.574924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:57.175106Z","title":null,"venue":null,"work_id":"0ab1c315-054d-45b6-92c5-da2c9345b873","year":2021},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.167414Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:2d7909cf931c899619de6dd5abdaa4c7f2a0896c5f09871509f27142e351b2bd","observation_id":"285f3fc9-847f-42c1-b021-83a85f47c76b","resolution":{"observed_at":"2026-08-07T11:25:57.261505Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:57.005968Z","title":"Lyzinski","venue":null,"work_id":"d9b1082d-58b0-41a1-91d5-af3755221ac4","year":2018},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.237585Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:ac747b586b8033d88012a90f77bfae7ad3342bd0f676216fb673c8a234db69cf","observation_id":"f9492c61-58c5-4c35-af3f-803f7d84fb75","resolution":{"observed_at":"2026-08-07T11:25:57.087846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:56.793354Z","title":"Lyzinski, D.E","venue":null,"work_id":"d20a2466-9731-4b29-90f8-e6bf52e00fea","year":2014},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.316180Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:999b9f568b73434f77c21d65f12f8c870d3294b111d10dee41c4cf43445ef9ac","observation_id":"4fd42f00-7929-4529-9ff8-a8ee04e3af7f","resolution":{"observed_at":"2026-08-07T11:25:56.861522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:56.661562Z","title":"Lyzinski, D","venue":null,"work_id":"222c8520-9cca-47d9-aefa-1b1ccc202e62","year":2014},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.404032Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:967ec639ebe76d7965e9925535b95404dd55039d7c10363506f309ae48eba469","observation_id":"c631dcaa-8098-44ea-bfd9-64c35bcfed85","resolution":{"observed_at":"2026-08-07T11:25:56.711793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:56.409718Z","title":"Seeded graph matching via joint optimization of fidelity and commensurability","venue":null,"work_id":"4e78dbd8-45e1-4b63-a225-019e9e7141b8","year":2014},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.477678Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:3a2860eb694ae96773140d7db6d3d027893c5c4a0892ed63e98734252c461ad8","observation_id":"510639b7-3752-4c79-9e48-abc738c4c99a","resolution":{"observed_at":"2026-08-07T11:25:56.554877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:56.081819Z","title":"Random graph matching at otter’s threshold via counting chandeliers","venue":null,"work_id":"2ac6ad68-9d11-4f57-97e9-431a94a24016","year":2023},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.544473Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:712b12be030010b96507578b8c9179f7d90d77765a4be95b385027de96c53052","observation_id":"84a1a444-bd8d-4d41-af57-f8e376d4a2ed","resolution":{"observed_at":"2026-08-07T11:25:56.209966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:55.941265Z","title":"Bilin- gual lexicon induction for low-resource languages using graph matching via optimal transport","venue":null,"work_id":"c95609da-0ac8-4d9b-b826-d64c7ee914de","year":2022},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.620421Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:576e3ab1d00d2e6223377c593949c9c114840ba508b774717dbcc8b93ca63577","observation_id":"8e57917f-845b-4717-bba0-6bdd9d9304ba","resolution":{"observed_at":"2026-08-07T11:25:55.982713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:55.698744Z","title":"Mossel and J","venue":null,"work_id":"4dee64b5-e138-4811-9d97-281acc1ad26b","year":2020},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.697008Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:da06a57e5b9690203586f4c43b9c5fd6d54cd10a3812ac3c1eb576f3e7f50860","observation_id":"a7772cf1-82e3-4103-9714-3ee9e4dfb647","resolution":{"observed_at":"2026-08-07T11:25:55.837316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:55.518176Z","title":"Random graph models of social networks","venue":null,"work_id":"c861e4e8-e148-44db-87a2-e65d462da32d","year":2002},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.801177Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:6633de750e85fbd28599a198241df8559db3ebadf753248680f4edc14a60da01","observation_id":"e84b9568-4a74-4891-bc69-c28b5ec702e9","resolution":{"observed_at":"2026-08-07T11:25:55.595462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:55.339637Z","title":null,"venue":null,"work_id":"0eaaf59a-9811-4157-9c33-2a5bf96c9793","year":2014},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.869992Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:765d39a6c83a3fe6f91d2c05445d1b13f6851e56a9d807e72a0cf767af920abd","observation_id":"91d021b6-75f0-43c8-acc8-c9dfe12fab15","resolution":{"observed_at":"2026-08-07T11:25:55.417198Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:55.155960Z","title":"Sparse subspace clustering in diverse multiplex network model","venue":null,"work_id":"b334e4a3-02a1-4a00-a9b7-8698ce930b77","year":2024},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:45.949994Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:9713b84cb75b6f856ddd002e09451bfd9d039baebce5f6959d9cc08d759fe221","observation_id":"5ae051bf-1dc2-4d72-83de-f2bd5e36693d","resolution":{"observed_at":"2026-08-07T11:25:55.263015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01613","last_updated":"2025-02-03T22:26:56Z","snapshot_observed_at":"2026-07-06T17:24:29.001170Z","submitted_at":"2024-02-02T18:23:18Z","title":"Nomic Embed: Training a Reproducible Long Context Text Embedder","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01613","snapshot_observed_at":"2026-08-07T11:25:46.029625Z","title":"Nomic embed: Training a reproducible long context text embedder","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.029625Z"},"links":{"cited_paper":"/paper/2402.01613","citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:482f23975bca7a8ce52d64f65bc067fe0d3493fcac87819c4d5c277eb7e8ef14","observation_id":"17c5a633-67ae-4098-a140-ce5822d89682","resolution":{"observed_at":"2026-08-07T11:25:46.029625Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:54.971347Z","title":null,"venue":null,"work_id":"e6b5d8c1-3429-4b9c-a357-36e7e859323c","year":2010},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.120486Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:5b3f3b10a691df1158e9d58667d0cbec7103c0877a2f1db0307638fee16b19ee","observation_id":"0034acd3-133b-4061-af0c-35595d3de97d","resolution":{"observed_at":"2026-08-07T11:25:55.042548Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:54.753381Z","title":"Pantazis, A","venue":null,"work_id":"01605a5c-8723-41e8-b936-455ce3f1ff34","year":2022},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.216499Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:5dcddcf063e6fb927f4708623ea0a313aedf409648ef1f5031997ded96a5d6bd","observation_id":"088c3697-d433-4bea-920d-f5801be68bf4","resolution":{"observed_at":"2026-08-07T11:25:54.858134Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:54.572389Z","title":"Spectral clustering in the dynamic stochastic block model","venue":null,"work_id":"8e52acae-bd1b-4618-95a8-98c85d86b662","year":2019},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.308432Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:6a817fb183e547c936968aa01008a2609abf0e7a4189312dab2317f199b5daf9","observation_id":"dac00b9e-6899-4d0a-ba0a-c774e1eb2fee","resolution":{"observed_at":"2026-08-07T11:25:54.655528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:54.412486Z","title":null,"venue":null,"work_id":"f07bfbef-9958-4762-a46d-67d511498f18","year":2019},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.431684Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:5d0b0bf8556c460fc7d40fba978ee81a61cac6cf62d5e7ec83952b3c8bd963c1","observation_id":"bfcd5b17-8fd4-4112-99d6-146913cf67d7","resolution":{"observed_at":"2026-08-07T11:25:54.494786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:54.252239Z","title":"Racz and A","venue":null,"work_id":"a988984a-de6b-4db8-a2eb-0ae302e3c6e2","year":2021},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.528768Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:a9b3257b48e95f41530d630374323a01703351d40fef0ed8ea16e2ac4e5f7947","observation_id":"65e56a6b-5234-4e06-8d15-3f74543ccd23","resolution":{"observed_at":"2026-08-07T11:25:54.324896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:54.092919Z","title":"Matching correlated inhomogeneous random graphs using the k-core estimator","venue":null,"work_id":"8054b8f7-3b67-4321-965b-5efd9bb7fa66","year":2023},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.619745Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:8b18cdb1a544935b1c5c1c4765bf4ab1fc9a59f419ff8e4ac14152556a5a1d65","observation_id":"8a9be107-46da-40f1-8f44-d305c9d310ab","resolution":{"observed_at":"2026-08-07T11:25:54.164228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:53.883148Z","title":"Network classification with applications to brain connectomics","venue":null,"work_id":"353d35b0-27fe-4231-b4fb-a6fb6503cd1e","year":2019},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.723382Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:c34490d7f2248d29a6191f3bf7533f5dbbc2c50caaf9f6ef2d3b22d077ee4355","observation_id":"8464c7b1-bee3-4648-8d6e-b68b1105594f","resolution":{"observed_at":"2026-08-07T11:25:53.979521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:53.698817Z","title":null,"venue":null,"work_id":"38b09970-a088-4037-a442-e7b683cf2125","year":1915},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.787750Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:5ee943482caf70a15282ea245b0e575947e60c998c43cf32118de58ec5521c8e","observation_id":"d83b1323-d100-4212-a4e1-560ced54af31","resolution":{"observed_at":"2026-08-07T11:25:53.773274Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:53.483721Z","title":null,"venue":null,"work_id":"32b2d7c5-2dda-4638-a32e-20aeb788c584","year":2013},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.852481Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:89df5c1bf98d7394fce509a68dc5cf460116d7684947d1e148ec1a5a8ccb9987","observation_id":"d22d9db2-420b-4990-9cc8-77bc81eff52a","resolution":{"observed_at":"2026-08-07T11:25:53.584835Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:53.299951Z","title":"Rubin-Delanchy, J","venue":null,"work_id":"797fbdd4-b575-48c8-9e4b-c20021dc757c","year":2022},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.908223Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:579d4256b0c0d17b10cc8838e819c07d22c59236a38e6e5151c47355d329c9b7","observation_id":"d677f92b-76f8-4e34-b0e3-a5572e161a63","resolution":{"observed_at":"2026-08-07T11:25:53.371180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:53.080475Z","title":"Saxena and V","venue":null,"work_id":"38332844-bd13-4771-81d2-2303d9e3355b","year":2025},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:46.965597Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:ba63c79398200e5990397b68c7c9086a997ff4bc637dca68b4b42a61dc1e0e5f","observation_id":"9dffa535-cd0b-417b-be4c-314d1f1bc114","resolution":{"observed_at":"2026-08-07T11:25:53.189160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:52.897306Z","title":null,"venue":null,"work_id":"717000fe-6200-4346-98ef-f9712da73a98","year":2012},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.021220Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:fcacaa110122a64e63565fa43630601af9ee4a8a661d33cf63429c06336479f0","observation_id":"dab6acf9-f838-4b59-812f-ac38b1c6cbc3","resolution":{"observed_at":"2026-08-07T11:25:53.000990Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:52.679781Z","title":null,"venue":null,"work_id":"a70cd8d6-d11c-4cda-baca-ff1a8576332b","year":2017},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.102018Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:b71aa6887b46a5e18279eda88b16def23825cd9d6bce21c9627999c66ee0cb81","observation_id":"1d9228af-3009-410b-bc25-8872a0bf7d21","resolution":{"observed_at":"2026-08-07T11:25:52.796794Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:52.460334Z","title":null,"venue":null,"work_id":"e813ecc6-5fdc-4f85-926b-763baa486120","year":2017},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.161493Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:7f0c317392e819044fc2395964804f053793807bf4cbd399ece589544cecc729","observation_id":"8a93b685-8801-4555-b7cb-c94d3a741254","resolution":{"observed_at":"2026-08-07T11:25:52.568087Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:52.259123Z","title":null,"venue":null,"work_id":"f0c4f587-a903-443a-907d-b0995844b624","year":2013},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.218840Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:73d341d2d2ba1ccc34608560b17ed03a1058750ee77efad8c4cfcd0d8f81ba85","observation_id":"46161001-a566-4963-b395-9d1b403a20f7","resolution":{"observed_at":"2026-08-07T11:25:52.354745Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:52.066238Z","title":"A nonparametric two-sample hypothesis testing problem for random graphs","venue":null,"work_id":"d2c84e91-4b15-4548-b2ed-b20ed0e16947","year":2017},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.274252Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:0987c41a0c7e18493060f3c976c7266a16f5617052c109b5573ac06160222d6c","observation_id":"a439f5b8-07e2-4a8b-8968-5c0c5a26b12e","resolution":{"observed_at":"2026-08-07T11:25:52.160906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:51.891325Z","title":"OPUS – parallel corpora for everyone","venue":null,"work_id":"76e4b221-d793-4f8e-946b-ca743be86035","year":2016},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.331198Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:495b6072dc4e81c867b47b6f15e986740b596fb6e281136116dd5ddb03603232","observation_id":"8d103c08-150d-4f24-843f-225558a16105","resolution":{"observed_at":"2026-08-07T11:25:51.965000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:51.721244Z","title":null,"venue":null,"work_id":"17412b1e-4409-41d8-aea5-2532b4a30d3f","year":2015},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.424085Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:a7afd8299ba5eb068b1b413727a5341ffd33d04b45528ca618f4fc2fdd7a13d9","observation_id":"7d07c682-666f-430f-99b1-a3da60affd3a","resolution":{"observed_at":"2026-08-07T11:25:51.813390Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:51.557798Z","title":null,"venue":null,"work_id":"84e23202-50e1-4ecf-8631-0361d32ecb7a","year":2015},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.494760Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:09c5a3158f1f71b837333743000aeecb3fb9ba22644169b3318533c4e7b28d39","observation_id":"26ffdf5a-9414-4b5a-a886-ddbcb72327b4","resolution":{"observed_at":"2026-08-07T11:25:51.627036Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:51.363500Z","title":"Random graph matching in geometric models: the case of complete graphs","venue":null,"work_id":"c0b0655a-f2f4-4cb6-acb1-de3ae6ad172f","year":2022},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.550849Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:f16ba837f6f6547efa7747c112544907369e6c100b08971e6790078e14d63b19","observation_id":"f2c59e4d-0f5e-472a-be65-3fe8a936a83a","resolution":{"observed_at":"2026-08-07T11:25:51.459108Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:51.205341Z","title":null,"venue":null,"work_id":"639acd26-f282-447b-bc18-4684dd5dfd7c","year":2019},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.624353Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:28ded8e6c19bdc8535f4c8fbc9837b553cb3a7d57feff7ac7770bc398f7d804d","observation_id":"0e171697-0a86-419c-ac5b-3899381f364e","resolution":{"observed_at":"2026-08-07T11:25:51.277461Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:51.033455Z","title":"Wasserman and K","venue":null,"work_id":"1a3a1ba4-98bc-4d1f-b926-395ac3d4a2a9","year":1994},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.677416Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:1001fdfa32787768388d32d21051cd5e5144bb2d0cc7ef3fd80f59613ff8e487","observation_id":"217f9ed1-3a32-4869-96e5-a1975c235866","resolution":{"observed_at":"2026-08-07T11:25:51.108585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:50.863831Z","title":null,"venue":null,"work_id":"3dbdd3c3-490a-4c5b-a590-4f2d0c5c2f49","year":2022},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.742456Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:2107760ff74624e110d7b4505894e4db86853f2cb02f3f88c912c07b35fcb887","observation_id":"dc29bacd-3471-4238-a389-3f265ff62196","resolution":{"observed_at":"2026-08-07T11:25:50.953622Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:50.669153Z","title":null,"venue":null,"work_id":"a064b0d2-5079-4186-9726-cd8ec1a63c71","year":2016},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.798346Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:8a8d46432e544dfa45c515f2c3cc6a08311fc62f0347cad02903aa801a298ab6","observation_id":"390d4a15-3d28-44d5-b564-0db8df6f1b92","resolution":{"observed_at":"2026-08-07T11:25:50.763118Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:50.479563Z","title":"Young and E","venue":null,"work_id":"9e82ed29-8621-400b-a507-7b95a3e740eb","year":2007},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.859092Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:b835df0ac97ba2b1b8cc822bb6c8d54a82c7dd4a12190dd4b2394c12b4697c50","observation_id":"414294bb-51a2-4e0a-a9fe-b78761c0903d","resolution":{"observed_at":"2026-08-07T11:25:50.569537Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:50.271236Z","title":"A practical two-sample test for weighted random graphs","venue":null,"work_id":"dcf04aa7-72ff-4cbb-9188-1694f32a9a7d","year":2023},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.927243Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:a9d8191c08939f4ed7e7f8a5a6127521da6059186e34b458972b9a9acab8330a","observation_id":"58581389-34cf-4974-af75-535d7e8340ec","resolution":{"observed_at":"2026-08-07T11:25:50.378733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:50.131957Z","title":"Zhang and D","venue":null,"work_id":"a6ea1bdf-2efa-413a-ad40-4d0dad347d66","year":2018},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:47.991417Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:86b1f57a2c424794dd74dce991bfa2d42afcc2265fe469dc8313b519c6338518","observation_id":"ff2bf444-b17b-4d84-9b4a-1ead877c06d5","resolution":{"observed_at":"2026-08-07T11:25:50.202218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:49.865088Z","title":"Cross: Efficient low-rank tensor completion","venue":null,"work_id":"132f8b83-7bad-4f4a-994e-196ce227fc42","year":2019},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:48.064283Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:47b043d9b59705ab0e2da2a279bf654fbd1e979d49f6f96026377f639d3e2bbd","observation_id":"f51a4678-c142-4e64-b993-88c9aa0feeea","resolution":{"observed_at":"2026-08-07T11:25:50.022029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.11027","last_updated":"2018-07-29T09:25:37Z","snapshot_observed_at":"2026-08-06T19:16:01.904495Z","submitted_at":"2018-07-29T09:25:37Z","title":"Consistent polynomial-time unseeded graph matching for Lipschitz graphons","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.11027","snapshot_observed_at":"2026-08-07T11:25:48.071138Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:48.071138Z"},"links":{"cited_paper":"/paper/1807.11027","citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:2c533afc4143e8039e5673392b32730f4319ef72b374410a3643faba7ec9247d","observation_id":"c1bd3151-13dc-4304-84da-2cb8ef3f0d2f","resolution":{"observed_at":"2026-08-07T11:25:48.071138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.04680","last_updated":"2018-07-12T15:37:32Z","snapshot_observed_at":"2026-08-07T14:34:30.458097Z","submitted_at":"2018-07-12T15:37:32Z","title":"Unseeded low-rank graph matching by transform-based unsupervised point registration","version":1},"cited_work":{"arxiv_id":"1807.04680","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.04680","snapshot_observed_at":"2026-08-07T11:25:48.439902Z","title":"Unseeded low-rank graph matching by transform-based unsupervised point registration","venue":"stat.ME","work_id":"7233668c-a9c5-43f0-b00e-28a4af7cf1f9","year":2018},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:48.113751Z"},"links":{"cited_paper":"/paper/1807.04680","citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:bea86023b6a545f4b80989a870b095b71e9aa6948f060abf5ed68b37b25120cf","observation_id":"16a7afc2-7edf-4da0-ac2c-714699e7c78e","resolution":{"observed_at":"2026-08-07T11:25:48.568091Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-08-07T11:25:48.181121Z","title":"Zheng and M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:48.181121Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:d5cdbb22be9b06fe54240a3fb87c15385e8ed5d66dc0d357072baebf70496205","observation_id":"8fbbf0cb-cfe3-4c0a-9a0b-3f23d0d51d8b","resolution":{"observed_at":"2026-08-07T11:25:48.181121Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:49.587562Z","title":"Zhu and A","venue":null,"work_id":"28f84f91-2d99-45c0-98b5-716cc6cc793c","year":2006},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:48.243293Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:38e4cc1bfb5e387e10139b861b40b8fd7115e72c6e84017848f49caf56815787","observation_id":"f8442664-6177-4b2d-8c03-642de3cef0aa","resolution":{"observed_at":"2026-08-07T11:25:49.700753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:25:49.345198Z","title":"A survey on application of knowledge graph","venue":null,"work_id":"46ae7a44-1b7d-403b-8a53-d3970f3a8c19","year":2020},"citing_paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T11:25:48.287535Z"},"links":{"citing_paper":"/paper/2506.02825"},"observation_digest":"sha256:a19c346733a47f0ca86ab3c1f73ab47f81f1d66c1d0b4d4f0aefadae3136b65b","observation_id":"13ab6eb9-ab9e-4328-b83e-e21a35d755f0","resolution":{"observed_at":"2026-08-07T11:25:49.457782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.02825","last_updated":"2025-07-02T19:19:46Z","latest_version":2,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-07T11:12:39.547545Z","submitted_at":"2025-06-03T12:54:24Z","title":"Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)"},"reference_resolution":{"displayed":78,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":3,"verified_fuzzy":42},"total_outbound_references":78},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 78 of 78 outbound references and 1 inbound Pith citation observation for arXiv:2506.02825."}