{"as_of":"2026-08-04T14:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f96572b38d1edae094c327b8f08a103a75f565f57124baf4819380b49086a77d","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T09:14:07.252387Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2304.03985/citation-record","integrity":"/paper/2304.03985/integrity","json":"/paper/2304.03985/citation-record.json","paper":"/paper/2304.03985"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0890-5401(89)90001-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T11:12:01.171557Z","title":"Learning decision trees from random examples","venue":null,"work_id":"41534f7e-b7ba-42f6-adec-fd628e7f4fc2","year":1989},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:94260cd1281ba22fa995397736d4e17e0d41fdb2bedc82baae13ebb5818cf1f0","observation_id":"c51ed215-4f31-484c-a406-67ef53339502","resolution":{"observed_at":"2026-05-24T09:14:15.852901Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"mjms/1404997","doi":"10.35834/mjms/1404997104","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Polynomials, Binary Trees, and Positive Braids","venue":null,"work_id":"6ca49651-d81b-42ae-b059-e9c2d5f7c534","year":2014},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:de26022e4dde1c0fc012bcd71616382f7b1e8aaf99d05ef2300fed078b40b239","observation_id":"b7cc3cd9-5db0-4e1e-a226-31827a5fe44f","resolution":{"observed_at":"2026-05-24T09:14:15.846493Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0020-0190(82)90083-7","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A note on some tree similarity measures","venue":null,"work_id":"2454c94e-f63a-4ffd-8ee1-772212aab0be","year":1982},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:f360c7857502e85b17d89fd22dfd8ac14fe74203248a8acb31ecc30bf5bd8c43","observation_id":"48992695-024e-479e-ac8e-02367d9f496d","resolution":{"observed_at":"2026-05-24T09:14:15.869419Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the rotation distance between binary trees","venue":null,"work_id":"b4873c52-d921-45ca-8e13-0469a1a368af","year":2010},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:2be24d9740dc977b686056127f33c26d3bd107aa61a9687d81c149ee1a8c3f99","observation_id":"b05c6b6b-fcd5-4334-958c-f952a58e0aad","resolution":{"observed_at":"2026-05-24T09:14:16.824598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.aim.2009.09.016","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3790e702-7f90-494a-bf32-29d1cb9d3e36","year":2009},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:0954ae20f4bbd909fd1aa0fb26b53b2dcf7f047bc64f4526bcdb105dd1671146","observation_id":"f1f7903c-ec43-4ae9-9d03-f575b62831bf","resolution":{"observed_at":"2026-05-24T09:14:15.832682Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2130.12143","doi":"10.1145/12130.12143","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Rotation Distance, Triangulations, and Hyperbolic Geometry","venue":null,"work_id":"ebd55fd6-87bb-4fa1-bbe6-2f95aa42bdea","year":1986},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:097fb86341de933d1d836b7d16f3ec447fee1dc87656af472b9bf46db46f59b5","observation_id":"3217c499-a7fb-4876-8415-8bfeef810c7c","resolution":{"observed_at":"2026-05-24T09:14:15.826104Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The diameter of associahedra","venue":null,"work_id":"197374f3-0d4e-4f15-a0d5-fb4adb5eb006","year":2014},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:15935e2b4d4850e9bbe944e25e8cb52a1b4e988330c9195704182d1a88deadce","observation_id":"0d6a24c6-31f2-4766-84dc-0e9be1a74859","resolution":{"observed_at":"2026-05-24T09:14:16.821678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7155/jgaa.00212","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Linear-Time Approximation Algorithm for Rotation Distance","venue":null,"work_id":"b0500b1d-f120-4645-932b-c92736f98dec","year":2010},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:fe84c44ea794b6d552894f2fb898d38397dce8547650679a4c59e810bcf88cec","observation_id":"b2f6a026-d093-4102-ae29-5652a1a0aa67","resolution":{"observed_at":"2026-05-24T09:14:15.861422Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Untangling Binary Trees via Rotations","venue":null,"work_id":"a0d6f322-cb11-4208-99b7-4f2c7598eed5","year":2004},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:391b2a578d081ce71becef1d3581980d8205f767f542387ba9adf7016eb21065","observation_id":"49444802-7204-4171-951f-10b7121c6c6d","resolution":{"observed_at":"2026-05-24T09:14:16.828091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0196-6774(87)90048-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The Rotation Graph of Binary Trees Is Hamiltonian","venue":null,"work_id":"02516782-d4bf-4be2-8714-3e1e5468e8b1","year":1987},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:4de0857c52fa873d4f29f38cf5f61c030f40ae107f169e51c5cd690e16299902","observation_id":"a0427fa3-857a-4eab-b7da-10930e0b8b06","resolution":{"observed_at":"2026-05-24T09:14:15.865337Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-07-12T03:49:54.056715+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T03:49:54.056715+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs","venue":null,"work_id":"d9d05dc4-1464-420c-ab8d-56554b242027","year":2013},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:3cf0dd9ed42873f038eb59382c65eedd550f1bbb3c08b300c17930ecdf7f4b34","observation_id":"c0d3b902-b927-4469-be9b-0a337830f2aa","resolution":{"observed_at":"2026-05-24T09:14:16.818839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T14:16:16.764150Z","title":"In: Proc","venue":null,"work_id":"452f975d-5e1f-47e0-967f-db1ed9da0d80","year":2025},"citing_paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T09:14:07.252387Z"},"links":{"citing_paper":"/paper/2304.03985"},"observation_digest":"sha256:4b06fef55877794cc426af6ec4e3ab44360ddd05ff900e4ea7137911f0ddfef8","observation_id":"72521493-2ba2-408e-974c-4c2aacc4a7d9","resolution":{"observed_at":"2026-05-24T09:14:15.857430Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2304.03985","last_updated":"2024-05-10T18:18:05Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-03T06:48:11.699929Z","submitted_at":"2023-04-08T11:02:35Z","title":"On Rotation Distance of Rank Bounded Trees"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":7,"verified_fuzzy":4},"total_outbound_references":12},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2304.03985."}