{"as_of":"2026-08-18T12:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ab64040a1ef59bc9d3564f3d4c0ba0fccc7de9a2f5a70799c353af74556c0cfc","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:40:06.461037Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2501.13031/citation-record","integrity":"/paper/2501.13031/integrity","json":"/paper/2501.13031/citation-record.json","paper":"/paper/2501.13031"},"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-10T16:40:06.736983Z","title":null,"venue":null,"work_id":"25064ad1-b794-41bc-a0c7-91e39b7aee10","year":null},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.368681Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:cc90083aada1f8574ab011ce5c6e57bd5432e648387798df8cecb2239b7d4564","observation_id":"f3104766-8129-4c60-8e96-f3422c853a24","resolution":{"observed_at":"2026-08-10T16:40:06.740836Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.724940Z","title":"a ckinger, and Roopak Shah. Signature verification using a","venue":null,"work_id":"e22ebbf9-5119-41d3-a8fc-8f68d4310bf6","year":1993},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.374828Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:510e91fc78c18fc709fde2e6bd6eba7075480ef2d7d53c2370c2266736b8b3be","observation_id":"98beb359-437d-4118-a74a-3b3cc099186c","resolution":{"observed_at":"2026-08-10T16:40:06.729039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.712999Z","title":"Self-supervised learning of pretext-invariant representations","venue":null,"work_id":"459c4bb2-13ee-4975-8d9a-af90513fa2c8","year":2020},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.378985Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:06fea76438098bec8d646a15b7f514e5e1a5d758993770dbb0fe93c4fd736133","observation_id":"0eadf03a-9c1d-4a44-b9fa-f051d92e769b","resolution":{"observed_at":"2026-08-10T16:40:06.716972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.700381Z","title":"Self-supervised video representation learning with odd-one-out networks","venue":null,"work_id":"5523c67d-2c47-4728-91bb-c373c7c8b922","year":2017},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.382727Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:6f0f9f1df14b2ad5f84bbb502f679bb240baf2dfec1c4b1e185c764247f081a1","observation_id":"3ce2c9df-eef3-4f53-b004-d79461dc380c","resolution":{"observed_at":"2026-08-10T16:40:06.705175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.687951Z","title":"A simple framework for contrastive learning of visual representations","venue":null,"work_id":"e4caf36e-defe-485e-886c-11d1203bc941","year":2020},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.386949Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:e88c57bf6fd193aa0d57e8c5caa10433868cc27f357101f4b45334366f4874d6","observation_id":"38776f6d-8e4b-4da5-9e21-2520520fd1f8","resolution":{"observed_at":"2026-08-10T16:40:06.691913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.677366Z","title":"wav2vec: Unsupervised pre-training for speech recognition, 2019","venue":null,"work_id":"9723cc9d-716d-46a5-8726-8092821e7f9a","year":2019},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.391092Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:69e8ae755d99a275bb67dddf6cad326b3998d2f717d920b6bbed6f19b9b2c4a4","observation_id":"5165243f-cdf2-46b7-b8d4-ae18b070395c","resolution":{"observed_at":"2026-08-10T16:40:06.681126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.667289Z","title":"Representation learning: A review and new perspectives","venue":null,"work_id":"2f36681a-f100-4806-ad6b-3f9710a19046","year":2013},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.395879Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:2d9efd0acbda6cc0dbbff0db737f0abb7dc7b90093e8811d307a9425bdbb1146","observation_id":"fc255b94-6f02-4476-85bc-95b330a9bb34","resolution":{"observed_at":"2026-08-10T16:40:06.670820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.399984Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.399984Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:ea3b076a90a976aecd16a52ef06ef0656ad271c9baf979aa065587d3fbda1d71","observation_id":"92d4b171-1d63-4eac-a32c-9c47fcce1971","resolution":{"observed_at":"2026-08-10T16:40:06.399984Z","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-10T16:40:06.403777Z","title":"Probabilistic principal component analysis","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.403777Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:2d3bafb90d5f9190a52deb0abcacd1d191eb4ed20a0a1541825aab10e397946b","observation_id":"b305e58c-0d7c-4a42-8e72-da5c50763118","resolution":{"observed_at":"2026-08-10T16:40:06.403777Z","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-10T16:40:06.643114Z","title":"Probabilistic non-linear principal component analysis with gaussian process latent variable models","venue":null,"work_id":"90134308-9c32-45e7-9e18-7927989598ca","year":2005},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.407460Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:341df991b9b4ec695e439c51a9dabae9f70558d2844e56893cc268f3f6491380","observation_id":"50fca214-4426-41e2-b142-beaac0c29f06","resolution":{"observed_at":"2026-08-10T16:40:06.646805Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.631766Z","title":"Barlow twins: Self-supervised learning via redundancy reduction","venue":null,"work_id":"da2c0b54-6556-4d01-9ff1-18e796c2cdac","year":2021},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.411346Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:592f71a773285e45438880f8d3cf2addc10cb596bb34320e0bb1e4f8a0bf9356","observation_id":"f6f74e65-8eb9-4650-b811-341f2fc0a33f","resolution":{"observed_at":"2026-08-10T16:40:06.635557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.04906","last_updated":"2022-01-28T12:23:37Z","snapshot_observed_at":"2026-08-12T14:02:29.797842Z","submitted_at":"2021-05-11T09:53:21Z","title":"VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.04906","snapshot_observed_at":"2026-08-10T16:40:06.414899Z","title":"Vicreg: Variance-invariance-covariance regularization for self-supervised learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.414899Z"},"links":{"cited_paper":"/paper/2105.04906","citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:a4e1905015873425670a1c217e4100bd023f5ef8a1b4ff56d9bff68830f8b093","observation_id":"77638919-30ba-49f3-920e-d9e31952f64c","resolution":{"observed_at":"2026-08-10T16:40:06.414899Z","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-10T16:40:06.621547Z","title":"Toward understanding the feature learning process of self-supervised contrastive learning","venue":null,"work_id":"a8da7e86-2f6b-4030-a134-fe71093bce67","year":2021},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.419520Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:c701f3954e1e0db27d9c9b519a2893b2f401decdcde41c3b753a537294868c72","observation_id":"5908b507-92ca-4c7b-b85d-83f48d9f18f1","resolution":{"observed_at":"2026-08-10T16:40:06.625175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.610826Z","title":"Towards a unified theoretical understanding of non-contrastive learning via rank differential mechanism","venue":null,"work_id":"d21e1991-cfe9-4ca0-8a23-ee6f818e15b1","year":2023},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.423860Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:12cb4ca817b2d20ede9f103e443527af284c17f65855ee8ff0afba6c445aa547","observation_id":"6fb38a49-011c-476d-bed7-2b0d05df14c6","resolution":{"observed_at":"2026-08-10T16:40:06.614778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15702","last_updated":"2022-03-29T16:08:31Z","snapshot_observed_at":"2026-08-16T17:10:52.660704Z","submitted_at":"2022-03-29T16:08:31Z","title":"Contrasting the landscape of contrastive and non-contrastive learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15702","snapshot_observed_at":"2026-08-10T16:40:06.427588Z","title":"Contrasting the landscape of contrastive and non-contrastive learning","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.427588Z"},"links":{"cited_paper":"/paper/2203.15702","citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:9996f4f15d87ffc70ceb323c8de2a8ee2f7ffee15b7e01452812624607aa9558","observation_id":"2866c0ee-f1b6-4946-96d2-b3f97fddc07b","resolution":{"observed_at":"2026-08-10T16:40:06.427588Z","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-10T16:40:06.600851Z","title":"Representation learning dynamics of self-supervised models","venue":null,"work_id":"70ffbc5e-f988-417d-8b67-e69318730a8e","year":2023},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.431325Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:5d3b5c86e2aadd6e1e39f60e9c1f6bf5bf016140627729f2489a48850b3027cc","observation_id":"aa1a52ed-e632-4d8f-8d07-64b3c269e8ca","resolution":{"observed_at":"2026-08-10T16:40:06.604337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.590612Z","title":"A theoretical analysis of contrastive unsupervised representation learning","venue":null,"work_id":"fb21b37f-5fb8-4860-aa99-f4558a43475a","year":2019},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.434698Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:c6181b0d01f2cf1618f42830fab4c1806c51b8a2a953d23d5cf2a5a5fb016573","observation_id":"ac57e284-2cd0-42e6-94c6-7e45e00281f3","resolution":{"observed_at":"2026-08-10T16:40:06.594289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.580654Z","title":"Why do pretrained language models help in downstream tasks? an analysis of head and prompt tuning","venue":null,"work_id":"9dc10c5d-6bf1-46b8-8c10-e6c5804cee52","year":2021},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.438076Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:fc00c0c430eec281d7eab7d7f657c60b7f3ed0aded8fa8e98a63c5ff04dd34f5","observation_id":"046b038e-76a4-4901-bac1-339bde7201ed","resolution":{"observed_at":"2026-08-10T16:40:06.584080Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.11673","last_updated":"2024-01-31T03:02:06Z","snapshot_observed_at":"2026-08-16T15:59:44.584068Z","submitted_at":"2023-01-27T12:13:06Z","title":"Bayesian Self-Supervised Contrastive Learning","version":4},"cited_work":{"arxiv_id":"2301.11673","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.11673","snapshot_observed_at":"2026-08-10T16:40:06.524053Z","title":"Bayesian Self-Supervised Contrastive Learning","venue":"cs.LG","work_id":"aedaf22a-05c0-46fa-b227-de0bae9c9f51","year":2023},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.443218Z"},"links":{"cited_paper":"/paper/2301.11673","citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:e645057afd09152f5b2293957960cd8a68bc89e6cdcbc61a976fce8f2102e57e","observation_id":"1da3a638-ecbf-423c-8955-82db0191dfa7","resolution":{"observed_at":"2026-08-10T16:40:06.528089Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.02048","last_updated":"2023-09-05T08:48:25Z","snapshot_observed_at":"2026-08-16T15:03:16.508890Z","submitted_at":"2023-09-05T08:48:25Z","title":"Probabilistic Self-supervised Learning via Scoring Rules Minimization","version":1},"cited_work":{"arxiv_id":"2309.02048","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.02048","snapshot_observed_at":"2026-08-10T16:40:06.507584Z","title":"Probabilistic Self-supervised Learning via Scoring Rules Minimization","venue":"cs.LG","work_id":"f65d2c99-8ed2-4dbd-88b1-8b4f35afc938","year":2023},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.447870Z"},"links":{"cited_paper":"/paper/2309.02048","citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:a038d394b78e8f01a3a5685a97e35d1e25c3a33d036a5de8dc00a250a5c9bc2d","observation_id":"a0285a73-da83-448e-b3f0-17a768c72d07","resolution":{"observed_at":"2026-08-10T16:40:06.513461Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.01399","last_updated":"2024-10-15T13:16:13Z","snapshot_observed_at":"2026-08-16T14:22:09.037607Z","submitted_at":"2024-02-02T13:31:17Z","title":"A Probabilistic Model Behind Self-Supervised Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.01399","snapshot_observed_at":"2026-08-10T16:40:06.452541Z","title":"A probabilistic model to explain self-supervised representation learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.452541Z"},"links":{"cited_paper":"/paper/2402.01399","citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:b5785f8bde490854b0355aebfbf88baedba863caabd9c6eef205bcdc6fde7241","observation_id":"1a63cdb7-f5e8-44c9-9f50-abd5423eb56f","resolution":{"observed_at":"2026-08-10T16:40:06.452541Z","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-10T16:40:06.570201Z","title":"Contrastive learning inverts the data generating process","venue":null,"work_id":"26dfafaa-98f2-4582-8419-9da476a913b5","year":2021},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.457457Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:53419c360217f3bdab1cbb2be42d94c0f61a810ca9d80d591450adb4698bf700","observation_id":"5dda3a5b-7568-46b2-b9e9-0830bcbd962c","resolution":{"observed_at":"2026-08-10T16:40:06.574165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-10T16:40:06.558595Z","title":"Representation learning with contrastive predictive coding","venue":null,"work_id":"a9343997-1fc5-401d-b4f2-d75e1cfc3d22","year":2018},"citing_paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-10T16:40:06.461037Z"},"links":{"citing_paper":"/paper/2501.13031"},"observation_digest":"sha256:437b138aacf83e60d9192bd8168ab2191cc5fe545de0f9e6d0acd4a4fd7794a2","observation_id":"5eb60955-d88b-415f-b483-c0359b1f95ee","resolution":{"observed_at":"2026-08-10T16:40:06.563269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.13031","last_updated":"2025-05-26T12:40:32Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T19:57:28.596613Z","submitted_at":"2025-01-22T17:25:47Z","title":"A Probabilistic Model for Non-Contrastive Learning"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":2,"verified_fuzzy":15},"total_outbound_references":23},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2501.13031."}