{"as_of":"2026-08-20T02:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1b1701f48f872775767218508f3d2e73ddf593bdbcb4170e939c235aa3e91164","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:11:01.508429Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.00528/citation-record","integrity":"/paper/2506.00528/integrity","json":"/paper/2506.00528/citation-record.json","paper":"/paper/2506.00528"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:04.108301Z","title":null,"venue":null,"work_id":"baf8af4f-d772-4e13-8fae-0f7580918216","year":null},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:10:59.837414Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:b710fb1e92769d9aae553ef7c491c07d1d9fcc2612654042b7c68b5b78d32433","observation_id":"e77c1f50-ec20-4528-8e37-85ab32c58874","resolution":{"observed_at":"2026-08-07T12:11:04.235758Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:03.870878Z","title":null,"venue":null,"work_id":"737554cc-8494-4d1e-8d02-3dcaa7f9787d","year":2020},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:10:59.882027Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:78c5bfc15e9a8c9f97a48fe6789c106b2cba1f6d06226f7ddfd925b79987f68d","observation_id":"7f631f37-78b9-4f73-9cfe-6fd84e449dda","resolution":{"observed_at":"2026-08-07T12:11:03.997595Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:03.657475Z","title":"Claren- don Press (1953)","venue":null,"work_id":"7dc3bf21-d844-4aa2-9829-88d2b8087ce6","year":1953},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:10:59.974888Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:6b7d1d732fc8fe381e07edbdc5db4d3290f12492d26f2d2b2929c4db662d2677","observation_id":"a5482738-f5e9-405c-bb05-9047de17e9f4","resolution":{"observed_at":"2026-08-07T12:11:03.744346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:03.450265Z","title":"Bulletin of the Amer- ican Mathematical Society39(6), 423–426 (1933)","venue":null,"work_id":"69ca97eb-9806-4de4-872c-809ffdf77798","year":1933},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:00.142010Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:554ee0db618e0cff0ebeb922960eb8bc20b87532c92eb402a3aec7247c1537fc","observation_id":"58bf637e-61d9-4171-bbb1-3da4d28c9443","resolution":{"observed_at":"2026-08-07T12:11:03.554620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:03.265553Z","title":null,"venue":null,"work_id":"39357bb0-bf90-4b49-aa5f-1bd22a99e5ab","year":2025},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:00.260482Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:8bde03a661cdef802f16f907389da08790189df338f65cb79663a4036c34bfb0","observation_id":"bfe64b61-ffd6-425c-b796-08e37c27ea8c","resolution":{"observed_at":"2026-08-07T12:11:03.341893Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:03.063346Z","title":"ACM TRANS- ACTIONS ON INFORMATION SYSTEMS35(3), 17–27","venue":null,"work_id":"e87af1e2-b074-45f9-8951-348572fbd356","year":null},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:00.480475Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:d89e8f6f3e3c871eed7f6f70b1af8ed9ddd35490bce57dcc7e174af6e178b7ca","observation_id":"f1c06f08-841a-495e-86a8-d482fdb65490","resolution":{"observed_at":"2026-08-07T12:11:03.191715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:02.882766Z","title":"In: Similarity Search and Applications","venue":null,"work_id":"d868e1c9-8bf8-488a-8aa8-99becefb6cd2","year":2020},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:00.588506Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:f66a3863cc1a1ac5e1fefd0ce49e6d9bdaf67b4fdc8a9ff6debeede4e4acaaef","observation_id":"335a414d-d601-4077-beae-e225b169e870","resolution":{"observed_at":"2026-08-07T12:11:02.958983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:02.693978Z","title":"ACM Transactions on Knowledge Discovery from Data18(6), 1–44 (2024)","venue":null,"work_id":"16eaeb82-3ec0-4e6b-96a0-7b2315b6f12e","year":2024},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:00.745820Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:a5af4aa7c34ea37a7e4cb13d8727b0860dd92a1c01aca4e9eb3ebbe3408374df","observation_id":"44c95f79-8882-4ea0-814f-1cc606b35df1","resolution":{"observed_at":"2026-08-07T12:11:02.793046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:02.473017Z","title":null,"venue":null,"work_id":"de7c3294-807f-41f0-9bbe-385f68ecadfc","year":2025},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:00.826256Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:0d80cbea9a8e4b4eb6175f89d5701113bd805a2def2979543282f87dcff210a1","observation_id":"20a2b2fd-f48f-4df7-bdaf-9a9cdef5a2a6","resolution":{"observed_at":"2026-08-07T12:11:02.541386Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ins.2014.02.068","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Information Sciences270, 1–27 (2014)","venue":"Information Sciences","work_id":"3e82105e-c4ec-4f9c-b570-7ab08b873677","year":2014},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:00.964137Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:26ee660b006143bd08edc3ec62dbf9a018b5dcade0170abac1728ed8af492c6e","observation_id":"aea06ca6-07cc-44c7-9f2d-bb92cee3c588","resolution":{"observed_at":"2026-08-07T12:11:01.749909Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.12285","last_updated":"2025-04-25T03:07:55Z","snapshot_observed_at":"2026-08-18T00:55:34.089747Z","submitted_at":"2025-04-16T17:51:43Z","title":"BitNet b1.58 2B4T Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.12285","snapshot_observed_at":"2026-08-07T12:11:01.072185Z","title":"58 2b4t technical report","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:01.072185Z"},"links":{"cited_paper":"/paper/2504.12285","citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:ef82953965138818c903e11cce65a13508a0d2d11a8ecea2be1388787ddd2023","observation_id":"a6848788-c955-4892-b53a-fcf76eb0b116","resolution":{"observed_at":"2026-08-07T12:11:01.072185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17764","last_updated":"2024-02-27T18:56:19Z","snapshot_observed_at":"2026-08-14T15:17:37.878305Z","submitted_at":"2024-02-27T18:56:19Z","title":"The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17764","snapshot_observed_at":"2026-08-07T12:11:01.202720Z","title":"arXiv preprint arXiv:2402.17764 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:01.202720Z"},"links":{"cited_paper":"/paper/2402.17764","citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:c30a7a3da3fd2f2f1a46eb4af1cbce4d0f075c66b153cd764bb12b84c064dd79","observation_id":"6122dbcf-038a-4938-ab2c-cba40786105b","resolution":{"observed_at":"2026-08-07T12:11:01.202720Z","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-07T12:11:02.281641Z","title":"In: Empirical Methods in Natural Language Processing (EMNLP)","venue":null,"work_id":"20077a61-8e2f-45f2-ac8e-fcea2e932aeb","year":2014},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:01.271625Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:68989667ff92b0c2bc53a9205b34253debe183c36ce8d8a9420615f17afb7e50","observation_id":"e26a56b5-bce1-4bd2-a5eb-316c93b3413f","resolution":{"observed_at":"2026-08-07T12:11:02.351507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:02.051162Z","title":"github.io/2024/datasets/#768d_clip_embeddings_clip768 16","venue":null,"work_id":"2e2a46bf-092e-458c-9496-c657f28d3a94","year":2022},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:01.393273Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:372e51dc7e328d57986ed159d79c3c2c5d59f8adde9c571cda93cda22a873606","observation_id":"79550df3-8ba1-4d2f-ac9f-bcba6e7854de","resolution":{"observed_at":"2026-08-07T12:11:02.181619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T12:11:01.901053Z","title":null,"venue":null,"work_id":"f7fdd1da-af0a-4c0c-88e9-8eda948cce44","year":2017},"citing_paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:11:01.508429Z"},"links":{"citing_paper":"/paper/2506.00528"},"observation_digest":"sha256:a0735dae6f612f64e5977ee77df9814512cc5bf13c7287bf27428368c345c791","observation_id":"2079357f-9e7c-4480-ab95-9deec5222b0b","resolution":{"observed_at":"2026-08-07T12:11:01.933501Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.00528","last_updated":"2025-05-31T12:22:24Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-12T13:08:11.076003Z","submitted_at":"2025-05-31T12:22:24Z","title":"Ultra-Quantisation: Efficient Embedding Search via 1.58-bit Encodings"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":7},"total_outbound_references":15},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2506.00528."}