{"as_of":"2026-08-21T15:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9172e9b7786b7d586bb3894d8c0335e55de3531b841bf3b46862c15b1bd44793","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T07:56:18.554497Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.09087/citation-record","integrity":"/paper/2607.09087/integrity","json":"/paper/2607.09087/citation-record.json","paper":"/paper/2607.09087"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.414979Z","title":"De-anonymizing social networks,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.414979Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:14423bc6608541c003f82289184597f55205c6b6d0060523371ab0cd8c92fb6c","observation_id":"e5f3b417-daa4-4257-9615-99b6b071e48b","resolution":{"observed_at":"2026-08-02T07:56:18.414979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.418583Z","title":"An efficient reconciliation algorithm for social networks,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.418583Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:f2ee67a5d8dc8ef3b7a6c3d4abcb715e62a1c4f397db3d24a08a99513cbc4261","observation_id":"bc37eb1d-f9d9-49d1-9318-cbb23ae5251c","resolution":{"observed_at":"2026-08-02T07:56:18.418583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.421491Z","title":"Pairwise global alignment of protein interaction networks by matching neighborhood topology,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.421491Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:6eec27411da0735ca2f3f31fb80a2b01cd2099582d6808815cff3295939b919a","observation_id":"d801082d-bada-42ee-9e94-1f5566b50069","resolution":{"observed_at":"2026-08-02T07:56:18.421491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.424519Z","title":"Progressive graph matching: Making a move of graphs via probabilistic voting,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.424519Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:aabf9999e1b1cbbd7541842654eeb2a9a38076bb00a0e44080ca8379858448c0","observation_id":"7b8f89b6-1b33-453b-9585-2c3ea917edf9","resolution":{"observed_at":"2026-08-02T07:56:18.424519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.427320Z","title":"Robust textual inference via graph matching,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.427320Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:34d0b29b2c03625cf5a55db2adb87ab1c2b5777bed8388a07026f16e5a7d0367","observation_id":"08bb18f6-5802-49c0-aa0c-873663c51563","resolution":{"observed_at":"2026-08-02T07:56:18.427320Z","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":"10.1007/978-1-4613-0303-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The quadratic assignment problem,","venue":null,"work_id":"2a3218fe-8a69-412f-a817-86f7c173de40","year":1998},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.430036Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:9eb277ddc9e282e6e952d01dc22d85fc0fbfd0bdc84779183dfd661877718f40","observation_id":"03c16b35-7d61-49af-b8a4-119780e4ced3","resolution":{"observed_at":"2026-08-02T07:58:29.262262Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2629672","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Maximum quadratic assignment problem: Reduction from maximum label cover and lp-based approximation algorithm,","venue":"ACM Transactions on Algorithms","work_id":"e6d3e3ed-1e96-46f8-9594-4e9edc09fd5a","year":2014},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.432875Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:ad511161117ad1c59b6ef01e9b50db7f3a9f7c1d36e254a85d4bd4ed29e4aa03","observation_id":"17505f54-222e-480e-aa07-1d812e733860","resolution":{"observed_at":"2026-08-02T07:58:29.113125Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-02T07:56:18.435410Z","title":"On the privacy of anonymized networks,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.435410Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:2941e44f8765560f4e8585f5dabd2219fe7abf15244f3f8e2b003599fefab7e0","observation_id":"982e3f7c-3113-4703-bbba-7225fd96af5e","resolution":{"observed_at":"2026-08-02T07:56:18.435410Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.437806Z","title":"Random graph matching at otter’s threshold via counting chandeliers,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.437806Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:345ef91028effaf039de35386e9803d20e67c48d60cf0584f0efe6b01ef7af99","observation_id":"8455f296-f770-48e4-aeca-264a8eb47c39","resolution":{"observed_at":"2026-08-02T07:56:18.437806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.440220Z","title":"Settling the sharp reconstruction thresholds of random graph matching,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.440220Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:12360e27e10160e23e998ed5d77dd85870ee228f15bb5d44afce39d2414f8e44","observation_id":"8c3be59a-1828-48ad-8120-4b16f007d22a","resolution":{"observed_at":"2026-08-02T07:56:18.440220Z","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":"10.1214/23-aap2020","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Correlation detection in trees for planted graph alignment,","venue":"The Annals of Applied Probability","work_id":"058bf9ef-c928-4206-823e-4399cd4c6eb4","year":2024},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.442561Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:0eebda121e752824c33a971b88508dc5b6bb1170bd1f5c64033a5c9a3581a967","observation_id":"b111a1a2-a7cb-4cf0-989b-68971644331c","resolution":{"observed_at":"2026-08-02T07:58:28.994099Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-02T07:56:18.445640Z","title":"The number of trees,","venue":null,"work_id":null,"year":1948},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.445640Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:f6d8beaca84952f6db4aba5aae7ea17f63440d3ffe4c4b8f0f29f399d13bdf03","observation_id":"10003e26-77a9-4b2e-af5e-7d968cb793ee","resolution":{"observed_at":"2026-08-02T07:56:18.445640Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.448040Z","title":"Improved achievability and converse bounds for erd ˝os-r´enyi graph matching,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.448040Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:36b305b0e80bc680fddfe1b7321fb661e4444a7dd9119fc36fbf9a16e67902ac","observation_id":"f4ce5f86-61b4-4e53-977a-268b24ba7da0","resolution":{"observed_at":"2026-08-02T07:56:18.448040Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.06783","last_updated":"2018-05-14T04:27:12Z","snapshot_observed_at":"2026-08-16T07:38:32.245373Z","submitted_at":"2017-11-18T00:57:18Z","title":"Exact alignment recovery for correlated Erd\\H{o}s-R\\'enyi graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.06783","snapshot_observed_at":"2026-08-02T07:56:18.450483Z","title":"Exact alignment recovery for correlated Erd ˝os–R´enyi graphs,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.450483Z"},"links":{"cited_paper":"/paper/1711.06783","citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:42c640592deb020a57ef7e6dfb7559538f6185a1ff19ba17f98130f48c0ec7d4","observation_id":"e1d8e88e-ddce-448c-8728-00ee11645fe5","resolution":{"observed_at":"2026-08-02T07:56:18.450483Z","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":"10.1145/3366702","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Partial recovery of Erd˝os-R´enyi graph alignment viak-core alignment,","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","work_id":"e0b8369a-9f50-44fa-a2cb-9e25d58d2268","year":2019},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.453321Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:fb8b6729347406cac55b9bdf43620fc4e33c93a7314b94edf8e173b04b6083dc","observation_id":"c601ef9a-401d-452b-b44c-97992b12036e","resolution":{"observed_at":"2026-08-02T07:58:28.889686Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-02T07:56:18.456061Z","title":"Impossibility of partial recovery in the graph alignment problem,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.456061Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:d610b33b31d5bf57cbd4aa7377572c59aacd3e354cf9f94926a26e43beac3927","observation_id":"73f0b6f3-9caa-4789-9bce-d59387ed5205","resolution":{"observed_at":"2026-08-02T07:56:18.456061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.458376Z","title":"Partial recovery in the graph alignment problem,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.458376Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:5eda1fb5715be62b3a678e6c9fb18777080d6da8a7b2e05ac05933d709a12ffc","observation_id":"a60f4bd4-80ef-49de-8d80-50bc531ad85d","resolution":{"observed_at":"2026-08-02T07:56:18.458376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.460503Z","title":"Matching recovery threshold for correlated random graphs,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.460503Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:9f97e465bd555bc6de2307890f346abbfe55a3141dc23fcc5420c80064224385","observation_id":"76f74ad3-6b45-4999-ba1a-71c4ded8c6fa","resolution":{"observed_at":"2026-08-02T07:56:18.460503Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12077","last_updated":"2025-02-17T17:52:26Z","snapshot_observed_at":"2026-08-19T21:45:24.659192Z","submitted_at":"2025-02-17T17:52:26Z","title":"Optimal recovery of correlated Erd\\H{o}s-R\\'enyi graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.12077","snapshot_observed_at":"2026-08-02T07:56:18.462670Z","title":"Optimal recovery of correlated Erd ˝os–R´enyi graphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.462670Z"},"links":{"cited_paper":"/paper/2502.12077","citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:94c016585cb9ba4b28719def82df825879a633b5c2fc94584534b4a57941d7c4","observation_id":"84ce12f2-562d-45fd-a734-bfd3e599937e","resolution":{"observed_at":"2026-08-02T07:56:18.462670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.465266Z","title":"Analysis of a canonical labeling algorithm for the alignment of correlated erdos-r ´enyi graphs,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.465266Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:7fc17a9897a52c8beeadaa7395add7226d7a3a75f82f0d1cd8f43b76a7ee8798","observation_id":"c1f24308-796c-4091-b257-ba19d350e7de","resolution":{"observed_at":"2026-08-02T07:56:18.465266Z","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":"10.1007/s00440-020-00997-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient random graph matching via degree profiles,","venue":"Probability Theory and Related Fields","work_id":"f5bd298d-32cd-4afb-aa5d-d6fa101a2a09","year":2021},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.467530Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:bf4522053bd7d3b1bd096abf0de0d5143c0bec26fde300a09793bcddbe776948","observation_id":"bf68ded1-f7bf-4ec4-afd5-2a22edf16c11","resolution":{"observed_at":"2026-08-02T07:58:28.701100Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-02T07:56:18.469853Z","title":"Spectral graph matching and regularized quadratic relaxations i algorithm and gaussian analysis,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.469853Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:d2e7c0192205cc6bbf222866c0b97d0847a6394d91e79761290c167c2391a6b8","observation_id":"69cf79a3-8101-49ec-b102-aebe00c63272","resolution":{"observed_at":"2026-08-02T07:56:18.469853Z","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":"10.1007/s10208-022-09575-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Spectral graph matching and regularized quadratic relaxations II: Erd ˝os-R´enyi graphs and universality,","venue":"Foundations of Computational Mathematics","work_id":"ecf1f4a3-a38d-4c4b-9f67-9e24095d9c74","year":2023},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.474993Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:b34153e5ec5075c21ffdd5f469d308d0664966ab8f78e1e85744742793d3101f","observation_id":"b2f66354-ba3a-4541-98a1-00b171787dbe","resolution":{"observed_at":"2026-08-02T07:58:28.542966Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-02T07:56:18.477258Z","title":"From tree matching to sparse graph alignment,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.477258Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:c3c7653391386cfa02163caad62a8b296360e94961e1b56f0eaa76adf02eaeb5","observation_id":"47cd1b38-f5f8-4003-97aa-401271510ff5","resolution":{"observed_at":"2026-08-02T07:56:18.477258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.479491Z","title":"Asymmetric graph alignment and the phase transition for asymmetric tree correlation testing,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.479491Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:05ed37ef9ea3744bf147ae12791041722e3cd34053a6a02b1c6cf6a3927d29bd","observation_id":"42edbc54-1291-40a2-b98a-86c9c39870a5","resolution":{"observed_at":"2026-08-02T07:56:18.479491Z","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":"10.1007/s00440-022-01184-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Exact matching of random graphs with constant correlation,","venue":"Probability Theory and Related Fields","work_id":"d34d8565-450b-48f6-95b6-66acbc0275e7","year":2023},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.481593Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:92bfb9894369227e24ad301b2f9c101aaa1da9645ae851e99db92745140c4550","observation_id":"31367a33-fdc9-4750-81d3-dc0a9b7977d5","resolution":{"observed_at":"2026-08-02T07:58:28.413094Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-02T07:56:18.484498Z","title":"Random graph matching with improved noise robustness,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.484498Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:902ce6e8e4b9dcdcd3ecc70227f33d30b474813359099bcfb466d134a75fc903","observation_id":"56d17d24-0558-4a78-bc7b-0749737b9205","resolution":{"observed_at":"2026-08-02T07:56:18.484498Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.486809Z","title":"A polynomial-time iterative algorithm for random graph matching with nonvanishing correlation,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.486809Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:0a5be10bbfca81c7440b6c420d51384574781d07af2aac6dc58eb6533f900c7c","observation_id":"56028ec9-8ea7-411f-bebf-69661786fce7","resolution":{"observed_at":"2026-08-02T07:56:18.486809Z","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":"10.1214/23-aap2048","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Statistical limits of correlation detection in trees,","venue":"The Annals of Applied Probability","work_id":"778569f8-072e-4b22-aaf2-b78e3b832286","year":2024},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.489024Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:7a608cfd4b152f613bd1ffb53baf2059c147475768839d18d3d4fc4a43a5646e","observation_id":"458d60f3-87be-4ce2-8e1b-a2326c3caac6","resolution":{"observed_at":"2026-08-02T07:58:28.299333Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2025.30","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs,","venue":"ArXiv.org","work_id":"5bc0c9a5-a93a-41d6-aaae-f309c6c1ab41","year":2025},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.491473Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:d8d54b22c150e826705f34c65286a418486a330f861143e7e8cf2269ec2e5019","observation_id":"22c7d827-55ee-4a3d-af5a-44588c9d1fa6","resolution":{"observed_at":"2026-08-02T07:58:28.185219Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-02T07:56:18.493803Z","title":"Correlated stochastic block models: Exact graph matching with applications to recovering communities,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.493803Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:536ad5e6733633658f2b2479bcad204ba6c2e54ac165f1c5580d5518c7c1d6bf","observation_id":"13051f0b-3bd3-4e76-a8dc-4e1b63a96dbe","resolution":{"observed_at":"2026-08-02T07:56:18.493803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.496112Z","title":"Efficient graph matching for correlated stochastic block models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.496112Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:e124cf9460562a5c7a2c4c4b9a235e1a943917deaa903b39c9d3cb0032e93744","observation_id":"1d6c0f50-2bc5-4678-a187-9371c0dd6139","resolution":{"observed_at":"2026-08-02T07:56:18.496112Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.498389Z","title":"Efficient algorithms for exact graph matching on correlated stochastic block models with constant correlation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.498389Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:1d1cf570f3977871772def23e83fa5d117a7b3d7efc5c9848121de697524fa56","observation_id":"9032bae3-d100-4c15-aa31-dc3e015c746d","resolution":{"observed_at":"2026-08-02T07:56:18.498389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.500694Z","title":"Random graph matching in geometric models: the case of complete graphs,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.500694Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:715d4ca7189d003029f34e91cf55cda5300746651a14b03ea5a683b4f2d66eca","observation_id":"b46fd6fd-9aeb-4308-8d61-f94cab89b11d","resolution":{"observed_at":"2026-08-02T07:56:18.500694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.503141Z","title":"Attributed graph alignment,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.503141Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:ad78863863ec43fe7b6a828facd2fd3def063f58a43c22a5d243c706a6afafed","observation_id":"e81e48be-0f5f-4c25-97e8-78f6f132a53a","resolution":{"observed_at":"2026-08-02T07:56:18.503141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.505631Z","title":"On the feasible region of efficient algorithms for attributed graph alignment,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.505631Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:7d30d815e7c55a0915236733f961c98140ce10c12842da1486a57576186c7878","observation_id":"b97c776c-d993-47bb-bb78-900c1382db2b","resolution":{"observed_at":"2026-08-02T07:56:18.505631Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.508201Z","title":"Efficient algorithms for attributed graph alignment with vanishing edge correlation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.508201Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:c7eacb4fba8eef42fca62e2167a4d1f546b66ff48033b7f95f7f798622c8703d","observation_id":"d0b9dcee-dd8d-4296-8ed4-315013d7b020","resolution":{"observed_at":"2026-08-02T07:56:18.508201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.04365","last_updated":"2026-04-06T02:27:50Z","snapshot_observed_at":"2026-07-31T18:44:50.458178Z","submitted_at":"2026-04-06T02:27:50Z","title":"Attributed Network Alignment: Statistical Limits and Efficient Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.04365","snapshot_observed_at":"2026-08-02T07:56:18.510814Z","title":"Attributed network alignment: Statistical limits and efficient algorithm,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.510814Z"},"links":{"cited_paper":"/paper/2604.04365","citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:775b72289e9d9d91af8854c5c6df5124abd2125d9c6d4c1c38c6629a29978943","observation_id":"0ff7ab2f-ce9c-4522-8eef-ad489fbaeac7","resolution":{"observed_at":"2026-08-02T07:56:18.510814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.513372Z","title":"Exact random graph matching with multiple graphs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.513372Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:2732e4f19e979a63b42692c0cae16e781412b35df48bf36fb2beced988cbac1e","observation_id":"a78b2bfd-a883-41dd-a7e6-1c6992acd402","resolution":{"observed_at":"2026-08-02T07:56:18.513372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12293","last_updated":"2025-06-29T21:18:24Z","snapshot_observed_at":"2026-08-18T16:47:02.626604Z","submitted_at":"2024-05-20T18:01:11Z","title":"Aligning Multiple Inhomogeneous Random Graphs: Fundamental Limits of Exact Recovery","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12293","snapshot_observed_at":"2026-08-02T07:56:18.516045Z","title":"Aligning multiple inhomogeneous random graphs: Fundamental limits of exact recovery,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.516045Z"},"links":{"cited_paper":"/paper/2405.12293","citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:92d37e5f658c07f0f225792bf3794d7515ede265f319f40885da16cb0f9abc90","observation_id":"dafaa73d-286c-451f-8ece-b901c18d0e2e","resolution":{"observed_at":"2026-08-02T07:56:18.516045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.518703Z","title":"Diffusion-network alignment: An efficient algorithm and explicit probability bounds,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.518703Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:1f8a660996e6222f0adc0e90fd59d8f87824924a6dc869b24e56181ca62dd3ce","observation_id":"ceab866f-a0a3-44ef-90ad-e9298d7b157c","resolution":{"observed_at":"2026-08-02T07:56:18.518703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.521231Z","title":"On the information-theoretic limit of subgraph alignment,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.521231Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:946d2c624bb309ce71e962d19560682ecda4c878a5208411b7d63183c7cef5c1","observation_id":"e4502d20-f472-4281-a38a-8b1a52e17e9c","resolution":{"observed_at":"2026-08-02T07:56:18.521231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.524083Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.524083Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:4172b5afd07b28f565bfddd952e9053f36cb7f0139b0bb1ddc27adba15b00fc4","observation_id":"8726c941-0b5c-4a15-a37d-4bd23a92ffcb","resolution":{"observed_at":"2026-08-02T07:56:18.524083Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.526520Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.526520Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:b4214e980deedb5cf693ecdfc79bcf0af499bb12aee622c7e67ffdb6bdeeee09","observation_id":"6c3fc493-739b-4653-a4c5-6bc6449c1995","resolution":{"observed_at":"2026-08-02T07:56:18.526520Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.528968Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.528968Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:55a0592a0f1a3d775a85850d11cfe38bf93eafac4eb15d679430578ead864dd8","observation_id":"1394cd90-464d-4ff6-8e1e-380bbf679af2","resolution":{"observed_at":"2026-08-02T07:56:18.528968Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.531283Z","title":"The poisson approximation to the poisson binomial distribution,","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.531283Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:0f80df4ae8fb05a14cfd83da48867431265f4f3fabc74ef3871f67350a88bd7b","observation_id":"5ac99ccf-6109-40ad-a892-40774ba65e3e","resolution":{"observed_at":"2026-08-02T07:56:18.531283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.533567Z","title":"Probability inequalities for the sum of independent random variables,","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.533567Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:5ad16ad4e0870e5c9f83cd465f82052cbf3e9fa92642087cd86407cf43e40e01","observation_id":"e74b6147-a273-4223-ac47-448d5bcd03a5","resolution":{"observed_at":"2026-08-02T07:56:18.533567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.535937Z","title":"Mitzenmacher and E","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.535937Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:884ab7a30a574930c5882d62e0fcb3d7472258c949f6acbff4556f807d744716","observation_id":"1abd0fe7-a4c5-434a-8b5d-590c260c03c2","resolution":{"observed_at":"2026-08-02T07:56:18.535937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.538953Z","title":"In particular, ¯dis given by ¯d=   max   k0 −1, 3 log s2 COtter !2 , 2 log s2 COtter 2C6 + log 2s2 C5      , wherek 0 andC 5 are constants indicated by Lemma 6","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.538953Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:8afe76340ee244af44d3a3060e8406b9a42e4c50de2ee718a0ebca514237803d","observation_id":"183e62bd-141b-4bcb-930a-7cb391f7c6aa","resolution":{"observed_at":"2026-08-02T07:56:18.538953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.541583Z","title":", y(t) i )inGfromutox i withy (0) i =u,y (1) i =u i,y (t) i =x i, and t≤d+ 1,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.541583Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:35cc3e2a42a02ce565294ddac758d2d0b3a8272f269f901e9db5c4992d9f81b0","observation_id":"36587d5e-7e29-44a7-a299-e5421aed3162","resolution":{"observed_at":"2026-08-02T07:56:18.541583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.544322Z","title":",˜z(˜t) i )in ˜Gfrom˜vtox i with˜z(0) i = ˜v,˜z(1) i = ˜vi,˜z(˜t) i =x i, and ˜t≤d+ 1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.544322Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:01c2f494ef048736be139e0b9ffec5a607deaf2d4eca0de5d1444c985b6aa68c","observation_id":"1f440e3f-3fbc-42db-9a7f-b3f942b74a59","resolution":{"observed_at":"2026-08-02T07:56:18.544322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.547171Z","title":"Coupling(T k, ˜Tk)with(H k, ˜Hk)givenℓ(T k−1, ˜Tk−1) = (Hk−1, ˜Hk−1): For each depthk≥ 1, we recursively define three sets of vertices:COM k,EXC k, and gEXCk","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.547171Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:f23ab5ecc7e5d56d07a542b42ae5d6ba3deb7b9da945a35b0da42d01f8b0ab81","observation_id":"aabfd762-6d96-4de3-91be-014865215be4","resolution":{"observed_at":"2026-08-02T07:56:18.547171Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.550026Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.550026Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:4a75d21ffb58c86052ccf819adf9738fa7a8b5c2e18e9c7261da55ca1394d164","observation_id":"9750d2fd-f50a-4b2b-b050-3768a0bd18d5","resolution":{"observed_at":"2026-08-02T07:56:18.550026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.552249Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.552249Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:d7a9c18519193ad35701d2fbfb9c3e258286d232edad77a69553ac357c60ca2a","observation_id":"0bdec016-5649-41c9-bc89-d0da8da65d8d","resolution":{"observed_at":"2026-08-02T07:56:18.552249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.554497Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.554497Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:ab808184384af49c66aba2509c468394e7a58cd7195b19407c445e928b9b7768","observation_id":"de9ba951-2ac8-457a-baed-899806ef35ee","resolution":{"observed_at":"2026-08-02T07:56:18.554497Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:56:18.472264Z","title":"Available: https://doi.org/10.1007/s10208-022-09570-y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T07:56:18.472264Z"},"links":{"citing_paper":"/paper/2607.09087"},"observation_digest":"sha256:000def380d29e004fe7b4dab7f3fa4c2c22d710df301993b25df62f355d6e0eb","observation_id":"d10a48d3-5014-4d05-8a32-a349d52476bc","resolution":{"observed_at":"2026-08-02T07:56:18.472264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09087","last_updated":"2026-07-22T19:24:48Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T14:43:40.562816Z","submitted_at":"2026-07-10T04:08:08Z","title":"Achieving Almost Exact Recovery in Almost Quadratic Time: Rank-Based Graph Matching via Local Tree Correlation Tests"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":47,"verified_exact":9,"verified_fuzzy":0},"total_outbound_references":56},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2607.09087."}