{"as_of":"2026-08-10T13:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:18d8ec2b90ec43984e0816d380b528f7813407eaa699abd9ef8a1bd9b1b29e70","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-10T06:31:04.303077+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-06-27T04:12:16.298588Z","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-03T17:28:44.221117Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1409.5308","last_updated":"2014-12-01T22:13:05Z","snapshot_observed_at":"2026-07-06T03:54:52.212376Z","submitted_at":"2014-09-18T14:15:45Z","title":"Solving the Maximum-Weight Connected Subgraph Problem to Optimality","version":2},"cited_work":{"arxiv_id":"1409.5308","doi":null,"metadata_source":"pith","pith_arxiv_id":"1409.5308","snapshot_observed_at":"2026-07-03T17:28:44.221117Z","title":"Solving the Maximum-Weight Connected Subgraph Problem to Optimality","venue":"cs.DS","work_id":"771011a9-5492-46e0-a411-6bab29bf6ad9","year":2014},"citing_paper":{"arxiv_id":"2606.15632","last_updated":"2026-06-17T08:07:31Z","snapshot_observed_at":"2026-08-03T20:25:59.741401Z","submitted_at":"2026-06-14T06:48:15Z","title":"Open-World Video Segmentation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T04:12:16.298588Z"},"links":{"cited_paper":"/paper/1409.5308","citing_paper":"/paper/2606.15632"},"observation_digest":"sha256:14aa341c74e81415cfeb6ac27519adbe3051f39b5f4394bdba1719cd5352c129","observation_id":"3576ad35-2f24-4143-bc89-d530efe120c0","resolution":{"observed_at":"2026-07-03T17:28:44.222278Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1409.5308/citation-record","integrity":"/paper/1409.5308/integrity","json":"/paper/1409.5308/citation-record.json","paper":"/paper/1409.5308"},"outbound":[],"paper":{"arxiv_id":"1409.5308","last_updated":"2014-12-01T22:13:05Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T03:54:52.212376Z","submitted_at":"2014-09-18T14:15:45Z","title":"Solving the Maximum-Weight Connected Subgraph Problem to Optimality"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1409.5308."}