{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:I3C3MGSEN7WCWLDNOC23E4HKRC","short_pith_number":"pith:I3C3MGSE","canonical_record":{"source":{"id":"1412.3100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-12-09T20:58:45Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"c28955de3cf6583ac8b1b6474bb464a5b43054ab04a511590a4aee213f829952","abstract_canon_sha256":"4714e5ed155f605e50d55d513c6c2b2496c5d881f0de93b13239e087fb6cbbc8"},"schema_version":"1.0"},"canonical_sha256":"46c5b61a446fec2b2c6d70b5b270ea8889a18e372c85ef6c47f26996975da6a0","source":{"kind":"arxiv","id":"1412.3100","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3100","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3100v2","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3100","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"I3C3MGSEN7WC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I3C3MGSEN7WCWLDN","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I3C3MGSE","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:I3C3MGSEN7WCWLDNOC23E4HKRC","target":"record","payload":{"canonical_record":{"source":{"id":"1412.3100","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-12-09T20:58:45Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"c28955de3cf6583ac8b1b6474bb464a5b43054ab04a511590a4aee213f829952","abstract_canon_sha256":"4714e5ed155f605e50d55d513c6c2b2496c5d881f0de93b13239e087fb6cbbc8"},"schema_version":"1.0"},"canonical_sha256":"46c5b61a446fec2b2c6d70b5b270ea8889a18e372c85ef6c47f26996975da6a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:51.431206Z","signature_b64":"Vuz/9ZiKlMGkqdy9RASZG58r9Oz6lQ6txO4FzdPzviuxlgrAYATOTmANiBaKZ3qDVsn05AkMuxvUExv9iN80CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46c5b61a446fec2b2c6d70b5b270ea8889a18e372c85ef6c47f26996975da6a0","last_reissued_at":"2026-05-18T00:53:51.430842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:51.430842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.3100","source_version":2,"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-18T00:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEcoUTdlcGYzjrfjURATpkubMqoYp50i7H9IOMMOn0RKaw/T+LI5sPH+pHVQ8f3+UNq/PfpYc9MWicMUJTArCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:38:21.888624Z"},"content_sha256":"a179b10d34a32161efe5fc8a597bbda7f58724ed0cca5cd880653da7b2f84b9d","schema_version":"1.0","event_id":"sha256:a179b10d34a32161efe5fc8a597bbda7f58724ed0cca5cd880653da7b2f84b9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:I3C3MGSEN7WCWLDNOC23E4HKRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Supervised Learning with Heterophily","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Wolfgang Gatterbauer","submitted_at":"2014-12-09T20:58:45Z","abstract_excerpt":"We derive a family of linear inference algorithms that generalize existing graph-based label propagation algorithms by allowing them to propagate generalized assumptions about \"attraction\" or \"compatibility\" between classes of neighboring nodes (in particular those that involve heterophily between nodes where \"opposites attract\"). We thus call this formulation Semi-Supervised Learning with Heterophily (SSLH) and show how it generalizes and improves upon a recently proposed approach called Linearized Belief Propagation (LinBP). Importantly, our framework allows us to reduce the problem of estim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3100","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"},"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-18T00:53:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJJmpr3O3zLEPgjYQC0NC9NaIy9KL3sLNMpMDZJEZsWzXMR1tTBuXve4lR4r7zIWIL1+AZ/PBFck6WPbkxOeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:38:21.888980Z"},"content_sha256":"a5c9e9a04c32ffb4c4dfaa863658dd40c6972f1909ff64b4b9f25665826bbe00","schema_version":"1.0","event_id":"sha256:a5c9e9a04c32ffb4c4dfaa863658dd40c6972f1909ff64b4b9f25665826bbe00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3C3MGSEN7WCWLDNOC23E4HKRC/bundle.json","state_url":"https://pith.science/pith/I3C3MGSEN7WCWLDNOC23E4HKRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3C3MGSEN7WCWLDNOC23E4HKRC/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-06-06T00:38:21Z","links":{"resolver":"https://pith.science/pith/I3C3MGSEN7WCWLDNOC23E4HKRC","bundle":"https://pith.science/pith/I3C3MGSEN7WCWLDNOC23E4HKRC/bundle.json","state":"https://pith.science/pith/I3C3MGSEN7WCWLDNOC23E4HKRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3C3MGSEN7WCWLDNOC23E4HKRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:I3C3MGSEN7WCWLDNOC23E4HKRC","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":"4714e5ed155f605e50d55d513c6c2b2496c5d881f0de93b13239e087fb6cbbc8","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-12-09T20:58:45Z","title_canon_sha256":"c28955de3cf6583ac8b1b6474bb464a5b43054ab04a511590a4aee213f829952"},"schema_version":"1.0","source":{"id":"1412.3100","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3100","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3100v2","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3100","created_at":"2026-05-18T00:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"I3C3MGSEN7WC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"I3C3MGSEN7WCWLDN","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"I3C3MGSE","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:a5c9e9a04c32ffb4c4dfaa863658dd40c6972f1909ff64b4b9f25665826bbe00","target":"graph","created_at":"2026-05-18T00:53:51Z","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 derive a family of linear inference algorithms that generalize existing graph-based label propagation algorithms by allowing them to propagate generalized assumptions about \"attraction\" or \"compatibility\" between classes of neighboring nodes (in particular those that involve heterophily between nodes where \"opposites attract\"). We thus call this formulation Semi-Supervised Learning with Heterophily (SSLH) and show how it generalizes and improves upon a recently proposed approach called Linearized Belief Propagation (LinBP). Importantly, our framework allows us to reduce the problem of estim","authors_text":"Wolfgang Gatterbauer","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-12-09T20:58:45Z","title":"Semi-Supervised Learning with Heterophily"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3100","kind":"arxiv","version":2},"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:a179b10d34a32161efe5fc8a597bbda7f58724ed0cca5cd880653da7b2f84b9d","target":"record","created_at":"2026-05-18T00:53:51Z","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":"4714e5ed155f605e50d55d513c6c2b2496c5d881f0de93b13239e087fb6cbbc8","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-12-09T20:58:45Z","title_canon_sha256":"c28955de3cf6583ac8b1b6474bb464a5b43054ab04a511590a4aee213f829952"},"schema_version":"1.0","source":{"id":"1412.3100","kind":"arxiv","version":2}},"canonical_sha256":"46c5b61a446fec2b2c6d70b5b270ea8889a18e372c85ef6c47f26996975da6a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46c5b61a446fec2b2c6d70b5b270ea8889a18e372c85ef6c47f26996975da6a0","first_computed_at":"2026-05-18T00:53:51.430842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:51.430842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vuz/9ZiKlMGkqdy9RASZG58r9Oz6lQ6txO4FzdPzviuxlgrAYATOTmANiBaKZ3qDVsn05AkMuxvUExv9iN80CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:51.431206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3100","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a179b10d34a32161efe5fc8a597bbda7f58724ed0cca5cd880653da7b2f84b9d","sha256:a5c9e9a04c32ffb4c4dfaa863658dd40c6972f1909ff64b4b9f25665826bbe00"],"state_sha256":"9b61dae9b9a1063e7d4bdcf766b706b22653cbb8fbb3687a46581f117562f01e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oV17q23Lfy7SshjDHNLAZNvqKPrJjgNiuR4wWyTMhXwfYWL4vkJIrNKLBlhVKRLKNArs5D7IH5EBpkqFTDx3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T00:38:21.891035Z","bundle_sha256":"f67588ec2a5edb2cb4766626c3174cf920319258192f6bcf60347f458511f09a"}}