{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YCHBSA6DYWN6N2NQGCNYTQXNKA","short_pith_number":"pith:YCHBSA6D","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"},"canonical_sha256":"c08e1903c3c59be6e9b0309b89c2ed5028d5885f58756dee6967185d2c6d1cd4","source":{"kind":"arxiv","id":"1202.3702","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3702","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3702v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3702","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"YCHBSA6DYWN6","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YCHBSA6DYWN6N2NQ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YCHBSA6D","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YCHBSA6DYWN6N2NQGCNYTQXNKA","target":"record","payload":{"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"},"canonical_sha256":"c08e1903c3c59be6e9b0309b89c2ed5028d5885f58756dee6967185d2c6d1cd4","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"},"source_kind":"arxiv","source_id":"1202.3702","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACCudHhiCXi9FeFCNnrLyCwcq4jix5yxzzkwlVew3i8AHCnHCAPMNKdT8MTTSDKyy137JumuhRG9un22ekruAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:13:57.622606Z"},"content_sha256":"35a399f904e0cfd7d1c36426aa3b24499f895ab21e8266c02d64c65a422acc5e","schema_version":"1.0","event_id":"sha256:35a399f904e0cfd7d1c36426aa3b24499f895ab21e8266c02d64c65a422acc5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YCHBSA6DYWN6N2NQGCNYTQXNKA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"olLVhxjY0sYUpY489lbJqXYv5XtZUAD7wDSUaMnv6jOo1E1kVR8hFYSeU7jK1n8GAUpUPakkCqrikzVTtTgRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:13:57.623219Z"},"content_sha256":"3c83c44d4e86fd328f0cb37669c73ba55a2171c087b70366613fb7981009b4a4","schema_version":"1.0","event_id":"sha256:3c83c44d4e86fd328f0cb37669c73ba55a2171c087b70366613fb7981009b4a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/bundle.json","state_url":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T06:13:57Z","links":{"resolver":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA","bundle":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/bundle.json","state":"https://pith.science/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YCHBSA6DYWN6N2NQGCNYTQXNKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YCHBSA6DYWN6N2NQGCNYTQXNKA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5462f80b8cc7154211d15ec6abc933d323a6fbc3dd637c85f896792c7e0ce609","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"47a184451894a34be20a5420ccaf25fb07dfd8086c1f64dbc9c9fd33d4f4caa5"},"schema_version":"1.0","source":{"id":"1202.3702","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3702","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3702v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3702","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"YCHBSA6DYWN6","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YCHBSA6DYWN6N2NQ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YCHBSA6D","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:3c83c44d4e86fd328f0cb37669c73ba55a2171c087b70366613fb7981009b4a4","target":"graph","created_at":"2026-05-18T04:02:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Avleen S. Bijral, Nathan Ratliff, Nathan Srebro","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title":"Semi-supervised Learning with Density Based Distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3702","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:35a399f904e0cfd7d1c36426aa3b24499f895ab21e8266c02d64c65a422acc5e","target":"record","created_at":"2026-05-18T04:02:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5462f80b8cc7154211d15ec6abc933d323a6fbc3dd637c85f896792c7e0ce609","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"47a184451894a34be20a5420ccaf25fb07dfd8086c1f64dbc9c9fd33d4f4caa5"},"schema_version":"1.0","source":{"id":"1202.3702","kind":"arxiv","version":1}},"canonical_sha256":"c08e1903c3c59be6e9b0309b89c2ed5028d5885f58756dee6967185d2c6d1cd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c08e1903c3c59be6e9b0309b89c2ed5028d5885f58756dee6967185d2c6d1cd4","first_computed_at":"2026-05-18T04:02:03.499516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:03.499516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KKsbCuYtXXdEua95vvPqXFWd2UNNWVI0lbBSJYgwL9QmEKx6+UN+Gu+X55q5yAAadQrTOOYaqt1w7aDBxGr4AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:03.500187Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3702","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35a399f904e0cfd7d1c36426aa3b24499f895ab21e8266c02d64c65a422acc5e","sha256:3c83c44d4e86fd328f0cb37669c73ba55a2171c087b70366613fb7981009b4a4"],"state_sha256":"37021fe83bd9942d3402858cd10cfae9761bb58e10b0a2a6c425f05c48921ab5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLJ0othpGlDhGcj3fwIjk3Bf96Eky+sBlXh6XOCk6v7RYGztKE+tQ1ZXZ13ufYBXdWtw3xVaTAP33KBbmaktDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:13:57.626249Z","bundle_sha256":"3c2827898215465367efc4e439d9ab0141555c97ee984e2d9e7b55645f07bba2"}}