{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VQYHWWMYD5WF3UI22KOM3SXQRT","short_pith_number":"pith:VQYHWWMY","schema_version":"1.0","canonical_sha256":"ac307b59981f6c5dd11ad29ccdcaf08cd4e9c715524fd624f3299fe3213b6430","source":{"kind":"arxiv","id":"1205.1868","version":2},"attestation_state":"computed","paper":{"title":"Low Rank Estimation of Similarities on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Pedro Rangel, Vladimir Koltchinskii","submitted_at":"2012-05-09T04:22:23Z","abstract_excerpt":"Let (V, E) be a graph with vertex set V and edge set E. Let (X, X', Y) \\in V \\times V \\times {-1, 1} be a random triple, where X, X' are independent uniformly distributed vertices and Y is a label indicating whether X, X' are \"similar\" (Y = +1), or not (Y = -1). Our goal is to estimate the regression function S\\ast (u, v) = E(Y |X = u, X = v), u, v \\in V based on training data consisting of n i.i.d. copies of (X, X',Y). We are interested in this problem in the case when S\\ast is a symmetric low rank kernel and, in addition to this, it is assumed that S\\ast is \"smooth\" on the graph. We study es"},"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":"1205.1868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-05-09T04:22:23Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8e4171e7dee5712fc5e6a3d67243ba978bbf46708bdc0fcb0c539e993143962e","abstract_canon_sha256":"ec591cbc2d236efc4a54a327c9a2efb1a65e120bcdc10bf2cbc3c789b563a50c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:46.210638Z","signature_b64":"oZz58jfWW+An7oUsMKtw1nptbqAmCjS0+hZk1RUOKjkDPc302+w3IhiskMYVSvMbL4IQX3XROVwv77J6j3MWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac307b59981f6c5dd11ad29ccdcaf08cd4e9c715524fd624f3299fe3213b6430","last_reissued_at":"2026-05-18T03:55:46.210148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:46.210148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Rank Estimation of Similarities on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Pedro Rangel, Vladimir Koltchinskii","submitted_at":"2012-05-09T04:22:23Z","abstract_excerpt":"Let (V, E) be a graph with vertex set V and edge set E. Let (X, X', Y) \\in V \\times V \\times {-1, 1} be a random triple, where X, X' are independent uniformly distributed vertices and Y is a label indicating whether X, X' are \"similar\" (Y = +1), or not (Y = -1). Our goal is to estimate the regression function S\\ast (u, v) = E(Y |X = u, X = v), u, v \\in V based on training data consisting of n i.i.d. copies of (X, X',Y). We are interested in this problem in the case when S\\ast is a symmetric low rank kernel and, in addition to this, it is assumed that S\\ast is \"smooth\" on the graph. We study es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1868","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":""},"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":"1205.1868","created_at":"2026-05-18T03:55:46.210220+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1868v2","created_at":"2026-05-18T03:55:46.210220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1868","created_at":"2026-05-18T03:55:46.210220+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQYHWWMYD5WF","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQYHWWMYD5WF3UI2","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQYHWWMY","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT","json":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT.json","graph_json":"https://pith.science/api/pith-number/VQYHWWMYD5WF3UI22KOM3SXQRT/graph.json","events_json":"https://pith.science/api/pith-number/VQYHWWMYD5WF3UI22KOM3SXQRT/events.json","paper":"https://pith.science/paper/VQYHWWMY"},"agent_actions":{"view_html":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT","download_json":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT.json","view_paper":"https://pith.science/paper/VQYHWWMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1868&json=true","fetch_graph":"https://pith.science/api/pith-number/VQYHWWMYD5WF3UI22KOM3SXQRT/graph.json","fetch_events":"https://pith.science/api/pith-number/VQYHWWMYD5WF3UI22KOM3SXQRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/action/storage_attestation","attest_author":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/action/author_attestation","sign_citation":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/action/citation_signature","submit_replication":"https://pith.science/pith/VQYHWWMYD5WF3UI22KOM3SXQRT/action/replication_record"}},"created_at":"2026-05-18T03:55:46.210220+00:00","updated_at":"2026-05-18T03:55:46.210220+00:00"}