{"as_of":"2026-08-13T06:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:78504e244e614fc4ac4c438ec8380e6325f79f2ac8a8c0a1dc88ba01aca8228e","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T22:34:50.707726Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2502.09161/citation-record","integrity":"/paper/2502.09161/integrity","json":"/paper/2502.09161/citation-record.json","paper":"/paper/2502.09161"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.206364Z","title":"Carlitz and R","venue":null,"work_id":"a95a1254-564a-4bea-9a15-69253dbece94","year":1974},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.553404Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:7ae96b6df952c4cd2b6d6adbb354545c6158ff6001a10b4c4f1996b0fefcb4a1","observation_id":"51a8253d-0746-4e19-86cf-43d4316c4a16","resolution":{"observed_at":"2026-08-07T22:34:51.212335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.188115Z","title":"Chen, A general bijective algorithm for trees, Pr oc","venue":null,"work_id":"b17a2e1f-e867-457a-b43f-4cbbbd9d6d68","year":1990},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.558743Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:41f24710a1bdd0ad13972420ab006317e062a9129f4366bb32d6bd8c2fa04a25","observation_id":"873ead96-3f91-4f26-94e6-cb6bb45e3f20","resolution":{"observed_at":"2026-08-07T22:34:51.194125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.166470Z","title":"Chen, Context-free grammars, differential opera tors and formal power series, Theoret","venue":null,"work_id":"b95970f4-8bf6-4453-9db8-acf546e5fc29","year":1993},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.568896Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:858252a0e065f08593da297c1fdee73f4898a73cc96edf78004bfa00403c6160","observation_id":"fa3231be-336d-4e37-a860-d350b2d45da3","resolution":{"observed_at":"2026-08-07T22:34:51.172875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.144970Z","title":null,"venue":null,"work_id":"2edb0e2f-474a-465b-b226-2d09ab1fac1a","year":2006},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.574701Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:ab573a735eb11f4f75e428d1c71f47d9478b72f74bb8ebe22c2080b93ae0962a","observation_id":"1f0dd8bd-43bd-4ea4-977f-56c51f182245","resolution":{"observed_at":"2026-08-07T22:34:51.150489Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.129259Z","title":"Chen and A.M","venue":null,"work_id":"94a78be2-389c-42e0-af70-3e773ca990a2","year":2017},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.582510Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:22742fe702d981ef59a80a775dadefb81924addf5f0b770a761a86bb205f4dff","observation_id":"0bcbc2a3-662a-423a-b3aa-5b9f8b8ecc57","resolution":{"observed_at":"2026-08-07T22:34:51.134332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.113343Z","title":"Chen and S","venue":null,"work_id":"0c52c8eb-ee2e-4ee4-8554-80e3b878d552","year":2022},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.589410Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:0c45ae5487046b3655839578bfc4c0d11f458dcbe068b566d9c6074f670f5127","observation_id":"53b29654-47f3-4042-9570-418165493c58","resolution":{"observed_at":"2026-08-07T22:34:51.118358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.096637Z","title":"Chen and H","venue":null,"work_id":"2f59e3bc-13e9-450c-9bc0-47af3bf2a0ba","year":2017},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.601596Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:a8aca376e2fe9e53558e4325dcae27b0d06e2c923b9f9fcf451b89b7a2dc31c0","observation_id":"2dca03a2-54ea-495c-b9d2-e176e82bf056","resolution":{"observed_at":"2026-08-07T22:34:51.101611Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12076","last_updated":"2025-07-27T04:48:32Z","snapshot_observed_at":"2026-08-12T23:20:52.307416Z","submitted_at":"2024-07-16T17:48:53Z","title":"Colored Multiset Eulerian Polynomials","version":2},"cited_work":{"arxiv_id":"2407.12076","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.12076","snapshot_observed_at":"2026-08-07T22:34:50.773645Z","title":"Colored Multiset Eulerian Polynomials","venue":"math.CO","work_id":"c7c27e26-868a-4af8-9652-f4ed036cdadf","year":2024},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.606815Z"},"links":{"cited_paper":"/paper/2407.12076","citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:04059d4d5813499cd30ceea4241cf13852f796b3bff6760b08b787a5f3bf889e","observation_id":"e5b220cb-ac83-4a64-b788-57eb5265e6b8","resolution":{"observed_at":"2026-08-07T22:34:50.779764Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.079166Z","title":"Deutsch, A bijection on ordered trees and its conseque nces, J","venue":null,"work_id":"1312707c-c252-4329-9167-e8d3c307352d","year":2000},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.613324Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:5998853c70c4fee01b3001e591a6cfeee6a923d894dd292acbb6ded0c3984968","observation_id":"17896715-e337-4ea6-a8a8-605412ba5ada","resolution":{"observed_at":"2026-08-07T22:34:51.085283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.058430Z","title":"Donaghey, Restricted plane tree representations of four Motzkin-Catalan equations, J","venue":null,"work_id":"893eef7d-5e2a-4791-9d5c-c50ac61b3c6c","year":1977},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.618760Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:d615c7c97afd4a0af654adbc8bc4a275f95c46da9e2bfd2d64b627b8019b6f65","observation_id":"0a16954f-e8a8-4069-8a79-584096bc91dd","resolution":{"observed_at":"2026-08-07T22:34:51.065249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.037248Z","title":"Dong, L.R","venue":null,"work_id":"98dbcd7d-18d5-4ba9-927e-0dbd53e57e66","year":2025},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.625010Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:50e162ada19382ba1db46143dcc8b284e018f3b0264148922cb07ade20cd5cae","observation_id":"fb91cb4d-96f8-4b77-9d37-c4ecfa9471cd","resolution":{"observed_at":"2026-08-07T22:34:51.043740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:51.017743Z","title":"Elizalde and M","venue":null,"work_id":"da57ea5d-df82-4efa-9eed-8c1344993cf1","year":2003},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.630465Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:0de37cf58824d4fcf666435c086077e6502c910f4b69e8b3961d4aad4c88d5dd","observation_id":"e72aadd7-c114-408c-ae09-e42566f095b6","resolution":{"observed_at":"2026-08-07T22:34:51.023708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.997882Z","title":"Fu, A context-free grammar for peaks and double des cents of permutations, Adv","venue":null,"work_id":"29ba0700-e586-48e3-8841-156f43e780b9","year":2018},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.637497Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:0cd1138b0119282d127d7beaa98863ef2bbbe2f657d060ba0300fe2a8b8e512b","observation_id":"12caefa4-70ac-4bde-b431-a11555b4da0a","resolution":{"observed_at":"2026-08-07T22:34:51.004177Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.976705Z","title":"Kitaev, Patterns in Permutations and Words , Springer Science & Business Media, 2011","venue":null,"work_id":"2bb9ca15-487b-415d-b34c-eb4dc60d00ff","year":2011},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.643732Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:436d6af404c41e56f5658c091b9b76386305e33517a166d93ca98322414e8ded","observation_id":"b7f6ecec-0462-46ae-9e28-937cefa57871","resolution":{"observed_at":"2026-08-07T22:34:50.984428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.959408Z","title":"Kitaev, Partially ordered generalized patterns, Di screte Math., 298(2005), 212–229","venue":null,"work_id":"0a48a627-f1cb-46d4-9c46-211462a68052","year":2005},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.649186Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:14a46c1b0b8f630b4c563964a1885bd0e3b8216a9c7b5ed6ece5a0c600f428ef","observation_id":"6837ca84-65f8-4e8f-a9bc-9363a8911ab6","resolution":{"observed_at":"2026-08-07T22:34:50.964737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.943525Z","title":"Kitaev and P.B","venue":null,"work_id":"8949a227-6969-4521-a3e1-b441ce06ee10","year":2024},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.654232Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:76f0559b8c022ef3642f01608a5af315b80c568ccef4b8885a966f246b98b7da","observation_id":"677d3684-1897-4217-92a1-2183b70231e3","resolution":{"observed_at":"2026-08-07T22:34:50.948640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.927685Z","title":"Kuznetsov, I.M","venue":null,"work_id":"da30b24e-51de-40ee-b88d-2a8e52a7ab4d","year":1994},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.660857Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:7fc05acf9f2cb13681b56686e2265e6558a7b8fe8a23fa45d5c46599dff7010c","observation_id":"a8fec466-e1e6-401f-94ba-adc6dbd9055a","resolution":{"observed_at":"2026-08-07T22:34:50.932570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.911552Z","title":null,"venue":null,"work_id":"6600d2c5-6653-4df1-99c9-1098adff38bf","year":2024},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.666175Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:ba80a61cd06200634827b3b6f3c798fc3daffed26c908768246e2c8ac4734e2e","observation_id":"2630a197-0c82-48bc-848f-7b3074bed55a","resolution":{"observed_at":"2026-08-07T22:34:50.916567Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.894124Z","title":null,"venue":null,"work_id":"751900b0-a1d8-4caf-97b9-f7b5f13515bc","year":2021},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.671880Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:2e79a4d8192aebf1ab0ae41db4afaf5a6a739c3086039874a1c550149e2c8e96","observation_id":"223f60c5-03fe-4f3d-9551-13f95844eb26","resolution":{"observed_at":"2026-08-07T22:34:50.899429Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.876653Z","title":null,"venue":null,"work_id":"18a04a0c-96a7-455b-bac7-0d025405ea31","year":2024},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.677205Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:dffacefc2bf1d7512f9330307c11b1e3f1cf194a790cc6132fe3b57ea6112931","observation_id":"f80a9b25-00ef-4f43-a84e-1ab3e9b08dd9","resolution":{"observed_at":"2026-08-07T22:34:50.881732Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01558","last_updated":"2024-09-03T02:54:43Z","snapshot_observed_at":"2026-08-12T22:52:42.458431Z","submitted_at":"2024-09-03T02:54:43Z","title":"Parity statistics on restricted permutations and the Catalan--Schett polynomials","version":1},"cited_work":{"arxiv_id":"2409.01558","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.01558","snapshot_observed_at":"2026-08-07T22:34:50.746582Z","title":"Parity statistics on restricted permutations and the Catalan--Schett polynomials","venue":"math.CO","work_id":"8ef94095-1336-4ad4-a972-33fcf0bee4b5","year":2024},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.682140Z"},"links":{"cited_paper":"/paper/2409.01558","citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:adc3a22fc4b1629069db8457f5cf57b2714525ab3001067e84fbb0da93cc1b87","observation_id":"31bdfab4-308c-4221-b7fb-dd3643591184","resolution":{"observed_at":"2026-08-07T22:34:50.754287Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.859650Z","title":"Lin and J","venue":null,"work_id":"d43b0cce-c37f-4da7-9548-b3fc6d0b8662","year":2025},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.687807Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:ad0e69126820b0becc6cf1be7e36ccb9317ff3b6c33a68d095d6970def379058","observation_id":"76be6604-ad05-43bd-946f-f3ddedaefe9e","resolution":{"observed_at":"2026-08-07T22:34:50.863945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.843318Z","title":null,"venue":null,"work_id":"9745b2df-4b48-4f05-b1c6-c32eaa24ea17","year":2022},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.692846Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:263c99aed3f74a07a1a82c26f02dc808b1b75d2c85c785f83984b009f996095a","observation_id":"7b071bc2-3b9d-4ec9-9581-be2056b4994a","resolution":{"observed_at":"2026-08-07T22:34:50.848494Z","resolver_source":"raw_fallback","status":"unresolved"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.825842Z","title":"Sun, Congruences involving generalized central trinomial coefficients, Sci","venue":null,"work_id":"c5f5a4c3-4c53-40bf-9ec9-bf37dd956c73","year":2014},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.697636Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:541cda9dde705c860e08af145c6e7f2c70dd0525a3be564b2ac1e65a5aa192b4","observation_id":"183aeb8a-cbb0-48ff-95de-1a81cdc0d282","resolution":{"observed_at":"2026-08-07T22:34:50.830215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.809984Z","title":"Stanley, Enumerative Combinatorics , vol","venue":null,"work_id":"bac874b6-fb7d-4465-a917-dfb9113abf1d","year":1997},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.702735Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:0acfb208ef4513767aefb8fcd209f9233eedb93a259a12418bb3a7146b6ebb7d","observation_id":"56ceb84f-a3a3-4c66-afab-b9e19307eafe","resolution":{"observed_at":"2026-08-07T22:34:50.814929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:34:50.791589Z","title":"Stanley, Catalan numbers , Cambridge University Press, New York, 2015","venue":null,"work_id":"f65d0e28-bb29-4e8a-9b33-1ba9c78863a5","year":2015},"citing_paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T22:34:50.707726Z"},"links":{"citing_paper":"/paper/2502.09161"},"observation_digest":"sha256:ce8913200cf9b8a49b6b8a6b32bfeb825ce391f9f761cde048496479194913c8","observation_id":"eb2fecb4-f19c-4db4-b263-a5f658221847","resolution":{"observed_at":"2026-08-07T22:34:50.796824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2502.09161","last_updated":"2025-02-13T10:42:49Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-13T01:56:44.530059Z","submitted_at":"2025-02-13T10:42:49Z","title":"Bijections in weakly increasing trees via binary trees"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":2,"verified_fuzzy":19},"total_outbound_references":26},"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 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:2502.09161."}