{"as_of":"2026-08-16T17:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0d684a5aea1d3540fe5508d918adacff470aa7a8265d02ab34fde790232b0f1","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:40:30.177057Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.04937/citation-record","integrity":"/paper/1908.04937/integrity","json":"/paper/1908.04937/citation-record.json","paper":"/paper/1908.04937"},"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-14T13:40:30.552042Z","title":"Journal of Algorithms 37(2), 247–266 (2000)","venue":null,"work_id":"605d22cf-e276-410b-902a-22fd643b0a86","year":2000},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.082122Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:09a992c81db41a98fa35413e58292f67ae94b7066ebd752e872060ca4a63c461","observation_id":"87039842-d3ac-4e90-8579-f2adc7b88e55","resolution":{"observed_at":"2026-08-14T13:40:30.556659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.538265Z","title":"Information and Computation 181(1), 57–74 (2003)","venue":null,"work_id":"820bdb3f-4801-4178-83cc-86cce4c3f5da","year":2003},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.087181Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:26fa79f2468d711e22f255cb02e00e1d2a0be87ec2d7c728ca1de559beaa7d3c","observation_id":"d7a15f41-e6f8-45eb-842f-815244e1abeb","resolution":{"observed_at":"2026-08-14T13:40:30.542905Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.523207Z","title":"Information Processing Letters 49(3), 111–115 (1994)","venue":null,"work_id":"16581d6e-108c-4948-ac29-206ce6bfc594","year":1994},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.091942Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:f8806045407c411b40ea6665f2082fccde233933c0b7958bf69cd7f1249c8f4c","observation_id":"4789479c-c588-48be-bb64-ba9d9ba8e3eb","resolution":{"observed_at":"2026-08-14T13:40:30.528564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.506310Z","title":"Information Processing Letters 83(1), 33–39 (2002)","venue":null,"work_id":"eb64b734-a2f2-4b70-b2d7-9ea5aef82e4f","year":2002},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.096740Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:b48c83623d50982f8d30e3158e7cab835ca4e229934f195d907080ddd1629115","observation_id":"d4cc2a7f-1405-47e7-bca4-b31b096fec98","resolution":{"observed_at":"2026-08-14T13:40:30.511606Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.489320Z","title":"In: Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing","venue":null,"work_id":"42e5ed71-2b09-4b02-a63e-bda2e5002dd0","year":1993},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.101388Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:9969eb98d03066d1ed5b10a3d67b70cbb77dba1e3ba5631544d070deb9bf905d","observation_id":"c55883ea-1fa9-4d28-9e36-daeb6c41b3e2","resolution":{"observed_at":"2026-08-14T13:40:30.496101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.474035Z","title":"International Journal of Foundations of Computer Science 23(2), 357–374 (2012)","venue":null,"work_id":"beefc188-3713-4ee4-ae55-3cb301fab2f0","year":2012},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.105704Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:eaa087fedcb763c7dadca08063f80f4fef4cc9770b41d7d87b1d8823efaf074e","observation_id":"25301c71-4cfc-4528-9752-abaf7bfea5a6","resolution":{"observed_at":"2026-08-14T13:40:30.479582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.460731Z","title":"Discrete Applied Mathematics (2018)","venue":null,"work_id":"1ee9e75d-14b3-494a-befe-7a6eb3361c04","year":2018},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.110010Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:d37bc2f81568ae97eb3a753d9f05d75f6d5a36c81cf349e76ebcb313df7ace86","observation_id":"d6503f2b-c36a-4e51-9a7c-54c1fae548b7","resolution":{"observed_at":"2026-08-14T13:40:30.465577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.444380Z","title":"In: Combinatorial Pattern Matching","venue":null,"work_id":"dbdca911-f84c-49b9-857b-508331b4989e","year":1998},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.115332Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:1c09631a9f386a3260ac9ccfe9a6412678f771ea11c90ba70248041b4deed0ec","observation_id":"50bc793d-d2fd-4023-b2a6-edbd4e78336c","resolution":{"observed_at":"2026-08-14T13:40:30.449823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.427350Z","title":"In: Proceedings of the Prague Stringology Conference 2015","venue":null,"work_id":"46ce9587-ec60-4502-8fd4-b7ab28d0104e","year":2015},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.119678Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:a0e30a4d9071501e14fad2c18e6a3683fc1bc88e4bd195ec7e6a81727cbeddad","observation_id":"fec83be7-73c7-484b-a161-7abba8549470","resolution":{"observed_at":"2026-08-14T13:40:30.433255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.405688Z","title":"Infor- mation Processing Letters 116(2), 71–74 (2016)","venue":null,"work_id":"c6276af0-224b-4842-af4b-4fdda24fa296","year":2016},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.124425Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:ce95766b6926459f3a3ce61f2245d19f10b1bc45afec416e1ebc4ac6b7bd1c7a","observation_id":"3ceffdb0-26fc-41e7-914e-750c972f7162","resolution":{"observed_at":"2026-08-14T13:40:30.412739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.382731Z","title":"Information Processing Letters 115(2), 397–402 (2015)","venue":null,"work_id":"0e1f761d-9bf9-427d-8a0d-3d61ad73b548","year":2015},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.128485Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:50233a4711873deed0a1f202ca4c34ad05c719984f626e786d2eb84524d2181f","observation_id":"d63da2c9-4a23-4951-af40-6a9f37289adf","resolution":{"observed_at":"2026-08-14T13:40:30.387447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.369494Z","title":"Information Processing Letters 110(4), 148–152 (2010)","venue":null,"work_id":"93e6f741-8398-4d1d-aaf5-f3e9b2e39402","year":2010},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.132863Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:bfe97c9e603fbf2a647315bfaaf7728d83db0e2a55567a92abe163fbf56fe5b8","observation_id":"2ba75c7f-38b0-4d2a-bf95-ca330550a47d","resolution":{"observed_at":"2026-08-14T13:40:30.373510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.355287Z","title":"In: Proceedings of the Prague Stringology Conference","venue":null,"work_id":"26ecd568-cae7-47fe-a5ac-a28e65022a87","year":null},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.137775Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:b4e2f05dd9c63505438b4446ddc50539e2a437a74b63ea250266b010a1c39ae3","observation_id":"7b276bb1-26a3-41fd-b033-bbe7bd790bb1","resolution":{"observed_at":"2026-08-14T13:40:30.359815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.342386Z","title":"In: String Processing and Information Retrieval","venue":null,"work_id":"75d8b010-a9f8-435f-960a-e08db8dfaa7e","year":2005},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.141563Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:4c4486f369b6f25e7e5e7267d1cc9de3f54ca611b2430541e9240b78e6a17546","observation_id":"2c956b55-5812-4510-aef0-3fc977931e5c","resolution":{"observed_at":"2026-08-14T13:40:30.346888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.328586Z","title":"Software: Practice and Experi- ence 10(6), 501–506 (1980) 14 S","venue":null,"work_id":"9a4ae856-94de-43b2-affa-de9a2b864e80","year":1980},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.145228Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:ba5385d4419f21e6b5b3352c9d15127834c92f7a0cdd9c2d3a56693c4a4f89b9","observation_id":"6dd9c3f6-79a7-464e-98d4-09aa6766139f","resolution":{"observed_at":"2026-08-14T13:40:30.333304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.315025Z","title":null,"venue":null,"work_id":"7726fd23-4b93-4097-a339-7bb077b0275e","year":2019},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.148924Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:f1010dd1bf439d1c66bfbcc3581edd6ce99902ae180652e14991bbd8b5c89a68","observation_id":"0d19ceef-0286-414c-b55d-789901280f5f","resolution":{"observed_at":"2026-08-14T13:40:30.319236Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.297575Z","title":"Mathematics in Computer Science 11(2), 127– 136 (2017)","venue":null,"work_id":"b3c34ac4-fdfa-4f2d-9504-9b6ac6c944f0","year":2017},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.152737Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:f39aa927f86328acfd5cb4dff76d19458f5cbb628a672ba2846b095c5405a877","observation_id":"ae80f6cf-0e10-4dac-882c-dddb03804de8","resolution":{"observed_at":"2026-08-14T13:40:30.303517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.283271Z","title":"Theoretical Computer Science 525, 68–79 (2014)","venue":null,"work_id":"948c0516-1cb6-42e8-8399-4547da9f20fe","year":2014},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.156779Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:668146c70430a20a02701328ee90e78c97a583fe263ddda8dd53d4cb61cdaf5c","observation_id":"9997c4b0-aefe-44f2-8260-ec7a084f0e49","resolution":{"observed_at":"2026-08-14T13:40:30.287774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.271706Z","title":"SIAM Journal on Computing 6(2), 323–350 (1977)","venue":null,"work_id":"26375fc2-8f17-4927-9f80-689cdd4e2a73","year":1977},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.160715Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:a6cf36d7a8776d74c73e1d6e42f4d70abbcd3f5ee056417cf4261f061a97a352","observation_id":"9f9c36d7-b4fd-405b-89c0-a13ca87da40d","resolution":{"observed_at":"2026-08-14T13:40:30.275644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.257477Z","title":"Information Processing Letters 113(12), 430–433 (2013)","venue":null,"work_id":"676febe6-7abe-4d81-8622-a424e5922db2","year":2013},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.164794Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:608193a84bdccc544a6c0d727c3733f8ab907c1fa85c803b7536ffc6ccba685f","observation_id":"0ddd1cbd-a186-4a35-b440-b43f8673d5c2","resolution":{"observed_at":"2026-08-14T13:40:30.262187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.08974","last_updated":"2019-05-22T06:15:31Z","snapshot_observed_at":"2026-08-14T16:28:38.776227Z","submitted_at":"2019-05-22T06:15:31Z","title":"Cartesian Tree Matching and Indexing","version":1},"cited_work":{"arxiv_id":"1905.08974","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.08974","snapshot_observed_at":"2026-08-14T13:40:30.216989Z","title":"Cartesian Tree Matching and Indexing","venue":"cs.DS","work_id":"c68e7a22-0d56-40ca-bfa7-636008d4d7cf","year":2019},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.168957Z"},"links":{"cited_paper":"/paper/1905.08974","citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:d1a0af0f4d9a9829725f20b27c3c93dd082a705fcdfb446884dfb3f2e9ab137d","observation_id":"da6a97a4-a341-4c43-a947-5568cb41f848","resolution":{"observed_at":"2026-08-14T13:40:30.223274Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.244669Z","title":"Software: Practice and Experience 27(7), 851–861 (1997)","venue":null,"work_id":"206c33e1-ebed-4cb3-90bc-238e47391f8c","year":1997},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.173180Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:5b9116720ff143ac2ffaa58238ea91df1067bde00fce3d00890bdb97c32580c6","observation_id":"c3b1f03a-80b6-4cab-8045-15ba7b03065a","resolution":{"observed_at":"2026-08-14T13:40:30.248480Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T13:40:30.232596Z","title":"Communications of the ACM 23(4), 229–239 (1980)","venue":null,"work_id":"5d1ac655-b589-4eb1-8d93-a87dca165e8d","year":1980},"citing_paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:40:30.177057Z"},"links":{"citing_paper":"/paper/1908.04937"},"observation_digest":"sha256:824b13ea21bb33e9cc478c462d6913ea74fd2bd57ec58591262910cbb5134b86","observation_id":"0b41970f-3001-4384-ae71-5ea4826f008f","resolution":{"observed_at":"2026-08-14T13:40:30.236463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.04937","last_updated":"2019-08-14T03:14:21Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T17:07:05.387817Z","submitted_at":"2019-08-14T03:14:21Z","title":"Fast Cartesian Tree Matching"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":21},"total_outbound_references":23},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:1908.04937."}