{"as_of":"2026-08-17T02:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:084ded31e6f0041f3c00b561e2c9245cf8bf2fb2d9e5640c21bf775891e83fa1","coverage":[{"denominator":36,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":36,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:35:16.503206Z","state":"measured"},{"denominator":36,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":36,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1909.04138/citation-record","integrity":"/paper/1909.04138/integrity","json":"/paper/1909.04138/citation-record.json","paper":"/paper/1909.04138"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:35:16.384932Z","title":"Deep learning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.384932Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:4dda33515f04c42a39d9e28762d2efec34b95327ba069ec1253a5c2298c035c7","observation_id":"a5f35c6a-4258-4058-bec9-8b4c2f83787e","resolution":{"observed_at":"2026-08-14T11:35:16.384932Z","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-14T11:35:16.820673Z","title":"Imagenet classifica- tion with deep convolutional neural networks,","venue":null,"work_id":"09c951dd-84da-4f32-be65-b4df145070e2","year":2012},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.389426Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:80e60ae60884f6fa841941b09fd1f1b118edf135d17d476de5ad7337e2e1df40","observation_id":"44f3e12e-8746-4325-b469-83df66b3b0e8","resolution":{"observed_at":"2026-08-14T11:35:16.823668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.812753Z","title":"Dermatologist-level classification of skin cancer with deep neural networks,","venue":null,"work_id":"fe3c42f5-6942-47ff-9f69-9a7a7545586f","year":2017},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.392924Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:d9afae651ee971cda9ca58e6df6aeb1ac346badde3c32858acc108537107e3a4","observation_id":"ed7f5d85-8d4e-45cc-8900-a327d8fb82b6","resolution":{"observed_at":"2026-08-14T11:35:16.815679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.803768Z","title":"Using deep learning and google street view to estimate the demographic makeup of neighborhoods across the united states,","venue":null,"work_id":"398e588f-c8c0-4e57-bf45-d4fcd4de2e65","year":2017},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.395895Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:90e3d2b42c22f399987e83f02342bedc61447a94528f23b3efd0f8039feec41d","observation_id":"5ef271a5-41fb-48bc-a7d3-c234dabb94cf","resolution":{"observed_at":"2026-08-14T11:35:16.807136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.796318Z","title":"An explainable deep machine vision framework for plant stress phenotyping,","venue":null,"work_id":"9d202023-b113-4573-8119-b3a14e81bf05","year":2018},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.399268Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:c7516c9f68a77cb6e7ce5523b1a833cadfaf34e65c08ee65310b8f2be1315bf1","observation_id":"ebd3aa6a-5cbe-4278-b6c8-af8055fc3fbc","resolution":{"observed_at":"2026-08-14T11:35:16.799127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.788378Z","title":"Automatically identifying, count- ing, and describing wild animals in camera-trap images with deep learning,","venue":null,"work_id":"ffb13891-507b-4549-b73b-9200eae74a8e","year":2018},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.402674Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:60c5818ec144220485b307a93f7132693f5ff6ab7ca23e777988b2e07d9232e8","observation_id":"426c1f1e-c765-4463-9dde-3aade17c2d32","resolution":{"observed_at":"2026-08-14T11:35:16.791531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.780296Z","title":"Self-paced learning with diversity,","venue":null,"work_id":"bb2175e9-3fbc-4efd-a38a-333f7e0e3c17","year":2014},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.406236Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:04c8fdfb386d4d829aaa2194fa6b28346c27053867d663c4f09013c82e8a4dae","observation_id":"4b6af271-13bc-4251-b52c-2fa39d2363ac","resolution":{"observed_at":"2026-08-14T11:35:16.783316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.771164Z","title":"Fast mixing markov chains for strongly rayleigh measures, dpps, and constrained sampling,","venue":null,"work_id":"8927a4b2-8a02-4c11-8ed4-55653e4679c9","year":2016},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.409143Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:571b12a6317fc764eb058e4633863f93be78a4b168b56784c7eaba9de4a55d19","observation_id":"2608edaa-f14b-4d57-9d06-8032c8952761","resolution":{"observed_at":"2026-08-14T11:35:16.775142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.761023Z","title":"Low-shot learning from imaginary data,","venue":null,"work_id":"aa854041-8f1f-4a6e-99fc-cf5a27ed64aa","year":2018},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.412625Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:4a4feaa27defd6fd431493c59716ccb192f76629ca4b5cd3a60fb26b0c9c0058","observation_id":"7ead49e4-12ed-446f-8947-021f415a7e44","resolution":{"observed_at":"2026-08-14T11:35:16.764119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1805.09501","last_updated":"2019-04-11T22:39:27Z","snapshot_observed_at":"2026-08-14T19:11:44.108868Z","submitted_at":"2018-05-24T04:05:42Z","title":"AutoAugment: Learning Augmentation Policies from Data","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.09501","snapshot_observed_at":"2026-08-14T11:35:16.416543Z","title":"Autoaugment: Learning augmentation policies from data,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.416543Z"},"links":{"cited_paper":"/paper/1805.09501","citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:18c28cfc1915ca629a2f70834a58225a243dd055f9d4ad6ae05f444643e23dce","observation_id":"ac4f1afe-873c-4ee7-ada4-ca8b32b49a8c","resolution":{"observed_at":"2026-08-14T11:35:16.416543Z","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-14T11:35:16.751475Z","title":"Unbiased look at dataset bias,","venue":null,"work_id":"4eb930f7-7456-4584-bd57-e00dd11890e4","year":2011},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.420559Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:5cd43bf4f67e64fc1299877e89e8e109125854ddb0a0e2565169f4aac55c8ccc","observation_id":"e8aace19-7bca-4b61-a036-bbff54c858ff","resolution":{"observed_at":"2026-08-14T11:35:16.755019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.740266Z","title":"Domain adaptation for object recognition: An unsupervised approach,","venue":null,"work_id":"6bd9e285-5880-4a7a-a848-a5ed0c47f1f0","year":2011},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.424244Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:e167c0b4f1517e5ef7ed786faa8f1547342351b5a7dc70a30935d31c9ab50e96","observation_id":"f2cba526-3d96-48ac-a7e5-e7becd01e334","resolution":{"observed_at":"2026-08-14T11:35:16.744246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.730144Z","title":"Lifelong machine learning,","venue":null,"work_id":"f15d16eb-468c-4c7c-978d-8521e611509a","year":2016},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.427593Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:23212c5047a5a1123162cd7ac285cc2c40d6d9866ed57cee61a2d6ea0d3eb38e","observation_id":"4513ac65-32e8-42d1-a30a-532b2ca9d795","resolution":{"observed_at":"2026-08-14T11:35:16.733534Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.722023Z","title":"Data- driven visual similarity for cross-domain image matching,","venue":null,"work_id":"475be207-471b-4a38-be12-c853ab2adbea","year":2011},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.430166Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:f6d8d935fa50116ecb4028474debfd6eeac331acedbbbcb1f929154c0e6b34c3","observation_id":"08e40f06-b905-41bc-90e3-1d9856eba44c","resolution":{"observed_at":"2026-08-14T11:35:16.725164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.712455Z","title":"Distance metric learning with application to clustering with side-information,","venue":null,"work_id":"5788de7c-407d-40de-9add-f45ac986a4ec","year":2003},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.434354Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:6d8278d64ce16742fe17dc9e678000d69675d1556411be0046477255adf34036","observation_id":"218a1334-3849-47ab-b7c8-b9d6e864a25f","resolution":{"observed_at":"2026-08-14T11:35:16.716194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.701790Z","title":"Distance metric learning for large margin nearest neighbor classification,","venue":null,"work_id":"6248e1f0-d703-42a6-bd99-6032c5c58f46","year":2009},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.437486Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:0e11c9214b7f0cd951c3a36d1af17530d356ae3b1f7e78357657e438d527a2fa","observation_id":"4362b4d1-f0fa-4953-a4f3-de458b1577f2","resolution":{"observed_at":"2026-08-14T11:35:16.706802Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.693277Z","title":"Writer adaptation with style transfer mapping,","venue":null,"work_id":"6e4f8d2b-eb49-4ac8-91fb-aa69a52c1acd","year":2013},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.440053Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:2bcccd05ef0563f79086247be52d673484ca63027721ea4b95b5cd5c1d1ddc2f","observation_id":"36c7ba35-199a-46ad-b798-67bfbe2d01f8","resolution":{"observed_at":"2026-08-14T11:35:16.696112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.3474","last_updated":"2014-12-10T21:20:54Z","snapshot_observed_at":"2026-08-14T23:08:06.157493Z","submitted_at":"2014-12-10T21:20:54Z","title":"Deep Domain Confusion: Maximizing for Domain Invariance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.3474","snapshot_observed_at":"2026-08-14T11:35:16.443390Z","title":"Deep domain confusion: Maximizing for domain invariance,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.443390Z"},"links":{"cited_paper":"/paper/1412.3474","citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:7c5476ea5c5d6352b37f27198b59ebcebf7cb56c52a8cf7dbcc18505b2586ef2","observation_id":"fc26741a-001a-4677-98db-fd3b951cd9dd","resolution":{"observed_at":"2026-08-14T11:35:16.443390Z","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-14T11:35:16.683204Z","title":"Dynamic programming algorithm op- timization for spoken word recognition,","venue":null,"work_id":"87ef344e-76fd-4286-88b0-22b075d59758","year":1978},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.446770Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:ec18856e316f4cbe55678aa185fd843306f6c2ac51071dcb8882e94a73b860cb","observation_id":"575213fc-0c66-4a19-86d5-4694e6fbc453","resolution":{"observed_at":"2026-08-14T11:35:16.687110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.674147Z","title":"Wundt, Lectures on human and animal psychology (Psychology revivals)","venue":null,"work_id":"07652336-0b1e-4f49-b252-2b1b34aa08e6","year":1912},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.449478Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:c59ed2c176de361c130c52de4f863101a94ba817c1abfc41afd9abfb6cf1ffcb","observation_id":"415a7d02-865e-4b9d-b0ca-7683c37d768e","resolution":{"observed_at":"2026-08-14T11:35:16.677293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.665164Z","title":"Stimulus similarity as a determinant of pavlovian conditioning,","venue":null,"work_id":"7403ad71-ee64-412a-844b-46148ac882b9","year":1977},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.452061Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:9a6c0234e78858e30f6c69bfc3a6f28d7d90548a7c85aaac5b4cf57e85748d07","observation_id":"5fd89cc9-a585-49db-a1ea-6098ebc123f8","resolution":{"observed_at":"2026-08-14T11:35:16.668398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.656087Z","title":"Behavior theory and the models of man","venue":null,"work_id":"8f9f3e2c-1745-403a-951e-3b909da38248","year":1974},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.455233Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:f25d69b783cb196a64183b5ea22984535792b5c5cfdea86edc897e058b1968a4","observation_id":"9a9453a2-20fa-4d9a-9918-e3bdc9a5bfdd","resolution":{"observed_at":"2026-08-14T11:35:16.659462Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.646375Z","title":"Happiness runs in a circular motion: Evidence for a positive feedback loop between prosocial spending and happiness,","venue":null,"work_id":"502bc207-da69-4bc1-9dc2-eb419796d832","year":2012},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.458250Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:c8847ba62ef13cf40de921cce631e89a2e65ece24a2738acdf02c30cf9eac796","observation_id":"8b2ecbe9-d847-44c1-9bb1-88dc66ab1e8f","resolution":{"observed_at":"2026-08-14T11:35:16.650019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.636465Z","title":null,"venue":null,"work_id":"01cb4486-24b2-46cd-9e76-afc6a0fc7fb2","year":2005},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.461061Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:6019c3dfd8c5c54af5f4e23afd88d689017c6860b3b02b3b6c241fac36bd19bb","observation_id":"ee6074be-c6aa-47e7-b59c-0a9f75b2148e","resolution":{"observed_at":"2026-08-14T11:35:16.640007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1409.1556","last_updated":"2015-04-10T16:25:04Z","snapshot_observed_at":"2026-08-14T23:20:42.336514Z","submitted_at":"2014-09-04T19:48:04Z","title":"Very Deep Convolutional Networks for Large-Scale Image Recognition","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.1556","snapshot_observed_at":"2026-08-14T11:35:16.464480Z","title":"Very deep convolutional networks for large-scale image recognition,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.464480Z"},"links":{"cited_paper":"/paper/1409.1556","citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:80e8c12f1e652d603f7a7a76298c1e0f65de0b8c65e5d315eea73f2761f34183","observation_id":"89f94386-d879-4600-8f87-417d6901311d","resolution":{"observed_at":"2026-08-14T11:35:16.464480Z","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-14T11:35:16.468587Z","title":"Rectified linear units improve restricted boltzmann machines,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.468587Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:afc0ab296917cf8b28c528ac480ac93515a8f8bec6d63cece65450ffa6b7015e","observation_id":"17d660ee-c4a1-4277-8f63-e0f4787025f5","resolution":{"observed_at":"2026-08-14T11:35:16.468587Z","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-14T11:35:16.622397Z","title":null,"venue":null,"work_id":"9e8b9827-ac72-429a-ac2e-9733d895606b","year":1995},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.472488Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:ddfad9f8c51c02bb671317a63a3eaae4cfd3c1e36810a337706ad38d61a73d96","observation_id":"5016346e-31c3-4657-b42b-89a4b1b139ac","resolution":{"observed_at":"2026-08-14T11:35:16.626194Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.613822Z","title":null,"venue":null,"work_id":"2e3b5594-3a9a-40df-8d7d-a4c065c07bdd","year":2006},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.476621Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:67cf79fb42525aa2148e625a79c22d9d65ca62c89843d56ca256e4b44ae829d1","observation_id":"1ca6231d-71a8-4ff7-a079-ffbd6c95bd9c","resolution":{"observed_at":"2026-08-14T11:35:16.616881Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.479778Z","title":"The expectation-maximization algorithm,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.479778Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:2df5db5e3cbc8b07b1d1317ea3ca32920e1eb7df3c8a20cb89dbe5a87c2fc066","observation_id":"0f23cfed-111e-49ce-b8e3-94c19e455dab","resolution":{"observed_at":"2026-08-14T11:35:16.479778Z","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-14T11:35:16.598747Z","title":"A gentle tutorial of the em algorithm and its application to parameter estimation for gaussian mixture and hidden markov models,","venue":null,"work_id":"4a792aa3-f996-4134-b281-840c4fa07caa","year":1998},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.482693Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:8eb05d5d9c32354ff9a76263b74cd9ae09acb2efe711164823203025627ed868","observation_id":"24173163-453b-4a3e-b12b-739561b147c0","resolution":{"observed_at":"2026-08-14T11:35:16.602334Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.587787Z","title":"Semantic radicals contribute to the visual identification of chinese characters,","venue":null,"work_id":"c9d908e4-d65b-430d-b84d-c3e9e0ebb5fc","year":1999},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.485853Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:bc9a86a545e78f7f451c5fa916e423030c9f2ebb7ed9e65a8f495d8e0b342e91","observation_id":"a51ae711-7ed8-4cc4-afe7-2635360052ba","resolution":{"observed_at":"2026-08-14T11:35:16.592397Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.578678Z","title":"The german traffic sign recognition benchmark: a multi-class classification competition,","venue":null,"work_id":"eb053c21-527f-4d4a-a3ab-2df13c4e2189","year":2011},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.489197Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:21b96ba539c5b6111e1acb1672a8b751f1df819d64294c0a68a0969f5f629b84","observation_id":"90f09a68-95cf-48a9-bcb1-29a9f5537adb","resolution":{"observed_at":"2026-08-14T11:35:16.582097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.569408Z","title":"Incorporating nesterov momentum into adam,","venue":null,"work_id":"643b02bd-5546-467a-8b08-e288558dab7a","year":2016},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.492592Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:dd770732dc327fa4c0b7f733b4d180b0f6cfa8467f64f49ff3fa3e936517d50a","observation_id":"931f4853-f8f1-4182-beae-8ac05d7c9e08","resolution":{"observed_at":"2026-08-14T11:35:16.572437Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:35:16.496293Z","title":"Adam: A method for stochastic optimiza- tion,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.496293Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:e46923f5f7900c5727595d685fb16f29b281c8ad275344fd4f039f7b4c5f1357","observation_id":"d7897eba-0c06-4fc2-bf75-4df896d1cdb6","resolution":{"observed_at":"2026-08-14T11:35:16.496293Z","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-14T11:35:16.499892Z","title":"Long short-term memory,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.499892Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:2fc84bd2d6ce939a60c9b712417e6fbf4e1c25dd5af8ecdd15eb28c6f6d2185d","observation_id":"d0197762-dc69-412d-a900-d39c9a03ee20","resolution":{"observed_at":"2026-08-14T11:35:16.499892Z","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-14T11:35:16.547570Z","title":"Reducing the dimension- ality of data with neural networks,","venue":null,"work_id":"5bc9f4a7-9fd6-4b94-8a43-1e2ef83f86a4","year":2006},"citing_paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:35:16.503206Z"},"links":{"citing_paper":"/paper/1909.04138"},"observation_digest":"sha256:21391eccf3c73f0cee9fda62075933e6ef8b96f59340cfb4b830103ee349fd0b","observation_id":"0eb6211b-25bf-4b3a-89f5-9c208ff257de","resolution":{"observed_at":"2026-08-14T11:35:16.553565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1909.04138","last_updated":"2019-08-23T10:43:43Z","latest_version":1,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-16T19:13:28.538590Z","submitted_at":"2019-08-23T10:43:43Z","title":"Self-reinforcing Unsupervised Matching"},"reference_resolution":{"displayed":36,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":36},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:1909.04138."}