{"as_of":"2026-08-08T21:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c90bd7d4d49cdb9f7ba9bac4ad2b1183fc113a117d8c086a3b0b95db022930bf","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T22:22:57.678463Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2605.26072/citation-record","integrity":"/paper/2605.26072/integrity","json":"/paper/2605.26072/citation-record.json","paper":"/paper/2605.26072"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T22:22:57.678463Z","title":"Guest editorial annotation-efficient deep learning: the holy grail of medical imaging.IEEE transactions on medical imaging, 40(10):2526–2533, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:64850f878025ff0bdb42ee93538515f204e5ea628156c12d98b7272b2e1a85ac","observation_id":"d50cab70-9d33-4c6c-a80b-d651288ff78f","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"N segment: Label-specific deformations for remote sensing image segmentation.IEEE Geoscience and Remote Sensing Letters, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:a1e9dbbd1231f6ea2d64f90014d56e7b5e09b465ce3117eae1a33b02a7e9ea54","observation_id":"3e2000e6-ece7-400e-aa22-a5c7c87db3cd","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Batched bayesian optimization for drug design in noisy environments.Journal of Chemical Information and Modeling, 62(17):3970–3981, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:8ff0bfc775aab29b3efebaf81798fd2c9eeb3c763c398c745171847ab926891a","observation_id":"ee4ebc87-0255-4393-8143-8863439b02a7","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"A comprehensive benchmark of active learning strategies with automl for small-sample regression in materials science.Scientific Reports, 15(1):37167, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:3fb098f72f4fa6b12bafd575b19e9900aeff7bc69e751768ebccb0cc0b644a2b","observation_id":"2435655f-a25d-4890-964a-b28c73b2c522","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Active learning literature survey","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:7666ec8c007c9ea69d6e385803532bb77d15cc6cc0491c4f62d1059e2148a463","observation_id":"71ab0de7-0a95-48d6-98db-4a6f9d9cbdad","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Active learning on medical image","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:64282d59a044b03d7c1dee307df3ffb5b91732f03c492c44c4ff1120656b8f6e","observation_id":"91513be5-9fb5-4d95-a7e2-c19206cf65d2","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Active learning in the drug discovery process.Advances in Neural information processing systems, 14, 2001","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:e4625ca730a660128e0717f7961a1800ab9e2eee956715d490f4901690c0ab44","observation_id":"c1ac9f4b-fa47-4693-bdb8-c108fb8e885d","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Active learning via query synthesis and nearest neighbour search.Neurocomputing, 147:426–434, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:360d10812380e46ad02712c7218e653b076ade9352d93552f504e4d25d4e7d66","observation_id":"2ec24375-ffd0-492f-ada6-263bc42d93d2","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Active preference-based learning of reward functions","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:19dae7b2023510229f567076ffbcf599cc5654d40bebdaf8b00b90baf09ec236","observation_id":"c72b0df1-0774-4943-ac09-398263029195","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Preference learning with gaussian processes","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:6784ba657c1f417e5e741406afc37c8ae6e97b4d1a48971a7f8ddb6426d0362b","observation_id":"585750b5-319d-4200-9b56-89c4967fd404","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"London, 1963","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:adec1d409bd85c8b7033be3f92949fbf98bf69f490383ace25f75c541185757f","observation_id":"64b2199c-628d-43e1-83fc-60c2112d0721","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Random search for hyper-parameter optimization.Journal of machine learning research, 13(2), 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:e39d04b1f6a5327fddcd0bbb17e1ec838f839a8bdf33f4be3e47f78335f36f7d","observation_id":"2cccb195-9953-4d62-b942-40907d6b90e6","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Learn- ing controller gains on bipedal walking robots via user preferences","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:0e00e1d48ddf8fa584ffa18b88ed116394ec2b538ab1dc679b0c4fb6eb0d6b61","observation_id":"72895d34-54de-47a6-8a35-e945bbcb3003","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Psychological scaling without a unit of measurement.Psychological review, 57(3):145, 1950","venue":null,"work_id":null,"year":1950},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:bc02d3cdc562e84a69774e6f043e6ee1de0f520b78f7a1d2c151494c42259fcf","observation_id":"69eca457-fa48-437d-bcf5-a6ee1c5c4ce2","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Rank analysis of incomplete block designs: I","venue":null,"work_id":null,"year":1952},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:2561fb32548533303bbbfd4efd1a4bd8bf10798e2c253cbcaf6a99a9a2aac0d5","observation_id":"f9e9a002-6cfb-4b79-9f4e-b45d1d082184","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Active embedding search via noisy paired comparisons","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:66c4cf6f05b58c914792709a87b7612e305905b4550807c939aaf0f6298e598a","observation_id":"fcdbec2f-1c84-4d5e-ad84-e21a15c9e289","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Scalable and efficient comparison-based search without features","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:be951f10b59a01a1e40a18f17d2fc30f8154c487a98167f49a920a6cb7c4bd46","observation_id":"00348327-b862-45ca-916d-8978e6cafd55","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Preference-based learning for exoskeleton gait optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:0346c4478e3904eed269379577a62852f843346c25b591964506b78b79aab324","observation_id":"cbd6720c-1a7b-454c-a9f5-d2cd3f6b59b4","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Roial: Region of interest active learning for char- acterizing exoskeleton gait preference landscapes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:ecf99c63da1a3188951f98b34e6b3136c77a309cb9ab301daeed05d21dba7a7a","observation_id":"97fd49aa-033b-4782-a037-b61983c3ae85","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.04365","last_updated":"2019-10-10T04:52:46Z","snapshot_observed_at":"2026-07-06T08:28:19.995224Z","submitted_at":"2019-10-10T04:52:46Z","title":"Asking Easy Questions: A User-Friendly Approach to Active Reward Learning","version":1},"cited_work":{"arxiv_id":"1910.04365","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1910.04365","snapshot_observed_at":"2026-06-29T22:23:59.907519Z","title":"Asking easy questions: A user-friendly approach to active reward learning.arXiv preprint arXiv:1910.04365, 2019","venue":null,"work_id":"1eb07b44-df1d-4f66-ba33-986c8e8daec0","year":1910},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"cited_paper":"/paper/1910.04365","citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:06c62c477f486f17cbd21612b11aa3e6c2dcffca8bac8c233c6b12f784b0b3fa","observation_id":"74ad3bf9-15d1-4186-9e3b-a2a92d82de0a","resolution":{"observed_at":"2026-06-29T22:23:59.910295Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-29T22:22:57.678463Z","title":"A bayesian interactive optimiza- tion approach to procedural animation design","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:da7c1ab4fdb3338bee7d811a205ca7b5658817d36b0c67791d1bd0012eafe15c","observation_id":"9be3ff1e-a4e7-4a55-8ac9-be686bbe2ef2","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Preferential bayesian optimization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:8b892dfb5bd4e1be662a9749ffaee46fc99ea16c5c58d8eef61432f08d703798","observation_id":"165ee363-e33d-4a5d-9df5-4cec122c4b81","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Batch active preference-based learning of reward functions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:77d4c39e63a5af78b8f3aa8747ed542f9700fe55bc16e85ce9e582577e8bdeb8","observation_id":"53412140-e86a-4a85-a1af-b8ff8d84577e","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Human-in-the-loop controller tuning using preferential bayesian optimization.IFAC-PapersOnLine, 58(14):13–18, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:a5613ace5bbd4067a442ba4982cbe0503232c1bd2e58a4a849a2b3773d0fdf7e","observation_id":"cd5337cc-7fcb-4314-b694-f996ee23c3f4","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Safe controller optimization for quadrotors with gaussian processes","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:fb2ee8b1a0aa8cde68e5ef5afe31741f162ac47a06bea858572da15ea61cff17","observation_id":"284f8fc2-675d-4ba5-aaaa-40e90fe63df4","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Virtual vs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:f00aadb066e4f957866731d40909c9d6206c19234466416fdb5c966ea8cae41d","observation_id":"14040520-afb9-4519-9249-7b1df38e2ac3","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Active heteroscedastic regres- sion","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:5d9b84e3ea125b380feba42814132fd7f653ab4f353571921b36ad873ac68f94","observation_id":"12ccbd64-3674-490a-9595-b0a13a2b377a","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Near optimal het- eroscedastic regression with symbiotic learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:d413a1cb2dc46456349523c1b42c514cfa829db96bccc5c0eface78eb8aedd51","observation_id":"5d5fa7b6-a836-4ce4-964a-3c53756f2123","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Learning to summarize with human feedback","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:b57381336fd1d252883994c940a507aaf443b3adf651373477b9ee151bdfa5d2","observation_id":"e7d637a2-441f-4d12-aa93-281c2cbf8b58","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05133","last_updated":"2024-12-09T04:21:08Z","snapshot_observed_at":"2026-08-06T13:42:00.057517Z","submitted_at":"2024-02-06T04:18:58Z","title":"Personalized Language Modeling from Personalized Human Feedback","version":3},"cited_work":{"arxiv_id":"2402.05133","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.05133","snapshot_observed_at":"2026-07-03T20:58:57.654015Z","title":"Personalized language modeling from personalized human feedback","venue":null,"work_id":"b2db2be6-d18c-41ea-b9ed-10d51ab56e53","year":2024},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"cited_paper":"/paper/2402.05133","citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:3fb6a30a0067718641306cc2227b6492f36d82bcdd0d7b71d9bdab8d1b983d02","observation_id":"8e00764b-a21e-4ace-9ef5-7a0157ab1f57","resolution":{"observed_at":"2026-06-29T22:23:59.906280Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-29T22:22:57.678463Z","title":"Pal: Sample- efficient personalized reward modeling for pluralistic alignment","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:95dc6f4b7cf164e11edcef497511993f116aa9357c3724766dd0a08cece4d3be","observation_id":"158651c8-5718-4b83-8317-86e703fe2b60","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.01068","last_updated":"2022-06-21T17:04:40Z","snapshot_observed_at":"2026-08-06T03:13:37.403059Z","submitted_at":"2022-05-02T17:49:50Z","title":"OPT: Open Pre-trained Transformer Language Models","version":4},"cited_work":{"arxiv_id":"2205.01068","doi":"10.48550/arxiv.2205.01068","metadata_source":"pith","pith_arxiv_id":"2205.01068","snapshot_observed_at":"2026-07-11T03:37:45.880117Z","title":"OPT: Open Pre-trained Transformer Language Models","venue":"cs.CL","work_id":"d7ff3b21-1fff-4cf4-952a-4714e3ef2307","year":2022},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"cited_paper":"/paper/2205.01068","citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:3f07381a7dc4da8ce919bc6987188ce9fc2290033a462bbc4ace58b508e17446","observation_id":"afe5303e-bcd9-4815-87d9-25b06e769aac","resolution":{"observed_at":"2026-06-29T22:23:59.903947Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-05-25T10:53:17.026227+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T10:53:17.026227+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+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-06-29T22:22:57.678463Z","title":"A stable track- ing control method for an autonomous mobile robot","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:206435bebbc38e1875f6c0704b128465ae30b009c8c095624aa7717ca052a4b9","observation_id":"59949d59-dc91-46b3-b28a-a0f7f9eb8eb4","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"The bernstein polynomial basis: A centennial retrospective.Computer Aided Geometric Design, 29(6):379–419, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:26a379f18be82551ed9dfd9aea5de2bcd4dff461f507870239cb5be29832b335","observation_id":"5e0e2764-49fd-49a4-9ee1-356ca835a9ac","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"Stan: A probabilistic programming language.Journal of statistical software, 76:1–32, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:7f5d814f43cbad602e987ce24eba8dee24a60abe52af7bae5e80932a610d829d","observation_id":"8767f07c-aff2-4ff1-a21f-b16209315981","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","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-06-29T22:22:57.678463Z","title":"A is better than B","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-29T22:22:57.678463Z"},"links":{"citing_paper":"/paper/2605.26072"},"observation_digest":"sha256:2fcf99dfce56ffcbfe164f424b908c3c13ab83878bb75ba0f79d38c528ba7213","observation_id":"6c723ec6-43ee-4594-84bf-0f959b676e0d","resolution":{"observed_at":"2026-06-29T22:22:57.678463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.26072","last_updated":"2026-05-25T17:37:58Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T02:54:00.412469Z","submitted_at":"2026-05-25T17:37:58Z","title":"Active Query Synthesis for Preference Learning"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":33,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":36},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2605.26072."}