{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:J6672VNZYOMMQSG3PEZ54WHWIS","short_pith_number":"pith:J6672VNZ","canonical_record":{"source":{"id":"1508.04906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-20T08:01:42Z","cross_cats_sorted":[],"title_canon_sha256":"59748c9a4bce67cc483f70af3c490f7585b3a6998a239455b45532217dd4dbaf","abstract_canon_sha256":"070ae033d8dffc2c5e1449ed2350b4376954b7644d420c4fa875e29f705f3ffe"},"schema_version":"1.0"},"canonical_sha256":"4fbdfd55b9c398c848db7933de58f644a320a2f0fbd88ef0efe4cb34a89cfb85","source":{"kind":"arxiv","id":"1508.04906","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04906","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04906v1","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04906","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"J6672VNZYOMM","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J6672VNZYOMMQSG3","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J6672VNZ","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:J6672VNZYOMMQSG3PEZ54WHWIS","target":"record","payload":{"canonical_record":{"source":{"id":"1508.04906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-20T08:01:42Z","cross_cats_sorted":[],"title_canon_sha256":"59748c9a4bce67cc483f70af3c490f7585b3a6998a239455b45532217dd4dbaf","abstract_canon_sha256":"070ae033d8dffc2c5e1449ed2350b4376954b7644d420c4fa875e29f705f3ffe"},"schema_version":"1.0"},"canonical_sha256":"4fbdfd55b9c398c848db7933de58f644a320a2f0fbd88ef0efe4cb34a89cfb85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:00.279556Z","signature_b64":"TpLh/1nRC+Ug9pw1bnXi/O8NC6aoe/1ZloIEJkpjzb+L0fG/qVvvJQmpqnHtkI7CMZizzrZ8x2MVGi2fum/9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fbdfd55b9c398c848db7933de58f644a320a2f0fbd88ef0efe4cb34a89cfb85","last_reissued_at":"2026-05-18T01:35:00.278908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:00.278908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.04906","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-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ztn15/C4+++RxiXzQOh5UGk3RIIOSXwzWsgq2md5dY5KnqgxlKaLEH93YkiIzwqGcNRndFW/flWyo64pM1MyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:09:50.076548Z"},"content_sha256":"84a12bf92fc52301da8406d0ad74aa7bb4fd402a31d1299b0dcc9a8f29c2c793","schema_version":"1.0","event_id":"sha256:84a12bf92fc52301da8406d0ad74aa7bb4fd402a31d1299b0dcc9a8f29c2c793"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:J6672VNZYOMMQSG3PEZ54WHWIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-supervised Learning with Regularized Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexey Mishenin, Konstantin Avrachenkov (MAESTRO), Pavel Chebotarev","submitted_at":"2015-08-20T08:01:42Z","abstract_excerpt":"We study a semi-supervised learning method based on the similarity graph and RegularizedLaplacian. We give convenient optimization formulation of the Regularized Laplacian method and establishits various properties. In particular, we show that the kernel of the methodcan be interpreted in terms of discrete and continuous time random walks and possesses several importantproperties of proximity measures. Both optimization and linear algebra methods can be used for efficientcomputation of the classification functions. We demonstrate on numerical examples that theRegularized Laplacian method is co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04906","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-18T01:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4uG7pfof03z12ZmdaPSbI5EqOW/ulW+7ooNW6Ow+btYDFkNlB6skDCOFd1VIkRwAc80cR9CzjUBGEuQhE2QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:09:50.076940Z"},"content_sha256":"3ae2d43d8f255bbe61756738845d29acbf4a0d453840493bce7b61e2297fe20d","schema_version":"1.0","event_id":"sha256:3ae2d43d8f255bbe61756738845d29acbf4a0d453840493bce7b61e2297fe20d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6672VNZYOMMQSG3PEZ54WHWIS/bundle.json","state_url":"https://pith.science/pith/J6672VNZYOMMQSG3PEZ54WHWIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6672VNZYOMMQSG3PEZ54WHWIS/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-29T19:09:50Z","links":{"resolver":"https://pith.science/pith/J6672VNZYOMMQSG3PEZ54WHWIS","bundle":"https://pith.science/pith/J6672VNZYOMMQSG3PEZ54WHWIS/bundle.json","state":"https://pith.science/pith/J6672VNZYOMMQSG3PEZ54WHWIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6672VNZYOMMQSG3PEZ54WHWIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:J6672VNZYOMMQSG3PEZ54WHWIS","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":"070ae033d8dffc2c5e1449ed2350b4376954b7644d420c4fa875e29f705f3ffe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-20T08:01:42Z","title_canon_sha256":"59748c9a4bce67cc483f70af3c490f7585b3a6998a239455b45532217dd4dbaf"},"schema_version":"1.0","source":{"id":"1508.04906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04906","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04906v1","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04906","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"J6672VNZYOMM","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"J6672VNZYOMMQSG3","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"J6672VNZ","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:3ae2d43d8f255bbe61756738845d29acbf4a0d453840493bce7b61e2297fe20d","target":"graph","created_at":"2026-05-18T01:35:00Z","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 study a semi-supervised learning method based on the similarity graph and RegularizedLaplacian. We give convenient optimization formulation of the Regularized Laplacian method and establishits various properties. In particular, we show that the kernel of the methodcan be interpreted in terms of discrete and continuous time random walks and possesses several importantproperties of proximity measures. Both optimization and linear algebra methods can be used for efficientcomputation of the classification functions. We demonstrate on numerical examples that theRegularized Laplacian method is co","authors_text":"Alexey Mishenin, Konstantin Avrachenkov (MAESTRO), Pavel Chebotarev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-20T08:01:42Z","title":"Semi-supervised Learning with Regularized Laplacian"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04906","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:84a12bf92fc52301da8406d0ad74aa7bb4fd402a31d1299b0dcc9a8f29c2c793","target":"record","created_at":"2026-05-18T01:35:00Z","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":"070ae033d8dffc2c5e1449ed2350b4376954b7644d420c4fa875e29f705f3ffe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-20T08:01:42Z","title_canon_sha256":"59748c9a4bce67cc483f70af3c490f7585b3a6998a239455b45532217dd4dbaf"},"schema_version":"1.0","source":{"id":"1508.04906","kind":"arxiv","version":1}},"canonical_sha256":"4fbdfd55b9c398c848db7933de58f644a320a2f0fbd88ef0efe4cb34a89cfb85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fbdfd55b9c398c848db7933de58f644a320a2f0fbd88ef0efe4cb34a89cfb85","first_computed_at":"2026-05-18T01:35:00.278908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:00.278908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TpLh/1nRC+Ug9pw1bnXi/O8NC6aoe/1ZloIEJkpjzb+L0fG/qVvvJQmpqnHtkI7CMZizzrZ8x2MVGi2fum/9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:00.279556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84a12bf92fc52301da8406d0ad74aa7bb4fd402a31d1299b0dcc9a8f29c2c793","sha256:3ae2d43d8f255bbe61756738845d29acbf4a0d453840493bce7b61e2297fe20d"],"state_sha256":"6cf58bf5f4ab39cde4dfc0b726112eb97765d7c714a0ea1fea6eb56c547bcb22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8PRugCY0T0VEZ0TVcvGhC8/OtYl1sTU5KKOcPjJmxpJT1Cn09HIcYjIbFF6EakfWpFSyuNqhXSEb+b2XvwRDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:09:50.079336Z","bundle_sha256":"608cdf688ebb1bb2cfc869b85765ebb104d487b341f0c4a90f32cec97e39b148"}}