{"as_of":"2026-08-16T14:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e9ee565dd96470207d0964793902648308d111ae95774bfac06e57f752f3aa22","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:26:16.538177Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"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.03659/citation-record","integrity":"/paper/1908.03659/integrity","json":"/paper/1908.03659/citation-record.json","paper":"/paper/1908.03659"},"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-14T14:26:16.892379Z","title":"Acan and B","venue":null,"work_id":"b8a2f3ba-18d6-48b9-b9ef-74cceed3a34a","year":2019},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.432935Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:3113850269662e656c13b1266559a9ddacba2974453c2d54c4f6c8a73e8993c3","observation_id":"cd690531-d7d6-4374-a021-96cff19fe2f1","resolution":{"observed_at":"2026-08-14T14:26:16.897115Z","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-14T14:26:16.881127Z","title":"Ajtai, J","venue":null,"work_id":"8770b9de-27b2-46f9-ba17-b70ab12570a2","year":1985},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.437763Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:35a4fc3c27eecc8a2b3cbcafbbfad24532c95bbe4aa273982f9b6d9f8fdb8263","observation_id":"f50b63f5-a510-4c16-b514-beb56d595e08","resolution":{"observed_at":"2026-08-14T14:26:16.885070Z","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-14T14:26:16.870099Z","title":"Barab´ asi and R","venue":null,"work_id":"f735205e-e02f-4ede-a998-d500fda937e9","year":1999},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.441657Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:347074941977d05a83c011b770a260f883001f1e31cb5c88121b826d72ebc6d6","observation_id":"a1ef7f75-e7b3-4353-a602-0867f80a2230","resolution":{"observed_at":"2026-08-14T14:26:16.874029Z","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-14T14:26:16.857393Z","title":"Bohman and A","venue":null,"work_id":"50f186a1-71f7-4901-8d31-a2e638e20428","year":2009},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.445636Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:e44187fb4c7a58642907e927c86a478f1e25aa518a41371ee36fd2790bde56d7","observation_id":"d36876a4-bcaa-4bf2-9446-3fe282fc75e2","resolution":{"observed_at":"2026-08-14T14:26:16.861360Z","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-14T14:26:16.845852Z","title":"Bollob´ as,Random Graphs, 2nd Edition Cambridge University Press, Cambridge, 2001","venue":null,"work_id":"1c164191-e42c-4816-9a5a-c9f4f6600d61","year":2001},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.449806Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:1b32210142e32df65a959297d1e8da7f900cf31e26c565df02e66d116a98effa","observation_id":"7d613929-632a-44d2-9e93-ae0af5dd4be4","resolution":{"observed_at":"2026-08-14T14:26:16.850161Z","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-14T14:26:16.834760Z","title":"Bollob´ as,Almost all regular graphs are Hamiltonian , European J","venue":null,"work_id":"4c8012bf-1de0-48f2-b31b-c7793d55dfd9","year":1983},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.453568Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:223fb1846382a40b8c7c06cb91ca6b33a738bfac6ad016ece8caab99a7dc70b0","observation_id":"b0c103d1-bcfa-4e7a-bce5-41888d3f6d74","resolution":{"observed_at":"2026-08-14T14:26:16.838515Z","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-14T14:26:16.823100Z","title":"Bollob´ as and A","venue":null,"work_id":"aab13662-707c-40ce-9e29-8675d00b2bf0","year":1985},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.458174Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:6eb32fdc0312c8964ded22d419fb5761713866b5893e807612a6d2a69cdbb98b","observation_id":"b26add00-2f24-4751-82d5-0d181c067ae1","resolution":{"observed_at":"2026-08-14T14:26:16.827397Z","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-14T14:26:16.810646Z","title":"Bollob´ as and A","venue":null,"work_id":"5a7d4881-7c38-4d9d-944d-3d213fffd2b9","year":1985},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.462317Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:c5d06df2ab02b9e4e8173c69bbb11bf35d2944fc83ad087064ec908169b6c241","observation_id":"061b2b49-f13a-4450-8c61-ac706c291495","resolution":{"observed_at":"2026-08-14T14:26:16.814968Z","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-14T14:26:16.798270Z","title":"Bollob´ as, O","venue":null,"work_id":"b98acf89-43e0-48f1-af7f-8fcf18c4ca1c","year":2001},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.466083Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:e76765606f2a0dcc5dba247823c5b37c7189be7a18e058cddb1b72334ccfeef1","observation_id":"be897fad-0e11-4c52-b3bc-0127e4ffbe5a","resolution":{"observed_at":"2026-08-14T14:26:16.802702Z","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-14T14:26:16.785895Z","title":"Bollob´ as and O","venue":null,"work_id":"7761fd08-514f-4e3a-a243-d2c3ab96ecab","year":2004},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.469792Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:48d98df32ca347bdd8a3e998eab1585db45c79141e534ef8214aaa30fc7035ac","observation_id":"2dfbaf1b-48cd-4a0e-bfe2-688d15e9cc49","resolution":{"observed_at":"2026-08-14T14:26:16.790654Z","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-14T14:26:16.772785Z","title":"Cooper and A.M","venue":null,"work_id":"4b879839-4de3-40e0-8e19-3d0862be6338","year":2000},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.473846Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:69393d70f5bb722fdfe9ec4c4f70785dabbe2b41dfce3ccdb540e9e9bff5f133","observation_id":"0f23ad6d-eb0b-4b47-b456-ea5e156282b4","resolution":{"observed_at":"2026-08-14T14:26:16.776734Z","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-14T14:26:16.760949Z","title":"Erd˝ os and A","venue":null,"work_id":"df042066-c5f8-4a65-bfd4-a29b96173427","year":1960},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.477437Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:87a52bd6cea8b787d5a41ea5728b78ec82e0544c8e4bbb4fc9ccd588e732ef90","observation_id":"76a2619b-8006-4f15-b3c9-d8b8204c0d67","resolution":{"observed_at":"2026-08-14T14:26:16.765248Z","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-14T14:26:16.749846Z","title":"Erd˝ os and A","venue":null,"work_id":"74446045-a584-42b5-91a5-3d213b2c8ab3","year":1966},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.481525Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:d6b507816b2519cc91923bb9b7890bcd38ff48cb28f3806ed9b752184951a90f","observation_id":"4efef3d1-51f9-49ae-a8e4-b1063aa49c52","resolution":{"observed_at":"2026-08-14T14:26:16.753483Z","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-14T14:26:16.738375Z","title":"Fenner and A.M","venue":null,"work_id":"bac1c85c-4bd6-4cc4-950d-4f614b415789","year":1983},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.485276Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:59cdddf7de695432127b929e840b7f9aafe2f16c4867a4c1b09c0b4db7a17a6a","observation_id":"2569961c-7827-4c46-a244-744f28ed6a2e","resolution":{"observed_at":"2026-08-14T14:26:16.742551Z","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-14T14:26:16.725489Z","title":"Fenner and A.M","venue":null,"work_id":"44437d05-f5c0-4a73-8e6f-aaab3d8c9251","year":1984},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.488903Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:c4dc8081aae2539717c1465a409ad6b1b5821e84017f2ee095ebebb9bf26819e","observation_id":"67ebb8df-562f-4e5c-b1cc-9f1931395d57","resolution":{"observed_at":"2026-08-14T14:26:16.730001Z","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-14T14:26:16.713154Z","title":"Frieze, Maximum matchings in a class of random graphs , J","venue":null,"work_id":"5b2e812a-9668-4d07-b860-30431ad2ffae","year":1986},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.492584Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:25a291aa3c77b9134e20cb7797b6d491e519490799368cccbc9ede3c9d241d89","observation_id":"dc460c41-2028-4630-90f9-75ebc5a73584","resolution":{"observed_at":"2026-08-14T14:26:16.717102Z","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-14T14:26:16.699354Z","title":null,"venue":null,"work_id":"c73c0f44-8d98-40d6-b278-a8dfa726fe09","year":1988},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.496387Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:63cae1986173f0ea65176b94f02c6a0b38874e8350ac60431fd0a84e9b042566","observation_id":"331f78fa-6e41-4075-bbde-16cc48dc6ba1","resolution":{"observed_at":"2026-08-14T14:26:16.704794Z","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":{"arxiv_id":"1901.07139","last_updated":"2026-07-03T16:28:36Z","snapshot_observed_at":"2026-08-14T17:27:54.750170Z","submitted_at":"2019-01-22T01:33:26Z","title":"Hamilton Cycles in Random Graphs: a bibliography","version":28},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.07139","snapshot_observed_at":"2026-08-14T14:26:16.500309Z","title":"Frieze, Hamilton Cycles in Random Graphs: a bibliography , preprint, arXiv:1901.07139","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.500309Z"},"links":{"cited_paper":"/paper/1901.07139","citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:15d938efa99c4f63d6f28129e98cb1b0603e67ca42fa127419b2fa8cfc5335ca","observation_id":"e700f0e5-7c9e-475c-9f17-4a429ff4104d","resolution":{"observed_at":"2026-08-14T14:26:16.500309Z","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-14T14:26:16.686980Z","title":null,"venue":null,"work_id":"ec2c8440-8e6a-4e27-a7c4-4f803760e451","year":2015},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.504436Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:49569412494b42239886c75c554b7096c4def647b025e479c2bb96dd22ffca2a","observation_id":"3c6415e9-882a-4403-a376-3f3d5efb62b7","resolution":{"observed_at":"2026-08-14T14:26:16.691041Z","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-14T14:26:16.675085Z","title":null,"venue":null,"work_id":"b8fffff6-52d8-4892-a9b7-a97b993426b9","year":1987},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.508080Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:347ce1bddb9ad86bb83b765394c28a2b180e5054a162076d4dc58b3f820dd2b1","observation_id":"dfb8b1e2-bbbe-400e-900e-31db59f9f85e","resolution":{"observed_at":"2026-08-14T14:26:16.678820Z","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-14T14:26:16.662420Z","title":"Frieze, X","venue":null,"work_id":"b728221f-2a64-44f6-9711-dddf6a396176","year":2019},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.512354Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:e765d7ed3c1e80f615770e115092d91fbcfc303d91c13f6f3e8bda9ae407d403","observation_id":"a6831709-6144-470e-8d5c-5e39572ff6b9","resolution":{"observed_at":"2026-08-14T14:26:16.666444Z","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-14T14:26:16.515951Z","title":"Janson, T","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.515951Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:8f0a29d23dca8120291c531204ba204bd3af4e1788ef1ba83a050fcf5c6cf0b4","observation_id":"d17c9a97-dbe8-431f-9f13-ddd865829395","resolution":{"observed_at":"2026-08-14T14:26:16.515951Z","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-14T14:26:16.641981Z","title":"Koml´ os and E","venue":null,"work_id":"1d509cb9-ccf8-457c-a1bb-ae07d744149f","year":1983},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.519668Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:a8c006e694b23ae0f6251c19d6ebb703a1a714769375020eae7a3b8c7d2e1974","observation_id":"4f2f43bb-369c-4c58-984e-afe589f1a941","resolution":{"observed_at":"2026-08-14T14:26:16.646265Z","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-14T14:26:16.629861Z","title":null,"venue":null,"work_id":"3df80c9d-1947-4da0-b250-cb812b344c08","year":1976},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.523244Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:1e9751b1e140e60f7061596a88f2c4abd3bcf6f2d60942d76a200bcfe12e7da8","observation_id":"f40e642b-fb7a-4c47-890b-4d2cbb69e26f","resolution":{"observed_at":"2026-08-14T14:26:16.633858Z","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-14T14:26:16.618010Z","title":"Magner, S","venue":null,"work_id":"3e1785eb-3293-449e-b8fc-648ebe8ea74c","year":2014},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.527150Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:0178b78f735dca77ab95eeaae8bd56b4a63440f903fad2822ca4546759b0b44d","observation_id":"c2623da7-d8c9-49df-a857-f24767f76fa0","resolution":{"observed_at":"2026-08-14T14:26:16.621907Z","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-14T14:26:16.606070Z","title":"P´ osa,Hamiltonian circuits in random graphs , Discrete Math","venue":null,"work_id":"8f87d41d-62b6-461e-999d-0803e91433d4","year":1976},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.530670Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:b5f136146c9fb82512b0b0812b5a3646055da65ba129417700074e7d05bb7bb7","observation_id":"5b90bdc7-e07c-41e8-a04a-d89bfe1bda18","resolution":{"observed_at":"2026-08-14T14:26:16.610366Z","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-14T14:26:16.593718Z","title":null,"venue":null,"work_id":"1c9297fd-ff95-4e8a-a457-dab0356ac60c","year":1994},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.534408Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:96e1cca0b12a54a6acc0bae902f2c71bdd347807003fe1e3f789ec09e8c6306a","observation_id":"fa73d4c1-591f-4618-85b1-8213aaf95d3d","resolution":{"observed_at":"2026-08-14T14:26:16.598061Z","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-14T14:26:16.578824Z","title":"van der Hofstad, Random graphs and complex networks, Vol","venue":null,"work_id":"f599c7fe-161d-4be5-8cd2-326277aa0840","year":2017},"citing_paper":{"arxiv_id":"1908.03659","last_updated":"2019-08-10T01:14:08Z","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:16.538177Z"},"links":{"citing_paper":"/paper/1908.03659"},"observation_digest":"sha256:c9791fa8a0ecca322e4beed5203698c1dd1705612d097fc06fc73c5b9ef88f14","observation_id":"d0570163-5ff0-4e45-b715-f2aa3fdc7b0a","resolution":{"observed_at":"2026-08-14T14:26:16.584847Z","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.03659","last_updated":"2019-08-10T01:14:08Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-16T05:23:03.282720Z","submitted_at":"2019-08-10T01:14:08Z","title":"Perfect matchings and Hamilton cycles in uniform attachment graphs"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":21},"total_outbound_references":28},"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 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:1908.03659."}