{"as_of":"2026-08-08T17:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c06d52f7b2d2a5df77d4a6e37d4b09da74e6408adbc6e53f652d79b09a79301b","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:10:32.055952Z","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-08-07T04:38:53.097684Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1405.6559","last_updated":"2014-06-26T09:41:41Z","snapshot_observed_at":"2026-07-06T03:44:40.773406Z","submitted_at":"2014-05-26T12:59:08Z","title":"Embedding bounded degree spanning trees in random graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1405.6559","snapshot_observed_at":"2026-08-07T15:10:32.055952Z","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-07T14:52:22.706447Z","submitted_at":"2025-05-22T15:54:17Z","title":"Spanning trees of bounded degree in random geometric graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:10:32.055952Z"},"links":{"cited_paper":"/paper/1405.6559","citing_paper":"/paper/2505.16818"},"observation_digest":"sha256:dac95bdce95578b405e949d2ea8d5229e34cc4da4e83263bc65ae8721d8a4a95","observation_id":"d2d3c3f9-0482-4f92-8683-e789165a9cfe","resolution":{"observed_at":"2026-08-07T15:10:32.055952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1405.6559","last_updated":"2014-06-26T09:41:41Z","snapshot_observed_at":"2026-07-06T03:44:40.773406Z","submitted_at":"2014-05-26T12:59:08Z","title":"Embedding bounded degree spanning trees in random graphs","version":2},"cited_work":{"arxiv_id":"1405.6559","doi":null,"metadata_source":"pith","pith_arxiv_id":"1405.6559","snapshot_observed_at":"2026-08-07T04:38:53.097684Z","title":"Embedding bounded degree spanning trees in random graphs","venue":"math.CO","work_id":"56a52b17-6c0a-4f8a-a829-0dec48b4f9d8","year":2014},"citing_paper":{"arxiv_id":"2608.06358","last_updated":"2026-08-06T17:55:25Z","snapshot_observed_at":"2026-08-08T17:20:27.729659Z","submitted_at":"2026-08-06T17:55:25Z","title":"Universality in random graphs via optimal linking systems: trees and beyond","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T04:38:51.828455Z"},"links":{"cited_paper":"/paper/1405.6559","citing_paper":"/paper/2608.06358"},"observation_digest":"sha256:c5cdc2d6328d1dfc0172af2020ba138be7c6a9026d015715f7fd46a084603799","observation_id":"ab4e15f4-d9e8-4205-b457-fee0df872c8f","resolution":{"observed_at":"2026-08-07T04:38:53.163391Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1405.6559/citation-record","integrity":"/paper/1405.6559/integrity","json":"/paper/1405.6559/citation-record.json","paper":"/paper/1405.6559"},"outbound":[],"paper":{"arxiv_id":"1405.6559","last_updated":"2014-06-26T09:41:41Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T03:44:40.773406Z","submitted_at":"2014-05-26T12:59:08Z","title":"Embedding bounded degree 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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1405.6559."}