Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity | Paper Citation Record

Observation b1a4a252-3cc1-403f-b259-f57f837812d4 · outbound

This paper cites and Mehrotra, Anay and Zampetakis, Manolis , TITLE =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity and Mehrotra, Anay and Zampetakis, Manolis , TITLE =

Reference 1

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5d50f2af-26a9-4e81-b885-1a75be8d52ac · outbound

This paper cites 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a0302f93-d1e4-47a3-8d60-881666d543c5 · outbound

This paper cites Course notes: http://www.sumofsquares.org/public/index.html , volume=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Course notes: http://www.sumofsquares.org/public/index.html , volume=

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 756c2eb7-8629-4c48-9971-97c739607aba · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 72f0bdb2-f8e7-4491-947c-bdaf32867d07 · outbound

This paper cites and Mehrotra, Anay and Zampetakis, Manolis , title =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity and Mehrotra, Anay and Zampetakis, Manolis , title =

Reference 5

Resolution: verified exact; arxiv_id, observed 2026-06-26T01:58:53.677578Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 0e27c0a2-d050-4706-88f1-b918bf8802e3 · outbound

This paper cites Breakthroughs in statistics: Methodology and distribution , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Breakthroughs in statistics: Methodology and distribution , pages=

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 52cdcfb6-6f0a-4beb-b144-a46336daec0b · outbound

This paper cites Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 295800c2-b780-4f48-a4ef-d9405780ff53 · outbound

This paper cites Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Proceedings of the 56th Annual ACM Symposium on Theory of Computing , pages=

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9a148499-cd18-41c9-be02-6b21eb42d5e5 · outbound

This paper cites Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages=

Reference 9

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1c54b50-6ca6-4384-9dca-eff3095e898a · outbound

This paper cites Proceedings of The 28th International Conference on Artificial Intelligence and Statistics , pages =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Proceedings of The 28th International Conference on Artificial Intelligence and Statistics , pages =

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68d0fc86-930d-4d78-b936-5251e2541ff1 · outbound

This paper cites Private Statistical Estimation via Truncation , volume =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Private Statistical Estimation via Truncation , volume =

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7faf4c16-e0dc-4dc0-a593-e27e9df1d137 · outbound

This paper cites Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing , pages=

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9fa58056-cdd8-492a-907b-726b031da8f1 · outbound

This paper cites Conference on Learning Theory , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Conference on Learning Theory , pages=

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b738c92d-56b1-4329-922c-0eae828d4f74 · outbound

This paper cites Conference on Learning Theory , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Conference on Learning Theory , pages=

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b5c9cfb-368c-43c8-afb9-884daa265188 · outbound

This paper cites 2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity 2010 IEEE 51st Annual Symposium on Foundations of Computer Science , pages=

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4f576a32-64e0-4913-92c9-67dac3a667bc · outbound

This paper cites Philosophical Transactions of the Royal Society of London.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Philosophical Transactions of the Royal Society of London

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 322ff611-58e7-49da-ada5-e00bd05d2000 · outbound

This paper cites 2016 , month = dec, note =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity 2016 , month = dec, note =

Reference 17

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ffbe967-9a10-44a1-84d7-0a2799c05a19 · outbound

This paper cites 2008 49th Annual IEEE Symposium on Foundations of Computer Science , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity 2008 49th Annual IEEE Symposium on Foundations of Computer Science , pages=

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b3d8bcb7-4d71-491b-a4b6-da10aed1cbd7 · outbound

This paper cites The Thirty Seventh Annual Conference on Learning Theory , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity The Thirty Seventh Annual Conference on Learning Theory , pages=

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c42c85c-4cd0-4b3f-9475-2a451a7c80ce · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b67c100-6a3d-425e-b6a0-230d7b10da79 · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 21

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4911ed89-9b1a-465b-adfc-c83d83c52b6e · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 22

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 883f5d95-6ea9-4774-af95-c343bdf11763 · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4c60e0a5-31b7-48c9-8bd4-98af03b450cf · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5be2b2de-ef33-4b3c-ad9d-31666060bde4 · outbound

This paper cites 2018 , publisher=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity 2018 , publisher=

Reference 25

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 192944dd-50fe-433b-916b-5420cba6a29a · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 26

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 90a6d5f7-6563-41c8-944f-6f7bd1309927 · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33a95949-3e33-42de-af1e-08a3eef16079 · outbound

This paper cites Proceedings of the 2024.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Proceedings of the 2024

Reference 28

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 482b6a57-bace-43a1-9159-10d8688ceeff · outbound

This paper cites Tony and Zhang, Cun-Hui and Zhou, Harrison H.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Tony and Zhang, Cun-Hui and Zhou, Harrison H

Reference 29

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12d8a7f2-cc58-4a0d-8466-370e5da4c275 · outbound

This paper cites and Lim, Lek-Heng , TITLE =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity and Lim, Lek-Heng , TITLE =

Reference 30

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa738f5b-a965-4cb9-82e6-c7e5fdb514c0 · outbound

This paper cites and Steinhardt, Jacob and Steurer, David , TITLE =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity and Steinhardt, Jacob and Steurer, David , TITLE =

Reference 31

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 41c12fe0-e7e3-4088-9135-1bd8ed793278 · outbound

This paper cites and Pensia, Ankit and Tiegel, Stefan , TITLE =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity and Pensia, Ankit and Tiegel, Stefan , TITLE =

Reference 32

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ebc82b8e-3e32-402b-9f01-74ea56623718 · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 33

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f3f380c-d047-4fa8-bd32-ef2aa8d24e0f · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 34

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3d12dc10-50c0-46a0-8577-f2344345d701 · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 35

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7fdc6ae3-02ae-4fcb-9193-3a58541b4f5b · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 36

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation acb1c5dd-7989-443e-a99c-c312a6de462a · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 37

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 76880876-f169-4d3b-9c69-86df775c7fad · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 38

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1965024-eba0-4252-8657-6e8444e706a3 · outbound

This paper cites Histoire de l'Acad., Roy.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Histoire de l'Acad., Roy

Reference 39

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29b62605-d1e8-4470-b77d-c3771c5e1efc · outbound

This paper cites Proceedings of the Royal Society of London , volume =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Proceedings of the Royal Society of London , volume =

Reference 40

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 26581a4a-6929-47d1-bce6-2b2835e7e0a4 · outbound

This paper cites Biometrika , volume =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Biometrika , volume =

Reference 41

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed8ab186-be0f-435f-8415-a7ffb0acc8b8 · outbound

This paper cites Biometrika , volume =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Biometrika , volume =

Reference 42

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ef1c10e-5bd9-497f-8b66-3a610dc9f9ce · outbound

This paper cites Biometrika , volume =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Biometrika , volume =

Reference 43

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ff079d9-8b0d-4710-969a-bc4840981e29 · outbound

This paper cites Introduction to British A.A.S.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Introduction to British A.A.S

Reference 44

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64ca3998-9dc9-4670-9686-9a64efa81810 · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 45

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 691d1da8-2bd9-4152-90ec-7f4ce01b71d1 · outbound

This paper cites Clifford , TITLE =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Clifford , TITLE =

Reference 46

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b672a2b0-6759-4985-8a84-778a1bb632c2 · outbound

This paper cites Proceedings of the 2025.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Proceedings of the 2025

Reference 47

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b8d1d58c-d7fe-41c3-80f5-9b0aa6f6b087 · outbound

This paper cites The Thirteenth International Conference on Learning Representations , YEAR =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity The Thirteenth International Conference on Learning Representations , YEAR =

Reference 48

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82d2b519-f2a2-45cb-bd69-ca2ef53ecd4c · outbound

This paper cites 2023 , publisher=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity 2023 , publisher=

Reference 49

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 640aaa39-b74a-4c1a-992b-5d40fbd34372 · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 50

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 36dd4313-9ddf-4452-8e49-56f68135cc23 · outbound

This paper cites (Lecture Notes), Cambridge, MA, USA: MIT Open-CourseWare , year=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity (Lecture Notes), Cambridge, MA, USA: MIT Open-CourseWare , year=

Reference 51

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f2da530e-ee65-4058-adfe-da7d9329af0e · outbound

This paper cites 2023 , pages=.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity 2023 , pages=

Reference 52

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d40c1efa-14b8-4d9a-a864-e981efc07c44 · outbound

This paper cites 1997 , PAGES =.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity 1997 , PAGES =

Reference 53

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b66730f7-8f98-4630-a269-d7e229ad9e81 · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 54

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 338302ab-3d28-4ca9-9600-71f3a2037040 · outbound

This paper cites explanatory.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity explanatory

Reference 55

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c5e2d4f-1748-4ff6-94c7-6837d0cfd9ad · outbound

This paper cites an unresolved cited work.

Fast algorithms for learning a Gaussian under halfspace truncation with optimal sample complexity Unresolved cited work

Reference 56

Resolution: unresolved; no resolver link, observed 2026-06-26T01:58:23.544463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers