{"as_of":"2026-08-16T07:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2ac9c26dbf7b2d709df9198d137ef0d23dda89ccb1e1ce1e0ee4e4380998792c","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:17:58.803881Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"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.05647/citation-record","integrity":"/paper/1908.05647/integrity","json":"/paper/1908.05647/citation-record.json","paper":"/paper/1908.05647"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3243176","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:58.872248Z","title":"In Proceedings of the 27th Interna- tional Conference on Parallel Architectures and Compilation Techniques (PACT ’18)","venue":null,"work_id":"4fb1ad2b-b951-4736-ac05-116c36d835bf","year":null},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.748008Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:9d0b41ab0f286763ea4be83862c2d4b7395dcf2e007bcfce8383e872cd5cd396","observation_id":"3adc3a4b-fb9a-4654-b329-f3948bc0f14e","resolution":{"observed_at":"2026-08-14T13:17:58.876552Z","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-14T13:17:58.790531Z","title":"https://doi.org/10.1145/3062341.3062380 J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.790531Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:7db51153ca00c4abc82d47f44bd5121979ade22e08ba66de4934f29f826bb0e9","observation_id":"f7227c9a-4fc8-47d3-8e79-f6c7b245f310","resolution":{"observed_at":"2026-08-14T13:17:58.790531Z","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":"3841.31338","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:59.019290Z","title":"https://doi.org/10.1145/3133841.3133843 Stephen Weeks","venue":null,"work_id":"10f03e7b-5ead-4f14-b985-8dfc6f8259f0","year":null},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.799191Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:25559b575b89798e448e430476e9b112effaa65cfc11aa6e035cfed911bc2319","observation_id":"a3496a0b-6c6c-4680-960d-2dfd6f5d0ae0","resolution":{"observed_at":"2026-08-14T13:17:59.025828Z","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":"7487.36750","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:59.400111Z","title":null,"venue":null,"work_id":"8469a005-810d-46b6-8ae4-9440a9627a5f","year":1960},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":1960,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.752078Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:04f0af3a8c3c3765454c28f348ce74f34b778e5473c946daeeda61c6c5522024","observation_id":"6740993b-5781-4f48-856d-bff1190ce47e","resolution":{"observed_at":"2026-08-14T13:17:59.405773Z","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":"7593.36764","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:59.096066Z","title":null,"venue":null,"work_id":"3223869a-8c25-43a1-840b-8ab6851007db","year":1963},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":1963,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.794599Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:bbef0ffa9a4509c00bb56ba9801fcc22271ff390ed7c52a463887a7a217e6492","observation_id":"6734337e-5c0d-442f-9e61-998896c666d6","resolution":{"observed_at":"2026-08-14T13:17:59.102331Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:58.732350Z","title":"Com- mun","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":1977,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.732350Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:66fca91733c15e0ecda6cbdb54e3f721419c0926c44a1a45928a092777e395d3","observation_id":"b95e9bae-8fbe-41b6-bc27-32f7bac212a5","resolution":{"observed_at":"2026-08-14T13:17:58.732350Z","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":"8593.31866","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:59.263812Z","title":"InProceedings of the 12th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL ’85)","venue":null,"work_id":"ccf2828d-adf2-4427-a517-ad7ba7a61926","year":null},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":1985,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.782251Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:20f3c6c8dba600a83b414669e13c52177c2695c0cad851b4f62db860e7f96e72","observation_id":"a861d7ac-b987-4584-b640-e92ebc03deff","resolution":{"observed_at":"2026-08-14T13:17:59.270174Z","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-14T13:17:59.583443Z","title":null,"venue":null,"work_id":"dd09a90c-301a-47e5-b62c-7f4c899103ed","year":1988},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":1988,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.756618Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:c14cf9451bf4c81f4becb8f766caf8d2680348cb67f2aec4bc70159a12f8f55a","observation_id":"4c02497e-ffec-4a05-8f38-90a1f4025f91","resolution":{"observed_at":"2026-08-14T13:17:59.587139Z","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:17:59.570396Z","title":"In COLOG-88 (Tallinn, 1988)","venue":null,"work_id":"08709e39-5d29-496d-910e-7cca29869d53","year":1988},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.761298Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:51c5aa46c020e5a1abd693c050a4c0b0be09b15165685110dec2473879406006","observation_id":"1c2a4127-eb6a-42be-a50c-22e44f037442","resolution":{"observed_at":"2026-08-14T13:17:59.575389Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:58.778165Z","title":"In Proceedings of the ACM SIGPLAN 1993 Conference on Programming Language Design and Implementation (PLDI ’93)","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.778165Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:e9102e5de6204dc4f8c3b40525a05f3902d5a56ff1433e90fb4c820e414eccc5","observation_id":"e80da61f-6a58-4b20-b973-40ea8117e6a5","resolution":{"observed_at":"2026-08-14T13:17:58.778165Z","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":"5009.18501","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:59.543537Z","title":"SIGPLAN Not","venue":null,"work_id":"8aa66000-35bd-4355-9d65-0cfc3b2c1e9e","year":1994},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.727361Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:d8e272c28a247f66eec31d888b6c4ce05a6ef0925de7f8adc552865b404122aa","observation_id":"a792a596-7625-4b1a-b2d3-a073c75fbd81","resolution":{"observed_at":"2026-08-14T13:17:59.548766Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:58.737300Z","title":"InProceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’04)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.737300Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:14a2d9281b270727f4ea14eeb0f60e0b8f3a60463076ba426e2b1e4c8c72f832","observation_id":"6f801056-1613-4db2-aca0-90f5bbddea59","resolution":{"observed_at":"2026-08-14T13:17:58.737300Z","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":"9876.11598","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:58.952146Z","title":"In Proceedings of the 2006 Workshop on ML (ML ’06)","venue":null,"work_id":"21f7da57-3b52-44a2-bb9c-ce2696f2dfa4","year":2006},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.803881Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:1ca50d494c2e6c451b6b483461a584deeabd4256d0fc4e535254317a05de18fe","observation_id":"7e18fbeb-915f-47f5-bfad-1b38900db305","resolution":{"observed_at":"2026-08-14T13:17:58.958548Z","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.1145/2663171","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:58.835019Z","title":"In Proceedings of the 2014 ACM SIGAda Annual Conference on High Integrity Language Technology (HILT ’14)","venue":null,"work_id":"6190df46-45a8-4852-84b1-1eac7bb60233","year":2014},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.786177Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:2f319d1331f70a84497a8a9f5205d307b865b29e3ca6a548c2ced6a883084822","observation_id":"823b8b23-439f-4ec6-aad9-734f869fa338","resolution":{"observed_at":"2026-08-14T13:17:58.842144Z","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-14T13:17:59.556186Z","title":"In Automated Deduction - CADE-25 - 25th International Conference on Automated Deduction, 2015, Proceedings","venue":null,"work_id":"c0e652a7-25ff-4b15-b4ff-2873891355cd","year":2015},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.765779Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:9c17c4251f78002d4b20f0f3b8de43723a50eceb14516387dfbd481e5e0db603","observation_id":"0acca4ae-b1bc-416c-a3f3-92395cdb2ac7","resolution":{"observed_at":"2026-08-14T13:17:59.560813Z","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":"10.1007/978-3-319-40648-0_12","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:17:58.850562Z","title":"https://doi.org/10.1007/978-3-319-40648-0_12 Cormac Flanagan, Amr Sabry, Bruce F","venue":null,"work_id":"490c7851-8db9-42b7-830e-d92307874c61","year":null},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.773827Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:58d220ae2ee1a348600da699d6790f3a79222d4d48e35262b0c07467df40dd3d","observation_id":"968de20b-8e0e-4aca-8cd9-1309a7cd4890","resolution":{"observed_at":"2026-08-14T13:17:58.855163Z","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-14T13:17:58.769697Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.769697Z"},"links":{"citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:5fc2748a2016ef665caab5cfd250186d930e5ab453425e3bb78854fd2eec6648","observation_id":"fe10325e-849e-4382-a5ba-9622464132e9","resolution":{"observed_at":"2026-08-14T13:17:58.769697Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.07130","last_updated":"2018-06-03T10:22:49Z","snapshot_observed_at":"2026-08-14T19:34:38.897939Z","submitted_at":"2018-03-19T19:29:47Z","title":"A promise checked is a promise kept: Inspection Testing","version":2},"cited_work":{"arxiv_id":"1803.07130","doi":null,"metadata_source":"pith","pith_arxiv_id":"1803.07130","snapshot_observed_at":"2026-08-14T13:17:59.416784Z","title":"A promise checked is a promise kept: Inspection Testing","venue":"cs.PL","work_id":"b00f47a9-10a4-4f97-a9b4-920d584da8c2","year":2018},"citing_paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming","version":3},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T13:17:58.742906Z"},"links":{"cited_paper":"/paper/1803.07130","citing_paper":"/paper/1908.05647"},"observation_digest":"sha256:e0767049c332aabe928c9523ca0111a74ad15469196ba3f97c76613ef02b69cd","observation_id":"eb407ff5-74b6-46f6-ab50-e31f7cf721d6","resolution":{"observed_at":"2026-08-14T13:17:59.420923Z","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"}}],"paper":{"arxiv_id":"1908.05647","last_updated":"2020-03-05T17:03:14Z","latest_version":3,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-16T04:42:22.447765Z","submitted_at":"2019-08-15T17:28:01Z","title":"Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":7,"parse_uncertain":0,"unresolved":6,"verified_exact":3,"verified_fuzzy":2},"total_outbound_references":18},"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 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:1908.05647."}