{"as_of":"2026-08-16T13:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:32889b86ba6ed41c861f8f2b76afd8cb79d8fd1a5acc016708aa96f0363b9832","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:58:38.763542Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.00388/citation-record","integrity":"/paper/1908.00388/integrity","json":"/paper/1908.00388/citation-record.json","paper":"/paper/1908.00388"},"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-14T15:58:41.031183Z","title":"We define the border of a sampled subgraph as the set of all the incoming neighbors not include d in the sample itself","venue":null,"work_id":"48c99ce7-e055-4ea0-aa52-875de0f65a7a","year":null},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.116124Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:478d3ea63c5d37a7e43732e9768d3d4382fef51d0a74ca82cdce2e27e5889f6b","observation_id":"1f3275f6-94d2-4bc6-b6b1-0721dbfabea9","resolution":{"observed_at":"2026-08-14T15:58:41.036093Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:41.120372Z","title":"However, these two quantities are difficult to treat analytically and we therefore rely on acti ng on γ, which is instead accessible","venue":null,"work_id":"d61c34eb-7d2f-47f6-8559-f4ea051b845a","year":null},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.025653Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:4d1ebc1bb2f5251e5f401489baf0d4e70e0b7b9109cb144ee85957f5dba6e161","observation_id":"29200793-3c8c-49f8-9255-46b3a564d77c","resolution":{"observed_at":"2026-08-14T15:58:41.194030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.988460Z","title":"How does the data sampling strategy impact the discovery of info r- mation diffusion in social media? In F ourth International AAAI Conference on W eblogs and Social Media, 2010","venue":null,"work_id":"64e29f41-c5f1-4760-91e6-2a6072ebc066","year":2010},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.122108Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:b9f56f6594d0e0da6a051bcd17af67c43ebf4d16c06a32d89687d12952769cc3","observation_id":"ccabcad9-0ab4-49d3-9cce-e61f9c3634c3","resolution":{"observed_at":"2026-08-14T15:58:41.020022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.841280Z","title":"Correcting for missing data in information cas- cades","venue":null,"work_id":"be87f586-ea6c-4383-8be1-239d29862762","year":2011},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.127991Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:9f346c643b02455e8619613a038d1c17690cb773d9afa1f32950f3b1b7615e91","observation_id":"98b853f1-d151-4828-aa47-cfcd1ebe1b6d","resolution":{"observed_at":"2026-08-14T15:58:40.894156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:38.142043Z","title":"Sampling from large graphs","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.142043Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:1b3064aa24366e68abd46082a800e4365be48d60881ecae7fad46f77583d5c16","observation_id":"a4af1840-b9d9-4250-8d1a-d5f78d79fc99","resolution":{"observed_at":"2026-08-14T15:58:38.142043Z","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-14T15:58:40.815209Z","title":"Towards compress- ing web graphs","venue":null,"work_id":"8f0edb71-88d7-4404-a963-2d077ceddbfc","year":2001},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.183548Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:eb4edd72f192bcca1f721b9aa4078fa2b6ec5b3a2d7e7015624969a50ad3e6fe","observation_id":"92a9c74b-c3ce-4d4a-8029-ee3eb82c0868","resolution":{"observed_at":"2026-08-14T15:58:40.820478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.772907Z","title":"Network sampling and model fitting","venue":null,"work_id":"ef2bda4a-677b-43b8-aaef-41cbf1d9cce6","year":2005},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.204224Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:dd76f362d67fef290796d8508e856bc1358fd645334f4e7c854ed6225c7477d9","observation_id":"a8fb92f2-8150-4424-9ac6-6bdc3271b1cd","resolution":{"observed_at":"2026-08-14T15:58:40.804910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.661505Z","title":"Effect of sampling on topology predic- tions of protein-protein interaction networks","venue":null,"work_id":"b91896b3-a197-4d83-9995-d3ea4bdc84a5","year":2005},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.211318Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:6e64b97a0583226b1cfc14685e3ec97cba8ce76d294c5482956e97f4dafca619","observation_id":"07515535-b4bc-4e94-9f7c-8c117f86b29e","resolution":{"observed_at":"2026-08-14T15:58:40.706713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.645963Z","title":"Sta- tistical properties of sampled networks","venue":null,"work_id":"36da1b09-d444-4dc8-a39a-c31eb10f9fbd","year":2006},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.216671Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:9d14a7bb4f7b3430317d06d1ede71888e2bbb8e7b1b23343611fff01fb554f59","observation_id":"f74bc7bb-d71e-494d-8dd4-372901585e8e","resolution":{"observed_at":"2026-08-14T15:58:40.651818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.552848Z","title":"Effects of missing data in social networ ks","venue":null,"work_id":"ca2478a0-0c22-448c-af00-911c2dd4a245","year":2006},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.221292Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:135abfe3b9d7512e703a721484852f4599d8d28734df074d2487f829bb983641","observation_id":"6493bf77-af74-4a31-adfb-69c09e4911d2","resolution":{"observed_at":"2026-08-14T15:58:40.634603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.433521Z","title":"Factoring and weighting approaches to st a- tus scores and clique identification","venue":null,"work_id":"4eff47c8-6456-4b06-bfa7-30503f8e2498","year":1972},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.248046Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:27b08cb0b391496cdb5acaa4e5ad55234589ad36c0f3142c927ba06c7a58bae4","observation_id":"742aebe9-6548-4f27-ae28-3131bb534956","resolution":{"observed_at":"2026-08-14T15:58:40.438254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.418072Z","title":"The stability of centrality measures when networks are sampled","venue":null,"work_id":"f1869f50-ca56-4fab-923d-d1349fe27cef","year":2003},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.301556Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:92bda95e3fbef4d321e8a275ac31d91ae315112a8d309342296e576608acccdf","observation_id":"8dba83c5-9108-4a56-8ca5-d257d946a60c","resolution":{"observed_at":"2026-08-14T15:58:40.423349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.403266Z","title":null,"venue":null,"work_id":"da4db571-c3a0-4429-aa1e-6e8147e4f506","year":2011},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.351725Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:ca870229b128bc816d9e8f9a0a92594161dca8b8c9730f81924b07de15f7f61e","observation_id":"3d6bb85a-bb24-4270-a9b8-ce08d0f72e93","resolution":{"observed_at":"2026-08-14T15:58:40.407890Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.378661Z","title":"Empirical com- parison of network sampling: How to choose the most appropri - ate method? Physica A: Statistical Mechanics and its Applica- tions, 477:136–148, 2017","venue":null,"work_id":"a8c8f548-88d6-4c63-ad2f-bcc2d030c744","year":2017},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.357172Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:a03d3ddfb97f6513574ee90aa2c9e0d7baf5acf6413b15f18b43636689955b48","observation_id":"d16094d3-8ef7-4baa-80bf-7d33b0171bcb","resolution":{"observed_at":"2026-08-14T15:58:40.391899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.238972Z","title":"Is the sample good enough? comparing data from twitter’ s streaming api with twitter’s firehose","venue":null,"work_id":"3aceb11f-6bb9-40a0-9c6a-49753c37d191","year":2013},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.362306Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:3b117bae06ef07afd1cf5b248aa2b654ba061fd20b85a8468af3e836910d464f","observation_id":"bc59205f-d711-48b2-b27e-64c0097ea939","resolution":{"observed_at":"2026-08-14T15:58:40.316232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.223914Z","title":"On unbiased sampling for unstructure d peer-to-peer networks","venue":null,"work_id":"910e9bfc-be16-46bd-9980-9af23f4e325a","year":2009},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.367064Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:06c0c5cb712164d1b58b5c126181de633bfc3b1c46aacce16a4ceec3dd81d0a1","observation_id":"4754f4bb-d4f5-4f3a-9f44-a4a1ad5a4b3a","resolution":{"observed_at":"2026-08-14T15:58:40.228798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.207955Z","title":"Metropolis algorithms for representat ive subgraph sampling","venue":null,"work_id":"39d7127b-9483-437b-968b-f8f969d7e114","year":2008},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.371630Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:c3db3ff94c186865839c7f8ac1f0a4927f5b4f75e714d9ffdcd0430899ed6cce","observation_id":"3bd9f81c-1d61-416e-8be2-2d51ea8b32a9","resolution":{"observed_at":"2026-08-14T15:58:40.213186Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.043303Z","title":"Sampling properties of random graphs: the degree distribution","venue":null,"work_id":"d1d4ad34-817f-466b-b580-40be22bc2e68","year":2005},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.452085Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:de9099ebd5918a8195d7b86b54ba4ccd433f0a99484374d4b67c05d819f95931","observation_id":"b050ef4e-9351-4d9a-8324-3164925a3efe","resolution":{"observed_at":"2026-08-14T15:58:40.087548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:40.026305Z","title":"Estimation of vertex degrees in a sampled network","venue":null,"work_id":"48e5e7e3-1246-4652-bb0e-de801abc36a4","year":2017},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.464064Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:2a68701db1c1a24b452319bc35d27b435db35876ab876a4eb6d19ca875033475","observation_id":"1761fff3-413c-4ef3-b7eb-12de5b57918d","resolution":{"observed_at":"2026-08-14T15:58:40.031097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.01300","last_updated":"2018-10-02T14:34:53Z","snapshot_observed_at":"2026-08-14T18:20:33.023509Z","submitted_at":"2018-10-02T14:34:53Z","title":"Sampling-based Estimation of In-degree Distribution with Applications to Directed Complex Networks","version":1},"cited_work":{"arxiv_id":"1810.01300","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.01300","snapshot_observed_at":"2026-08-14T15:58:38.803877Z","title":"Sampling-based Estimation of In-degree Distribution with Applications to Directed Complex Networks","venue":"stat.ME","work_id":"c9f171c6-0da9-43a6-9cbb-6c43b8e25593","year":2018},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.468803Z"},"links":{"cited_paper":"/paper/1810.01300","citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:4e682fb249966ec9131e519f9d1f9d447e949f50323e7c12c239001867084ca5","observation_id":"0985240a-c34f-49e7-8e12-ec58d214d9a4","resolution":{"observed_at":"2026-08-14T15:58:38.955536Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:38.474016Z","title":"The anatomy of a large-scale hypertextual web search engine","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.474016Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:5b86b4b289c3082415df3a166bf7c185cb54ffc5ce4e6a32d07b7e6d9f8ecd10","observation_id":"c55ba298-26af-4951-8e57-5922832dadb1","resolution":{"observed_at":"2026-08-14T15:58:38.474016Z","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-14T15:58:39.904581Z","title":"An improved method for efficient pagerank estimation","venue":null,"work_id":"d7cb969b-393a-4412-b463-977e6d715a0a","year":2014},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.478703Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:85420ad3be039c76109fedff4c731b8df5447125dd4ae9048919a3b83574e446","observation_id":"fdbf0cbb-b8f7-43dd-a976-5b32034bb8d6","resolution":{"observed_at":"2026-08-14T15:58:39.956307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.889251Z","title":"Local methods for estimating pagerank values","venue":null,"work_id":"6a120cc3-7d45-4ab7-b1f7-584157aac8a4","year":2004},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.516399Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:7e70f934d8bd25feed6d9ba9d3e792e321e29c0ef9434d3ac640c0841be196ed","observation_id":"5b52eea3-4e3f-4082-90fc-b1eccff29d57","resolution":{"observed_at":"2026-08-14T15:58:39.893753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.805606Z","title":"Matrix computations, volume 3","venue":null,"work_id":"bbe538e8-1485-4384-b1ef-952c4c6ce8f1","year":2012},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.541041Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:6a6f7ed42efeb642f6cd6e0961587e972959980b3d3123dbcea8196b1f1fc162","observation_id":"c5380b69-34bf-49d4-b205-19d4fa21e899","resolution":{"observed_at":"2026-08-14T15:58:39.869402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.718218Z","title":"Walking in facebook: A case study of unbiased sampling of osns","venue":null,"work_id":"72857a48-0edb-4917-a74b-48a1e996436d","year":2010},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.546033Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:727311b54e055745c0aeb8c01d6af5cc11c9202e0f35fabedf18f84e8caf6760","observation_id":"8b061ca7-417c-412f-b177-620227cd07ff","resolution":{"observed_at":"2026-08-14T15:58:39.767808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.662948Z","title":"Local estimates for eigenvector-like cent ral- ities of complex networks","venue":null,"work_id":"72874ace-9bb7-401c-8439-6d986c9d5aa3","year":2011},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.549762Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:294b0d30fd6377fc5eee0e3b3d2be299de3b900ae080f8f26d2171e1bdf1a0ae","observation_id":"64e1796f-196f-48ea-9c44-8ff0da9c96c6","resolution":{"observed_at":"2026-08-14T15:58:39.668560Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.646319Z","title":"On random graphs, i","venue":null,"work_id":"1adaae7f-60ff-48ba-b5ef-7a174beae9ce","year":1959},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.555500Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:8d8d8604ab07f1b6a85cb7a2acd58091d1f1c09002ee0fa660b59738ee54d6f1","observation_id":"a0479a25-d2d2-42ae-8d4c-6e7d2fe3218a","resolution":{"observed_at":"2026-08-14T15:58:39.651718Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.551429Z","title":"Quantifying the completeness of the observed internet as-l evel structure","venue":null,"work_id":"100d9b9e-f0ea-493d-9a75-08add72bf6eb","year":2008},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.560129Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:b16d43e36bc45c21959b5c74ce9977f836bbd4c2a54324754eee499cf588e53b","observation_id":"5ed64dba-f0b7-46da-9381-0e9d4d081c0a","resolution":{"observed_at":"2026-08-14T15:58:39.634956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.465639Z","title":"Grap h evolution: Densification and shrinking diameters","venue":null,"work_id":"c4b9cc1f-aaae-4319-b5bb-a2d424703570","year":2007},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.601898Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:d559cb368016e4fb533bdb2dacf2ada4e61ed2f8ff91b92a438dba4e59132cfc","observation_id":"8297750e-c851-4136-9439-8e9fe440133a","resolution":{"observed_at":"2026-08-14T15:58:39.471299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.355231Z","title":"Trust management for the semantic web","venue":null,"work_id":"719187b4-6a3a-4eb0-b3f2-db9a4e61b6f7","year":2003},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.612119Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:454e24bc4ed30008968c0734c1624c75851e5fe1ed970e8665f06401c17621bc","observation_id":"5121ca7f-dc86-49f0-ac55-8f8839776338","resolution":{"observed_at":"2026-08-14T15:58:39.411269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.294341Z","title":"Community structure in large networks: Natural cluster sizes and the absence of large well-defined c lus- ters","venue":null,"work_id":"ee627056-3ac2-4a21-a966-0d517ade42d8","year":2009},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.616795Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:0ab8faf45dc20ed2e7c93d96e74db15ec63b7b991c1d9fc1c675992edd2d2d50","observation_id":"06f04496-d94c-49b9-bcab-ce84c6ec9959","resolution":{"observed_at":"2026-08-14T15:58:39.298892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.278761Z","title":"Random walks on graphs: A survey","venue":null,"work_id":"b2ac0240-1ef9-4509-b154-9a9295e7dabd","year":1993},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.621665Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:a2e51970be2e41e2f2824adcdf92abb6476d175e2e7e9214ef8c6e0966083af1","observation_id":"9b21f4e4-91cb-43e1-b107-63bf0c2d3d5c","resolution":{"observed_at":"2026-08-14T15:58:39.283538Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:38.625894Z","title":"Equation of state calculations by fast computing machines","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.625894Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:a9290d4faf1102f13891ff5d16467cddb667ca352439d3265dc436c54b0e759f","observation_id":"17ecbfa2-b060-4561-8444-f453b65584b3","resolution":{"observed_at":"2026-08-14T15:58:38.625894Z","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-14T15:58:39.073223Z","title":"Snowball sampling","venue":null,"work_id":"9aa2f7ae-1ef5-4a1a-9aa5-b872e521acc6","year":1961},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.630112Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:f3cb9e7824daa0533e8c4d377944ab78bdf62703143ec8607defb148bb312580","observation_id":"9a2dee97-e868-40ba-8f96-2b9ac34f15bd","resolution":{"observed_at":"2026-08-14T15:58:39.171720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.036124Z","title":"Sampling community structure","venue":null,"work_id":"3f0223c3-ac93-4a64-a9e9-d5c21daeb900","year":2010},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.697478Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:926691aa9fea9cf9e919e637dd2d30d0af09ca3e8ad138c0a0f318b55067cbc1","observation_id":"2e6e0693-e501-4885-89a9-ba16f189207e","resolution":{"observed_at":"2026-08-14T15:58:39.040714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:58:39.021900Z","title":"Nonparametric statis- tics: A step-by-step approach","venue":null,"work_id":"1c509173-4e12-423a-adbc-0d79d9dfb237","year":2014},"citing_paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T15:58:38.763542Z"},"links":{"citing_paper":"/paper/1908.00388"},"observation_digest":"sha256:c16f5542b908f033fc564c398f0c742052a73951825457656840eaf5c624b620","observation_id":"afd90e40-8341-4411-b478-ffcea8c217b4","resolution":{"observed_at":"2026-08-14T15:58:39.026980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.00388","last_updated":"2019-08-01T13:36:14Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-16T06:06:54.794409Z","submitted_at":"2019-08-01T13:36:14Z","title":"Sampling on networks: estimating eigenvector centrality on incomplete graphs"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":31},"total_outbound_references":36},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:1908.00388."}