{"as_of":"2026-08-17T00:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f88213001f1113a08fd1524a54b3eeeaeec26d4122038db7543267feb27ae064","coverage":[{"denominator":69,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":69,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:01:08.103443Z","state":"measured"},{"denominator":69,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":69,"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.07376/citation-record","integrity":"/paper/1908.07376/integrity","json":"/paper/1908.07376/citation-record.json","paper":"/paper/1908.07376"},"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-14T13:01:09.180713Z","title":"Albert, A.-L","venue":null,"work_id":"228ece0e-43d6-4050-9d16-59a0085b0ca8","year":2002},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.778321Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:54582dcdd259f7df37cb2e14767cc9bbd92c1707cb796a8af86515a875e62ff2","observation_id":"340c7f7d-ecbf-4188-bab9-897c881bddc5","resolution":{"observed_at":"2026-08-14T13:01:09.185338Z","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-14T13:01:09.165382Z","title":"Caldarelli, Scale free networks: complex webs in nature and technology (Oxford University Press, 2007)","venue":null,"work_id":"a3826251-b0e4-46cb-b81c-0c306177b749","year":2007},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.783857Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:80cad93df25f441f05acbe7f35561898a58e77efaa7b153d34e8b27a35b0295f","observation_id":"0d18b421-1a5e-426d-b981-3a95a05e37a6","resolution":{"observed_at":"2026-08-14T13:01:09.170572Z","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-14T13:01:09.149624Z","title":"Havlin, R","venue":null,"work_id":"c36b08a8-ac48-4e28-b17c-34626c440f98","year":2010},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.788781Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:80cbb55074580c0e88becfd6717a08fe6a74304611a755915280e46908a7cdab","observation_id":"12b6150e-33b9-44de-af8a-030f5fa03e6c","resolution":{"observed_at":"2026-08-14T13:01:09.154356Z","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-14T13:01:09.133938Z","title":"Newman, Networks: an Introduction (Oxford Uni- versity Press, 2010)","venue":null,"work_id":"09db8880-49c9-4e63-8852-6282ba3390d6","year":2010},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.793878Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:5f12d66216051f26f59189bcb1523b5fb978ad1d7862eabe80e73dedd234e8a6","observation_id":"0de3cc3f-0f74-422d-9913-644b9b7f6a01","resolution":{"observed_at":"2026-08-14T13:01:09.138708Z","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-14T13:01:09.119040Z","title":"Estrada, The Structure of Complex Networks: Theory and Applications (Oxford University Press, 2011)","venue":null,"work_id":"1ec7ed48-894e-4497-9a32-be3dcea87f8f","year":2011},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.798713Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:c989be563cfff8816355bf1d11606e7f8edc4171b658285bca1ac0d2f1f02f07","observation_id":"e1cf0955-a078-48a8-9c5b-cc5f86015809","resolution":{"observed_at":"2026-08-14T13:01:09.124123Z","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-14T13:01:09.102531Z","title":"Barrat, M","venue":null,"work_id":"bcba1536-2343-48e1-b2a4-25735ee438b1","year":2012},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.803333Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:c03e4e227148efd65722e9ce73363ed8f2ffad6346ca09239c74cf339170e8c6","observation_id":"a134d5d0-4e3a-4092-8685-14cba64fb5a3","resolution":{"observed_at":"2026-08-14T13:01:09.108214Z","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-14T13:01:09.086379Z","title":"Milgram, Psychology Today 1, 61 (1967)","venue":null,"work_id":"b5431076-52a3-41dc-ba8e-32e1b75c2f22","year":1967},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.808533Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:bec0b4444ded6a404b6e2097f90009b91c3b36dbabe048d4fa4a06d4bfcf3116","observation_id":"c5e0cba5-b197-4bfa-8e25-22d12f511db1","resolution":{"observed_at":"2026-08-14T13:01:09.091755Z","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-14T13:01:09.070092Z","title":"Watts, S","venue":null,"work_id":"f4375201-23d8-4a93-ac99-0ff06d559d53","year":1998},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.813725Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:1df086c2c468d27740d0e1ba0a3faa4be83689b5e08d16cf2c5a2ea488aa98c9","observation_id":"48ee081b-44a3-42b1-bfd0-bba0a53200c5","resolution":{"observed_at":"2026-08-14T13:01:09.075379Z","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-14T13:01:09.054612Z","title":"Chung, L","venue":null,"work_id":"84e625d4-f165-43e5-ad8d-274adae4f97c","year":2002},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.818128Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:1169dc73c12cb9ac00265291776f58f6b8911cd4231c45fe02ae053e13f8e322","observation_id":"5aade94f-b8c0-41c2-b59c-3c69503980a4","resolution":{"observed_at":"2026-08-14T13:01:09.059736Z","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-14T13:01:09.038235Z","title":"Chung, L","venue":null,"work_id":"dee48921-c778-4f12-becc-ae5ec2f8835c","year":2003},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.822641Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:65369f079a86499b8df5abce5f62de34eee989d85fc11ee5cb05f939f657f383","observation_id":"681fcb42-dffc-4c48-99a0-e2c31c4e4129","resolution":{"observed_at":"2026-08-14T13:01:09.043167Z","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-14T13:01:09.020528Z","title":"Barab´ asi, R","venue":null,"work_id":"fbe98cbe-7888-43b5-937c-c4641f476b54","year":1999},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.827192Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:fd0fd7b71cc036859880cce8896655f520702706f8e3a74a12717a20caaf69c6","observation_id":"22be054d-9ff9-4436-82d8-9002ace183b4","resolution":{"observed_at":"2026-08-14T13:01:09.026206Z","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-14T13:01:09.004458Z","title":"Jeong, B","venue":null,"work_id":"61e306df-8f0c-4c89-881c-b3e859501ec8","year":2000},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.831867Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:e2b952be03eef028a18d979e0a949bd133b9ab1d325bd0c70a84894a65a98622","observation_id":"38894968-00d7-4581-8d05-6dd4b75de81c","resolution":{"observed_at":"2026-08-14T13:01:09.009663Z","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-14T13:01:08.986952Z","title":"Krapivsky, S","venue":null,"work_id":"bb4e1a05-5d3c-45b6-b980-b79c68d2f629","year":2000},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.836413Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:9ab43e3da1625d630131dc3a8e5aafc3f52197cfc6eab4bb53e757b67a8be2d5","observation_id":"a2fe3c62-d7a7-419b-a590-1ddcfbb465e4","resolution":{"observed_at":"2026-08-14T13:01:08.992539Z","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-14T13:01:08.970279Z","title":"Krapivsky, S","venue":null,"work_id":"64c30f88-8fee-467a-8a1b-602e308d5047","year":2001},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.840813Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:84dddd34faea7ed5c8005027c491f8943bcdfa324d89b7089860fb88e6a31f97","observation_id":"1aba2e6b-0495-46bd-95f6-a9535fb49431","resolution":{"observed_at":"2026-08-14T13:01:08.975079Z","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-14T13:01:08.952670Z","title":"V´ azquez, Phys","venue":null,"work_id":"eb7f6dcc-f3e9-4cfc-9c12-75f46c3d9b96","year":2003},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.845390Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:d9ad5e0cf2460011f10eb5928271dd2d5193df8eb0b887049d21313208714f1b","observation_id":"0adfa22d-a273-4b8c-bbfa-826907881df2","resolution":{"observed_at":"2026-08-14T13:01:08.958147Z","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-14T13:01:08.936153Z","title":"Cohen, S","venue":null,"work_id":"299854dc-e85e-403b-9308-f61ded559270","year":2003},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.849858Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:2f23d624e4cda9445a43e0c7d27b3379f56c0dc220646ae1494f95c33953cfb8","observation_id":"33318b84-19c7-4348-97ca-b58a37342ce6","resolution":{"observed_at":"2026-08-14T13:01:08.941087Z","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-14T13:01:08.920157Z","title":"Giot et al., Science 302 1727 (2003)","venue":null,"work_id":"af006286-994c-4291-985c-9fb8ddfdf37c","year":2003},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.854237Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:b116b90c57cd0a39442d1799fae2f1b522b635ecef5dd9b61bf43cd81f6694c3","observation_id":"f444e03d-0929-421f-82bb-60ffb59b176e","resolution":{"observed_at":"2026-08-14T13:01:08.924980Z","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-14T13:01:08.904497Z","title":"Ma´ ayan, S.L","venue":null,"work_id":"9d1c4954-e543-40c7-83df-ad685d4a6ed0","year":2005},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.858815Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:4b0d2b154967af6830df3d639b18264633dbb3d1bff3b4743773288e1165cf65","observation_id":"f457330e-849c-4b5e-a7b4-532b98caf837","resolution":{"observed_at":"2026-08-14T13:01:08.909209Z","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-14T13:01:08.888317Z","title":"Dijkstra, Numerische Mathematik 1, 269 (1959)","venue":null,"work_id":"3e899bee-9ef6-4348-8ffe-33b84623e644","year":1959},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.863168Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:928b1567a4c4c06099e264dec332f9f789f156d70838df837eeb1620273dae60","observation_id":"8774bb1d-bbce-4cd5-ad6e-fcc58ab6a476","resolution":{"observed_at":"2026-08-14T13:01:08.893390Z","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-14T13:01:08.872066Z","title":"Delling, P","venue":null,"work_id":"8486b5fc-6bb9-47d4-8b65-9f0ac46e44ed","year":2009},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.867764Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:f5de81ce2084ceae7ef3a54be4b8a496f0376b24d249b04cc878a81f5279cc84","observation_id":"55bde2e4-db2a-43e6-95ce-08fcf41c7552","resolution":{"observed_at":"2026-08-14T13:01:08.877816Z","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-14T13:01:07.873025Z","title":"Pastor-Satorras, C","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.873025Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:439e050c8ed821396c6082b9616834ab19f60ee5540b5a816e4b2a0fe63e0fa1","observation_id":"a4c2e0b3-b56a-48d9-9f05-3f023e7350ab","resolution":{"observed_at":"2026-08-14T13:01:07.873025Z","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-14T13:01:08.846232Z","title":"Bollobas, Random Graphs, Second Edition (Academic Press, London, 2001)","venue":null,"work_id":"75f2a4ad-d6ed-43de-ae1c-b8aa5af0fef2","year":2001},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.877468Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:0a5a47aa66a9f56afe88349a2d71a95a7e0eba67e5973157db9b9c8b911f15c7","observation_id":"ef702c82-9476-4a44-babf-77cdf235a202","resolution":{"observed_at":"2026-08-14T13:01:08.850863Z","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-14T13:01:08.832253Z","title":"Durrett, Random Graph Dynamics (Cambridge Univer- sity Press, Cambridge, 2007)","venue":null,"work_id":"e581d6b5-43b7-42d7-9349-0ba992d12b3e","year":2007},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.882444Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:728a190fcdfe007a97f26ee941293ad7680d14e58fd5a23affd7c5988ddb3542","observation_id":"2111beb5-6048-4092-8ab7-3a77b18835f8","resolution":{"observed_at":"2026-08-14T13:01:08.836780Z","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-14T13:01:08.817684Z","title":"Fronczak, P","venue":null,"work_id":"c1109c69-d2c0-49b7-a076-9546d987819e","year":2004},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.887331Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:edf337a0781b8f55df1e940c8c4a4d608e7147f88ba600fe2a46334b52e0207f","observation_id":"b8b63ed6-8c95-4b38-aa42-30b29d1643df","resolution":{"observed_at":"2026-08-14T13:01:08.822653Z","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-14T13:01:08.803275Z","title":"Newman, Proc","venue":null,"work_id":"0fd9643b-d3aa-432c-894f-b7a20e62cec0","year":2001},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.891954Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:796c63f2ee1add4c08b6b068614313aa0dd118bb177775fd602bdec362e4f7e6","observation_id":"474159cc-e6ef-4af1-9e00-70258c95e37f","resolution":{"observed_at":"2026-08-14T13:01:08.807862Z","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-14T13:01:08.788388Z","title":"Hartmann, M","venue":null,"work_id":"8f4a5cd1-7096-4c7b-abfe-b3695b969201","year":2017},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.897479Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:038c554bd292f833c3ede2e132bfbc2fc94959adbbc71703b34222e5f19b001b","observation_id":"712ae08d-1c5c-484f-a7c7-65c2229932fa","resolution":{"observed_at":"2026-08-14T13:01:08.792768Z","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-14T13:01:08.772415Z","title":"Newman, S.H","venue":null,"work_id":"a41aac1e-dd2d-469b-90ac-f306ede6a455","year":2001},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.902702Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:30e301827df89bfb0de8dc37a8115f2402c4fb02047d82dc76d74c49ac1ca6e3","observation_id":"c735abe5-5849-477b-95ef-9173a497b243","resolution":{"observed_at":"2026-08-14T13:01:08.778531Z","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-14T13:01:08.757378Z","title":"Dorogotsev, J.F.F","venue":null,"work_id":"bee28ea5-7e19-4ba4-b5bb-38769750595d","year":2003},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.907829Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:2892717f87fce6dd791520ec24dfc40641e7613b81c91f9e30fe04329a890b8c","observation_id":"ee13597c-bfff-4920-ac39-9f6becb32fd8","resolution":{"observed_at":"2026-08-14T13:01:08.762248Z","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-14T13:01:08.743129Z","title":"Blondel, J.-L","venue":null,"work_id":"a0ba1aae-285e-487a-ac9e-ba8d6668980d","year":2007},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.912479Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:7e2fc778a5a4ba664e5ba75236e575efbc29cfd9cfafc1e71ea8c7cff74e9816","observation_id":"db55323d-c1ec-4df7-bb2a-3719d67e4ada","resolution":{"observed_at":"2026-08-14T13:01:08.747788Z","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-14T13:01:08.728820Z","title":"van der Hofstad, G","venue":null,"work_id":"a919db67-3af3-44a4-bf31-0f405c735694","year":2007},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.917242Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:0665170a40ae64bf2e1d9f2ee7c136ee2596a5efe1046e038edbaac8ed07a062","observation_id":"2a646c0e-ed81-4e9d-802a-a50803fd27cc","resolution":{"observed_at":"2026-08-14T13:01:08.733329Z","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-14T13:01:08.714279Z","title":"van der Esker, R","venue":null,"work_id":"ed3cab41-b7f4-48e3-8b8a-1a4983d3ce77","year":2008},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.921819Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:9bbe4a53af2a687d22baad874aeda6298531607d51ff14d8c91ff87399809382","observation_id":"c4ed8042-4306-4877-a22f-095f3cdcfa37","resolution":{"observed_at":"2026-08-14T13:01:08.718975Z","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-14T13:01:08.699854Z","title":null,"venue":null,"work_id":"c7ad4bc3-9bb8-4a1a-aecb-50d9a44320a5","year":2008},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.926171Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:90f58362e364d5c648b52836a55cf37a6ac8f8138a6abfeea22277904007b298","observation_id":"22561e84-13d7-4e12-b08c-0c8e18c11c89","resolution":{"observed_at":"2026-08-14T13:01:08.704530Z","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-14T13:01:08.685336Z","title":"Shao, S.V","venue":null,"work_id":"95c7a280-6a99-4748-859c-e8e16cb895fd","year":2009},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.931188Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:d1d9cab1ae62e0a959c713981933112aeea5ceab8ea770a8d0642ecac8651043","observation_id":"62cb4112-9f19-4d0b-aa3e-17a8f0a006ca","resolution":{"observed_at":"2026-08-14T13:01:08.689944Z","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-14T13:01:08.670492Z","title":"Katzav, M","venue":null,"work_id":"973285ce-fad8-43bb-89f2-9927e6d0323e","year":2015},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.935685Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:855daa6662ffbec04f46a22594f28550c63a47e70e980ff58b8172d28559e9a1","observation_id":"67240d4d-1d8e-4785-a429-7c85ae277190","resolution":{"observed_at":"2026-08-14T13:01:08.675209Z","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-14T13:01:08.655706Z","title":"Erd˝ os, A","venue":null,"work_id":"2c085405-4fb5-42fd-ac1c-65e255c1d6b0","year":1959},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.940359Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:1a6d684bc69c704c7c1e83dbdf54cc4b2fe3d932f9f174fed044006142471936","observation_id":"c5ee3ea5-13ea-4be5-ad5b-b07b3826150c","resolution":{"observed_at":"2026-08-14T13:01:08.660386Z","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-14T13:01:08.639215Z","title":"Erd˝ os, A","venue":null,"work_id":"838f1196-8dba-4d91-9b70-f05e12be7f79","year":1960},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.945835Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:1e501ab0f1fc646df8d1320f2533980cfee69630e17f66bffa7cdcf8158bc380","observation_id":"42066ae3-9f8d-43ca-8c03-5bab2a6a880a","resolution":{"observed_at":"2026-08-14T13:01:08.644640Z","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-14T13:01:08.624608Z","title":"Erd˝ os, A","venue":null,"work_id":"9532a686-7146-4571-8623-d208843e1db8","year":1961},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.950359Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:213e86fefeade544907698c821007ce03d269ab93620d96b1297416e4bada42f","observation_id":"f71e1d95-48f3-452f-b02a-1c47a07b9365","resolution":{"observed_at":"2026-08-14T13:01:08.629301Z","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-14T13:01:08.609043Z","title":"Nitzan, E","venue":null,"work_id":"072a2762-7de6-419f-bd58-fa847ed5c3b1","year":2016},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.954757Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:ae03c52301e21de5e86ac35a0e0427e68ef4c666dc402f20271e0ce10b29ea18","observation_id":"c0db9c36-1a3e-4627-8702-b777f8b3acfe","resolution":{"observed_at":"2026-08-14T13:01:08.613707Z","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":"1604.05521","last_updated":"2016-04-19T11:28:10Z","snapshot_observed_at":"2026-08-14T22:01:03.226072Z","submitted_at":"2016-04-19T11:28:10Z","title":"Simple and accurate analytical calculation of shortest path lengths","version":1},"cited_work":{"arxiv_id":"1604.05521","doi":null,"metadata_source":"pith","pith_arxiv_id":"1604.05521","snapshot_observed_at":"2026-08-14T13:01:08.141550Z","title":"Simple and accurate analytical calculation of shortest path lengths","venue":"physics.soc-ph","work_id":"ddcf1f60-d2d8-44f7-b782-a485a7bcec09","year":2016},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.959543Z"},"links":{"cited_paper":"/paper/1604.05521","citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:f66723cd3e3fa2a8f85e6aac9225b96deac54c24e3e43e996ae9525299bdf4cb","observation_id":"0c4e05bf-0400-4c5d-85b2-a33e74f9aeca","resolution":{"observed_at":"2026-08-14T13:01:08.148841Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:01:08.594360Z","title":"Molloy, B","venue":null,"work_id":"eb0d5b24-6f2b-4880-a8b5-5435c1df4481","year":1995},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.964542Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:db210e60cd613e3ce7ce5f20b416d7429cd7af46a5a747d27ab4f1e480079a15","observation_id":"c4f0ae98-e770-4a2c-9d80-d0dd96935103","resolution":{"observed_at":"2026-08-14T13:01:08.599307Z","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-14T13:01:08.578936Z","title":"Molloy, B","venue":null,"work_id":"5743e7d9-1004-41f4-98d0-ec134c699f8a","year":1998},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.968990Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:4b6e78eb2afd4b19a93e0d146ada8df767d63798cec8dc58caacfc4035d787ab","observation_id":"6e0f6a5e-549b-40a5-974f-e393dcc7933e","resolution":{"observed_at":"2026-08-14T13:01:08.584095Z","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-14T13:01:08.564416Z","title":"Bhan, D.J","venue":null,"work_id":"5d63f821-c8be-437b-a742-e7ea84113d01","year":2002},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.973454Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:9b443140f1cf2e2692de3d1a5ef047ff3c67c91879fce02090bda1e7f6a97fdb","observation_id":"6f539bbb-0a5b-460f-82eb-e4c49eb359ca","resolution":{"observed_at":"2026-08-14T13:01:08.568910Z","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-14T13:01:08.549375Z","title":"Kim, P.L","venue":null,"work_id":"e031f140-3757-42bb-ae61-44d0dd84df1b","year":2002},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.978044Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:d7f7a405e5cc4c0218d332b09c3c159b90832e4523fb5ddf1f604607769023f4","observation_id":"7c923ef7-c695-4068-8f2f-11f142b34443","resolution":{"observed_at":"2026-08-14T13:01:08.554423Z","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-14T13:01:08.535294Z","title":"Chung, L","venue":null,"work_id":"cb52635b-d156-453b-8862-68706b5dcd18","year":2003},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.983037Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:93d8659845ded012f06a0253d6208951f9f143f7392b5fdce5ef0b0f93c13453","observation_id":"4f06377c-3838-4b5a-894b-f80c0e467d5c","resolution":{"observed_at":"2026-08-14T13:01:08.539731Z","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-14T13:01:08.520950Z","title":"Krapivsky, S","venue":null,"work_id":"ddaa24b0-f2f9-4164-8b01-6b274ba5a0ea","year":2005},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.987748Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:b340b3e2f82937e4741437b794b902cabd6af566327d84162e7a16d617059151","observation_id":"0e95429b-a205-47af-8dd2-ce1291e6858d","resolution":{"observed_at":"2026-08-14T13:01:08.525625Z","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-14T13:01:08.506112Z","title":"Ispolatov, P.L","venue":null,"work_id":"205565b5-36e1-4cce-a5f1-44836697eb49","year":2005},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.992567Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:27dd7d9363454200a7e00fbd52f96406434c7e5d44935a8a5b79d96def4ea714","observation_id":"7a16071f-981e-4ff6-b01f-963f1fe04725","resolution":{"observed_at":"2026-08-14T13:01:08.511031Z","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-14T13:01:08.491110Z","title":"Ispolatov, P.L","venue":null,"work_id":"daca224e-ec70-4478-88ff-cdd16f94fe3a","year":2005},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:07.997711Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:d01819e0913159de63c2fd6b4692d8ce03f734137d4faadb928896630d31cca9","observation_id":"166a88e6-3128-41a3-9fb3-6d46fd112765","resolution":{"observed_at":"2026-08-14T13:01:08.495915Z","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-14T13:01:08.475917Z","title":"Bebek, P","venue":null,"work_id":"45bd53c5-1ccc-4aef-909c-aef662ac5a9f","year":2006},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.002321Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:c7145c72b2337015d2ad216fef3482261043725b04025ce0af23b8b9bc801b78","observation_id":"323a11a3-19b9-4748-979f-1d219e913035","resolution":{"observed_at":"2026-08-14T13:01:08.480818Z","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-14T13:01:08.460283Z","title":null,"venue":null,"work_id":"5c32d2e2-1e8d-4a63-a287-6b28c71f0a8b","year":2013},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.006693Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:af1ec131b06d3a2e6fecc8d59f3c5330f6ff16d9b674b1750fa378daf4b3b3b5","observation_id":"7e4eb9dd-a0b7-44b4-ae42-9f395fcb156f","resolution":{"observed_at":"2026-08-14T13:01:08.465478Z","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-14T13:01:08.444905Z","title":"Lambiotte, P.L","venue":null,"work_id":"1ebbf473-2c91-44eb-ac3d-94a90580e981","year":2016},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.011483Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:f54988668e69416f72657b09779f12400e0ab264b719bb78ec98670fedcb3154","observation_id":"7c38b678-a55e-419c-9f4f-a183ef6efb57","resolution":{"observed_at":"2026-08-14T13:01:08.449680Z","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-14T13:01:08.429867Z","title":"Bhat, P.L","venue":null,"work_id":"4634bfbd-f9a9-4cf1-b0dc-bb698a5d6da9","year":2016},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.016104Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:699299dfcd9a4dd2275ff0eb98bf280928419e44ac52d96731f6e0f6a6460cb5","observation_id":"7466f14f-f996-475f-8854-e14b8a98ab32","resolution":{"observed_at":"2026-08-14T13:01:08.434813Z","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-14T13:01:08.415125Z","title":"Toivonen, L","venue":null,"work_id":"74b3e77d-2a85-4b1c-bf76-6f34b0709a25","year":2009},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.021253Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:452ed501e37a0363c5bb0e8f347a34387a66d0c6b2370f2bc4f0467a5471c65f","observation_id":"2a97235a-2393-4591-a2e7-f346cc73249f","resolution":{"observed_at":"2026-08-14T13:01:08.419869Z","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-14T13:01:08.400688Z","title":"Granovetter, American Journal of Sociology 78, 1360 (1973)","venue":null,"work_id":"c661906c-85ef-4c85-98d6-edd5c60f7462","year":1973},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.025872Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:524551923c95d25ff4f36e5ecda7a807488dadcef861dcfe21a9026b2625b40d","observation_id":"0df797bd-9499-451d-a29c-224d899af8cb","resolution":{"observed_at":"2026-08-14T13:01:08.405803Z","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-14T13:01:08.385952Z","title":null,"venue":null,"work_id":"3cd2b4a3-4358-4c60-8f21-4503a0db801d","year":2002},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.030461Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:109d7d635bbd1863c62b903d0446c15df797ac32ffaad9fe590bcfab84d352ce","observation_id":"a339444a-54eb-4dfc-b092-b09739f05394","resolution":{"observed_at":"2026-08-14T13:01:08.390559Z","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-14T13:01:08.371227Z","title":"Alon, An Introduction to Systems Biology: Design Prin- ciples of Biological Circuits (Chapman and Hall/CRC, 2006)","venue":null,"work_id":"81978fab-1d12-42a1-9253-0323e87705f8","year":2006},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.035285Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:937b776c606e76482e90168deb1a2c29b4d86acc59904a2c2ece678cd138a4e4","observation_id":"3fe12881-4071-4b4c-b7cf-ef5598a71bfc","resolution":{"observed_at":"2026-08-14T13:01:08.376053Z","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-14T13:01:08.357601Z","title":"Steinbock, O","venue":null,"work_id":"f2d28256-20cc-4235-b58c-a03cfa0a5482","year":2017},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.040022Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:1d1f9b1a12069d37c329997b37aae19676b8b02a32e79f849ef96a0c61e349fd","observation_id":"b32ce593-7750-43f6-a683-e6ce162fe57f","resolution":{"observed_at":"2026-08-14T13:01:08.362002Z","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-14T13:01:08.343201Z","title":"Ohno, Evolution by Gene Duplication (Springer-Verlag, New York, 1970)","venue":null,"work_id":"d79faafc-f37d-4e11-a453-b7df05b8f013","year":1970},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.044808Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:c203185bd64e9bc87f1e758bb7cccdc8e5cc53ebd4f9d1e107d91c774384aa7b","observation_id":"c0b3046e-aaa3-4c20-ab4e-59ba1630b4a6","resolution":{"observed_at":"2026-08-14T13:01:08.348002Z","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-14T13:01:08.329332Z","title":"Teichmann, M.M","venue":null,"work_id":"396d1722-8552-4061-a9a0-482bcb595013","year":2004},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.049493Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:0a335b3f77aac11e1ecd96cce101a7000af7692f921d89f9ead830e965ae780b","observation_id":"8751ab9b-cb9d-4397-b32d-49420df32599","resolution":{"observed_at":"2026-08-14T13:01:08.333879Z","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-14T13:01:08.315161Z","title":"Redner, Eur","venue":null,"work_id":"14896682-09a9-4718-81b3-0849954e4683","year":1998},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.054126Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:02c601327ec597ddecd2a082ed8d1cac983325178f7db1a0bc3703bb6f9f308a","observation_id":"0e2611d2-f503-43b2-a341-b288f320f7f5","resolution":{"observed_at":"2026-08-14T13:01:08.319692Z","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-14T13:01:08.300458Z","title":"Redner, Physics Today 58, 49 (2005)","venue":null,"work_id":"c2339e15-e374-4dd9-a5ce-cee3216fd67a","year":2005},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.059004Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:d4479e3829d1ba66391805e22dc5fc4eadfdc978920c5327ae56e4e8d3a64c6b","observation_id":"68019518-1214-4ace-9755-169b4ca906ad","resolution":{"observed_at":"2026-08-14T13:01:08.304956Z","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-14T13:01:08.286214Z","title":"Radicchi, S","venue":null,"work_id":"2acb800d-30ca-4fca-9770-9c5db05ca82c","year":2008},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.063897Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:4541d80776f68d0b1d2fc4a945549a54123d27460536806e16bbbebf495e6a36","observation_id":"23361212-572f-42ef-b57d-30f48f323a0b","resolution":{"observed_at":"2026-08-14T13:01:08.290863Z","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-14T13:01:08.271038Z","title":"Golosovsky, S","venue":null,"work_id":"b4194030-ade5-41eb-b83f-0df11e9c3a88","year":2012},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.068850Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:af1237b28eaef32db655388c767ecb5cc9a1fc2401e2977ade8266f3be0fea24","observation_id":"37565d9e-4346-4124-8de0-5c7667afb60d","resolution":{"observed_at":"2026-08-14T13:01:08.275802Z","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-14T13:01:08.255274Z","title":"Golosovsky and S","venue":null,"work_id":"9b6370cb-9911-4e72-ae22-d5f84d252554","year":2017},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.073415Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:46de912d78f09a6d06becdcda583e4cf92c3c3d74b8d96cdb5cd4a336c213ea0","observation_id":"7ba63906-92f0-4e19-b30e-ee353627130a","resolution":{"observed_at":"2026-08-14T13:01:08.260103Z","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-14T13:01:08.240185Z","title":"Golosovsky, Phys","venue":null,"work_id":"8d06ad8b-6220-463b-89c0-1f3039366720","year":2017},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.078284Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:4c8dd2f9b5c1989db4e5570e14dba434d4ac69c2d5c6de89940c8da281c6ce54","observation_id":"b7eee1d5-94f8-4f8c-8de8-f99536ba6a88","resolution":{"observed_at":"2026-08-14T13:01:08.244751Z","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-14T13:01:08.223942Z","title":"Peterson, Steve Press´ e, K.A","venue":null,"work_id":"c4b415fe-1e35-4550-b3f5-91e9df1b77c7","year":2010},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.082848Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:83e7cc856d8c3c8355ccb22f1ebf77d151dc057644dad94a0a66c18c9c15391b","observation_id":"8841f6fd-81ee-48be-8352-aaced8e64606","resolution":{"observed_at":"2026-08-14T13:01:08.229110Z","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-14T13:01:08.208551Z","title":"Steinbock, O","venue":null,"work_id":"1b2abbb1-f0a4-48ac-b915-9cc16f76f62e","year":2019},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.088163Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:5e479025aaccbd128116c0bb8792a3677d07d700c490e097b84c1a1e74e688e9","observation_id":"296d0726-91ab-423a-b1fb-2963b98c058d","resolution":{"observed_at":"2026-08-14T13:01:08.213389Z","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-14T13:01:08.193266Z","title":"Smythe, H","venue":null,"work_id":"ca217bd4-31ee-400b-a6ae-9e5bf9380a04","year":1995},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.093490Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:e24c301f3d2601245fa792b2b2cca12958bf08cb52effc58e7d7813bfe2592c2","observation_id":"63ad34c4-7cc6-46a2-bd92-8bcda8624a9d","resolution":{"observed_at":"2026-08-14T13:01:08.198127Z","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-14T13:01:08.176353Z","title":"Drmota, B","venue":null,"work_id":"f1bf1aa0-b7f5-4b30-94fa-e526baec3515","year":1997},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.098715Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:ae28b33ff9ccc35a58e8b97f3dfbafbb34e501346f5523f331ecbe779aa8ebb2","observation_id":"7e651bba-d9fd-4297-a739-f753af2dba65","resolution":{"observed_at":"2026-08-14T13:01:08.181740Z","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-14T13:01:08.160277Z","title":"Drmota, H.-K","venue":null,"work_id":"66eddcd3-ac8d-428f-91c6-b497e6da1d21","year":2005},"citing_paper":{"arxiv_id":"1908.07376","last_updated":"2019-08-16T22:16:48Z","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-14T13:01:08.103443Z"},"links":{"citing_paper":"/paper/1908.07376"},"observation_digest":"sha256:9f40b847e5a0e11607c75b97880ffe55e9eb9270201d685c9fa3fd204371577e","observation_id":"1d367ae6-c575-4071-8550-7d25dd75724c","resolution":{"observed_at":"2026-08-14T13:01:08.165323Z","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.07376","last_updated":"2019-08-16T22:16:48Z","latest_version":1,"primary_category":"physics.soc-ph","snapshot_observed_at":"2026-08-16T22:20:56.326641Z","submitted_at":"2019-08-16T22:16:48Z","title":"Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication"},"reference_resolution":{"displayed":69,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":64},"total_outbound_references":69},"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 17 August 2026, this Paper Citation Record lists 69 of 69 outbound references and 0 inbound Pith citation observations for arXiv:1908.07376."}