{"as_of":"2026-08-08T15:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6c01e574e83b50aa11713e41caf674e913a84bdd3e92b969afdea29c0aae7790","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:09:51.318465Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2507.16881/citation-record","integrity":"/paper/2507.16881/integrity","json":"/paper/2507.16881/citation-record.json","paper":"/paper/2507.16881"},"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-06T15:09:51.696403Z","title":"Representation learning: A review and new perspectives,","venue":null,"work_id":"fb2f8b0b-52ea-4244-b3a5-a5f6f0a15c3f","year":2013},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.226737Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:838158ee6b21b8303628c1f8a92f838ab6c894dbeb326ae0772730acd5b0e4b9","observation_id":"59674d23-9343-4f7b-a1d7-36e4ad3a4c72","resolution":{"observed_at":"2026-08-06T15:09:51.701380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6623","last_updated":"2015-05-01T10:14:58Z","snapshot_observed_at":"2026-07-06T04:04:18.621124Z","submitted_at":"2014-12-20T07:42:40Z","title":"Word Representations via Gaussian Embedding","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6623","snapshot_observed_at":"2026-08-06T15:09:51.232163Z","title":"Word representations via gaussian embedding,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.232163Z"},"links":{"cited_paper":"/paper/1412.6623","citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:904eec80ce41a67d36ef7c245650261a5ade57ea452f0c300399ccc4835c947c","observation_id":"8818e7f1-0a3d-4404-b71a-c2e2e0d155f1","resolution":{"observed_at":"2026-08-06T15:09:51.232163Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-06T15:09:51.238302Z","title":"Auto-encoding variational bayes,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.238302Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:586b5bd7b7a5132b14264c266df3362e711d1ef87761eb5b99a6cedf4db0a406","observation_id":"dc8a0703-97fb-40e8-b09c-f0bdddb0415a","resolution":{"observed_at":"2026-08-06T15:09:51.238302Z","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-06T15:09:51.679634Z","title":"Denoising diffusion probabilistic models,","venue":null,"work_id":"578f5a1c-1809-4eb4-be2a-e4514c3877f6","year":2020},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.243956Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:ec7eaa41ce57214e35e2219b0c6857d685268ced30ca6116c3f5267e8d2861d5","observation_id":"1bcdaba5-cbdd-42b1-bf02-fedd4a7dd12f","resolution":{"observed_at":"2026-08-06T15:09:51.685195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00319","last_updated":"2019-08-27T00:31:41Z","snapshot_observed_at":"2026-07-06T07:05:08.070863Z","submitted_at":"2018-09-30T04:51:27Z","title":"Modeling Uncertainty with Hedged Instance Embedding","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00319","snapshot_observed_at":"2026-08-06T15:09:51.248919Z","title":"Modeling uncertainty with hedged instance embedding,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.248919Z"},"links":{"cited_paper":"/paper/1810.00319","citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:3f0e2ea39c46b3076a966727a2c16afd0068c75f0f2825466b5716dda0585cda","observation_id":"01f805f2-6a21-4f23-86e1-2c970cdfd276","resolution":{"observed_at":"2026-08-06T15:09:51.248919Z","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-06T15:09:51.663503Z","title":"Probabilistic face embeddings,","venue":null,"work_id":"b871a958-9dfd-4d67-936c-30a787ca21b5","year":2019},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.254458Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:c5bf3739ae713e0ecda09f4ad84faeb23b2f3014ed0b17d5fbd803fe235ef3a4","observation_id":"d5d5ba3e-d664-4f36-86cf-0a93e707387c","resolution":{"observed_at":"2026-08-06T15:09:51.668256Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T15:09:51.647408Z","title":"Data uncertainty learning in face recognition,","venue":null,"work_id":"df77743a-2509-4d9a-9c74-cc33220c3ed9","year":2020},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.260660Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:0a90b41faa36b4d86d0c9b21b08cf10955a7c78c7d58428e75c8961eb4bdbfcc","observation_id":"4abab8d3-4db1-41e9-a3b2-394e0d0637cd","resolution":{"observed_at":"2026-08-06T15:09:51.652578Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T15:09:51.630391Z","title":"Probabilistic embeddings for cross- modal retrieval,","venue":null,"work_id":"a5b6a18e-a477-4d43-85a1-c8a591ad736d","year":2021},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.265242Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:4d3d2acc88d58f4879d4f426632b825b69b9314ba4dc04374effaf404a74d8e5","observation_id":"dec49d4f-3162-4c74-855b-630b3572faf6","resolution":{"observed_at":"2026-08-06T15:09:51.635800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T15:09:51.604090Z","title":"Struc- tured probabilistic coding,","venue":null,"work_id":"293afd7e-7e94-4d09-b30a-4f1b186be9b1","year":2024},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.270625Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:41c7607e24051b6c2cd58ffd692589f4d2e54715879e85a2f9b133ddd1d92bdf","observation_id":"39ba6fef-c433-4ae5-8562-c40f8995cafb","resolution":{"observed_at":"2026-08-06T15:09:51.611583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T15:09:51.581935Z","title":"Variational autoencoders and the variable collapse phenomenon,","venue":null,"work_id":"2944f975-a213-426a-a375-7e4396aa9b8e","year":2019},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.275502Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:10516334c0157ff9456219ac0a2fd4ba68926b954808ee9e828852cb82bb6146","observation_id":"2a321cdc-c886-4623-a512-7c1b0fe6b289","resolution":{"observed_at":"2026-08-06T15:09:51.588626Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T15:09:51.563881Z","title":"Deep learning for natural language processing (nlp) using variational autoencoders (vae),","venue":null,"work_id":"de5dabdd-21ea-4a03-9a3b-a1bf94ffb687","year":2018},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.281075Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:5c105f59898d930a76e772c72f9d0854f6aab7582f51cfb66262b5f33637e088","observation_id":"0dea46e8-00db-4a59-acbd-a6d58463cb41","resolution":{"observed_at":"2026-08-06T15:09:51.569084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.12421","last_updated":"2020-10-26T09:14:54Z","snapshot_observed_at":"2026-07-06T10:07:41.319350Z","submitted_at":"2020-10-23T14:11:04Z","title":"TweetEval: Unified Benchmark and Comparative Evaluation for Tweet Classification","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.12421","snapshot_observed_at":"2026-08-06T15:09:51.286456Z","title":"Tweeteval: Unified benchmark and comparative evaluation for tweet classification,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.286456Z"},"links":{"cited_paper":"/paper/2010.12421","citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:1ae1c87dfa60b916748a54d86dd3373c2124ab770dbacc241d5856b952c37c3d","observation_id":"b6535adb-de64-434d-851f-751048934d89","resolution":{"observed_at":"2026-08-06T15:09:51.286456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-07-30T09:12:38.100527Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-06T15:09:51.292140Z","title":"BERT: pre-training of deep bidirectional transformers for language understanding,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.292140Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:d62247c2b023e33698f5c736b480d6482fdf1c286cc148b03134aadbad568bb3","observation_id":"61bcf8a5-ed82-49d8-937c-60c3c366ee28","resolution":{"observed_at":"2026-08-06T15:09:51.292140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.11692","last_updated":"2019-07-26T17:48:29Z","snapshot_observed_at":"2026-07-31T22:31:37.910868Z","submitted_at":"2019-07-26T17:48:29Z","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.11692","snapshot_observed_at":"2026-08-06T15:09:51.297270Z","title":"Roberta: A robustly optimized bert pretraining approach,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.297270Z"},"links":{"cited_paper":"/paper/1907.11692","citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:5e61d61dcc8f8f576bdcced24705aaaeef016c36c356a9b092b387c2043122c3","observation_id":"06c13310-b89d-48e4-905f-62da30f1cddf","resolution":{"observed_at":"2026-08-06T15:09:51.297270Z","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-06T15:09:51.544696Z","title":"Support-vector networks,","venue":null,"work_id":"9851a926-9493-4fe4-bd43-c2dad3dcc650","year":1995},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.302327Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:30a5c6a30f4f1e4b16f8918d745ea7e693f601b053cdbfd2cf6762e7b2d3f199","observation_id":"b10fe64a-4d2f-462a-8b5e-b8477bda4bcf","resolution":{"observed_at":"2026-08-06T15:09:51.551210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T15:09:51.527795Z","title":"Long short-term memory,","venue":null,"work_id":"a08a9246-f8a8-4bdd-a6ac-af37b767cddc","year":1997},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.307783Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:e41b2c966fb29531c0d20930f88d63bf550a16005a7d08549fc0285fc85b8739","observation_id":"b5708b33-a24e-4b30-be20-f2a8c0a1cf22","resolution":{"observed_at":"2026-08-06T15:09:51.533216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1607.01759","last_updated":"2016-08-09T17:38:43Z","snapshot_observed_at":"2026-07-06T05:02:39.487370Z","submitted_at":"2016-07-06T19:40:15Z","title":"Bag of Tricks for Efficient Text Classification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.01759","snapshot_observed_at":"2026-08-06T15:09:51.312848Z","title":"Bag of tricks for efficient text classification,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.312848Z"},"links":{"cited_paper":"/paper/1607.01759","citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:6d243430d0a5cdeda5e9a646f58f594ee9db22306e12bb0bc2b98ecbd41072f3","observation_id":"f4724891-9b54-44ca-92bf-4cc0273b36af","resolution":{"observed_at":"2026-08-06T15:09:51.312848Z","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-06T15:09:51.506798Z","title":"Maximum entropy information bottleneck for uncertainty-aware stochastic em- bedding,","venue":null,"work_id":"1383a543-0310-4c78-85ac-7e98e374ceb5","year":2023},"citing_paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T15:09:51.318465Z"},"links":{"citing_paper":"/paper/2507.16881"},"observation_digest":"sha256:de6d908ed8192ccf78d6585635c3f9955b4c3c32a5d07a4fc0a5a1efa7cdf104","observation_id":"9493dc35-34d4-4dfe-857b-9ecce055e04a","resolution":{"observed_at":"2026-08-06T15:09:51.515103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.16881","last_updated":"2025-07-22T15:32:27Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T15:01:40.323089Z","submitted_at":"2025-07-22T15:32:27Z","title":"Confidence Optimization for Probabilistic Encoding"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":11},"total_outbound_references":18},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2507.16881."}