{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:AZXYPT32PI7Z6V4KLVYMTOJCD7","short_pith_number":"pith:AZXYPT32","schema_version":"1.0","canonical_sha256":"066f87cf7a7a3f9f578a5d70c9b9221fe31e8caf7ee8c3190f906ce18c76dc19","source":{"kind":"arxiv","id":"2006.00402","version":2},"attestation_state":"computed","paper":{"title":"Doubly-Stochastic Normalization of the Gaussian Kernel is Robust to Heteroskedastic Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Boris Landa, Ronald R.Coifman, Yuval Kluger","submitted_at":"2020-05-31T01:31:10Z","abstract_excerpt":"A fundamental step in many data-analysis techniques is the construction of an affinity matrix describing similarities between data points. When the data points reside in Euclidean space, a widespread approach is to from an affinity matrix by the Gaussian kernel with pairwise distances, and to follow with a certain normalization (e.g. the row-stochastic normalization or its symmetric variant). We demonstrate that the doubly-stochastic normalization of the Gaussian kernel with zero main diagonal (i.e., no self loops) is robust to heteroskedastic noise. That is, the doubly-stochastic normalizatio"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2006.00402","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-05-31T01:31:10Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"6e50eb170257ea0cb73ba541f980bb0c03c4eae5ce7fd01b68c42810cb48b5dd","abstract_canon_sha256":"8d68d261d9aec7f111e3540e3276cd97defe1815e1c3f0971ce0ee0be01fea2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:40.336956Z","signature_b64":"uE+iS5MQJQJz0edaber7LZDlhihu4fDfBp25PhglrsmEawNkcJ6KjGOFTH3TEsbNrdHwS0D+fEqsnIKDQfAXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"066f87cf7a7a3f9f578a5d70c9b9221fe31e8caf7ee8c3190f906ce18c76dc19","last_reissued_at":"2026-07-05T02:09:40.336493Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:40.336493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly-Stochastic Normalization of the Gaussian Kernel is Robust to Heteroskedastic Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Boris Landa, Ronald R.Coifman, Yuval Kluger","submitted_at":"2020-05-31T01:31:10Z","abstract_excerpt":"A fundamental step in many data-analysis techniques is the construction of an affinity matrix describing similarities between data points. When the data points reside in Euclidean space, a widespread approach is to from an affinity matrix by the Gaussian kernel with pairwise distances, and to follow with a certain normalization (e.g. the row-stochastic normalization or its symmetric variant). We demonstrate that the doubly-stochastic normalization of the Gaussian kernel with zero main diagonal (i.e., no self loops) is robust to heteroskedastic noise. That is, the doubly-stochastic normalizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00402","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.00402/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2006.00402","created_at":"2026-07-05T02:09:40.336541+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.00402v2","created_at":"2026-07-05T02:09:40.336541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00402","created_at":"2026-07-05T02:09:40.336541+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZXYPT32PI7Z","created_at":"2026-07-05T02:09:40.336541+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZXYPT32PI7Z6V4K","created_at":"2026-07-05T02:09:40.336541+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZXYPT32","created_at":"2026-07-05T02:09:40.336541+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28670","citing_title":"MACROCAST: A Vintage-Consistent Time Series Foundation Model for Real-Time Macroeconomic Forecasting","ref_index":129,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AZXYPT32PI7Z6V4KLVYMTOJCD7","json":"https://pith.science/pith/AZXYPT32PI7Z6V4KLVYMTOJCD7.json","graph_json":"https://pith.science/api/pith-number/AZXYPT32PI7Z6V4KLVYMTOJCD7/graph.json","events_json":"https://pith.science/api/pith-number/AZXYPT32PI7Z6V4KLVYMTOJCD7/events.json","paper":"https://pith.science/paper/AZXYPT32"},"agent_actions":{"view_html":"https://pith.science/pith/AZXYPT32PI7Z6V4KLVYMTOJCD7","download_json":"https://pith.science/pith/AZXYPT32PI7Z6V4KLVYMTOJCD7.json","view_paper":"https://pith.science/paper/AZXYPT32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.00402&json=true","fetch_graph":"https://pith.science/api/pith-number/AZXYPT32PI7Z6V4KLVYMTOJCD7/graph.json","fetch_events":"https://pith.science/api/pith-number/AZXYPT32PI7Z6V4KLVYMTOJCD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZXYPT32PI7Z6V4KLVYMTOJCD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZXYPT32PI7Z6V4KLVYMTOJCD7/action/storage_attestation","attest_author":"https://pith.science/pith/AZXYPT32PI7Z6V4KLVYMTOJCD7/action/author_attestation","sign_citation":"https://pith.science/pith/AZXYPT32PI7Z6V4KLVYMTOJCD7/action/citation_signature","submit_replication":"https://pith.science/pith/AZXYPT32PI7Z6V4KLVYMTOJCD7/action/replication_record"}},"created_at":"2026-07-05T02:09:40.336541+00:00","updated_at":"2026-07-05T02:09:40.336541+00:00"}