{"as_of":"2026-08-21T02:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6d5312e5e8879201916f176aa3057dc001f5fbcaa946a56e7d04840b7d36866","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:30:18.102948Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T21:51:48.780602Z","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-13T21:53:19.646229Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"cited_work":{"arxiv_id":"2506.19743","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.19743","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv:2506.19743(2025)","venue":null,"work_id":"837d2f6a-0140-4242-a113-74766987079f","year":2025},"citing_paper":{"arxiv_id":"2604.07364","last_updated":"2026-04-01T19:38:36Z","snapshot_observed_at":"2026-08-14T13:31:50.204540Z","submitted_at":"2026-04-01T19:38:36Z","title":"Improving Search Suggestions for Alphanumeric Queries","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-13T21:51:48.780602Z"},"links":{"cited_paper":"/paper/2506.19743","citing_paper":"/paper/2604.07364"},"observation_digest":"sha256:e2d1df297ade64f67ff59e234ebc1d5e56aefda3ab033331403243754c67ada3","observation_id":"6716b632-4f56-48cd-8e0c-80846399bc8d","resolution":{"observed_at":"2026-05-13T21:53:19.647632Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.19743/citation-record","integrity":"/paper/2506.19743/integrity","json":"/paper/2506.19743/citation-record.json","paper":"/paper/2506.19743"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:30:18.013162Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.013162Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:cc5f83093f02f0c4e37490d418e2fcef4e2f223870751017a851363a1a97fc03","observation_id":"dd3e94d4-a655-47b2-ab35-07e3d71244f0","resolution":{"observed_at":"2026-08-15T18:30:18.013162Z","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":"10.1145/3534965","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:30:18.171447Z","title":"Keyvan, J","venue":null,"work_id":"592c0267-c797-4849-8b88-1f3422bbf35c","year":2022},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.018366Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:f129178489d1b33839ce39dbc359a9000cd7f0ccd320267f57228fa0ba592a96","observation_id":"ee381276-ff22-4ee5-8eb9-1715e2056d29","resolution":{"observed_at":"2026-08-15T18:30:18.175773Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:30:18.848275Z","title":"Saadany, S","venue":null,"work_id":"cd84b2fe-e857-4ef4-a0b8-e3362a6318ac","year":2024},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.022909Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:06fee741daa9d62c038c821d78d7db47d5a0754b0b2ebf1b1c71ec884203a66c","observation_id":"4b2705db-2c8e-4e3b-9bcf-d5314b8706a2","resolution":{"observed_at":"2026-08-15T18:30:18.852355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/network2040034","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:30:18.157860Z","title":null,"venue":null,"work_id":"c29e9590-46ba-4f51-8cd3-ea7d59a9ce46","year":2022},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.027252Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:f9266fd8edc9cc1120ad35345cd6e205cf8ac54769dbf92ca3634a15bd90d31f","observation_id":"177d0597-9598-4e11-adce-34e48da37be3","resolution":{"observed_at":"2026-08-15T18:30:18.162344Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:30:18.031633Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.031633Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:24e2d1f68ce8f390fdf23ce42a36bb648eb4806b58c13ad31a0e7c2e0027e60c","observation_id":"d2b12d27-a3d0-4470-b746-101bd31bf4f2","resolution":{"observed_at":"2026-08-15T18:30:18.031633Z","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-15T18:30:18.036166Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.036166Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:a509176a38c3cad1a4b7569e8e960a7c5432caaf90b63c9d79e98b9a6db81d50","observation_id":"af2fb0e6-f561-464f-98d6-0582db75a1c7","resolution":{"observed_at":"2026-08-15T18:30:18.036166Z","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-15T18:30:18.040754Z","title":"Vaswani, N","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.040754Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:5263ca8d2a624ff3be6c82e81734e14944f2a7c0351caf39732e5e8659925b7a","observation_id":"cb6ed26d-66a6-49a3-98cc-99c8a9d3bec9","resolution":{"observed_at":"2026-08-15T18:30:18.040754Z","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-15T18:30:18.044677Z","title":"Devlin, M.-W","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.044677Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:424a11f22c99c43eea02871ca9948f3c82fcc315952574b01e4500ec7500a4eb","observation_id":"ae930e58-9d93-45a7-b3e9-5c995312e721","resolution":{"observed_at":"2026-08-15T18:30:18.044677Z","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-15T18:30:18.048862Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.048862Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:1e3dbdc1debe69d17757fd2a20489e7e6751eeb04ce06491e048d79063313531","observation_id":"0fe42cea-ce30-46d2-9cab-6885728d8df0","resolution":{"observed_at":"2026-08-15T18:30:18.048862Z","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-15T18:30:18.052989Z","title":"Mitra, F","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.052989Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:baf138bf4926a93e0efc8e1aff3305ddafc8bf7e6f059dfcb96bd792e5c7e783","observation_id":"ea637306-d911-41de-89eb-96b3d25f267b","resolution":{"observed_at":"2026-08-15T18:30:18.052989Z","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-15T18:30:18.817532Z","title":null,"venue":null,"work_id":"dfd37cc4-ca38-41a6-861b-2f8a4121e700","year":null},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.057028Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:4d707942fd3786306c5722d67118d18398f17cf3635a37ec90a01eaddedc6570","observation_id":"9ee9b79d-10f9-411e-a925-b912d5c01a3a","resolution":{"observed_at":"2026-08-15T18:30:18.821798Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:30:18.065083Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.065083Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:ee82a1e9fb5f1cc0f1da45d0083244b3273fc001957403845a2a490626402bb0","observation_id":"b1695349-1fa0-490e-9da3-457efb5d1a46","resolution":{"observed_at":"2026-08-15T18:30:18.065083Z","resolver_source":null,"status":"malformed_identifier"},"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-15T18:30:18.790857Z","title":"Kusupati, G","venue":null,"work_id":"756862f6-cdd8-4770-8141-dadfe9718c8c","year":2022},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.069147Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:fc2954b920c48cf9ae69a2633fed2bbefb06bf90384db47ec93804bd4fffcf08","observation_id":"82231379-3906-4f08-a41a-8755bad50379","resolution":{"observed_at":"2026-08-15T18:30:18.795140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14776","last_updated":"2024-11-30T04:29:53Z","snapshot_observed_at":"2026-08-16T14:16:08.481678Z","submitted_at":"2024-02-22T18:35:05Z","title":"2D Matryoshka Sentence Embeddings","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14776","snapshot_observed_at":"2026-08-15T18:30:18.072992Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.072992Z"},"links":{"cited_paper":"/paper/2402.14776","citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:7fa925114d3cfbb313af692d053627e0aaef3b03dc9407c3da1de5c3c6aef1c1","observation_id":"f47d0302-99fa-4475-a03b-f9e22d0ca61b","resolution":{"observed_at":"2026-08-15T18:30:18.072992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.00652","last_updated":"2017-05-01T18:24:15Z","snapshot_observed_at":"2026-08-14T21:03:34.441072Z","submitted_at":"2017-05-01T18:24:15Z","title":"Efficient Natural Language Response Suggestion for Smart Reply","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.00652","snapshot_observed_at":"2026-08-15T18:30:18.077369Z","title":"Henderson, R","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.077369Z"},"links":{"cited_paper":"/paper/1705.00652","citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:23c175f3efc488b9de2a0b5a5e35fe1d96c357469d9b28ea5b97ab5fbf08181f","observation_id":"1f4b3363-6b5e-40dc-b2a4-9f7fbc7f25d6","resolution":{"observed_at":"2026-08-15T18:30:18.077369Z","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-15T18:30:18.081037Z","title":"Saadany, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.081037Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:b686c56e503aa8249ab391267a6412fecc6081d58be7481402665fdbdcffbbef","observation_id":"409e2396-aef9-4afe-bacd-04462f862d5b","resolution":{"observed_at":"2026-08-15T18:30:18.081037Z","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-15T18:30:18.777162Z","title":"Carlsson, A","venue":null,"work_id":"a1275d04-3e9a-43df-acab-6c02724415ac","year":2021},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.084507Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:f83dc25e4e33271c33fbb94db714c201885a47b13940f925ca4145a029d4b893","observation_id":"2fb8ebe2-3832-4f75-8027-8c7ab5db07c9","resolution":{"observed_at":"2026-08-15T18:30:18.781596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:30:18.087823Z","title":"Jiang, Y","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.087823Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:ec0d62a2d41caacb1693b9d81b393cca3874d63fb4eec70e297ef6f4f25ca4a5","observation_id":"30b94e72-3017-4374-a192-d30fed5ae973","resolution":{"observed_at":"2026-08-15T18:30:18.087823Z","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":"10.1016/j.asoc.2016.01.017","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T18:30:18.133290Z","title":null,"venue":null,"work_id":"ce18c568-20a3-4c7e-9387-c49225ff4fb7","year":2016},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.091182Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:169a8a3af26b65562691287adb01dd96bfb5abb07c4853fef6071cdd99d1e77a","observation_id":"5e9659b3-233f-4b72-9610-126dd8e7f6e5","resolution":{"observed_at":"2026-08-15T18:30:18.138833Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T18:30:18.094615Z","title":"Loshchilov, F","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.094615Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:904e80279c62bd16a9a17c25beae69325fd1501faac227a8641aedc802960e87","observation_id":"9b409c45-887c-443a-9b9a-09a6ed3ba50e","resolution":{"observed_at":"2026-08-15T18:30:18.094615Z","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-15T18:30:18.098805Z","title":"Järvelin, J","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.098805Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:3c32c773c54774fc037d6ff9d0956ada9dae097c4d3c7075369b538bf0abfdb4","observation_id":"e45671c2-7f13-408b-983f-edcf591c52b4","resolution":{"observed_at":"2026-08-15T18:30:18.098805Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.17428","last_updated":"2025-02-25T00:35:18Z","snapshot_observed_at":"2026-08-19T08:30:32.631359Z","submitted_at":"2024-05-27T17:59:45Z","title":"NV-Embed: Improved Techniques for Training LLMs as Generalist Embedding Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.17428","snapshot_observed_at":"2026-08-15T18:30:18.102948Z","title":"plants” with eBERT. Based on the gold label, the expected product title should include “potted plants","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.102948Z"},"links":{"cited_paper":"/paper/2405.17428","citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:92ff2c05ebc8f5822578bbc9f8a1d35c3515704347ab977234a56de8674d4460","observation_id":"d6349f96-fe3e-4df4-941a-c5f4dbe2ea02","resolution":{"observed_at":"2026-08-15T18:30:18.102948Z","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-15T18:30:18.804036Z","title":null,"venue":null,"work_id":"ed52942b-4e55-40fa-9995-b1d7b45d75d3","year":null},"citing_paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T18:30:18.061095Z"},"links":{"citing_paper":"/paper/2506.19743"},"observation_digest":"sha256:8f42fd5c12cb8edc20f8cd9803577dfcc9a98a6e1aa6d6166b92ff3d80bc06ff","observation_id":"d814f3c1-9451-45fd-af98-a1dcb29a6750","resolution":{"observed_at":"2026-08-15T18:30:18.808177Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.19743","last_updated":"2025-06-24T16:02:02Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-19T23:11:13.996397Z","submitted_at":"2025-06-24T16:02:02Z","title":"NEAR$^2$: A Nested Embedding Approach to Efficient Product Retrieval and Ranking"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":3,"verified_fuzzy":3},"total_outbound_references":23},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 1 inbound Pith citation observation for arXiv:2506.19743."}