{"as_of":"2026-08-20T09:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:848a6dae83e435d4b3d2d8f799b1067d7e8331c02d184e77c231a377638de7a1","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:10:32.088357Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-03T10:17:57.199913Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1405.6560","last_updated":"2014-05-26T13:02:03Z","snapshot_observed_at":"2026-08-14T23:32:44.007483Z","submitted_at":"2014-05-26T13:02:03Z","title":"Sharp threshold for embedding combs and other spanning trees in random graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.6560","snapshot_observed_at":"2026-08-07T15:10:32.088357Z","title":"Montgomery","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.16818","last_updated":"2025-05-22T15:54:17Z","snapshot_observed_at":"2026-08-15T06:53:11.144198Z","submitted_at":"2025-05-22T15:54:17Z","title":"Spanning trees of bounded degree in random geometric graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:32.088357Z"},"links":{"cited_paper":"/paper/1405.6560","citing_paper":"/paper/2505.16818"},"observation_digest":"sha256:760196f843f1afc6ca771196cd085e337128bbf8bbe06b5247bc546dd8498663","observation_id":"837b5763-eab4-4766-9580-145d843ee6a4","resolution":{"observed_at":"2026-08-07T15:10:32.088357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1405.6560","last_updated":"2014-05-26T13:02:03Z","snapshot_observed_at":"2026-08-14T23:32:44.007483Z","submitted_at":"2014-05-26T13:02:03Z","title":"Sharp threshold for embedding combs and other spanning trees in random graphs","version":1},"cited_work":{"arxiv_id":"1405.6560","doi":null,"metadata_source":"pith","pith_arxiv_id":"1405.6560","snapshot_observed_at":"2026-07-03T10:17:57.199913Z","title":"Sharp threshold for embedding combs and other spanning trees in random graphs","venue":"math.CO","work_id":"d1e90db1-525c-486d-b36f-33196fe99509","year":2014},"citing_paper":{"arxiv_id":"2607.02483","last_updated":"2026-07-24T10:40:05Z","snapshot_observed_at":"2026-08-13T22:34:22.963292Z","submitted_at":"2026-07-02T17:50:56Z","title":"Robustness and hyperstability for the Erd\\H{o}s-Gallai theorem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-03T10:14:38.453520Z"},"links":{"cited_paper":"/paper/1405.6560","citing_paper":"/paper/2607.02483"},"observation_digest":"sha256:276f1d800a5c2c16e14c332010d3c6c235b97ec3da10568bb344434186c874ef","observation_id":"2a75bc94-ed19-44ea-a708-ea2e8bed3f65","resolution":{"observed_at":"2026-07-03T10:17:57.201132Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1405.6560","last_updated":"2014-05-26T13:02:03Z","snapshot_observed_at":"2026-08-14T23:32:44.007483Z","submitted_at":"2014-05-26T13:02:03Z","title":"Sharp threshold for embedding combs and other spanning trees in random graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.6560","snapshot_observed_at":"2026-08-02T09:06:20.751360Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.02483","last_updated":"2026-07-24T10:40:05Z","snapshot_observed_at":"2026-08-13T22:34:22.963292Z","submitted_at":"2026-07-02T17:50:56Z","title":"Robustness and hyperstability for the Erd\\H{o}s-Gallai theorem","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-02T09:06:20.751360Z"},"links":{"cited_paper":"/paper/1405.6560","citing_paper":"/paper/2607.02483"},"observation_digest":"sha256:f54bb12f5dba9e22f301698566c9889fd8232dd3446a5abf6ce7ef92a3788e5c","observation_id":"7710b070-6cf5-4866-9ba9-884c4088c56d","resolution":{"observed_at":"2026-08-02T09:06:20.751360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1405.6560/citation-record","integrity":"/paper/1405.6560/integrity","json":"/paper/1405.6560/citation-record.json","paper":"/paper/1405.6560"},"outbound":[],"paper":{"arxiv_id":"1405.6560","last_updated":"2014-05-26T13:02:03Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-14T23:32:44.007483Z","submitted_at":"2014-05-26T13:02:03Z","title":"Sharp threshold for embedding combs and other spanning trees in random graphs"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1405.6560."}