{"as_of":"2026-08-15T13:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:69335640f7f6ea1285b4001a9d28be32d617906240a133e0149fa1bc320f74c4","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:48:52.403288Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T03:05:04.196270Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-15T03:09:44.071462Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"cited_work":{"arxiv_id":"2501.13959","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13959","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning an effective premise re- trieval model for efficient mathematical formalization.arXiv preprint arXiv:2501.13959","venue":null,"work_id":"226259c1-d503-4a84-921e-ace2e7cfe312","year":null},"citing_paper":{"arxiv_id":"2605.13137","last_updated":"2026-05-14T05:15:13Z","snapshot_observed_at":"2026-08-13T18:43:44.405835Z","submitted_at":"2026-05-13T08:04:57Z","title":"LeanSearch v2: Global Premise Retrieval for Lean 4 Theorem Proving","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-14T18:32:24.957899Z"},"links":{"cited_paper":"/paper/2501.13959","citing_paper":"/paper/2605.13137"},"observation_digest":"sha256:9b0f2b71c70ac16719bebd58767cd8558c62f94c737f9feb74466dd0bb321c75","observation_id":"21bbab78-48ea-4dd5-89dd-402d2e252c0f","resolution":{"observed_at":"2026-05-14T18:32:34.207696Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"cited_work":{"arxiv_id":"2501.13959","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.13959","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning an effective premise re- trieval model for efficient mathematical formalization.arXiv preprint arXiv:2501.13959","venue":null,"work_id":"226259c1-d503-4a84-921e-ace2e7cfe312","year":null},"citing_paper":{"arxiv_id":"2605.13137","last_updated":"2026-05-14T05:15:13Z","snapshot_observed_at":"2026-08-13T18:43:44.405835Z","submitted_at":"2026-05-13T08:04:57Z","title":"LeanSearch v2: Global Premise Retrieval for Lean 4 Theorem Proving","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-15T03:05:04.196270Z"},"links":{"cited_paper":"/paper/2501.13959","citing_paper":"/paper/2605.13137"},"observation_digest":"sha256:b20744b79c0f62c8f14ea8e10904b0b4015bfb3d1228ebae503a1bef0bfb036c","observation_id":"5ae5b4f7-d02c-4e3d-bafd-99021e55c86d","resolution":{"observed_at":"2026-05-15T03:09:44.077495Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.13959/citation-record","integrity":"/paper/2501.13959/integrity","json":"/paper/2501.13959/citation-record.json","paper":"/paper/2501.13959"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T17:48:52.278121Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.278121Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:9affabd23addc32816a5d90b27c30120dd7dfd87754b6a75e3bbf04ffefead29","observation_id":"1d0a9d0e-ce43-49c9-ad6d-65172c6a1f34","resolution":{"observed_at":"2026-08-10T17:48:52.278121Z","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-10T17:48:52.783211Z","title":"The Coq proof assistant reference manual: Version 6.1","venue":null,"work_id":"5030c213-d13f-4ef5-b990-328bce11fc52","year":1997},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.284198Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:c74d8fc6be2e8111bd2a729b0ee46f312b20083e8c4a869a4d699451658c1cff","observation_id":"f5af39e2-6ddc-42b2-a8fc-0ac293817f6b","resolution":{"observed_at":"2026-08-10T17:48:52.787110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.288269Z","title":"M 3-embedding: Multi-linguality, multi-functionality, multi-granularity text embeddings through self-knowledge distillation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.288269Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:b03e1b1c6473011b44a3d3b10d4a5b070d5163087cbc8f732f1caac6706c8bda","observation_id":"43bffa66-5150-4e75-a67b-531dc805e3cd","resolution":{"observed_at":"2026-08-10T17:48:52.288269Z","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-10T17:48:52.292293Z","title":"A simple framework for contrastive learning of visual representations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.292293Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:2f2a7ba22e188b9772d192fd7779d302cebb292cd631f9ae769af6184faed1f5","observation_id":"d48db010-cd81-428f-9e32-e50e4c78d546","resolution":{"observed_at":"2026-08-10T17:48:52.292293Z","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-10T17:48:52.761128Z","title":"The lean theorem prover (system description)","venue":null,"work_id":"fa6c1ffd-1df3-4f35-b611-b2e89638c933","year":2015},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.296656Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:49ce26245654120982622c84faddc0e85766dfc313f081d4444c314176f3fd71","observation_id":"e82938ec-4363-450d-bf44-b0c1d3d81c47","resolution":{"observed_at":"2026-08-10T17:48:52.765129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.300545Z","title":"BERT : Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.300545Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:1bf050a6a3b09c072bce9ac7996e73c17781d0e3245885978a8b8ed643f6390b","observation_id":"fb0befa1-af86-4178-97ab-522f776403c2","resolution":{"observed_at":"2026-08-10T17:48:52.300545Z","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-10T17:48:52.304822Z","title":"A semantic search engine for mathlib4","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.304822Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:33c73f05fa1d8ad79fefcbb6a1914c66fdfed92ac0a1322dc5dc1a1e1520f700","observation_id":"64225e05-a2cc-4769-9504-e94e50f621a1","resolution":{"observed_at":"2026-08-10T17:48:52.304822Z","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-10T17:48:52.309202Z","title":"U ni X coder: Unified cross-modal pre-training for code representation","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.309202Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:d2945aa7e31034c591935fe81d6214fa9398dc69ac232a88a2d8b1e27943a705","observation_id":"b5610de7-714d-4116-8e56-586513fc80c3","resolution":{"observed_at":"2026-08-10T17:48:52.309202Z","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-10T17:48:52.746663Z","title":null,"venue":null,"work_id":"c618f747-8098-4dfd-b5e8-4a819e2f0ab2","year":1995},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.313050Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:a18d1ac7bef83f778f457691ce7f41ad8dfdf6879df4f02ac2d4689ce0492621","observation_id":"308f714d-67a9-4ae7-95a9-657c343399f1","resolution":{"observed_at":"2026-08-10T17:48:52.751424Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.316707Z","title":"Momentum contrast for unsupervised visual representation learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.316707Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:6a3ad3c7c55edde5e300e9c25050a062ac1b036869377b92ca6d49c38a4dc800","observation_id":"65156a79-f9cd-41f1-a48f-b925fc6e3d80","resolution":{"observed_at":"2026-08-10T17:48:52.316707Z","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-10T17:48:52.320466Z","title":"Unsupervised dense information retrieval with contrastive learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.320466Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:d69a3e522817bdf331ec015d74786ba958023adf2329dbb6e9a7150e50adaec8","observation_id":"2f672643-d358-4804-85f1-b7606c21366e","resolution":{"observed_at":"2026-08-10T17:48:52.320466Z","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-10T17:48:52.324175Z","title":"Dense passage retrieval for open-domain question answering","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.324175Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:152b3c36b9149d9ec6f7abcaeb9eb54f4cb4140d0e38bd5000e2a857cc5a645c","observation_id":"d041f872-310a-46a3-91ac-99ef88c59da6","resolution":{"observed_at":"2026-08-10T17:48:52.324175Z","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-10T17:48:52.714188Z","title":"Llama2vec: Unsupervised adaptation of large language models for dense retrieval","venue":null,"work_id":"32e422fd-db4e-4e10-b439-df7d33a29e3a","year":2024},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.328427Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:6ff843099960c30337ec02be08f9b77574b94cd7bc3494c01a04899671bc1db8","observation_id":"a719326f-60f7-45ab-89d8-5152facc6d1b","resolution":{"observed_at":"2026-08-10T17:48:52.718723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.332180Z","title":"Fine-tuning llama for multi-stage text retrieval","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.332180Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:43c002683fba13c7e1212ccbaa7ec61d96a60a2b63edc1eb45fcd900b2a6022b","observation_id":"b6fd052c-8720-4f08-be4a-3b54617f1f79","resolution":{"observed_at":"2026-08-10T17:48:52.332180Z","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-10T17:48:52.690790Z","title":"P., Szegedy, C., Kuci \\'n ski, ., Mi o \\'s , P., and Wu, Y","venue":null,"work_id":"564c6f33-4adb-4e73-8312-047c9ff386eb","year":2023},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.335961Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:3c82aaf5164e6b6b5ab14ca441341e0cce348e57fb46e0141df02ad9a536de07","observation_id":"9855b852-22e0-4fed-9718-15c3bcd5009d","resolution":{"observed_at":"2026-08-10T17:48:52.695989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.677729Z","title":null,"venue":null,"work_id":"4a30a79b-c4e7-4ea3-8eb1-e10a8423b39e","year":2002},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.339665Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:5acaa26470b7c44e3027044159730cfdc4ece40f433bd41bfe8c4d07acc26a77","observation_id":"db9dcb6a-35e4-444e-9c4d-a78ab938c494","resolution":{"observed_at":"2026-08-10T17:48:52.681699Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.04085","last_updated":"2020-04-14T14:57:40Z","snapshot_observed_at":"2026-08-12T23:25:05.204139Z","submitted_at":"2019-01-13T23:27:58Z","title":"Passage Re-ranking with BERT","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.04085","snapshot_observed_at":"2026-08-10T17:48:52.343374Z","title":"and Cho, K","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.343374Z"},"links":{"cited_paper":"/paper/1901.04085","citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:609535a2ca3182a83c96e11f3af96736f8f9bb09d0f17c6d5983cf1b39e47f8f","observation_id":"0d9fb604-2beb-4576-aafe-e169ad204ee2","resolution":{"observed_at":"2026-08-10T17:48:52.343374Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.07531","last_updated":"2019-04-26T12:44:38Z","snapshot_observed_at":"2026-08-14T16:45:54.444749Z","submitted_at":"2019-04-16T08:30:31Z","title":"Understanding the Behaviors of BERT in Ranking","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.07531","snapshot_observed_at":"2026-08-10T17:48:52.348333Z","title":"Understanding the behaviors of bert in ranking","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.348333Z"},"links":{"cited_paper":"/paper/1904.07531","citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:f29b2d6dd10d679375486b8d99e510ffa4f1b597ba8ef59caed74a57cc0c2f80","observation_id":"2bf71c4c-a44c-4065-bbe1-6f2826cd11e7","resolution":{"observed_at":"2026-08-10T17:48:52.348333Z","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-10T17:48:52.353036Z","title":"X., Dong, D., Wu, H., and Wang, H","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.353036Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:4babb8ab974c79a823fe285be6163f3dc809912670afe849ae3d7daff12d17c2","observation_id":"4946cd64-e507-40b7-873d-bbc495d70e9d","resolution":{"observed_at":"2026-08-10T17:48:52.353036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.21801","last_updated":"2025-07-18T08:20:23Z","snapshot_observed_at":"2026-08-02T11:46:58.603316Z","submitted_at":"2025-04-30T16:57:48Z","title":"DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.21801","snapshot_observed_at":"2026-08-10T17:48:52.357337Z","title":"Z., Shao, Z., Song, J., Xin, H., Wang, H., Zhao, W., Zhang, L., Fu, Z., Zhu, Q., Yang, D., Wu, Z","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.357337Z"},"links":{"cited_paper":"/paper/2504.21801","citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:488af28b804b6db26e3edbcb497961c300be385e013172a392e4e1b4bcb5f1c4","observation_id":"a58c64f4-89b5-43a0-9662-cb9aca006b2d","resolution":{"observed_at":"2026-08-10T17:48:52.357337Z","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-10T17:48:52.362232Z","title":"The probabilistic relevance framework: Bm25 and beyond","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.362232Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:930a7336d8ee122460d4192f72694a609076d64ebbf4beb19d73200a88ee154c","observation_id":"9575f71f-8974-4dc8-bddf-80e444803586","resolution":{"observed_at":"2026-08-10T17:48:52.362232Z","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-10T17:48:52.645944Z","title":"and Buckley, C","venue":null,"work_id":"6beee287-42ac-45e4-9500-58cf6905af0a","year":1988},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.366441Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:53c483b044377cb4400e06134ab753351983fddfab125b40808b918607bcb26f","observation_id":"c1bff264-42fc-485f-ae2f-34feda6ba232","resolution":{"observed_at":"2026-08-10T17:48:52.650308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.631767Z","title":"Towards large language models as copilots for theorem proving in lean","venue":null,"work_id":"cd4ed5b1-8dde-45bd-988d-4e153edde089","year":2023},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.370495Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:3713e10289e1ed050e334a60745afeeb4d2e77287c94c56c95025696a3aca267","observation_id":"eea04ce8-b400-4bc6-a217-f71aebbacbc8","resolution":{"observed_at":"2026-08-10T17:48:52.636403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.616084Z","title":"Fast wordpiece tokenization","venue":null,"work_id":"94ccd0f0-0925-4f43-b41e-3d875feceb39","year":2021},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.374400Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:4d08c61f916d245050c88a9ec3f9473a8394c53a43ad1cd902b1e265ccafabb7","observation_id":"06e63f1a-2480-464b-81fb-d89f21e0dbaa","resolution":{"observed_at":"2026-08-10T17:48:52.620975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.600755Z","title":"cloze procedure","venue":null,"work_id":"abca7f74-1c2b-4d23-a7c2-625fd4d3cd42","year":1953},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.378349Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:6871f74af0637ce5aa24dc69e6bec832b85eeb9827414dbccf909d6eea0b99b5","observation_id":"23c17ea7-7b3c-487e-8c08-d30122a0f10c","resolution":{"observed_at":"2026-08-10T17:48:52.605228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.03533","last_updated":"2024-02-22T06:21:51Z","snapshot_observed_at":"2026-07-06T14:27:46.217000Z","submitted_at":"2022-12-07T09:25:54Z","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.03533","snapshot_observed_at":"2026-08-10T17:48:52.382324Z","title":"Text embeddings by weakly-supervised contrastive pre-training","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.382324Z"},"links":{"cited_paper":"/paper/2212.03533","citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:f062af25af88abeb92fd177a3cdec29deedc014ebc7440dd1694db8e3a33f07e","observation_id":"e0492c8f-a551-4271-b7fd-59386ad5ece6","resolution":{"observed_at":"2026-08-10T17:48:52.382324Z","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-10T17:48:52.386582Z","title":"Improving text embeddings with large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.386582Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:9759f3f0fd8afbd578eafe5b5a58e3d246b256dd0dbd259ddf1f54aafe919de0","observation_id":"c0a85873-a5fe-4ec7-a760-562481fc207b","resolution":{"observed_at":"2026-08-10T17:48:52.386582Z","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-10T17:48:52.587703Z","title":"and Saha, R","venue":null,"work_id":"303a1d24-7c68-42f6-a472-6de25163883d","year":2023},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.390447Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:bbce0bb19c5e1181e5cf2ca35f372dd0fae890c851a38882c01ea15dcf5589b5","observation_id":"114ee808-94e9-4966-926f-f7902dd196ce","resolution":{"observed_at":"2026-08-10T17:48:52.591734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.573344Z","title":"Byt5: Towards a token-free future with pre-trained byte-to-byte models","venue":null,"work_id":"ab5a407d-3a3a-4a47-a68a-40b0e991cc7d","year":2022},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.395587Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:1cdd37b2d29cd7aaebd314640a7df83ca5942a4112cbaccab51e2282b2f99fca","observation_id":"dced5e3e-9e53-4f2c-9cff-a47342f69036","resolution":{"observed_at":"2026-08-10T17:48:52.577894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.559971Z","title":"J., and Anandkumar, A","venue":null,"work_id":"96236628-1d6d-44d5-a5c1-10d43dd4b166","year":2024},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.399254Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:84b5b806f1aeb60da647012b3713565d90de323869c059c43f6976e29e78c3a0","observation_id":"b11c937c-4d2c-49e4-bd9a-58d2eef3e9d1","resolution":{"observed_at":"2026-08-10T17:48:52.564063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T17:48:52.544865Z","title":"M., and Polu, S","venue":null,"work_id":"0a7d0efb-4f79-4847-b508-0fcae1a832ea","year":2022},"citing_paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-10T17:48:52.403288Z"},"links":{"citing_paper":"/paper/2501.13959"},"observation_digest":"sha256:0780df4e5f67a027a61508abe481081dd4e0c43325ccc5bc7e6fd282fbb54e74","observation_id":"e9132bc6-9fdf-4ec1-9d56-ad12d468f0e5","resolution":{"observed_at":"2026-08-10T17:48:52.550247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.13959","last_updated":"2025-07-16T04:56:27Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T13:56:46.628120Z","submitted_at":"2025-01-21T06:32:25Z","title":"Learning an Effective Premise Retrieval Model for Efficient Mathematical Formalization"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":31},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 2 inbound Pith citation observations for arXiv:2501.13959."}