{"as_of":"2026-08-15T20:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:028e3d878ab185a1a06bab311c9f034edc444051bb9011d8c32eab2e893bcfbd","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T11:19:01.974329Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2508.08272/citation-record","integrity":"/paper/2508.08272/integrity","json":"/paper/2508.08272/citation-record.json","paper":"/paper/2508.08272"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-06T11:18:59.692776Z","title":"GPT-4 technical report.arXiv preprint arXiv:2303.08774, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:59.692776Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:f9720d8d17a817cb6e35baf6133beb0c8d0471d86ada862df96971520597743d","observation_id":"0227ce8e-a875-44ff-91f9-48e6249a7c71","resolution":{"observed_at":"2026-08-06T11:18:59.692776Z","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-06T11:19:04.404405Z","title":"A framework for clustering evolving data streams","venue":null,"work_id":"db01f471-783b-4c22-b4bd-d033014d5b75","year":2003},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:59.769139Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:248b1ed4175ffcebc077a25d9696af13dac63b5c98dd3627b9c0dd49be1b71e2","observation_id":"48c5f426-2750-4b6d-b847-3b13a982a5e1","resolution":{"observed_at":"2026-08-06T11:19:04.479384Z","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-06T11:19:04.218041Z","title":"Textual one-pass stream clustering with automated distance threshold adaption","venue":null,"work_id":"9386e2c4-5002-4e57-aeca-8faf6c9417cb","year":2022},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:59.834037Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:3c47fe96365f6f959b6793992bcf0e2abb48188490bb66a6d94594bec8aed2df","observation_id":"500cfb1b-f3d0-470f-87fa-6600658e98e1","resolution":{"observed_at":"2026-08-06T11:19:04.311312Z","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":"1611.09268","last_updated":"2018-10-31T14:46:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-11-28T18:14:11Z","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09268","snapshot_observed_at":"2026-08-06T11:18:59.954110Z","title":"MS MARCO: A human generated machine reading comprehension dataset","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T11:18:59.954110Z"},"links":{"cited_paper":"/paper/1611.09268","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:8f9de9e2371786b7a42b63240cd248bfb3441f7520db66338728d9583ae6a96d","observation_id":"2a435599-4fa6-48d8-9037-000ab2ce9805","resolution":{"observed_at":"2026-08-06T11:18:59.954110Z","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-06T11:19:04.041801Z","title":"Latent Dirichlet allocation.Journal of Machine Learning Research, 3, 2003","venue":null,"work_id":"65ded0ab-30a3-43e8-9f67-71993bb410f3","year":2003},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.046157Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:f55696687698ed4a920acac581501a285a17e9cf0e23dc7700a046a094d25797","observation_id":"d53b640a-4c31-4111-ae0b-50aa71463973","resolution":{"observed_at":"2026-08-06T11:19:04.123223Z","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-06T11:19:03.824948Z","title":null,"venue":null,"work_id":"0433226d-81fb-4676-a3b0-599abbedf898","year":2008},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.119400Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:46a8a5378a97604ba77e706f199b278d6180b562602426eccac82864b04ac4b5","observation_id":"37364fd9-9ffe-4838-be15-2c49fc8c8ae2","resolution":{"observed_at":"2026-08-06T11:19:03.919028Z","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":"2402.03216","last_updated":"2025-12-12T11:26:32Z","snapshot_observed_at":"2026-07-06T17:25:35.493362Z","submitted_at":"2024-02-05T17:26:49Z","title":"M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03216","snapshot_observed_at":"2026-08-06T11:19:00.172569Z","title":"BGE M3-embedding: Multi-lingual, multi-functionality, multi-granularity text embeddings through self-knowledge distillation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.172569Z"},"links":{"cited_paper":"/paper/2402.03216","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:2b989eaf8028765b837d837b23cb8d5a0e358d228966a91ac98369e672a88701","observation_id":"9f5cdeaf-6214-41e1-9838-95466a5b3b2e","resolution":{"observed_at":"2026-08-06T11:19:00.172569Z","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-06T11:19:00.286626Z","title":"Mean shift, mode seeking, and clustering.IEEE transac- tions on pattern analysis and machine intelligence, 17(8):790–799, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.286626Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:35d0b997ab22215998516a6b12cc7d6452f0d74503c82d53b0f75c315e1aa356","observation_id":"4a7af76d-cee3-483e-ac03-171c9d4ebe7b","resolution":{"observed_at":"2026-08-06T11:19:00.286626Z","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-06T11:19:03.696160Z","title":"BERT: Pre-training of deep bidirectional transformers for language un- derstanding","venue":null,"work_id":"fae7273e-1ae8-4d7c-9b93-78f9392aa3f7","year":2019},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.371202Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:4fe2c882b4a7860b2b8b97af635aa6800b2a07c5dde9f43547fc9951e992bd37","observation_id":"d4a39e7f-902c-43da-96ec-9f9b33e01106","resolution":{"observed_at":"2026-08-06T11:19:03.755421Z","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-06T11:19:03.582886Z","title":"A density-based algorithm for discovering clusters in large spatial databases with noise","venue":null,"work_id":"237c78b7-74b3-40ae-bd80-af42acaea134","year":1996},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.440190Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:e9917133495e7b0709fcd652104bc1235041695a92c350839389883a8b83199a","observation_id":"9a135ca0-bd71-4118-82e7-65fd123e67bc","resolution":{"observed_at":"2026-08-06T11:19:03.633125Z","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-06T11:19:00.532529Z","title":"KeyBERT: Minimal keyword extraction with BERT, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.532529Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:06f32211290c987ecdf4fede6f6a82126aa71a3d1a758820dd668759f5452311","observation_id":"2277b958-3ef5-4d8f-ac31-5d461939cf20","resolution":{"observed_at":"2026-08-06T11:19:00.532529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.05794","last_updated":"2022-03-11T08:35:15Z","snapshot_observed_at":"2026-07-06T12:46:41.057346Z","submitted_at":"2022-03-11T08:35:15Z","title":"BERTopic: Neural topic modeling with a class-based TF-IDF procedure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.05794","snapshot_observed_at":"2026-08-06T11:19:00.614670Z","title":"BERTopic: Neural topic modeling with a class- based TF-IDF procedure.arXiv preprint arXiv:2203.05794, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.614670Z"},"links":{"cited_paper":"/paper/2203.05794","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:23644d3eff0dbccb472adf3399bcf4b22df1db2de4f17cbf5163054ad53a98e6","observation_id":"c8c9909e-b91f-4ef4-9143-e21797308bef","resolution":{"observed_at":"2026-08-06T11:19:00.614670Z","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-06T11:19:03.419024Z","title":"Clustering data streams based on shared density between micro-clusters.IEEE transactions on knowl- edge and data engineering, 28(6):1449–1461, 2016","venue":null,"work_id":"bb2290a5-76d8-4c7a-9092-192f0540b774","year":2016},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.702722Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:3cbe47323cc4d6f3c679a3ef7d9ed14c67e477e61bb8588db2df0a8e27cbe4fc","observation_id":"9c498dcd-5bec-421a-8560-6b74e4f4cd88","resolution":{"observed_at":"2026-08-06T11:19:03.502076Z","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-06T11:19:03.259195Z","title":"Distributional structure.Word, 10(2-3):146–162, 1954","venue":null,"work_id":"d357aa71-a509-44b9-83d5-6d3bddb2a947","year":1954},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.800382Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:1ad610814a97c8162090c860e02ac67ad8eb8c64295ce9210eff859ffde77d85","observation_id":"c117be28-855a-4e3e-846c-ace6561e86d6","resolution":{"observed_at":"2026-08-06T11:19:03.322253Z","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":"2412.19437","last_updated":"2025-02-18T17:26:38Z","snapshot_observed_at":"2026-08-15T17:27:11.980940Z","submitted_at":"2024-12-27T04:03:16Z","title":"DeepSeek-V3 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19437","snapshot_observed_at":"2026-08-06T11:19:00.908858Z","title":"Deepseek-v3 technical report.arXiv preprint arXiv:2412.19437, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.908858Z"},"links":{"cited_paper":"/paper/2412.19437","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:63312f429e92c71a9bf8b255cc8e4b75d9f4b4cc45a0493225eb1708d581c27f","observation_id":"03d0c4a3-1417-4554-9f18-6583223686a8","resolution":{"observed_at":"2026-08-06T11:19:00.908858Z","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-06T11:19:03.092181Z","title":"Some methods for classification and analysis of multi- variate observations","venue":null,"work_id":"2c48e3ad-3b28-4fba-adcb-e20458e10c4b","year":1967},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:00.991345Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:71f3b2007b6fe5b35f6fc92a3bab6f53af511bb2e93490316344b0f165cdb78e","observation_id":"a0d515c5-476c-495a-b320-f89e5a76c1c8","resolution":{"observed_at":"2026-08-06T11:19:03.144149Z","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":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-06T11:19:01.052053Z","title":"Efficient estimation of word representations in vector space","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.052053Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:5d0d849af8aa2be77d7309877ca8523524b5bddf431a494a6124d4c47c490a9e","observation_id":"c3d25d9e-18ea-483d-9fdd-8efe4adf1d79","resolution":{"observed_at":"2026-08-06T11:19:01.052053Z","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-06T11:19:02.923249Z","title":"Streaming-data algorithms for high-quality clustering","venue":null,"work_id":"82b0cacc-f410-4041-9348-a3c23af8df2d","year":2002},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.138624Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:9270371af4f0a54a3402b15fb2a6528fe7ca67affd194b7d63350a64c89be641","observation_id":"8ad02a98-b1ca-40d2-94a5-6b478bcca2d9","resolution":{"observed_at":"2026-08-06T11:19:03.030864Z","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-06T11:19:02.703042Z","title":"Pytorch model for Slovenian named entity recognition SloNER 1.0","venue":null,"work_id":"c167bb77-93bb-4e4d-ae22-78b78b21580d","year":2023},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.223137Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:b38b73659efcecfab078b8a6cc299be0db8079adf48c751ca4c06bb20687e512","observation_id":"336d87b9-cb24-46d4-8884-7138e5685f57","resolution":{"observed_at":"2026-08-06T11:19:02.820113Z","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":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-08-14T05:02:11.716316Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-06T11:19:01.325457Z","title":"Sentence-BERT: Sentence em- beddings using Siamese BERT-networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.325457Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:9fa7bfc5755b749f9ed75380f4f5c16e96ccb61b46be90b677c710167af9a44f","observation_id":"1bd3e331-559c-47e1-a718-2ace6e8f1141","resolution":{"observed_at":"2026-08-06T11:19:01.325457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.01108","last_updated":"2020-03-01T02:57:50Z","snapshot_observed_at":"2026-08-07T19:07:36.327251Z","submitted_at":"2019-10-02T17:56:28Z","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.01108","snapshot_observed_at":"2026-08-06T11:19:01.418954Z","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.418954Z"},"links":{"cited_paper":"/paper/1910.01108","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:c0b29c4e9b5080a4701bab1a3bed571c7e71e2e52ac28a865d8c70c6ac02a8e3","observation_id":"68eae3e4-64b0-4814-840a-58ebc5328dcd","resolution":{"observed_at":"2026-08-06T11:19:01.418954Z","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-06T11:19:02.563564Z","title":"A statistical interpretation of term specificity and its application in retrieval.Journal of documentation, 28(1):11–21, 1972","venue":null,"work_id":"c9ccf487-c5d5-4c74-8987-5ab1dd6bab74","year":1972},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.506373Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:ea708a547cac63bd535b32f0b7267b0b9f55dd6fb61a9ba99b53d9be4a6f7472","observation_id":"7f58a000-fecf-462a-8fe8-0a25ab176998","resolution":{"observed_at":"2026-08-06T11:19:02.619751Z","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":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-06T11:19:01.593635Z","title":"Llama: Open and efficient foundation language models.arXiv preprint arXiv:2302.13971, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.593635Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:ab5f28a2d50ec59662ca75b303e6e8e8fd95fee3d94c27e46c9555098eee75b1","observation_id":"c517e234-b376-476d-8500-fdbe50e89d1f","resolution":{"observed_at":"2026-08-06T11:19:01.593635Z","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-06T11:19:01.671051Z","title":"Attention is all you need.Advances in neural information processing systems, 30, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.671051Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:086f455179434557bc61bc79c20cae29f2b513098c219af4d658ee2e6880dfc3","observation_id":"9f753089-ea6e-413f-9660-5f4d2e8a2510","resolution":{"observed_at":"2026-08-06T11:19:01.671051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.06979","last_updated":"2021-09-10T16:21:45Z","snapshot_observed_at":"2026-08-13T19:39:51.904751Z","submitted_at":"2021-04-14T17:02:18Z","title":"TSDAE: Using Transformer-based Sequential Denoising Auto-Encoder for Unsupervised Sentence Embedding Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.06979","snapshot_observed_at":"2026-08-06T11:19:01.760647Z","title":"TSDAE: Using transformer-based sequential denoising auto-encoder for unsupervised sentence embedding learning.arXiv preprint arXiv:2104.06979, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.760647Z"},"links":{"cited_paper":"/paper/2104.06979","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:66e9f0943728b56a1ce9495615ec05eaeceeb6ab75a5055cb5b8e61bdaf046af","observation_id":"ab892b75-7765-405b-8338-99137239e082","resolution":{"observed_at":"2026-08-06T11:19:01.760647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.05672","last_updated":"2024-02-08T13:47:50Z","snapshot_observed_at":"2026-08-12T15:58:37.148545Z","submitted_at":"2024-02-08T13:47:50Z","title":"Multilingual E5 Text Embeddings: A Technical Report","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.05672","snapshot_observed_at":"2026-08-06T11:19:01.834246Z","title":"Multilingual e5 text embeddings: A technical report","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.834246Z"},"links":{"cited_paper":"/paper/2402.05672","citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:d0678f0bfa3b93b086b58f0b624c407d096225f6f81e8f6cc5a8366a29e046d4","observation_id":"eae8d50d-e101-4f03-9eb8-69dee333e3df","resolution":{"observed_at":"2026-08-06T11:19:01.834246Z","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-06T11:19:02.379651Z","title":"A robust EM clus- tering algorithm for Gaussian mixture models.Pattern Recognition, 45 (11):3950–3961, 2012","venue":null,"work_id":"dde5eaa4-cb0a-4e34-855e-1f256cf32088","year":2012},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.895674Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:cbbc50818b3d11cbc0aa0646392caecaa58bb976f2bb78ebf935bd8e90db4ffe","observation_id":"62ab3f21-c7c2-4090-a4e0-66f3e62a9f1e","resolution":{"observed_at":"2026-08-06T11:19:02.462693Z","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-06T11:19:02.195637Z","title":"One model to rule them all: Ranking Slovene summarizers","venue":null,"work_id":"b6ef8454-e540-468e-a5fe-51cdff0a4d43","year":2023},"citing_paper":{"arxiv_id":"2508.08272","last_updated":"2025-07-30T16:21:00Z","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T11:19:01.974329Z"},"links":{"citing_paper":"/paper/2508.08272"},"observation_digest":"sha256:a811f98d6d105430b1c922bbaf16435d504c4e24d990ec449d3a0312c39d2f42","observation_id":"8de894df-8798-4031-acd2-e4475eaa4199","resolution":{"observed_at":"2026-08-06T11:19:02.292611Z","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":"2508.08272","last_updated":"2025-07-30T16:21:00Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-06T11:18:59.164922Z","submitted_at":"2025-07-30T16:21:00Z","title":"Real-time News Story Identification"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":13},"total_outbound_references":28},"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 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2508.08272."}