{"as_of":"2026-08-17T20:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68be8ffb3a29e7687c251ac54ccf37f3bd7778c39ea81fcd6daa53b8ea7d21ee","coverage":[{"denominator":62,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":62,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T18:19:45.501781Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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-08-07T04:24:25.737693Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T04:24:28.197974Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"cited_work":{"arxiv_id":"2411.19885","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.19885","snapshot_observed_at":"2026-08-07T04:24:28.197974Z","title":"Statistical inference of a ranked community in a directed graph","venue":"math.ST","work_id":"3fa46b32-f7ec-4fba-854c-66cfd2e82024","year":2024},"citing_paper":{"arxiv_id":"2506.10748","last_updated":"2025-06-12T14:35:26Z","snapshot_observed_at":"2026-08-14T18:28:43.937637Z","submitted_at":"2025-06-12T14:35:26Z","title":"Computational Complexity of Statistics: New Insights from Low-Degree Polynomials","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.737693Z"},"links":{"cited_paper":"/paper/2411.19885","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:c414f510ef0b697cde38c6263344362c90da92e35b8532c422a437ba8b51ab30","observation_id":"d45f2266-ea15-45af-9c79-964c973d30b1","resolution":{"observed_at":"2026-08-07T04:24:28.201731Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.19885/citation-record","integrity":"/paper/2411.19885/integrity","json":"/paper/2411.19885/citation-record.json","paper":"/paper/2411.19885"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T18:19:46.195493Z","title":"Community detection and stochastic block models: recent developments","venue":null,"work_id":"f29d271c-539e-4ae7-bf03-e88ff5a53a0f","year":2017},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.293007Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:6c199ec69ad3cc58e8def57bae39b5132058705fa549dafd4d91c629e3de1fa1","observation_id":"938a6c38-c6b5-4627-95ff-81bdaa76d582","resolution":{"observed_at":"2026-08-12T18:19:46.199553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.185359Z","title":"An introduction to random matrices","venue":null,"work_id":"6741cf50-67f3-4bac-8590-223c868fe90b","year":2010},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.297350Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:1ab59b8c0f0acc6c3a0eddaeeae33a93d06effee92e72f8f7b1a3583e1bbd10e","observation_id":"903711bb-f0ba-4311-a3d1-14d4c653f027","resolution":{"observed_at":"2026-08-12T18:19:46.188721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.300966Z","title":"Finding a large hidden clique in a random graph","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.300966Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:64023b7a69c030427a70e2c226c816b97c0a095c193d5c721d1f4953319a0501","observation_id":"2a2ccdc0-1ae4-4df5-b956-15f0ad8eb5b1","resolution":{"observed_at":"2026-08-12T18:19:45.300966Z","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-12T18:19:46.168445Z","title":"Ranking tournaments","venue":null,"work_id":"59b8bfb2-cccf-4e28-ac98-393dd2408be8","year":2006},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.304920Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:7f23ab9c3e429b276ca8b0d1449eac4613aefc68e2c1797d5ab19b6bc76579fb","observation_id":"bf94f9db-1b27-4fd4-9d94-c694cfb0a85c","resolution":{"observed_at":"2026-08-12T18:19:46.172252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.157112Z","title":"Reducibility and statistical-computational gaps from secret leakage","venue":null,"work_id":"3aab5883-97d4-4113-ad08-4d5c88bc3828","year":2020},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.308062Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:0cf76daae8b59793f6ff5a586f9dcd129548fe6217f1a9bdf45ad6018d8a3f88","observation_id":"2f59acd5-43c9-44a1-a856-f0d7522913c5","resolution":{"observed_at":"2026-08-12T18:19:46.161135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.146990Z","title":"Detecting high log-densities: an o (n 1/4 ) approximation for densest k-subgraph","venue":null,"work_id":"da9ef437-2b6c-43c9-acaa-a92654085d5b","year":2010},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.311385Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:1a4b6d26395a35b823f9f89bb684f81870afbe682f1450412fb3765ccd274eb7","observation_id":"a52463c6-10fa-4ffe-9a1b-4502164a5eec","resolution":{"observed_at":"2026-08-12T18:19:46.150509Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.136080Z","title":"The Franz-Parisi criterion and computational trade-offs in high dimensional statistics","venue":null,"work_id":"07c9d74c-fc6d-43c0-ba10-792374da8460","year":2022},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.315733Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:34f2b2b4d1d5b93bb7fe3799269d9b6bb1db7ef59b4bb7cb14bc7d3ff0bb652f","observation_id":"e8b506f0-def6-49d4-8e22-67e6f89d28e1","resolution":{"observed_at":"2026-08-12T18:19:46.140101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.124813Z","title":"The accuracy of the Gaussian approximation to the sum of independent variates","venue":null,"work_id":"12189f8f-cb9a-42d3-95dd-455d43afd35e","year":1941},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.319565Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:5a3ef13561a659c7f9d873b91732e256bba76d532d30abd92a900199fd9bb26b","observation_id":"ff6ab045-df31-457c-aaed-5909fbbc6f2d","resolution":{"observed_at":"2026-08-12T18:19:46.129101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.115111Z","title":"Spectral radii of sparse random matrices","venue":null,"work_id":"e685aa49-c414-48db-85c2-61de594623af","year":2020},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.322805Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:9f49f14cbb3432d2b5866a65d8768ca07cdc5098d6002c35c4e24d014b2b246d","observation_id":"389c94c0-e561-4de8-8363-6c250fa16a07","resolution":{"observed_at":"2026-08-12T18:19:46.118548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.326006Z","title":"A nearly tight sum-of-squares lower bound for the planted clique problem","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.326006Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:2b25a6f1b5f49a15e357ef68b1036911bc58504f90dc0c75a1157b27fad769e7","observation_id":"78879811-b7d2-4b6d-835f-f7979081c2ea","resolution":{"observed_at":"2026-08-12T18:19:45.326006Z","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-12T18:19:46.099217Z","title":"Detection-recovery and detection-refutation gaps via reductions from planted clique","venue":null,"work_id":"6bf8c342-b308-4346-a91c-121377c47bdf","year":2023},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.329342Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:bbc4bf9fd9092d6bf2722bc4af80db305a4271fae82d1d1635f04f3364d699ed","observation_id":"f43a76da-2eb0-4462-aeb4-8bfd5564430b","resolution":{"observed_at":"2026-08-12T18:19:46.102667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.089566Z","title":"Noisy sorting without resampling","venue":null,"work_id":"6ac3a307-8134-4689-8c59-12eec32352d8","year":2008},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.332976Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:14e8314a903d8f571cdfcd0d7f160bbd9907cf7f975d1c9c15ed3ad293969000","observation_id":"11158816-52a6-4a86-98db-410c1f4a9c3e","resolution":{"observed_at":"2026-08-12T18:19:46.093011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.079035Z","title":"Notes on computational-to-statistical gaps: predictions using statistical physics","venue":null,"work_id":"611b4ece-d1ac-4ea1-b1ca-2e9657ec32ec","year":2018},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.336218Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:489d49b42b88f56e1e8b305c6c9e12bf2b595691312cbd71b3a6b6ab317d7a0d","observation_id":"2d23a05f-f67c-4ee9-bc4c-86b17fc10072","resolution":{"observed_at":"2026-08-12T18:19:46.083334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.069125Z","title":"Rank analysis of incomplete block designs: I","venue":null,"work_id":"0a6e1c3a-597c-454a-89ab-fcf4787ac11e","year":1952},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.339553Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:a5619f481998e2b03d076d8986de39d553d4ec686a032f57c6cc33f39363fbf0","observation_id":"27bd290f-94be-438b-831a-321bf5628bab","resolution":{"observed_at":"2026-08-12T18:19:46.072489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.07198","last_updated":"2023-08-02T05:53:36Z","snapshot_observed_at":"2026-08-16T17:21:15.936523Z","submitted_at":"2022-02-15T05:12:43Z","title":"A short note on an inequality between KL and TV","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.07198","snapshot_observed_at":"2026-08-12T18:19:45.342661Z","title":"A short note on an inequality between KL and TV","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.342661Z"},"links":{"cited_paper":"/paper/2202.07198","citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:0d9cc95c2dd375bc6f71df7be14d658d822cc73a733dfd72d4cec9979e3b6837","observation_id":"12c2dd0f-24d9-47aa-90fe-1c1f0da396ab","resolution":{"observed_at":"2026-08-12T18:19:45.342661Z","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-12T18:19:46.056740Z","title":"The largest eigenvalues of finite rank deformation of large Wigner matrices: convergence and nonuniversality of the fluctuations","venue":null,"work_id":"b5f41fb8-4c3e-43a7-a969-aa30865b42cb","year":2009},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.346354Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:6b04a554aa6dbbfc34e90f07c35951341bdd488710fe550344244df65ddab043","observation_id":"8d0d965c-2098-4219-9019-060dbee12b43","resolution":{"observed_at":"2026-08-12T18:19:46.060743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.046722Z","title":"Matrix estimation by universal singular value thresholding","venue":null,"work_id":"561dde9a-029a-4693-a341-d25d27263de8","year":2015},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.349887Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:a31be7756058f126c80daf8eed3f2404169be596680ec3a1e50a9468a31c2292","observation_id":"d9bb4412-d087-4a3f-9ee5-2c6c84232aec","resolution":{"observed_at":"2026-08-12T18:19:46.050535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.037020Z","title":"Estimation in tournaments and graphs under monotonicity constraints","venue":null,"work_id":"b46b44fc-f9a2-4602-a774-cac34a571efa","year":2019},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.353162Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:c628b99a1cd6abddd75e1b8ba8fe0087c1062f4639ac9541872b13fb36c07dd3","observation_id":"f1f982a1-8a6c-4be1-8816-ecff2d41bc4c","resolution":{"observed_at":"2026-08-12T18:19:46.040551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.027763Z","title":"Statistical and computational phase transitions in group testing","venue":null,"work_id":"a6b80b66-953d-4ec8-b184-f61cccc0b4cc","year":2022},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.356783Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:bbeb5d772d646f02e33be6196ab8378ef616d5ce46f929749f0cb4030d89806f","observation_id":"a9b38ceb-e58d-4588-8200-2f7751ca0b66","resolution":{"observed_at":"2026-08-12T18:19:46.031212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.018279Z","title":"Spectral MLE : Top- k rank aggregation from pairwise comparisons","venue":null,"work_id":"d954544d-39f6-4e03-8fab-17215103865f","year":2015},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.360099Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:abedc7ce72f9066655d40e6e994e89057659384e5a8238adb7ef104b29ca0d1c","observation_id":"607cc360-92a2-4b41-afb4-17e2315b7323","resolution":{"observed_at":"2026-08-12T18:19:46.021743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:46.008398Z","title":"Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices","venue":null,"work_id":"4739ced0-a429-493e-b1c6-ed0c20017efe","year":2016},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.362928Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:3890bf0e67b4caae3e76a0b9e4ce2e125f6769b8f97870715d8ec9210ca77062","observation_id":"68d2d384-4f6d-4986-8f16-392ce236163b","resolution":{"observed_at":"2026-08-12T18:19:46.012074Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.998442Z","title":"A physical model for efficient ranking in networks","venue":null,"work_id":"060177aa-f625-4523-8d79-5c3e1f91d959","year":2018},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.367529Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:ba428598aa8eaef01effd706ae65a2a6f54f09470fe8a23d6d3210b674ca129b","observation_id":"1979571b-dc04-4abd-8d5f-9a1eeac8e181","resolution":{"observed_at":"2026-08-12T18:19:46.002092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.370568Z","title":"Low-degree hardness of detection for correlated Erd o s-R\\' e nyi graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.370568Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:550213fd73cf62d621e411de1b1c44adef596655e7899477a519194a43ac5ff1","observation_id":"22194f9a-969d-49f0-b082-f16598a697e4","resolution":{"observed_at":"2026-08-12T18:19:45.370568Z","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-12T18:19:45.988640Z","title":"The rotation of eigenvectors by a perturbation","venue":null,"work_id":"b9be59a6-a6c1-43dc-ba2f-19d401b1e69b","year":1970},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.373820Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:51eea1801de58a420fd87d002fdc3d7599e2fa31fda0d797bb1c249630d69b72","observation_id":"ecdc1979-ee11-43f1-ad12-599443987f00","resolution":{"observed_at":"2026-08-12T18:19:45.992146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.978565Z","title":"On the maximum cardinality of a consistent set of arcs in a random tournament","venue":null,"work_id":"279786f5-e703-4ab7-ad5a-ba5192711a29","year":1983},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.377082Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:9b106b15f4f606112deca824605664911e78a0ed9b0875ecc649d750c77c1375","observation_id":"bec3ef96-4c0c-4b5e-af69-0ba245be6948","resolution":{"observed_at":"2026-08-12T18:19:45.982109Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.08135","last_updated":"2023-04-17T10:38:08Z","snapshot_observed_at":"2026-08-16T15:39:57.805068Z","submitted_at":"2023-04-17T10:38:08Z","title":"Detection of Dense Subhypergraphs by Low-Degree Polynomials","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.08135","snapshot_observed_at":"2026-08-12T18:19:45.380454Z","title":"Detection of dense subhypergraphs by low-degree polynomials","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.380454Z"},"links":{"cited_paper":"/paper/2304.08135","citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:0af61888545d24dacd89c8182a40298275b04a41fb2ce90c3cdb488f5f43f092","observation_id":"4939b2ce-7aeb-448e-998f-a4f82653493c","resolution":{"observed_at":"2026-08-12T18:19:45.380454Z","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-12T18:19:45.967925Z","title":"Condorcet social choice functions","venue":null,"work_id":"b1a72a7f-f3db-4c1c-a414-3bed9b9edd94","year":1977},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.384130Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:0ccacb58ed47fc5839d0f4d78b93bcbeabe904767fb9655f8f78b75b11d39f9b","observation_id":"15578408-51c8-45bf-81a9-410a47739c26","resolution":{"observed_at":"2026-08-12T18:19:45.971976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.957672Z","title":"Finding and certifying a large hidden clique in a semirandom graph","venue":null,"work_id":"3d9d282c-cba8-42f0-9b6b-32c532641c76","year":2000},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.387406Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:d44419487634278ace7192e9362cba2ef35373c8c8a5196bfbcba28fe6ee1da8","observation_id":"5a5533a9-c335-4038-b9b9-7ac365a73820","resolution":{"observed_at":"2026-08-12T18:19:45.961355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1709.07249","last_updated":"2017-09-21T10:38:28Z","snapshot_observed_at":"2026-08-14T20:31:05.034022Z","submitted_at":"2017-09-21T10:38:28Z","title":"Sorting with Recurrent Comparison Errors","version":1},"cited_work":{"arxiv_id":"1709.07249","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.07249","snapshot_observed_at":"2026-08-12T18:19:45.561972Z","title":"Sorting with Recurrent Comparison Errors","venue":"cs.DS","work_id":"c3befe89-8339-434f-ac97-b0148da56369","year":2017},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.391194Z"},"links":{"cited_paper":"/paper/1709.07249","citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:a76f8fcb92d434b6c6d6cb96e2386a789e9f25a239a05ddca81ed8265d798a4b","observation_id":"24240d58-a6ab-4937-bd4b-d808664e6f2d","resolution":{"observed_at":"2026-08-12T18:19:45.565666Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.07575","last_updated":"2018-04-20T12:33:42Z","snapshot_observed_at":"2026-08-14T19:23:53.712261Z","submitted_at":"2018-04-20T12:33:42Z","title":"Optimal Sorting with Persistent Comparison Errors","version":1},"cited_work":{"arxiv_id":"1804.07575","doi":null,"metadata_source":"pith","pith_arxiv_id":"1804.07575","snapshot_observed_at":"2026-08-12T18:19:45.547699Z","title":"Optimal Sorting with Persistent Comparison Errors","venue":"cs.DS","work_id":"2e734a58-2c6c-4619-a3cc-ad7dc8c75f80","year":2018},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.395502Z"},"links":{"cited_paper":"/paper/1804.07575","citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:7e0b83f6d168d020440d798c7d5204de8aff9c4d0c7706fa175dcab4cd023003","observation_id":"1fbedb2c-7145-4574-b2a8-5dd51b4da028","resolution":{"observed_at":"2026-08-12T18:19:45.551410Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.947103Z","title":"A tail bound for read- k families of functions","venue":null,"work_id":"d121486a-c857-4e3e-9533-b8885ec0892d","year":2015},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.399147Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:4d32e481c2a667147f005878d030d01aca52175d0fff6953cda2c47b4716f937","observation_id":"4cf85f4f-278f-4cd2-87a1-f518987f7453","resolution":{"observed_at":"2026-08-12T18:19:45.950491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.936730Z","title":"Values of Mills' ratio of area to bounding ordinate and of the normal probability integral for large values of the argument","venue":null,"work_id":"f9012259-470b-4aed-ac45-0a945e691403","year":1941},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.402455Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:6572bf8ce2a15114115ae9d2389f7588c16ad0d0579d14429e213a7680229909","observation_id":"68716554-fc31-4694-bf22-c29cd4591ac3","resolution":{"observed_at":"2026-08-12T18:19:45.940339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.927090Z","title":"Finding hierarchy in directed online social networks","venue":null,"work_id":"560af51b-6948-47ac-919b-d9b52dad36ea","year":2011},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.406512Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:7a1b58753e5ad2dcb6c771a332d8f2bec1b708ae235d71f4a76fa65ffdfd11f0","observation_id":"9ec943c5-4f7a-4031-859b-5a9b992f3df3","resolution":{"observed_at":"2026-08-12T18:19:45.930462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.915488Z","title":"Optimal bounds for noisy sorting","venue":null,"work_id":"b2e19d8c-7f66-4b9c-9236-50170185d379","year":2023},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.410430Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:0ac72709390ef5cc59ff9308636de5fff3c2e9b1affd57b3941bc7c8fbf2cc7e","observation_id":"c1df6ba0-05b5-43c0-b42f-7d33bf30fc9b","resolution":{"observed_at":"2026-08-12T18:19:45.919728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.904617Z","title":"The power of sum-of-squares for detecting hidden structures","venue":null,"work_id":"e00b41e8-b713-4a95-9909-5d11c009d853","year":2017},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.414551Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:f5d7aa38de2dcab99ac9718f9f2886b9fecc834e2ecce08b985256dca55dca41","observation_id":"d2ed94ad-553b-4f3e-821b-61a1dc586ff1","resolution":{"observed_at":"2026-08-12T18:19:45.908486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.417889Z","title":"Statistical inference and the sum of squares method","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.417889Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:950d1deb5926c6acf5163a2341ff17ca6475437ce314624b04c22d24bfe9c2a7","observation_id":"861cc19d-ed2e-4aa3-9da3-ec43263788c2","resolution":{"observed_at":"2026-08-12T18:19:45.417889Z","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-12T18:19:45.886612Z","title":"Efficient Bayesian estimation from few samples: community detection and related problems","venue":null,"work_id":"86b65baa-39eb-4e0a-96cb-ec4b7a8e9a9f","year":2017},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.421420Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:cc5a7cbea5851b01f20c174159dcc70d8365b18fbdc703e7b63d095d809ae5ea","observation_id":"283682db-01ef-4d4b-aa5e-108c219584dd","resolution":{"observed_at":"2026-08-12T18:19:45.891126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.875638Z","title":"Computational lower bounds for community detection on random graphs","venue":null,"work_id":"e432a114-f51f-4a16-9478-baa4e9e2fc4c","year":2015},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.424529Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:a646c48ddf33cbe5e50f7746c23b7788d19f0de4407cff271970993bca52340d","observation_id":"147a6dc5-6896-4f96-9d67-ad995f99eae2","resolution":{"observed_at":"2026-08-12T18:19:45.880158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.864902Z","title":"Large cliques elude the Metropolis process","venue":null,"work_id":"dbff94a9-5c18-489f-9e60-786b2a6b6a6b","year":1992},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.427685Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:3fcc2068672541981a3ec3511ffe0ddf46571ffe5374334cdb09753f99f0f028","observation_id":"3cb039ef-fdbd-476d-8518-6027021fbc37","resolution":{"observed_at":"2026-08-12T18:19:45.868453Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1603.04153","last_updated":"2016-03-14T07:01:28Z","snapshot_observed_at":"2026-08-14T22:06:13.939250Z","submitted_at":"2016-03-14T07:01:28Z","title":"Top-$K$ Ranking from Pairwise Comparisons: When Spectral Ranking is Optimal","version":1},"cited_work":{"arxiv_id":"1603.04153","doi":null,"metadata_source":"pith","pith_arxiv_id":"1603.04153","snapshot_observed_at":"2026-08-12T18:19:45.530038Z","title":"Top-$K$ Ranking from Pairwise Comparisons: When Spectral Ranking is Optimal","venue":"cs.LG","work_id":"a183cdf1-77c9-430b-8130-b6fd1e8edac8","year":2016},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.431384Z"},"links":{"cited_paper":"/paper/1603.04153","citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:5252c01b1794f59350e2787c38932aa3b08a1733e8d006e1d9e1dd3d93a166e1","observation_id":"10459484-3d99-4eec-a5ad-ca1da3d396d4","resolution":{"observed_at":"2026-08-12T18:19:45.536797Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.854443Z","title":"Tolerant algorithms","venue":null,"work_id":"537f16a1-c9cd-4612-9cd0-2e69dcaad0d5","year":2011},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.435225Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:e356e0dd68482d70ef1ddcff33cb18e80ac813458d3275194484c975d0ea6b5a","observation_id":"f4c6ee9b-d294-4752-9e23-5edcb1043f0f","resolution":{"observed_at":"2026-08-12T18:19:45.858115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.438347Z","title":"Notes on computational hardness of hypothesis testing: Predictions using the low-degree likelihood ratio","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.438347Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:d8d56a9d6896413dfa909d71fc5af219217b4fa366d241a76c182ab045d7927b","observation_id":"15532276-e388-43a7-820c-d900578a411f","resolution":{"observed_at":"2026-08-12T18:19:45.438347Z","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-12T18:19:45.838050Z","title":"Individual choice behavior , volume 4","venue":null,"work_id":"b8f80a5b-54c1-4e0f-8337-db9641c4750e","year":1959},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.441306Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:f7d7337cc589b9dee5eabac1e5340ef979b4a0836c288f26dcd4914a0801ef5b","observation_id":"07717b14-74f7-4348-9e74-5719a28a8aad","resolution":{"observed_at":"2026-08-12T18:19:45.842188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.828556Z","title":"Spectral partitioning of random graphs","venue":null,"work_id":"9a7f4578-88b1-4db4-a7e1-1d0f70f75cbf","year":2001},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.444916Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:ebe63d47172eeb7c6e52af59017510b5a398bf3ec20ec9725ddaa07249721444","observation_id":"13d78e4e-cee6-477c-831c-5510c6f93e8b","resolution":{"observed_at":"2026-08-12T18:19:45.832200Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.817871Z","title":"Active learning for top- k rank aggregation from noisy comparisons","venue":null,"work_id":"caa9acb6-ecd7-4a8a-a919-9313abab94c7","year":2017},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.447869Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:746163ea271fd567289a20bf2372f792042e1af9be907ec0a9d1a06cb7d4f229","observation_id":"d1d239e9-e2cd-4253-8162-1490189bfd17","resolution":{"observed_at":"2026-08-12T18:19:45.822040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.808466Z","title":"Minimax rates and efficient algorithms for noisy sorting","venue":null,"work_id":"f6636151-6690-48b4-a09d-b05ca6365fc5","year":2018},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.450829Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:a9fcf84777df872bcb7792f5f381b6fffca93ae7815285a4ad707a8d7e92cbdb","observation_id":"dd14965f-2e33-4f65-88fa-cd22229f40c1","resolution":{"observed_at":"2026-08-12T18:19:45.811855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.798189Z","title":"Detection-recovery gap for planted dense cycles","venue":null,"work_id":"fe8ffe97-fff8-486a-add9-47c03f01384a","year":2023},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.454143Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:02dc5bc1c82f2b1147c163d880b57aa7b676fe2c4c1eff72d1257c0a9d5fae1b","observation_id":"38f75e55-9c7f-48b7-a6c5-efd4f8b03786","resolution":{"observed_at":"2026-08-12T18:19:45.802525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.786732Z","title":"Iterative ranking from pair-wise comparisons","venue":null,"work_id":"586b4876-5552-4b33-bb02-23ebf42228da","year":2012},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.457278Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:373e9b2dbeb634704dcf12cf7c5da1fda45fe921dfafc276b226405448728604","observation_id":"e830e4e4-84f4-4dcc-b4d0-94240c61c773","resolution":{"observed_at":"2026-08-12T18:19:45.790994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.776648Z","title":"Tournament ranking with expected profit in polynomial time","venue":null,"work_id":"c5f16b36-40bc-40d5-a250-a8c927731026","year":1988},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.460445Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:38be4c3e5a5a761cd839483a078f8d9cbd6b3575bb72cdb09b714e7ad97d88a7","observation_id":"6b38d3d4-3e52-45ab-9e6f-7826b0b9b9e3","resolution":{"observed_at":"2026-08-12T18:19:45.780210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.765943Z","title":"A statistical convergence perspective of algorithms for rank aggregation from pairwise data","venue":null,"work_id":"8e8884fb-bc1c-4649-8b2a-cc756df67a2a","year":2014},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.464184Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:a117f4603ab6ae6283a33ceb128683affc37fd78533547e83f5192852dfb402c","observation_id":"8345f48f-bd6b-4152-ba75-a8c24f6069cf","resolution":{"observed_at":"2026-08-12T18:19:45.769758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.756186Z","title":"Social hierarchies and social networks in humans","venue":null,"work_id":"f844f799-b15c-47bf-b2ca-c8bb7d949b29","year":2022},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.467404Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:7dcec420aa110ce9bd17e8e2a32da398f212a4b591794d0c0c91c6e168b770ad","observation_id":"4d25e143-8ae1-4593-9ba1-ccd3e3b9e466","resolution":{"observed_at":"2026-08-12T18:19:45.759860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.745558Z","title":"Sorting from noisier samples","venue":null,"work_id":"06cedec2-6d57-4fa0-b540-a65902f9bfd8","year":2017},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.470687Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:f87976d0dccd402dbd4940a8e0e5e407e9d62547e036d0275afbe5d0b672de74","observation_id":"34c5d73e-659a-481c-a4b4-826fa95ac880","resolution":{"observed_at":"2026-08-12T18:19:45.749144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.733926Z","title":"Stochastically transitive models for pairwise comparisons: Statistical and computational issues","venue":null,"work_id":"6fbc1903-e972-48de-945c-e153054b013b","year":2016},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.473690Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:84cb512f58d457b5018293d017db73d93262b46cb83831014292c54b3fad4ed1","observation_id":"0962b846-7264-4a67-a365-66d0c2c0a527","resolution":{"observed_at":"2026-08-12T18:19:45.738330Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.723834Z","title":"Feeling the bern: Adaptive estimators for bernoulli probabilities of pairwise comparisons","venue":null,"work_id":"3e328b9f-58d7-4a1a-93e0-2c8e1f8d75c6","year":2019},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.476806Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:b8c07e9dda18a3c6dec4ed27164598adf214d9187926a75b66a844b942c25cbc","observation_id":"22716bf9-0ef8-41b5-90e2-ef6450b724c9","resolution":{"observed_at":"2026-08-12T18:19:45.727256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.713502Z","title":"Optimal ranking of tournaments","venue":null,"work_id":"26142766-2128-4237-9a45-86c9c05c5549","year":1971},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.479569Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:4ca24ec5a82e61063f6737d09a0291476bd657dcecf76c119e1918c25e3034f9","observation_id":"bb478d11-34f0-4e92-ab4d-6f99bb941ef1","resolution":{"observed_at":"2026-08-12T18:19:45.716825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.702551Z","title":"On the size of induced acyclic subgraphs in random digraphs","venue":null,"work_id":"c63de931-668d-4c3b-ab65-74123bd6a649","year":2008},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.482598Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:6a5894e86b4e62a1239a1a41020c45416bdf7645e249bf59b8c9e5706454437e","observation_id":"194c90ff-b336-46dd-98b1-635b0fcdb770","resolution":{"observed_at":"2026-08-12T18:19:45.706618Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.692278Z","title":"Simple, robust and optimal ranking from pairwise comparisons","venue":null,"work_id":"8b61e47e-19ee-4d8a-bc6b-192abd4fe175","year":2018},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.485812Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:fde4ccac3174fdb6c5f6bffa4e58aa02fa3e30f4c7fb702672806c7826d39902","observation_id":"a04a731e-cbd5-473d-a528-7cce1066391e","resolution":{"observed_at":"2026-08-12T18:19:45.696023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.488852Z","title":"Computational barriers to estimation from low-degree polynomials","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.488852Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:53b874860ed8774eaf3f95ddb510611d6bff04072eed116bdcbe384e3e6d2314","observation_id":"d8df9e39-da4c-48b7-b1a6-1d6f585ae1e0","resolution":{"observed_at":"2026-08-12T18:19:45.488852Z","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-12T18:19:45.675306Z","title":"Tsybakov","venue":null,"work_id":"3d56d6ce-d3cd-45c0-b537-681083dd338f","year":2009},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.492487Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:62be8c6060ad3e50ddccca561487dbf5353e12ea86fa09e68d3a8f4df2183a54","observation_id":"f608c1cd-d6eb-4765-9d88-071d026110a9","resolution":{"observed_at":"2026-08-12T18:19:45.679466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.665113Z","title":"Noisy sorting capacity","venue":null,"work_id":"9b6758dc-f4d5-41d7-bab2-9784b5a30b60","year":2022},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.495777Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:299f04699468f81b6081d2e9ff1a1458e5f8f0ca385c2085e97d48b76aaf61e3","observation_id":"d3f94a41-2aa1-4402-8155-8cf65208c0b0","resolution":{"observed_at":"2026-08-12T18:19:45.668530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.655145Z","title":"Statistical problems with planted structures: Information-theoretical and computational limits","venue":null,"work_id":"5e03208b-a673-473f-bf07-4bcb4610c8bb","year":2021},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.498815Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:16f8d0d5613523ae142e9672aa0ed0953d0d88e6de50b4b50375d29a8e211255","observation_id":"428024bc-dbb9-4f46-a8df-c5f7a6cdb205","resolution":{"observed_at":"2026-08-12T18:19:45.658771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-12T18:19:45.644684Z","title":"Quantifying hierarchy and dynamics in us faculty hiring and retention","venue":null,"work_id":"842ebea8-619a-42b7-aafa-7e2f3cde5661","year":2022},"citing_paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-12T18:19:45.501781Z"},"links":{"citing_paper":"/paper/2411.19885"},"observation_digest":"sha256:549b436610500c348ff201f6d88b2646f53c6a7213a3a0fc5359e267520b4d08","observation_id":"dcd9b6f8-3319-4284-8084-9c6e562bd900","resolution":{"observed_at":"2026-08-12T18:19:45.648252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.19885","last_updated":"2024-11-18T18:20:30Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph"},"reference_resolution":{"displayed":62,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":3,"verified_fuzzy":51},"total_outbound_references":62},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 62 of 62 outbound references and 1 inbound Pith citation observation for arXiv:2411.19885."}