{"as_of":"2026-08-16T14:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aba3232771f57621c090408a98c278146621e794e6cbdfc87e7474f4a45053bc","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:16:12.584968Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"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.03619/citation-record","integrity":"/paper/1908.03619/integrity","json":"/paper/1908.03619/citation-record.json","paper":"/paper/1908.03619"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf00245294","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.898264Z","title":"Mason, and Robert Poll ack","venue":null,"work_id":"d952713b-4d3d-4921-b84a-3d9fba7e4eaa","year":1992},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.303549Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:e2d4f993f50a7d31ae6c64b16d63e96dee217ead6690ae13791d39a54b0c3237","observation_id":"d55ad041-c234-419a-9e0b-feed3601732f","resolution":{"observed_at":"2026-08-14T14:16:12.903009Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.308867Z","title":"Aydemir, Aaron Bohannon, Matthew Fairbairn, J","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.308867Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:fa0ba970ac560ca38ca084686facdbc861e1dcef5a5570af1bafb3333cd43d2d","observation_id":"8db8be74-61c1-4a87-9b8f-6479a513001e","resolution":{"observed_at":"2026-08-14T14:16:12.308867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:13.902422Z","title":null,"venue":null,"work_id":"792698de-24d6-4007-bf36-27664629bd32","year":2014},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.313449Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:37cb1ddfc27e917c70ee8c0dc23a612f98345307cd3eb5685c7beda4e2253be1","observation_id":"976af8e1-09dc-4c55-b28d-2719937923dc","resolution":{"observed_at":"2026-08-14T14:16:13.907003Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.323070Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.323070Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:a75e4f913760ef1eacee94de9f4328f1ef09fb3e2adeb567b0fe8a1d1644f72d","observation_id":"3dd396fb-bf9b-44b9-af16-25c3eff5a31a","resolution":{"observed_at":"2026-08-14T14:16:12.323070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-27775-0_19","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.859932Z","title":null,"venue":null,"work_id":"a2827b18-7532-4338-bad2-7d8a947dc79a","year":2004},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.327567Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:d862025beadd2192dadb5073e568f3d77f06b3186c5a4adb249fade6b8a91c23","observation_id":"1189b66e-cbfc-4234-a47a-ef5386e94452","resolution":{"observed_at":"2026-08-14T14:16:12.864500Z","resolver_source":"doi","status":"verified_exact"},"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-14T14:16:13.886855Z","title":null,"venue":null,"work_id":"d7a00b8f-6721-4640-90a7-0a3f524119e7","year":1991},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.333271Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:bab877b4043e04a00b267d472206b6138c6ab7fe8c9b206828c7b98659c3fe48","observation_id":"31437163-e969-4213-9eae-73226f48fa1a","resolution":{"observed_at":"2026-08-14T14:16:13.892897Z","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-14T14:16:13.872902Z","title":null,"venue":null,"work_id":"9abb97e5-c4d7-427a-86e0-4b7215336c17","year":1995},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.337810Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:5f00b119d24ab2f21a5880a5957b638a615da647fc8b987e1b1ef79c0910cfc5","observation_id":"226663a1-6119-46da-92fc-5b8cd54f22b0","resolution":{"observed_at":"2026-08-14T14:16:13.876919Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.342591Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.342591Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:f808568164b35960489943abc7f4d14ef8bdf3fdc4c2a827e12e38a8b698e044","observation_id":"49a35e25-3ff6-46fd-9730-d571940d828c","resolution":{"observed_at":"2026-08-14T14:16:12.342591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.347931Z","title":null,"venue":null,"work_id":null,"year":1940},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.347931Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:c5e81aa31baf79aab0eedffd7e57d8630c66fde903bc85e9f745bf70d576b971","observation_id":"862decd9-0be6-4439-a813-07a0758e935e","resolution":{"observed_at":"2026-08-14T14:16:12.347931Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.352598Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.352598Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:786b23276a96fb57b79face30b7f9937ca4a9c1a1014631db5c3467ca9617352","observation_id":"0e901a96-314b-4f4c-a6f0-1be0440501f0","resolution":{"observed_at":"2026-08-14T14:16:12.352598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.356853Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.356853Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:d165109cb3f8f98a3837eb48c2dead307b12f18b3091d1c7d8974f5e602ece16","observation_id":"d9f40a7c-85fd-4c2c-a927-eb8d7dcdcc27","resolution":{"observed_at":"2026-08-14T14:16:12.356853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:13.858493Z","title":null,"venue":null,"work_id":"bbd76c69-c906-4329-94f9-f908fa0e9882","year":null},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.361475Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:8a011215e36637ed7a219ffeb2bfa8b263fb616ddfdab05f9a4a677fe18c4400","observation_id":"6ee63101-b724-48c5-b9fc-1149332f80b5","resolution":{"observed_at":"2026-08-14T14:16:13.864137Z","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":"10.1007/s10817-015-9327-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.799549Z","title":"Felty, Alberto Momigliano, and Brigitte Pientka","venue":null,"work_id":"f0a30597-8cd3-4c31-b8ff-f3eda558939c","year":2015},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.371151Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:a2ae99731bf931553ade5fcb983a5baaa6ef79974423e2c4348ba6f7ff602f49","observation_id":"e4703551-499b-457c-8900-62a89cc6771b","resolution":{"observed_at":"2026-08-14T14:16:12.804360Z","resolver_source":"doi","status":"verified_exact"},"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-14T14:16:13.843383Z","title":null,"venue":null,"work_id":"d319d65a-d37c-4b36-9b39-9a7a6e299028","year":2017},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.375562Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:631af8ae3fa75c68c5b983c79a1bfc80238ac69f4cbfd14d9f91c8b716d79876","observation_id":"9707238d-6761-4313-ada1-3c0bb12ed53b","resolution":{"observed_at":"2026-08-14T14:16:13.848736Z","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-14T14:16:13.827340Z","title":null,"venue":null,"work_id":"ef510fda-358b-4382-914c-07297f71278a","year":1999},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.380445Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:7a56fd11c90659ea120844b3a689020704d2a47d092104fb53557b595e5ddfe9","observation_id":"8713f245-6f3f-4f2d-9c05-1f91931bacbd","resolution":{"observed_at":"2026-08-14T14:16:13.833836Z","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-14T14:16:13.813924Z","title":null,"venue":null,"work_id":"7cfd15ad-40c8-441f-b77c-2517400e7774","year":2009},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.384525Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:afb6bb43e7db4e5c0ae7c5631e7ff1b507b4b0cdce93df7b6703f54aa7f88e39","observation_id":"195913be-0dd9-44d8-9438-8102be04b1d1","resolution":{"observed_at":"2026-08-14T14:16:13.818219Z","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":"10.1109/lics.2008.33","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.785439Z","title":null,"venue":null,"work_id":"7bdf4ed1-31c6-46a4-a3e4-c8ff434a3650","year":2008},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.390151Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:2efffb7fa236a4de58701892060d7a598e7b62fdd4fa01c33a59f93b81d0e541","observation_id":"8f1911f4-e6fb-432d-ae00-a6b3288298e8","resolution":{"observed_at":"2026-08-14T14:16:12.790456Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1016/j.ic.2010.09.004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.770167Z","title":null,"venue":null,"work_id":"ff4abcf9-8289-4fb5-b439-40ab19631cae","year":2011},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.395741Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:789687c0ff31c489142e6150424ccd9984c3d548ddccb048cf2ac101ff400bb0","observation_id":"4bcc239f-9d2d-4873-9b58-2832e044bab1","resolution":{"observed_at":"2026-08-14T14:16:12.774623Z","resolver_source":"doi","status":"verified_exact"},"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-14T14:16:13.799997Z","title":null,"venue":null,"work_id":"df67be07-c6ed-4089-9bc6-4d036c8297d2","year":2019},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.400670Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:8cfcfa5b876d7d57bf95c704021ff32dfd1ef67be411ba16892a5b4631fdf97d","observation_id":"0e1d20fd-d001-465b-873f-4db662d49e0c","resolution":{"observed_at":"2026-08-14T14:16:13.804557Z","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-14T14:16:13.787055Z","title":null,"venue":null,"work_id":"92b2f0bb-b884-450c-ae60-6b8fc4e95fd5","year":2018},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.404919Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:59ab58da98c3528d2e3db2999f10a624601a8d5301a56b8b729e31f0b871e44c","observation_id":"0767d92a-f495-4ade-800a-817def84111b","resolution":{"observed_at":"2026-08-14T14:16:13.791249Z","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-14T14:16:13.774127Z","title":null,"venue":null,"work_id":"86c81bc6-d4a7-4419-b33c-e2e1639ab2c9","year":1994},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.409124Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:416631d13bc111ee58c287eb96ef0a23e6fd22704868a326d39cbd912392c62a","observation_id":"b32bf75b-9392-4298-b978-919f3c37c0c5","resolution":{"observed_at":"2026-08-14T14:16:13.778201Z","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-14T14:16:13.758297Z","title":"Gordon, Arthur J","venue":null,"work_id":"2fc3a0dd-ef49-4ce8-9d5f-de1f6a917d6e","year":1979},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.413108Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:00094a303ed01a25392c92121e013d731dd6a23dca4f4c3b63ec194114c63d76","observation_id":"e07aa666-3b09-434f-988d-d94a187966fb","resolution":{"observed_at":"2026-08-14T14:16:13.763607Z","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-14T14:16:13.743033Z","title":null,"venue":null,"work_id":"d410bf7e-1cfe-4fa1-9655-1d0875cae2cb","year":1991},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.417029Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:167d638cc7bbf479ed6d96752e5372c8fcf34f635b592ce63539eb46deb4f3ca","observation_id":"b59d2fb7-d952-41ef-a1b9-7e472b575a0d","resolution":{"observed_at":"2026-08-14T14:16:13.747700Z","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-14T14:16:13.726353Z","title":null,"venue":null,"work_id":"5ac8834a-af19-4987-880c-ab24e96757de","year":1993},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.422337Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:5e0d77aa86595536eb08545654ff43d5d271f4c127053e719a3c9df095ed7e46","observation_id":"27510061-31d9-471d-bee4-1bc6f0448fdf","resolution":{"observed_at":"2026-08-14T14:16:13.733304Z","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-14T14:16:13.704308Z","title":null,"venue":null,"work_id":"237843dd-96d6-43e7-8d92-69cfd3f94271","year":2009},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.427018Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:0107b4a73f92593f3b445cd20c28d166dee3249196befa8f660e5c727c74e25d","observation_id":"08b416b9-436d-4d30-8fca-57c16a986357","resolution":{"observed_at":"2026-08-14T14:16:13.709467Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.432120Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.432120Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:237026a2609a4b3da59b2b403e0b496264881c1d76d075cd9dcf611d4ad393fd","observation_id":"bc5a376c-35c0-4c08-bc78-25309af02a64","resolution":{"observed_at":"2026-08-14T14:16:12.432120Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:13.689767Z","title":"Js_of_ocaml","venue":null,"work_id":"7811a631-807a-4fef-8794-6713883946b1","year":2018},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.436988Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:15d0d4a5a40a8889988e1c0861177e0855eccf1aaffc78b43ba86e9c88a5e7a8","observation_id":"e1d2de80-e189-4019-ae68-57e00d5a754b","resolution":{"observed_at":"2026-08-14T14:16:13.694294Z","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-14T14:16:13.564142Z","title":null,"venue":null,"work_id":"68dab828-fd34-4c9a-b4f2-4ff36488c98b","year":1987},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.440602Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:52b12523a3ada844e6d95fd1977bc1edf79d96bc14c8f12dc69db155d0ac5cef","observation_id":"62972cfe-adc1-4aa1-ba1f-365c85034b2e","resolution":{"observed_at":"2026-08-14T14:16:13.568722Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.444767Z","title":"Licata and Robert Harper","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.444767Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:e18aac9c645571c8ee4dd81ce1a9655685330dbb2bb5730842a82b4c2be9dd22","observation_id":"646bd599-095f-4089-9d3b-2aacc3e5fc6c","resolution":{"observed_at":"2026-08-14T14:16:12.444767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7472.10174","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:13.123243Z","title":null,"venue":null,"work_id":"65dc5657-438d-493b-a397-95d81c6215fd","year":2004},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.449021Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:10ef35f04925815aa150982029dbc4bacbb864869b59416f9ca47be3456fc925","observation_id":"5c0c77b6-290a-4a3b-a2ef-9e7156d4c3d3","resolution":{"observed_at":"2026-08-14T14:16:13.131790Z","resolver_source":"raw_fallback","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-14T14:16:13.550643Z","title":null,"venue":null,"work_id":"ad00d76c-8801-44e6-b198-64dcc16feecb","year":1990},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.452769Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:5063b25edada5b89bd6855fcbfd66e8e21d2cd8985b4affb387fed25eb831e52","observation_id":"b6779bfc-4023-43c9-b1be-59d52c8e1a67","resolution":{"observed_at":"2026-08-14T14:16:13.554818Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.456618Z","title":null,"venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.456618Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:450e71dcd03129bfd2a4514ca526a39d0f1b53da88b1fe9a6b690c6ce57a89b4","observation_id":"5106258d-b1d7-4658-bc0d-84e9b029096b","resolution":{"observed_at":"2026-08-14T14:16:12.456618Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.460703Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.460703Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:03fc31eefd819329429ec55841e4c33b29b518c9aa35a03f48fce09b494acb6d","observation_id":"cbdfaa3c-e3f9-4d14-8c13-b993fb84e112","resolution":{"observed_at":"2026-08-14T14:16:12.460703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0304-3975(96)00045-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.718996Z","title":null,"venue":null,"work_id":"c03eb779-9bcf-4d4f-a2ad-329bdc0f12f1","year":1996},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.465646Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:bb1a8612b78d79d2dde8454439f257ec771dca0644cf0461767f3dc2fa765209","observation_id":"bce057fd-1e00-4f57-90e9-04f3c04993d0","resolution":{"observed_at":"2026-08-14T14:16:12.732160Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/978-3-540-30124-0_4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.703746Z","title":null,"venue":null,"work_id":"4a083082-9bf0-4bc3-81c8-38e14435ba3f","year":2004},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.469578Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:1cb500fd551e1c92264eb27e054c2ec463368aa33f9bf53fb70779d67aebb80d","observation_id":"ec260463-86c1-4f77-8042-28bd0afaadf1","resolution":{"observed_at":"2026-08-14T14:16:12.708736Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/s10817-018-9483-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.686688Z","title":null,"venue":null,"work_id":"5f002d75-7719-441e-b310-8be4c04f3a1f","year":2018},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.473705Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:2e2d3b56a8aeeefd8d397715a32c458c75517ad0595c296b174babc88933b22c","observation_id":"6b03b22c-974f-483e-b760-07d523caaab8","resolution":{"observed_at":"2026-08-14T14:16:12.693066Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.478177Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.478177Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:e6c6e963785a8683c3ff7e8eae681f0de92d561421dffd6c87103497489ed337","observation_id":"59358600-05f9-41ee-8e71-4046b8a7f3d2","resolution":{"observed_at":"2026-08-14T14:16:12.478177Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:13.533988Z","title":null,"venue":null,"work_id":"2f8d3a1d-da7b-4de5-a9b2-22cae45a5805","year":1999},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.482236Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:88b488e0be68ffd6b2cb538cb2e0653cd2415739d0084bddef1643c15dbe3db5","observation_id":"5fefc03a-bc82-4b7f-8ddd-4dab4cf26523","resolution":{"observed_at":"2026-08-14T14:16:13.539536Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.486050Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.486050Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:1273b5192cf5834d86f9fbe2908376e35660b49cf99a94ecb3c81776271d19d6","observation_id":"3c81aeb1-c619-4470-b38d-7955de54a689","resolution":{"observed_at":"2026-08-14T14:16:12.486050Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:13.520121Z","title":null,"venue":null,"work_id":"6ef72ff0-e837-4fb9-986c-997490593269","year":1988},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.489735Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:83a413df268c10d66d5a6c8aafcdecfc8a485f9a7ab322d36992cac70e271b2b","observation_id":"83a3e3cc-b71c-493f-953e-463228313fcd","resolution":{"observed_at":"2026-08-14T14:16:13.524853Z","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-14T14:16:13.506504Z","title":null,"venue":null,"work_id":"de5e3fb1-2fe5-461f-812d-8c19d7678fee","year":1993},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.494177Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:dbc526f129764129f68db8a4bfcb1fbaf554371c68ee8ded45e744e523fe7a29","observation_id":"27e4bee0-4d24-4e36-b5de-b9b0532b2b89","resolution":{"observed_at":"2026-08-14T14:16:13.511215Z","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-14T14:16:13.492246Z","title":null,"venue":null,"work_id":"c73a8460-2d33-412d-b8ab-15afcf9996ab","year":2018},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.499186Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:f63b900a028b9a2ab47224a7e40465d6061baae08fd6618d93ac4d2d07151b25","observation_id":"65c5c0ed-ba7e-4450-af7f-f2b26fff5c1b","resolution":{"observed_at":"2026-08-14T14:16:13.496633Z","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-14T14:16:13.477046Z","title":null,"venue":null,"work_id":"06653902-4b14-493d-897d-8c04824ce708","year":1989},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.503157Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:a7bb59117ec6afb38e70d38ef6e9f7d43c684b017f356f6ce9e3832e0287fbcc","observation_id":"e9a03098-0771-4cf0-9b78-02b8709ce8fe","resolution":{"observed_at":"2026-08-14T14:16:13.482079Z","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-14T14:16:13.464973Z","title":null,"venue":null,"work_id":"be2b0c5c-19ca-46e0-b818-5efa82f18ccf","year":1994},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.507469Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:dc165a83c35a3d7caabf94d2d588625e4dcfeb52522fa7aff6d5044b14469149","observation_id":"c7771541-4174-46d8-ada9-6d7cb5db8189","resolution":{"observed_at":"2026-08-14T14:16:13.468979Z","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-14T14:16:13.451464Z","title":null,"venue":null,"work_id":"20a6b695-c939-43a4-8235-2c2eab824eab","year":1988},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.512013Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:b1f92ef4345dcb24c0cec3f794510a89e53bbd3518461ce16573ca560d7a077a","observation_id":"10b4345f-90c7-4278-8035-1d8f5c299178","resolution":{"observed_at":"2026-08-14T14:16:13.456303Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.516133Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.516133Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:4f87320bf454f2cecb74a78f87622a37090cad0d04f59452a4b8c526b116b97d","observation_id":"6c96842f-9595-4b2d-a969-1deab55a3959","resolution":{"observed_at":"2026-08-14T14:16:12.516133Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:13.438314Z","title":null,"venue":null,"work_id":"62bb3d88-b39b-43f4-a162-5d28090de511","year":2010},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.520300Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:98ecd9b888c2b0db06332f5fd0be2b58e1741c34f37839ca24a8016fb587a35c","observation_id":"dbb70083-dfaa-4750-96e2-7cede9c45d9b","resolution":{"observed_at":"2026-08-14T14:16:13.442507Z","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-14T14:16:13.422442Z","title":null,"venue":null,"work_id":"6624e5af-544d-4b2b-8470-6f850c5874d7","year":2003},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.524586Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:852938209d0a2edd43efc69df4c28e3ca82638a98e940074d30e6984286a0d3f","observation_id":"dfcdb4d0-e5bb-4d19-8bdf-090444aeff98","resolution":{"observed_at":"2026-08-14T14:16:13.427829Z","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-14T14:16:13.408317Z","title":null,"venue":null,"work_id":"dcf53b7c-9ef1-4631-a496-16501cedeb72","year":2000},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.529548Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:2163a8b2be2c80037fc2885842bdb39c6c5c717a0ef02d3f6b0fb3dd7a49375f","observation_id":"70311d09-b4b7-40cd-947b-97bb506a987a","resolution":{"observed_at":"2026-08-14T14:16:13.413548Z","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-14T14:16:13.393014Z","title":null,"venue":null,"work_id":"c9cad91d-71cf-4236-a58b-433fd587f646","year":2008},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.534650Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:e229cb72afa9bc044bf41e779d7e19ae5e69d89c854c6b20b8226177aa30e69b","observation_id":"e22e797a-69ce-4347-8e93-e7e4ef97fdca","resolution":{"observed_at":"2026-08-14T14:16:13.398187Z","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-14T14:16:13.378797Z","title":null,"venue":null,"work_id":"0a0607fb-5769-4065-bd23-234b5b9dc882","year":2008},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.540221Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:bd71a9482468ca934d1cc99df772d57f32dd5c8e1ac946da50e2d0eb5d3cb775","observation_id":"b18a59e4-fb7c-4655-9c78-2c4f2c3d0733","resolution":{"observed_at":"2026-08-14T14:16:13.383927Z","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":"10.1016/j.entcs.2005.11.039","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.650066Z","title":null,"venue":null,"work_id":"916e7a5f-8e33-44ea-a677-a995c25820bc","year":2006},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.544350Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:6f5c991b0561756107e38ac8e4a198e5c1eaa66cf65cf80fac0a0a19c389b861","observation_id":"d3d4fd9e-8bfe-4267-a870-d6e6a9c2d2dd","resolution":{"observed_at":"2026-08-14T14:16:12.655342Z","resolver_source":"doi","status":"verified_exact"},"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-14T14:16:13.364883Z","title":null,"venue":null,"work_id":"96c8d956-42bf-457c-a3d8-441b7889558d","year":2007},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.548828Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:a078f17108b08e52c3b0c760e1df009033c734ead1e24fcfd08992b2b81c824e","observation_id":"c33b9d85-ef7d-4004-8322-09556576c53b","resolution":{"observed_at":"2026-08-14T14:16:13.369389Z","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-14T14:16:13.349899Z","title":null,"venue":null,"work_id":"95693fcf-361b-48e8-9123-4df07d49c956","year":2015},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.552579Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:81a38013b696e4e11510b03e8d9700ca61864c3f246f86423aedac02964412cb","observation_id":"dbc6e4ec-844a-4cd6-8ff8-6b6b26022e72","resolution":{"observed_at":"2026-08-14T14:16:13.354050Z","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-14T14:16:13.333567Z","title":null,"venue":null,"work_id":"0d58ff09-803a-44d2-b232-c289b3247df5","year":1996},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.557701Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:bbfc18c7e1e5de5d203b548720c10e13eb4aafbe9522fcbbb88da7e0951f0927","observation_id":"fb9c44dc-ff68-4abe-bf08-5b999dbd04f0","resolution":{"observed_at":"2026-08-14T14:16:13.339695Z","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":"10.1007/11417170_25","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.636175Z","title":null,"venue":null,"work_id":"6f800cf9-9fc6-4e9e-9133-e9a5f2f2d8dc","year":2005},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.561584Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:8a5ac273e4bfe46c8412b82a566b6699917d1aa3eccf398526b9ea8a72eded7b","observation_id":"70f3125d-5e15-4465-8719-8271667d9fc9","resolution":{"observed_at":"2026-08-14T14:16:12.640624Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1007/11542384_19","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.619532Z","title":null,"venue":null,"work_id":"c0fca864-20bf-4ebc-a798-d7cacbe3c023","year":2006},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.565834Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:c25c2e74c0f2eb4f3a1b1d6a413e70b97f3013878a4b99e58927288774ca598b","observation_id":"d914f354-6d35-4011-ae01-e3055f2d83a6","resolution":{"observed_at":"2026-08-14T14:16:12.625703Z","resolver_source":"doi","status":"verified_exact"},"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-14T14:16:13.320754Z","title":null,"venue":null,"work_id":"d9760793-0a80-4e0f-87b0-4775e0522a1a","year":1970},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.571718Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:b32c96f657a838eaee7e4220f2e665cdd1027f038996c29d76a8b2baee2f2880","observation_id":"2c85cd17-eddd-4165-bf27-2b0577cb290a","resolution":{"observed_at":"2026-08-14T14:16:13.324699Z","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-14T14:16:13.306269Z","title":null,"venue":null,"work_id":"32ff13a1-9735-4d9e-a168-7afcd3904fa7","year":2003},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.576374Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:0d2f541165bfe4571355a0321bf4efd1b5a33665b74333f94cbb7f0d7caa48c0","observation_id":"93f5fc87-481b-4d0b-af07-196b9c196874","resolution":{"observed_at":"2026-08-14T14:16:13.311470Z","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-14T14:16:13.292044Z","title":null,"venue":null,"work_id":"85d5006c-9967-43e8-ab23-18a2b084d2e7","year":null},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.580785Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:0c93bb626031c4ca9bf84c851c6406f1180c212271bb5b29c72506541edc144a","observation_id":"33ebfecc-b9eb-4713-93de-40143cdfc959","resolution":{"observed_at":"2026-08-14T14:16:13.296411Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.318332Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.318332Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:5b5e62933eee0731e2fde2e9ff13ec4a134e2f9c72c6aad761cd741031849985","observation_id":"dc427f51-d9a7-4d19-a7fd-62f8962760d8","resolution":{"observed_at":"2026-08-14T14:16:12.318332Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5879.25058","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.973004Z","title":"In Proceed- ings of the 15th International Symposium on Princples and Prac tice of Declar- ative Programming (PPDP) , Tom Schrijvers (Ed.)","venue":null,"work_id":"ebd386c3-9658-4933-9fba-8617fb667127","year":null},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.584968Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:2de76c164d8802145c68c6e255c1040dec898adaa175857013eb4d0760dc72e0","observation_id":"58e36f28-bab7-480e-9c6c-1c3385bfe82a","resolution":{"observed_at":"2026-08-14T14:16:12.980619Z","resolver_source":"raw_fallback","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":"10.1007/978-3-662-48899-7_32","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:16:12.814528Z","title":null,"venue":null,"work_id":"dbb7c883-4cdc-440b-927e-fe7bde82672d","year":2015},"citing_paper":{"arxiv_id":"1908.03619","last_updated":"2019-08-09T20:38:05Z","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T14:16:12.366912Z"},"links":{"citing_paper":"/paper/1908.03619"},"observation_digest":"sha256:fe4dbdc1f0aabc32318f30254fd9ea88b2b49b9945250956a6e4f057fc806a0f","observation_id":"7fc9b3d1-f15b-4954-8d9f-e1eb2084484e","resolution":{"observed_at":"2026-08-14T14:16:12.819885Z","resolver_source":"doi","status":"verified_exact"},"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.03619","last_updated":"2019-08-09T20:38:05Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-16T10:45:36.722581Z","submitted_at":"2019-08-09T20:38:05Z","title":"Functional programming with lambda-tree syntax"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":47,"verified_exact":12,"verified_fuzzy":2},"total_outbound_references":63},"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 63 of 63 outbound references and 0 inbound Pith citation observations for arXiv:1908.03619."}