{"as_of":"2026-08-20T04:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c3475fba9d62927a961a397966d9d9ed1de1d91d914811042c904ecad6fb72c","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:47:21.524163Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2510.24380/citation-record","integrity":"/paper/2510.24380/integrity","json":"/paper/2510.24380/citation-record.json","paper":"/paper/2510.24380"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T15:47:21.441804Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.441804Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:1aa09e433e698a59fe0922ae05e4bd566464dc9d7d7ced30ec4a78637da627ec","observation_id":"13dc0a12-2910-4166-a417-83761033095e","resolution":{"observed_at":"2026-08-15T15:47:21.441804Z","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-15T15:47:21.809655Z","title":"CCCL : CUDA C++ C ore L ibraries , 2023","venue":null,"work_id":"dfa4c2dd-2ea0-4a05-a148-7f762676d6fc","year":2023},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.446913Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:e79789689f886c9ace4f7a8be3bedae6a3c0c3da2a6fe4e7bc5ee253eb38f023","observation_id":"13df5228-b010-44d9-9e63-fb881c7b8b99","resolution":{"observed_at":"2026-08-15T15:47:21.813031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.799247Z","title":"A ``rule of three'' for fragment-based lead discovery? Drug Discovery Today, 8 0 (19): 0 876--877, 2003","venue":null,"work_id":"e9fbc5c2-0ba7-43dc-95cb-377b7297b731","year":2003},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.451607Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:330c6da3f61fed881de6976b5907bbf82a0767e2b6eefdda6db7420adffca22a","observation_id":"f513edc7-a2eb-4cdd-905a-bc32c298285f","resolution":{"observed_at":"2026-08-15T15:47:21.802949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.788831Z","title":"NGT : Generative AI with synthesizability guarantees discovers MC2R inhibitors from a tera-scale virtual screen","venue":null,"work_id":"e8964d96-f6ee-48c4-b5dc-e49ac9b5bd09","year":2024},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.455494Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:1ccd90a9ea0f67046f4a18673e7badd7b6813c3f3cb3609fd66eb89dbf7129ca","observation_id":"c55da11d-9303-4dac-a1d1-00695ce6628c","resolution":{"observed_at":"2026-08-15T15:47:21.792421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.778456Z","title":"On the art of compiling and using ``drug-like'' chemical fragment spaces","venue":null,"work_id":"09d8a074-8a64-43a7-8ff5-8a81c98c6b14","year":2008},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.459440Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:123cac99aae4e4f506e860fea0d0e4b35f26e010602dd591b2897bd796a0ec9d","observation_id":"0d2fadd8-1a20-47b3-b41c-229de69e815a","resolution":{"observed_at":"2026-08-15T15:47:21.782198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.768520Z","title":"DOCKSTRING : Easy molecular docking yields better benchmarks for ligand design","venue":null,"work_id":"702830fd-6a28-4038-8f5f-d7b12e90bfff","year":2022},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.463691Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:f2d75bf9d2cc77d4ac80dda5aa44c3acfcaac4256782f1e5ba2dca0b815f5239","observation_id":"359a6fce-8b9e-4809-9c6a-f9ec1838b4ae","resolution":{"observed_at":"2026-08-15T15:47:21.772072Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.758247Z","title":"Errors in variables and other unobservables","venue":null,"work_id":"6ce3c5c3-924c-4212-87d8-4f1980ce300e","year":1974},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.467510Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:5a80166f1ca9854794f7c8d86573a2b97f4249f7cc70f180b6846990004ffd80","observation_id":"885b8a46-799a-4b6f-a996-0f234bc5e634","resolution":{"observed_at":"2026-08-15T15:47:21.762048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.747826Z","title":"Physiochemical drug properties associated with in vivo toxicological outcomes","venue":null,"work_id":"97d4bee4-7f2e-4622-bc2e-53184548b2c8","year":2008},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.472194Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:ec8d774f33870153931c9e29b4c2e5ceb19bdfcdedff8741f7cafe16fbdb252f","observation_id":"8964ea2f-0004-4b60-a71f-ff7000986ebe","resolution":{"observed_at":"2026-08-15T15:47:21.751501Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.737387Z","title":"Thompson sampling: An efficient method for searching ultra-large synthesis on demand databases","venue":null,"work_id":"a3c642d6-1f54-4452-8229-5d95222517dc","year":2024},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.475508Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:37d2a8ec24eb24eaacb7c15215722bb5d2a12ebe5585095dd58d99104a7df352","observation_id":"83d06b26-8d1b-49b6-ba44-504086019e8e","resolution":{"observed_at":"2026-08-15T15:47:21.741079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.725608Z","title":"Experimental and computational approaches to estimate solubility and permeability in drug discovery and development settings","venue":null,"work_id":"89c5db58-49c6-4c9e-b35b-87c9d6a8ad2a","year":1997},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.479422Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:2446a2d1343c5da50b0f02b326636a852b44353e7c416f18c7b6ad8a55395bb0","observation_id":"7f923589-b2ad-4e4d-9646-436d3a47fa79","resolution":{"observed_at":"2026-08-15T15:47:21.729877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.714788Z","title":"CU ina: An efficient GPU implementation of A uto D ock V ina","venue":null,"work_id":"4812401d-8c86-4d2e-b623-bfed4de26b95","year":2020},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.483118Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:b341c659df60b0a5f528a051d93f184c99d740a1802b8c408ee0c3b592e3c3da","observation_id":"bb54e834-32d1-401f-98d9-b89926c027d3","resolution":{"observed_at":"2026-08-15T15:47:21.718873Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.703399Z","title":"An efficient graph generative model for navigating ultra-large combinatorial synthesis libraries","venue":null,"work_id":"38d0c4d6-a0ae-4357-8ed1-c14903b4f69a","year":2022},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.487141Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:5bc2e1a72b262d9746edd47d82d63699fb642f4e56942b875b7dc0a9dab7d4d2","observation_id":"b1e7e2ab-6e97-4d1a-85bc-ecbbe5bf060b","resolution":{"observed_at":"2026-08-15T15:47:21.707655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.691827Z","title":"Through the looking glass: Navigating in latent space to optimize over combinatorial synthesis libraries","venue":null,"work_id":"c8b5aa05-985c-4d31-af41-ee51919038bb","year":2023},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.492718Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:8e2f4f489b5142c05376a4d7687fb959e33fac76100051d8cae2168964f16f97","observation_id":"cdd30590-ea64-48d5-a74d-19c0ade5babe","resolution":{"observed_at":"2026-08-15T15:47:21.696116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.680708Z","title":"Synthon-based ligand discovery in virtual libraries of over 11 billion compounds","venue":null,"work_id":"132cf31e-7c9f-4c86-83dc-4f6a0ffded01","year":2022},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.496221Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:b0409b02b040f1c03d7b4f7ea13a7b7c2e73a419a0b34002b28bb008f7b19f5e","observation_id":"97d0bf20-e99f-4f0d-99c7-2ffff2577b87","resolution":{"observed_at":"2026-08-15T15:47:21.684700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.669148Z","title":"ZINC -22: A free multi-billion-scale database of tangible compounds for ligand discovery","venue":null,"work_id":"f9f35a13-28c2-4371-8051-1b306567c270","year":2023},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.499795Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:b3f6fff7db95788dedf2729df513c60fadb4f04f6710a19cdddd5654dfeaa92e","observation_id":"00778766-cdfb-4b2b-96fb-e19025b0d15a","resolution":{"observed_at":"2026-08-15T15:47:21.673275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.657657Z","title":"A uto D ock V ina: Improving the speed and accuracy of docking with a new scoring function, efficient optimization, and multithreading","venue":null,"work_id":"d7c5d8c7-7a4b-4d01-9730-6a379e2f9306","year":2010},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.503462Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:05773f008d8b1b76d4a6a49ea0a56f482c8ca59bce0b3b70da48c302fc642be1","observation_id":"f01954d0-518c-46e5-a73a-7f33a3ed506c","resolution":{"observed_at":"2026-08-15T15:47:21.661639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.643938Z","title":"Molecular properties that influence the oral bioavailability of drug candidates","venue":null,"work_id":"e3523cf4-199c-448d-8cfd-e36ca57a3eb0","year":2002},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.508260Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:979bfb558ac41b08c14867faa0376eb48601abf2fbee47a09cf9bc03d01af462","observation_id":"e4e8c830-e2ea-45a5-83a2-a0f90fbb1bdf","resolution":{"observed_at":"2026-08-15T15:47:21.650150Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T15:47:21.511826Z","title":"Parallel top-k algorithms on GPU : A comprehensive study and new methods","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.511826Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:bd3445847b3288f1a87e33407bdda05a49dc90faeb72f9e6cbce6d4a4459fa87","observation_id":"7baabda0-8f9d-4efd-8e8d-5ff324a164da","resolution":{"observed_at":"2026-08-15T15:47:21.511826Z","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-15T15:47:21.515286Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.515286Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:260c0aec55b141b947d1794fd93f1c4f7d172e543202c0a346dc6bb208f17924","observation_id":"4252df08-e506-4414-b3b0-f4a88a0340fb","resolution":{"observed_at":"2026-08-15T15:47:21.515286Z","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-15T15:47:21.520513Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.520513Z"},"links":{"citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:ee2e2ea0a469d543325cbeb04a6cc8f866d9a433287106c8157d25fecca0ce4e","observation_id":"1c8df1d6-11ad-4608-8123-9a0e8f8331c4","resolution":{"observed_at":"2026-08-15T15:47:21.520513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.07691","last_updated":"2024-08-24T01:05:42Z","snapshot_observed_at":"2026-08-04T17:19:56.776844Z","submitted_at":"2020-06-13T18:15:22Z","title":"Synthetic Interventions","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.07691","snapshot_observed_at":"2026-08-15T15:47:21.524163Z","title":"wO4ݾ8 3_F Ƞ+9 ut 70o J? n Z] 97NkҋY ol(E Կ8)[fl _ 9'8@ = b .&j (sG usa`o p8/vιnL?8y|ԋ Wm(p6.=?/ eP+jߏ3\\ Fۿq= z?x:DGݫm D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T15:47:21.524163Z"},"links":{"cited_paper":"/paper/2006.07691","citing_paper":"/paper/2510.24380"},"observation_digest":"sha256:1938c61918bca56a07a9043b3565db3355b942bebda725788d57180cf0508098","observation_id":"b4edff7e-cf67-4e46-8c71-9b908e949028","resolution":{"observed_at":"2026-08-15T15:47:21.524163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.24380","last_updated":"2026-07-06T13:25:03Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T21:37:52.952753Z","submitted_at":"2025-10-28T12:57:59Z","title":"APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":21},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2510.24380."}