{"as_of":"2026-08-16T22:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2dc5c51fc9b125e202ff5d26407d27251de7b434cf287eb9aed6671af80f106","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:01:13.639522Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"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.02407/citation-record","integrity":"/paper/1908.02407/integrity","json":"/paper/1908.02407/citation-record.json","paper":"/paper/1908.02407"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.199661Z","title":"Acan and B","venue":null,"work_id":"d5ea42a5-d887-4afc-a119-2331e7ed572c","year":2019},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.473261Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:bc3f64f4a3cf1be7d51d597b2351b85b23d44fac47d8cb3e70475bafe885e82a","observation_id":"509229db-e3ea-4477-93fd-81c269656aad","resolution":{"observed_at":"2026-08-14T15:01:14.205066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.183073Z","title":"Acan and P","venue":null,"work_id":"30a98d0e-0137-4db6-8ac7-1641e5d562f6","year":2016},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.478981Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:4f8063682079fdf900a4867e9957e88bccc820dc56e1cfc21dbac43b87b0b7bf","observation_id":"029de76e-a1c3-471f-a757-d362dd76fec4","resolution":{"observed_at":"2026-08-14T15:01:14.188169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.167461Z","title":"Barab´ asi and R","venue":null,"work_id":"05019714-ed50-41bb-a3e8-96cace6fbe05","year":1999},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.484480Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:a7f0b8b507e707126627939f30dadf673068333141b6e7b5fbe73d7234cbf926","observation_id":"58bba6d8-a29f-4187-8a59-eb90abfc32e7","resolution":{"observed_at":"2026-08-14T15:01:14.172343Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.152641Z","title":"Berger, C","venue":null,"work_id":"598eef13-885d-4d8c-ac83-7bfddcd5d508","year":2014},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.489596Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:6912d27acc178e6bf4a03819afa468eaa26478fe1de0379d512e3e9b1ca47177","observation_id":"333397e9-1967-40e7-ac9f-b5ad38a674ca","resolution":{"observed_at":"2026-08-14T15:01:14.156960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.138206Z","title":"Bollob´ as,Random Graphs, 2nd Edition (2001)","venue":null,"work_id":"b84fb5c4-9a7e-4a3d-9cd5-bb43adfccaa9","year":2001},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.494859Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:a2eb96ded652453cbad589ef39660e5f48a4172161a3027b160fcf593840b456","observation_id":"edd87a33-0e63-4d37-b18b-5f45808750d0","resolution":{"observed_at":"2026-08-14T15:01:14.143132Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.124340Z","title":"Bollob´ as, O","venue":null,"work_id":"ea62e5f3-cee6-438e-946b-10efd2c2633e","year":2001},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.499520Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:c960cbbc1a8381e0d00767f9d303c16314721abdb33f5f230b26dac1f78795ad","observation_id":"728877b8-93bb-46f6-adee-3f0d87d21a71","resolution":{"observed_at":"2026-08-14T15:01:14.128605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.504681Z","title":"Bollob´ as and O","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.504681Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:a972a07b6fdd03f441f7c4ae1e199bb5eb60c9110641fcd8049f9a19880613da","observation_id":"cce7fa6a-857a-4e1f-82f5-d1f1cf3a78be","resolution":{"observed_at":"2026-08-14T15:01:13.504681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.099998Z","title":"Bollob´ as and O","venue":null,"work_id":"a9e390cb-4178-48ab-9376-03c8655a5d3f","year":2000},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.509160Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:59053ef4c51001247d896b376145b5f021af85fabb839dd0659c1bc8fee00d9b","observation_id":"5fecca19-0b1d-47fc-8b5c-b3038e5ad9ca","resolution":{"observed_at":"2026-08-14T15:01:14.104188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.085816Z","title":"Bollob´ as and O","venue":null,"work_id":"59811fa5-3b75-4571-97be-da615cf4bd71","year":2003},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.513559Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:2544941b0f4730d65f7851ea2b7c4be5d2a9e6579d3873ac0eaf11ff7e4f90ae","observation_id":"4168f10d-d255-4391-a8bc-f1d8c947d269","resolution":{"observed_at":"2026-08-14T15:01:14.090432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.071320Z","title":"Bollob´ as and O","venue":null,"work_id":"4d691b56-f903-46c3-9825-f91688a9798a","year":2002},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.517806Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:7de8fac21009d10681f5ad81c60493a6a6c4f8c3f13ca46534814630330f267f","observation_id":"e2bdd122-a71e-48c4-ac31-9dfd8db7e87f","resolution":{"observed_at":"2026-08-14T15:01:14.076097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.057023Z","title":"Bollob´ as, C","venue":null,"work_id":"ccb4475c-efec-420c-b1de-85e5bbbacb34","year":2003},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.522171Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:d9a08861a8ba0adf632ede6f30a93adc21272d6d8c7f24bcaeb58ea805304fd6","observation_id":"b926258f-f7e4-40a6-9cba-cbcf9c41c6cf","resolution":{"observed_at":"2026-08-14T15:01:14.061584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.041738Z","title":"Borgs, M","venue":null,"work_id":"c2a9e2b5-dd8d-4ed0-b87f-85cc2911d56e","year":2012},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.527878Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:f7548b221b930de5dfeb92f7dc69706238a87a2517efcb51d1d73f9c433a1d7c","observation_id":"cfd9fdc1-fa8c-44b2-a951-bb694415cfc0","resolution":{"observed_at":"2026-08-14T15:01:14.046511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.025826Z","title":"Comtet, Advanced Combinatorics, Dordrecht-Holland (1974)","venue":null,"work_id":"f49dd219-f85c-4b13-b9be-011e80bd005c","year":1974},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.532988Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:e3ae4cf5c67f962c281a36c9caff6610d0c6b8d6a11c87a96e2fccb0e7f194c0","observation_id":"e98f2984-4999-4fae-9fd0-98ce8b6d6717","resolution":{"observed_at":"2026-08-14T15:01:14.031194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:14.010032Z","title":"Cooper and A.M","venue":null,"work_id":"0c53abee-3aa0-4d9c-a33f-3bd90b700b9f","year":2003},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.538072Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:d14cdb4343913094363b5c0f5f1ca9a96358dc2cf1e6322df1e32ee8ca63070d","observation_id":"2d7868d4-4fb5-4380-ac96-47f1906c801d","resolution":{"observed_at":"2026-08-14T15:01:14.015183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.994269Z","title":"Cooper and A.M","venue":null,"work_id":"263f8d19-85e6-4bc3-90dd-5869fe1c43a9","year":2007},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.542963Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:73f569a3b3195735176b700492591796549619f55af248619d905073aa163435","observation_id":"7f4f9120-51e1-422f-b928-c786dfe40943","resolution":{"observed_at":"2026-08-14T15:01:13.998885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.979306Z","title":"Cooper, R","venue":null,"work_id":"2b7098e0-2d53-4259-90d0-5da5ede9eddf","year":2005},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.547825Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:9e91b67acce90b65fbd1a6f3bcbefb10ba009dc5318c22fa8265a50b31d33f45","observation_id":"b451ddac-ec45-4bbd-b291-58453fbab405","resolution":{"observed_at":"2026-08-14T15:01:13.983886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.965763Z","title":"Erd˝ os and A","venue":null,"work_id":"757600a4-3294-46fa-8513-0a5efd3a4881","year":1959},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.552812Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:c0c7377756e273f9a2d65ab0b6ccc794e78d3757963ab07fa5966fca4166ee4c","observation_id":"cd91f2e4-35aa-4f18-8e79-e8f181470e1d","resolution":{"observed_at":"2026-08-14T15:01:13.969866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.949754Z","title":"Flaxman, A.M","venue":null,"work_id":"9c390f06-c0dd-4a1b-9b82-f555a506123f","year":2005},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.558129Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:9cbc90c2ddcca119b1f78ab46141b2debb2fd4f0c0799f6152635d87b08787f5","observation_id":"db190c4d-5427-4925-8381-060b134b8681","resolution":{"observed_at":"2026-08-14T15:01:13.955449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.932415Z","title":"Frieze, X","venue":null,"work_id":"6c55f500-3f09-40f2-8f75-2f9dcb9269f9","year":2019},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.562771Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:a966e7ef60e6c9ac6d5cd82a331134cfb51f0f9011d8c54c23ac39dd286234f7","observation_id":"96114c3c-cead-440d-af0f-1f45864b3471","resolution":{"observed_at":"2026-08-14T15:01:13.937388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.916968Z","title":"Frieze and M","venue":null,"work_id":"7ac3a537-9504-4d0a-b2ed-973c467cb73c","year":2016},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.566731Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:e6690cfe9f357138221164f133003ddb26b4fcff8b24706a57d3978a89872ee4","observation_id":"9e2a68dc-5105-41ee-b6a1-1fd5aba627ec","resolution":{"observed_at":"2026-08-14T15:01:13.921763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.901503Z","title":"Frieze and W","venue":null,"work_id":"4155e9a6-e8c2-411f-b134-310da642a73d","year":2017},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.571114Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:fbd071d92ce49984575007129ef734a7d6caa43e5b3cd2a7900b00c13afe2974","observation_id":"7d7e73b2-5d76-431f-93be-adc66468ef03","resolution":{"observed_at":"2026-08-14T15:01:13.906335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.887483Z","title":"Gilbert, Random graphs, Annals of Mathematical Statistics 30 (1959) 1141-1144","venue":null,"work_id":"1d9ff684-dba0-458e-8b87-29700e904a32","year":1959},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.575784Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:595d241fde75ceea589a3dd02d9bc57c67f8ece275f73b40ab9e94916114c48b","observation_id":"ca98dc20-85ab-4158-927d-4d4785d23a07","resolution":{"observed_at":"2026-08-14T15:01:13.891967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.873164Z","title":"Mihail, C","venue":null,"work_id":"49266394-0630-4c77-af99-8891f890483c","year":2006},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.580349Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:5d2c3496a551ebf06433b1f8952a0d6ecfd4df3b29e078361c885452c603cf72","observation_id":"f68225ea-cf89-489a-a891-05ff554ec5f7","resolution":{"observed_at":"2026-08-14T15:01:13.877421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.584678Z","title":"Janson, T","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.584678Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:08ed59777dc9603e01ebc2c8b1975c47f184804eea47336bd50f802c16a5bca3","observation_id":"e1c71a5e-73f1-497e-80f3-3ca88c2ec4b7","resolution":{"observed_at":"2026-08-14T15:01:13.584678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.846339Z","title":"Janson, Random recursive trees and preferential attachment trees a re random split trees , Combinatorics, Probability and Computing 28 (2019) 81–99","venue":null,"work_id":"99587631-02df-47fb-9894-8ae430ce8342","year":2019},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.589386Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:f4ba4daaf0be3f37ee780cf99181ed2d4e9d2a64c3ac3bdba3f70e9d4d5dae9c","observation_id":"7e47aa36-48b3-4c7f-ade2-e2515137409d","resolution":{"observed_at":"2026-08-14T15:01:13.851428Z","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":"1904.11861","last_updated":"2019-04-26T14:17:54Z","snapshot_observed_at":"2026-08-14T16:40:55.993509Z","submitted_at":"2019-04-26T14:17:54Z","title":"Preferential attachment without vertex growth: emergence of the giant component","version":1},"cited_work":{"arxiv_id":"1904.11861","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.11861","snapshot_observed_at":"2026-08-14T15:01:13.700833Z","title":"Preferential attachment without vertex growth: emergence of the giant component","venue":"math.PR","work_id":"b84270f8-a044-4220-a1bc-e70f255210f6","year":2019},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.594425Z"},"links":{"cited_paper":"/paper/1904.11861","citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:de202c58316d13a9b7bdd56c268d7539494434b0657dee648eed49ea87810512","observation_id":"a831f9e1-0aea-4f5b-9c37-1a2f1b41822d","resolution":{"observed_at":"2026-08-14T15:01:13.706108Z","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-14T15:01:13.830580Z","title":"Katona and T","venue":null,"work_id":"331e096d-c446-4cdf-87a8-cc42710833df","year":2006},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.599583Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:6a64595ab3a44c8ccf5c39b25893f9ae3bdc3958f275af220657f719634c11e6","observation_id":"aeedb15b-9c18-424a-ac85-dd0dd6e2534c","resolution":{"observed_at":"2026-08-14T15:01:13.835211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.814932Z","title":"van der Hofstad, Random Graphs and Complex Networks, V1 , Cambridge University Press (2017)","venue":null,"work_id":"44c7d6cb-8bbc-4514-9bd1-114f58dcc982","year":2017},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.605103Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:9b05605591ba5ae023397c51a82c9c45ee5bc423e91cffe85679bb8603a9dde4","observation_id":"d3b8957f-e0b6-4df8-beb4-5d4b443ccfb7","resolution":{"observed_at":"2026-08-14T15:01:13.820011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.800578Z","title":"M´ ori,On random trees , Studia Sci","venue":null,"work_id":"6fb645da-73b1-4407-9c1b-70af21645898","year":2003},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.609862Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:7176f5e651aa84249cdefd9546082ef1c717577ce07d3dc1d4bcf8de46611397","observation_id":"705bc011-9e3d-4139-84f2-b0ac2bf404ba","resolution":{"observed_at":"2026-08-14T15:01:13.805199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.784790Z","title":"M´ ori,The maximum degree of the Barab´ asi–Albert random tree , Combin","venue":null,"work_id":"4a05f2f5-fd7d-4aac-979f-b5fe55e92747","year":2005},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.615603Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:1ea3baf053078760d360f42be7712c39092a43e7969e9fb5ff94edbaa54ab2c6","observation_id":"f7d1a21f-809f-4513-9307-c73160c8bc62","resolution":{"observed_at":"2026-08-14T15:01:13.789756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.767195Z","title":"Pek¨ oz, A","venue":null,"work_id":"4a00ce09-5554-435e-b487-1dc2d2d37edb","year":2017},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.620690Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:4b44199e730ee99ee2c876e4afe676b74a44656436c75e55b4c17124d1cb7618","observation_id":"5468a499-ad03-4ca6-92c5-897cd88950ef","resolution":{"observed_at":"2026-08-14T15:01:13.772782Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.750533Z","title":"Pittel, On the probable behavior of some algorithms for finding the st ability number of a graph , Math","venue":null,"work_id":"60874e6a-e09a-47d0-ae66-bc2402ba8cd6","year":1982},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.625320Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:775b444bce3a66bd11ebb375d775f0cad1a08c637aa3d1872e78463778169f4c","observation_id":"9a3840c1-6159-4448-9905-5f4a0a153d06","resolution":{"observed_at":"2026-08-14T15:01:13.755510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.733697Z","title":"Pittel, Note on the heights of random recursive trees and random m-ar y search trees, Random Structures Algorithms 5 (1994), 337–347","venue":null,"work_id":"b2697d99-f0e7-4b11-b820-534ddd56d2ef","year":1994},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.630443Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:75da0de4555d66b723880e5bd0e7907c34b0c0ed7da7c700bac5be0be4795625","observation_id":"d050ced4-6fdf-45ce-a62f-a037b79f3397","resolution":{"observed_at":"2026-08-14T15:01:13.738907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:01:13.717860Z","title":"Pittel, On a random graph evolving by degrees , Adv","venue":null,"work_id":"fd08651a-adef-44d4-962d-e7da769842ea","year":2010},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.634739Z"},"links":{"citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:3143a44ce8052c76e44e7089bb4cae60ef8a1a1f7e924eb2ce97387adba9aa20","observation_id":"ad62e512-d0b0-4e55-933d-cbaa026a8e3a","resolution":{"observed_at":"2026-08-14T15:01:13.722807Z","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":"1811.10764","last_updated":"2019-03-13T23:21:17Z","snapshot_observed_at":"2026-08-14T17:52:56.399630Z","submitted_at":"2018-11-27T01:16:13Z","title":"On Bollob\\'as-Riordan random pairing model of preferential attachment graph","version":3},"cited_work":{"arxiv_id":"1811.10764","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.10764","snapshot_observed_at":"2026-08-14T15:01:13.676630Z","title":"On Bollob\\'as-Riordan random pairing model of preferential attachment graph","venue":"math.CO","work_id":"c53a40c5-a5db-40aa-b08e-80484ee275da","year":2018},"citing_paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T15:01:13.639522Z"},"links":{"cited_paper":"/paper/1811.10764","citing_paper":"/paper/1908.02407"},"observation_digest":"sha256:ae46ec84270485dcdb6b6700bb0e597f297ad14cbc15fa8e8e12ea228a6fad44","observation_id":"93d42973-adf8-492c-a28f-b0caa6d397b6","resolution":{"observed_at":"2026-08-14T15:01:13.683379Z","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"}}],"paper":{"arxiv_id":"1908.02407","last_updated":"2020-11-12T17:11:49Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T09:00:41.235131Z","submitted_at":"2019-08-07T00:24:15Z","title":"Giant descendant trees, matchings and independent sets in the age-biased attachment graphs"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":2,"verified_fuzzy":31},"total_outbound_references":35},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:1908.02407."}