{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YCHBSA6DYWN6N2NQGCNYTQXNKA","short_pith_number":"pith:YCHBSA6D","schema_version":"1.0","canonical_sha256":"c08e1903c3c59be6e9b0309b89c2ed5028d5885f58756dee6967185d2c6d1cd4","source":{"kind":"arxiv","id":"1202.3702","version":1},"attestation_state":"computed","paper":{"title":"Semi-supervised Learning with Density Based Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Avleen S. Bijral, Nathan Ratliff, Nathan Srebro","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"We present a simple, yet effective, approach to Semi-Supervised Learning. Our approach is based on estimating density-based distances (DBD) using a shortest path calculation on a graph. These Graph-DBD estimates can then be used in any distance-based supervised learning method, such as Nearest Neighbor methods and SVMs with RBF kernels. In order to apply the method to very large data sets, we also present a novel algorithm which integrates nearest neighbor computations into the shortest path search and can find exact shortest paths even in extremely large dense graphs. Significant runtime impr"},"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":"1202.3702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"47a184451894a34be20a5420ccaf25fb07dfd8086c1f64dbc9c9fd33d4f4caa5","abstract_canon_sha256":"5462f80b8cc7154211d15ec6abc933d323a6fbc3dd637c85f896792c7e0ce609"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.500187Z","signature_b64":"KKsbCuYtXXdEua95vvPqXFWd2UNNWVI0lbBSJYgwL9QmEKx6+UN+Gu+X55q5yAAadQrTOOYaqt1w7aDBxGr4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c08e1903c3c59be6e9b0309b89c2ed5028d5885f58756dee6967185d2c6d1cd4","last_reissued_at":"2026-05-18T04:02:03.499516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.499516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-supervised Learning with Density Based Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Avleen S. Bijral, Nathan Ratliff, Nathan Srebro","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"We present a simple, yet effective, approach to Semi-Supervised Learning. Our approach is based on estimating density-based distances (DBD) using a shortest path calculation on a graph. These Graph-DBD estimates can then be used in any distance-based supervised learning method, such as Nearest Neighbor methods and SVMs with RBF kernels. In order to apply the method to very large data sets, we also present a novel algorithm which integrates nearest neighbor computations into the shortest path search and can find exact shortest paths even in extremely large dense graphs. Significant runtime impr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3702","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":"1202.3702","created_at":"2026-05-18T04:02:03.499582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3702v1","created_at":"2026-05-18T04:02:03.499582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3702","created_at":"2026-05-18T04:02:03.499582+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCHBSA6DYWN6","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCHBSA6DYWN6N2NQ","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCHBSA6D","created_at":"2026-05-18T12:27:27.928770+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/YCHBSA6DYWN6N2NQGCNYTQXNKA","json":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA.json","graph_json":"https://pith.science/api/pith-number/YCHBSA6DYWN6N2NQGCNYTQXNKA/graph.json","events_json":"https://pith.science/api/pith-number/YCHBSA6DYWN6N2NQGCNYTQXNKA/events.json","paper":"https://pith.science/paper/YCHBSA6D"},"agent_actions":{"view_html":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA","download_json":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA.json","view_paper":"https://pith.science/paper/YCHBSA6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3702&json=true","fetch_graph":"https://pith.science/api/pith-number/YCHBSA6DYWN6N2NQGCNYTQXNKA/graph.json","fetch_events":"https://pith.science/api/pith-number/YCHBSA6DYWN6N2NQGCNYTQXNKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/action/storage_attestation","attest_author":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/action/author_attestation","sign_citation":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/action/citation_signature","submit_replication":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/action/replication_record"}},"created_at":"2026-05-18T04:02:03.499582+00:00","updated_at":"2026-05-18T04:02:03.499582+00:00"}