{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MCSKIT3U3XHFZNGKB4Q5TM3QTC","short_pith_number":"pith:MCSKIT3U","schema_version":"1.0","canonical_sha256":"60a4a44f74ddce5cb4ca0f21d9b37098a2490097dd1b298995c753d23141347e","source":{"kind":"arxiv","id":"1210.4846","version":1},"attestation_state":"computed","paper":{"title":"Variational Dual-Tree Framework for Large-Scale Transition Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Thiesson, Milos Hauskrecht, Saeed Amizadeh","submitted_at":"2012-10-16T17:34:45Z","abstract_excerpt":"In recent years, non-parametric methods utilizing random walks on graphs have been used to solve a wide range of machine learning problems, but in their simplest form they do not scale well due to the quadratic complexity. In this paper, a new dual-tree based variational approach for approximating the transition matrix and efficiently performing the random walk is proposed. The approach exploits a connection between kernel density estimation, mixture modeling, and random walk on graphs in an optimization of the transition matrix for the data graph that ties together edge transitions probabilit"},"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":"1210.4846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-16T17:34:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1a80db0339aec5d15924cd54afee81fc5fe4c791c48f07b786f181e458eb8fd5","abstract_canon_sha256":"dadc4890e8c67502015b0fb25ce036dd396edfeaa9d3487ec241e911f23887b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:55.525787Z","signature_b64":"4afvjzwXH1KV4dbpIenzi8F4Y3H+mLa6W49rbbZiLDD1NVntwL0lFlcbPCu+V5MjICCVrlfpFeo0lOK+FFrADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60a4a44f74ddce5cb4ca0f21d9b37098a2490097dd1b298995c753d23141347e","last_reissued_at":"2026-05-18T03:42:55.524993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:55.524993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational Dual-Tree Framework for Large-Scale Transition Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bo Thiesson, Milos Hauskrecht, Saeed Amizadeh","submitted_at":"2012-10-16T17:34:45Z","abstract_excerpt":"In recent years, non-parametric methods utilizing random walks on graphs have been used to solve a wide range of machine learning problems, but in their simplest form they do not scale well due to the quadratic complexity. In this paper, a new dual-tree based variational approach for approximating the transition matrix and efficiently performing the random walk is proposed. The approach exploits a connection between kernel density estimation, mixture modeling, and random walk on graphs in an optimization of the transition matrix for the data graph that ties together edge transitions probabilit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4846","kind":"arxiv","version":1},"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":"1210.4846","created_at":"2026-05-18T03:42:55.525133+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4846v1","created_at":"2026-05-18T03:42:55.525133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4846","created_at":"2026-05-18T03:42:55.525133+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCSKIT3U3XHF","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCSKIT3U3XHFZNGK","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCSKIT3U","created_at":"2026-05-18T12:27:14.488303+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/MCSKIT3U3XHFZNGKB4Q5TM3QTC","json":"https://pith.science/pith/MCSKIT3U3XHFZNGKB4Q5TM3QTC.json","graph_json":"https://pith.science/api/pith-number/MCSKIT3U3XHFZNGKB4Q5TM3QTC/graph.json","events_json":"https://pith.science/api/pith-number/MCSKIT3U3XHFZNGKB4Q5TM3QTC/events.json","paper":"https://pith.science/paper/MCSKIT3U"},"agent_actions":{"view_html":"https://pith.science/pith/MCSKIT3U3XHFZNGKB4Q5TM3QTC","download_json":"https://pith.science/pith/MCSKIT3U3XHFZNGKB4Q5TM3QTC.json","view_paper":"https://pith.science/paper/MCSKIT3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4846&json=true","fetch_graph":"https://pith.science/api/pith-number/MCSKIT3U3XHFZNGKB4Q5TM3QTC/graph.json","fetch_events":"https://pith.science/api/pith-number/MCSKIT3U3XHFZNGKB4Q5TM3QTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCSKIT3U3XHFZNGKB4Q5TM3QTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCSKIT3U3XHFZNGKB4Q5TM3QTC/action/storage_attestation","attest_author":"https://pith.science/pith/MCSKIT3U3XHFZNGKB4Q5TM3QTC/action/author_attestation","sign_citation":"https://pith.science/pith/MCSKIT3U3XHFZNGKB4Q5TM3QTC/action/citation_signature","submit_replication":"https://pith.science/pith/MCSKIT3U3XHFZNGKB4Q5TM3QTC/action/replication_record"}},"created_at":"2026-05-18T03:42:55.525133+00:00","updated_at":"2026-05-18T03:42:55.525133+00:00"}