{"as_of":"2026-08-23T23:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9a4b20b60ca21706bdd0e5737b0b47e94e32fba18a109eb724b6d270fab7040b","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-23T06:30:58.430688+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-08-02T08:50:21.245129Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2407.03666","last_updated":"2025-08-08T13:23:37Z","snapshot_observed_at":"2026-08-17T19:18:10.598074Z","submitted_at":"2024-07-04T06:17:23Z","title":"Greedy BST on Permutation Initial Tree","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.03666","snapshot_observed_at":"2026-08-02T08:50:21.245129Z","title":"InProceed- ings of the 2018 Conference on Empirical Methods in Natural Language Processing, pages 4231–4242, Brussels, Belgium","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.19398","last_updated":"2026-07-04T07:07:15Z","snapshot_observed_at":"2026-08-18T14:01:53.035994Z","submitted_at":"2026-07-04T07:07:15Z","title":"HyGRL: Adaptive Hybrid Graph Reasoning for Multi-Entity Questions","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-02T08:50:21.245129Z"},"links":{"cited_paper":"/paper/2407.03666","citing_paper":"/paper/2607.19398"},"observation_digest":"sha256:e2ac4636520dd948148531c63b27b4128743ff45cf60d72917e18f7ed793317a","observation_id":"c4ee8d79-1ba5-4171-9777-acc866f901e3","resolution":{"observed_at":"2026-08-02T08:50:21.245129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2407.03666/citation-record","integrity":"/paper/2407.03666/integrity","json":"/paper/2407.03666/citation-record.json","paper":"/paper/2407.03666"},"outbound":[],"paper":{"arxiv_id":"2407.03666","last_updated":"2025-08-08T13:23:37Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T19:18:10.598074Z","submitted_at":"2024-07-04T06:17:23Z","title":"Greedy BST on Permutation Initial 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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2407.03666."}