{"as_of":"2026-08-16T19:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9b566a8992fdd6290608580398c068dd00b927c81e71c31c88cf8369477dbbac","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:43:42.088829Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"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.04546/citation-record","integrity":"/paper/1908.04546/integrity","json":"/paper/1908.04546/citation-record.json","paper":"/paper/1908.04546"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:44.140099Z","title":"Portability in scientific computing: The molecular dynamics non-bonded forces calculation as a case study,","venue":null,"work_id":"725b86cf-d3c0-4c3f-8565-c3c4a125b28f","year":2018},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.796205Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:4d207c19452af500cdf93a0abeced431144294d3b5481960c5a5d065028502d0","observation_id":"0a80c828-9086-4c87-ae89-d99f88feb212","resolution":{"observed_at":"2026-08-14T13:43:44.149382Z","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.1109/se","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:42.223586Z","title":"The scalability-efficiency/maintainability- portability trade-off in simulation software engineering: Examples and a preliminary systematic literature review,","venue":null,"work_id":"3a37f56a-89fa-46b8-a652-f78ef6e47272","year":2016},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.802597Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:70122d4993213f399e97bf04cdc62fde662c5e486313a1688614c5625774ffce","observation_id":"2f277d22-3ff5-4756-94c7-eaa3fcdbe364","resolution":{"observed_at":"2026-08-14T13:43:42.232714Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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:43:44.113165Z","title":"PyTorch,","venue":null,"work_id":"dacdb46e-909e-42b2-a7e4-e28b29950fbb","year":null},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.810562Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:29b9307126d9fcd70d7cd4882c961bc91af58dbe9dbceda5d577f686abeaf3ff","observation_id":"b08a71d6-30c6-41fc-833a-2e6259177c63","resolution":{"observed_at":"2026-08-14T13:43:44.124363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:44.087875Z","title":"Darknet: Open Source Neural Networks in C,","venue":null,"work_id":"94e0bd31-598f-4de1-958e-d7b2df8ac6b7","year":2013},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.817685Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:bcfacc23bbd461caf9bb161628f980485ea64d7c5e45806025a866d9d111f134","observation_id":"7e6b193a-3b0e-4a08-93ab-946dea5be78a","resolution":{"observed_at":"2026-08-14T13:43:44.094655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:44.068703Z","title":"NVIDIA cuBLAS,","venue":null,"work_id":"2683c09b-347b-4199-acd7-aafccbce6eea","year":null},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.824285Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:0c9e539dd47528ea34f99a421626f21fffd337249cfbb54cc589b0248ca3527f","observation_id":"fa62f602-850f-4609-8d4f-f34c9fd53ada","resolution":{"observed_at":"2026-08-14T13:43:44.074945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:44.050056Z","title":"clMathLibraries clBLAS,","venue":null,"work_id":"63c38beb-5c1c-4b7a-ac46-c163f396617e","year":null},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.831251Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:d5bb1d0bd57b86f150d23232dcf8533200c02352799e83708cc5191783b0dfef","observation_id":"a1897266-2a49-4d51-8a90-1f2a0f9a76db","resolution":{"observed_at":"2026-08-14T13:43:44.056546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:44.020711Z","title":"NVIDIA cuDNN,","venue":null,"work_id":"297c8616-2158-47bd-85ba-2e32ee5489b9","year":2018},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.838723Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:a21100f25e865edbe33d84c2f8b3e2155eafde26d931691cfb426d898a8b8f57","observation_id":"520b74f3-0b29-4c1b-8afa-8bb1e302a14d","resolution":{"observed_at":"2026-08-14T13:43:44.026499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:43.992091Z","title":"Intel® Compute Library for Deep Neural Networks (clDNN),","venue":null,"work_id":"31267e2c-704c-4b2b-ac9d-a8fcc0f2d16d","year":null},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.848627Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:62e05516b3e5adf7424345d1378992b22bff97bdc768b6e8d8b3a33442ef87fb","observation_id":"df9da4d6-e28e-4c12-bd9b-3af22b397f06","resolution":{"observed_at":"2026-08-14T13:43:44.005996Z","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:43:41.855523Z","title":"Accelerating Search- based Program Synthesis Using Learned Probabilistic Models,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.855523Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:81668ef0ba0a5f0f52b8a408e05ba1d0a5789bfd61920e78e3b5f269583c72d2","observation_id":"9bd73705-f75a-4a4f-909a-9cff89b63a11","resolution":{"observed_at":"2026-08-14T13:43:41.855523Z","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-14T13:43:43.971760Z","title":"NWChem: A comprehensive and scalable open-source solution for large scale molecular simulations,","venue":null,"work_id":"202f4eff-505b-4234-b6d6-5813162c9955","year":null},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.861979Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:6fc1d79102a2ae6226df26215f1a0030b749f932fac59c880c1a66b9dbcf9302","observation_id":"d3f1c1fb-48c6-4f35-843a-1ae3b92a2a6c","resolution":{"observed_at":"2026-08-14T13:43:43.979072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:43.925328Z","title":"Intel® Math Kernel Library (MKL),","venue":null,"work_id":"86bbdd5d-6168-4f15-8430-1641a9f6088c","year":null},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.873591Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:30e6c5c8f5b644cfb5c910ad114a59b9301974c287c108da6079559667812c9c","observation_id":"01cfb64f-d465-442c-92ee-dce31e291694","resolution":{"observed_at":"2026-08-14T13:43:43.934492Z","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:43:41.879539Z","title":"A theory of formal synthesis via inductive learning,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.879539Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:08dc67611ee7c88b83c5669e40528b007d30371f0a0ca5754b70d19e04630647","observation_id":"b8d9ba7b-72cc-4a8b-ba17-6d34371dbb12","resolution":{"observed_at":"2026-08-14T13:43:41.879539Z","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-14T13:43:41.886606Z","title":"Automatic Matching of Legacy Code to Heterogeneous APIs: An Idiomatic Approach,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.886606Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:71d3e68c43103a55d931d97c40ccd86d1a151033106075fd5d43ed9f91b1a5d0","observation_id":"5cf129cb-d994-4e53-950f-59acb526e59c","resolution":{"observed_at":"2026-08-14T13:43:41.886606Z","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-14T13:43:41.892658Z","title":"QuickCheck: A Lightweight Tool for Random Testing of Haskell Programs,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.892658Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:7bf0a78b060d607cc29153a927d109b3525bd3ecb35ef55d089cbf068c8c99f2","observation_id":"27f1c76d-ff1a-4e88-8ad1-c1d3a444e8f6","resolution":{"observed_at":"2026-08-14T13:43:41.892658Z","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-14T13:43:41.898117Z","title":"CAnDL: A Domain Specific Language for Compiler Analysis,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.898117Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:9bbbdb9bdd4b999b713d8b49117a05b491b65e9fd103bc9eecd7d08050dd4889","observation_id":"9b10e8af-d74c-49fe-81e9-1cdf6f016ea9","resolution":{"observed_at":"2026-08-14T13:43:41.898117Z","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-14T13:43:43.904260Z","title":"XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networks,","venue":null,"work_id":"9a616da2-3a7a-41e6-88e2-0dde53011ab8","year":2016},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.903534Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:3d931716c522827853529f0d61f26863c996d8aa0e9547091ab63bfcfa95f394","observation_id":"e27e3a02-4bc7-4751-94aa-f0de1527d6e1","resolution":{"observed_at":"2026-08-14T13:43:43.910402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:43.883972Z","title":"You Only Look Once: Unified, Real-Time Object Detection,","venue":null,"work_id":"2bb64422-765f-4caa-ac29-e1ec92a8ee3c","year":2016},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.909587Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:a36ced89e1844797d0054099a42f80616e09bbd0cf1a023c69ebf4dead829507","observation_id":"7406dfd0-c326-4712-a843-0031eb86b36f","resolution":{"observed_at":"2026-08-14T13:43:43.890680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:43.858064Z","title":"YOLO9000: Better, Faster, Stronger,","venue":null,"work_id":"57b8178c-541e-4d7f-abe5-786ffcb61217","year":2017},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.915528Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:53d21bb93a2dd45138712b444755de87e1728a6e02388b36853b808095dab370","observation_id":"26d7247b-6548-4d5e-ae9c-7fd4f7fb7bd3","resolution":{"observed_at":"2026-08-14T13:43:43.867406Z","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:43:41.922303Z","title":"CLBlast: A Tuned OpenCL BLAS Library,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.922303Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:f5935ee69fbfe69146d75b3deff6184e14bb5c5e3ef19703e358c5f84db45fa4","observation_id":"8ae485ea-ddef-432d-867e-ee39fa01fb6e","resolution":{"observed_at":"2026-08-14T13:43:41.922303Z","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-14T13:43:43.836515Z","title":"Characterising across-stack optimisations for deep convolutional neural networks,","venue":null,"work_id":"8ff50e45-e70c-4233-9c07-51f31b72617a","year":2018},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.928383Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:ab5b3d6645a3276dc8b62b0e3c0fc4af4ef6f661010564d6a3a118d1ea96590e","observation_id":"c52fc658-7dcd-4a0d-a145-dfa1f4841532","resolution":{"observed_at":"2026-08-14T13:43:43.842913Z","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:43:41.935606Z","title":"Synthesis of Loop-free Programs,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.935606Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:7555d55d5d537ffbfc7066a4744b3ec488fc3ee9518df1ef3b13aca4de01464a","observation_id":"0ab6084a-4f67-4bc5-9c17-850640e19f9c","resolution":{"observed_at":"2026-08-14T13:43:41.935606Z","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-14T13:43:43.816940Z","title":"Stochastic Superoptimization,","venue":null,"work_id":"7142e506-8255-4a1d-906c-f40c4b5f544f","year":2013},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.941439Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:66bdf361a0bfa0746447b250e174fde89d855e78ec0f68f2d8d5e4d8f2749654","observation_id":"d6dbf0b4-bf53-4c38-9b6a-303a449fbe0d","resolution":{"observed_at":"2026-08-14T13:43:43.822400Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.10665","last_updated":"2018-11-26T19:51:27Z","snapshot_observed_at":"2026-08-14T17:53:03.675682Z","submitted_at":"2018-11-26T19:51:27Z","title":"Stepping Stones to Inductive Synthesis of Low-Level Looping Programs","version":1},"cited_work":{"arxiv_id":"1811.10665","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.10665","snapshot_observed_at":"2026-08-14T13:43:43.033994Z","title":"Stepping Stones to Inductive Synthesis of Low-Level Looping Programs","venue":"cs.AI","work_id":"5a25719d-8958-4793-8684-f3b922f841e1","year":2018},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.953452Z"},"links":{"cited_paper":"/paper/1811.10665","citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:b1b5fd7e044a8f1d4fb2f8401d1136af02ef477fd9e217e4954a3e4a955a33e4","observation_id":"3334abd8-0aaf-4ece-8938-a3d67ac56d32","resolution":{"observed_at":"2026-08-14T13:43:43.042230Z","resolver_source":"local_arxiv","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:43:43.798360Z","title":"The role of refactorings in api evolu- tion,","venue":null,"work_id":"b6884bae-a2df-461e-8b1c-ddce5f421e1d","year":2005},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.959074Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:16c4207cd6808e386d1e59006eec6ce64f35280a186a13593adaeba4d71e2260","observation_id":"4d35c9d9-1162-4733-aee5-70e4502b0d67","resolution":{"observed_at":"2026-08-14T13:43:43.804188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:43.771018Z","title":"How are java software developers using the elipse ide?","venue":null,"work_id":"2b42aafd-918e-43d1-b354-b7051e1ff64d","year":2006},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.964324Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:5da9c71aebfff9223a4d77d4e31b18ed164b2afa127f5ea39909ef4d9e8d7af2","observation_id":"3b6a8954-d827-4239-9742-375cd02c4550","resolution":{"observed_at":"2026-08-14T13:43:43.784430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:43.748539Z","title":"Catchup! capturing and replaying refactorings to support api evolution,","venue":null,"work_id":"06bd846d-0f45-4568-b464-a88dbd78a968","year":2005},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.970013Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:a4602779f274824ca9b79692e8060c14f713149b2d9f6a217d7da5e98e72f42f","observation_id":"b2be23ba-53d2-40c7-bb39-a35108ab9943","resolution":{"observed_at":"2026-08-14T13:43:43.754467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:43.719793Z","title":"Apidiff: Detecting api breaking changes,","venue":null,"work_id":"d00e576b-98f3-4451-a890-3973add8e2c3","year":2018},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.975013Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:99e06552e36fff5736105d7e0e52a6d9c108986cd434eb3e818661d05b32a4e8","observation_id":"3fdb4b39-4b0a-4003-8d7a-4066d907d10e","resolution":{"observed_at":"2026-08-14T13:43:43.728686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:43.698570Z","title":"The Sketching Approach to Program Synthesis,","venue":null,"work_id":"e775d371-2e9c-4de3-a6ee-4bcab4cb869d","year":2009},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.980231Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:1480d1070f3d730011efb6c01c2b6cfc4806960d10cd51079d40ff794bf2c28a","observation_id":"80f4eef9-529f-4d11-bd41-666e2cb739d1","resolution":{"observed_at":"2026-08-14T13:43:43.707621Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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:43:43.679040Z","title":"Synthesis of Recursive ADT Transformations from Reusable Templates,","venue":null,"work_id":"150c0ec1-6244-426f-ac02-484fa7644cd3","year":2017},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.985298Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:926649f1de479cb028931ce968ddc1aaec5484dc0d006f80d654a0053d8c92bb","observation_id":"109e9ca6-a281-49a1-87ab-aa3937590b1f","resolution":{"observed_at":"2026-08-14T13:43:43.686602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:43:43.654887Z","title":"Modular Synthesis of Sketches Using Models,","venue":null,"work_id":"7cc5ff34-4d61-4bab-942d-10b2ffa32de3","year":2014},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.992525Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:4d49f89c06918a0ed68644c781fab9f2e4278d6d5df29ac70c63489be1d40dba","observation_id":"283c32aa-7dc8-4907-8ead-794cf93f6978","resolution":{"observed_at":"2026-08-14T13:43:43.664574Z","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:43:41.999060Z","title":"Synthesizing Highly Expressive SQL Queries from Input-output Examples,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.999060Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:d4eb55a0dd156875f7779700fdbb2602918a624e92319b01c6c2a57aafcb88cd","observation_id":"8a36320f-8fcd-4a06-973c-19e89f72f7b7","resolution":{"observed_at":"2026-08-14T13:43:41.999060Z","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-14T13:43:42.010119Z","title":"Test-driven Synthesis,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.010119Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:739b7a8c582587a6e1731f647adef9ba39da785f6fa283f84c8dc3d0c302eda4","observation_id":"6a74dca2-352e-46ce-ab4b-e30504717a17","resolution":{"observed_at":"2026-08-14T13:43:42.010119Z","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-14T13:43:42.016220Z","title":"Synthesizing Data Structure Transformations from Input-output Examples,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.016220Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:3e506c41800c8b0c21a541ec5e7e9c4151ef9500e5ef1c6183801373f2edb3db","observation_id":"973b746d-ff0f-4404-ab52-86a643ac40b9","resolution":{"observed_at":"2026-08-14T13:43:42.016220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.04422","last_updated":"2018-04-06T01:50:19Z","snapshot_observed_at":"2026-08-14T20:14:25.738420Z","submitted_at":"2017-11-13T05:01:56Z","title":"Souper: A Synthesizing Superoptimizer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.04422","snapshot_observed_at":"2026-08-14T13:43:42.022654Z","title":"Souper: A Synthesizing Superoptimizer,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.022654Z"},"links":{"cited_paper":"/paper/1711.04422","citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:7c1df98c9c88dfef4e6946dee0f685639e83f15121e2cb96d0454c4104a0b32c","observation_id":"b0e5e2ec-0b3e-4622-ae59-6beb5ec0a8d0","resolution":{"observed_at":"2026-08-14T13:43:42.022654Z","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-14T13:43:42.028592Z","title":"Automating String Processing in Spreadsheets Using Input- output Examples,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.028592Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:e622db93eb5561d14f6b0f075afcfa8fc03b2d4576db766ddcaec6938324984b","observation_id":"01a630db-83f8-47f8-b348-2d74093b6b74","resolution":{"observed_at":"2026-08-14T13:43:42.028592Z","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-14T13:43:42.034662Z","title":"Synthesis of Machine Code from Semantics,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.034662Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:50d9661d81738671a30f7fb67cd23c97a4779dfba18a3cbf97adbb35b397783e","observation_id":"96e2fb04-b4ea-49a3-a15d-a614e261919a","resolution":{"observed_at":"2026-08-14T13:43:42.034662Z","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-14T13:43:42.047807Z","title":"Checking Correctness of Code Generator Architecture Specifications,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.047807Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:29c00d8979a27d7315ea6cf92016055cabe1122944b39ae05585f3ef645609fa","observation_id":"a5451e44-4555-48e6-864f-b716e6851a23","resolution":{"observed_at":"2026-08-14T13:43:42.047807Z","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-14T13:43:42.059662Z","title":"Gradual Synthesis for Static Parallelization of Single-pass Array-processing Programs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.059662Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:290c0618185fd7ad84a881af2531f48a8b587f08d8fde3c10836ec22923593dc","observation_id":"10ee8287-324e-4838-ab46-af17de040471","resolution":{"observed_at":"2026-08-14T13:43:42.059662Z","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-14T13:43:43.631775Z","title":"Helium: Lifting high-performance stencil kernels from stripped x86 binaries to halide dsl code,","venue":null,"work_id":"cb1ccf1d-5d8f-4c36-a628-8c1918b04531","year":2015},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.065378Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:acb6e0ab8d9c4f6f6166cc3f459be13c140594a192427dc63c0ebc6a5a42865b","observation_id":"f082ca72-d9f8-4956-a4cd-cb732588db45","resolution":{"observed_at":"2026-08-14T13:43:43.637782Z","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:43:42.072452Z","title":"Halide: A Language and Compiler for Optimizing Parallelism, Locality, and Recomputation in Image Processing Pipelines,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.072452Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:b00c6a2190f67f141bfd7084e798abf4b55517be7be42109b8a9fac5f5125a81","observation_id":"5cecaa40-cd19-4026-8114-9139f004bb7c","resolution":{"observed_at":"2026-08-14T13:43:42.072452Z","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-14T13:43:42.078057Z","title":"Verified Lifting of Stencil Computations,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.078057Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:bccb2719e7266f405753a620f81b742c54c217a3c23175cb5724b4687e28b824","observation_id":"67a3e45c-1ee7-42db-ba79-7969b9a1ff28","resolution":{"observed_at":"2026-08-14T13:43:42.078057Z","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-14T13:43:42.083580Z","title":"Type-and-example-directed Program Synthesis,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.083580Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:7935e00e2dfb5376b37ddd7035152db525ef90732e270f7bb4f030f04f84301c","observation_id":"25f322b2-8f24-4b92-94d8-9a3704131f49","resolution":{"observed_at":"2026-08-14T13:43:42.083580Z","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-14T13:43:42.088829Z","title":"Program Synthesis from Polymorphic Refinement Types,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:42.088829Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:f73b84ac09177258b9c32be2369f6603f3d74ef509bbbd86de74db13d2676278","observation_id":"9264b93d-66f6-4c6b-9406-8ce0ef8def05","resolution":{"observed_at":"2026-08-14T13:43:42.088829Z","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-14T13:43:41.947939Z","title":"Available: http://doi.acm.org/10.1145/2451116.2451150","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":316,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.947939Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:a3f30c478a2425ebb6be9864583585d71eb61b078e74359c616ee8f1185d62a5","observation_id":"4a0c6e54-aef3-4076-8f8c-897bd6610e81","resolution":{"observed_at":"2026-08-14T13:43:41.947939Z","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-14T13:43:43.949521Z","title":"Available: http://www.sciencedirect.com/science/article/ pii/S0010465510001438","venue":null,"work_id":"72a3a375-4abc-46fa-b7f2-b988e18cc9c4","year":null},"citing_paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability","version":3},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-14T13:43:41.866791Z"},"links":{"citing_paper":"/paper/1908.04546"},"observation_digest":"sha256:fc6bd8385636ea2ebff8a77085f4137e3fc0e35ba0c0edb12bc3e529978cdf2c","observation_id":"92777001-34f1-4bfa-b6b2-ae8233476564","resolution":{"observed_at":"2026-08-14T13:43:43.955641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.04546","last_updated":"2019-08-22T17:06:48Z","latest_version":3,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-16T14:36:56.225016Z","submitted_at":"2019-08-13T08:58:44Z","title":"Type-Directed Program Synthesis and Constraint Generation for Library Portability"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":45},"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 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:1908.04546."}