{"as_of":"2026-08-13T11:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:33e57d05962b85f573e87523fb1bcb34808482ba526578d1ca65cea3e1ce40fe","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-17T21:23:29.660036Z","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-05-17T21:25:16.905009Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1709.07849","last_updated":"2017-09-22T17:05:22Z","snapshot_observed_at":"2026-07-06T06:00:57.001365Z","submitted_at":"2017-09-22T17:05:22Z","title":"Pemantle's min-plus binary tree","version":1},"cited_work":{"arxiv_id":"1709.07849","doi":null,"metadata_source":"pith","pith_arxiv_id":"1709.07849","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pemantle's min-plus binary tree","venue":"math.PR","work_id":"027b87bc-406f-4f17-b0f1-336c157b2834","year":2017},"citing_paper":{"arxiv_id":"2511.16880","last_updated":"2026-04-10T15:33:45Z","snapshot_observed_at":"2026-08-13T08:55:50.053987Z","submitted_at":"2025-11-21T01:11:39Z","title":"Hipster random walks, random series-parallel graph and random homogeneous systems","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-17T21:23:29.660036Z"},"links":{"cited_paper":"/paper/1709.07849","citing_paper":"/paper/2511.16880"},"observation_digest":"sha256:5a31048ab6ff4572dff5962880d3732fa582f9cd010d3641b2a8ace7a1f64b10","observation_id":"2ca26a23-e04b-40a1-a257-0c2d8af110a5","resolution":{"observed_at":"2026-05-17T21:25:16.907433Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1709.07849/citation-record","integrity":"/paper/1709.07849/integrity","json":"/paper/1709.07849/citation-record.json","paper":"/paper/1709.07849"},"outbound":[],"paper":{"arxiv_id":"1709.07849","last_updated":"2017-09-22T17:05:22Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-07-06T06:00:57.001365Z","submitted_at":"2017-09-22T17:05:22Z","title":"Pemantle's min-plus binary tree"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1709.07849."}