{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VED345FRAINO6T7HSUE3P6FBOI","short_pith_number":"pith:VED345FR","canonical_record":{"source":{"id":"1206.6015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-26T14:56:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3bab6ae890db0fa7c436fa5cff2c792a82fbfdb16c3446a605301a0c4eb8f24a","abstract_canon_sha256":"a6a33e9f1b3430809a889d778bb2286c66b6513a69b43fb82ab6e15fc7d749dc"},"schema_version":"1.0"},"canonical_sha256":"a907be74b1021aef4fe79509b7f8a17212aea13942a93e1726c8cfc928e12b06","source":{"kind":"arxiv","id":"1206.6015","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6015","created_at":"2026-05-18T03:52:37Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6015v1","created_at":"2026-05-18T03:52:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6015","created_at":"2026-05-18T03:52:37Z"},{"alias_kind":"pith_short_12","alias_value":"VED345FRAINO","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VED345FRAINO6T7H","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VED345FR","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VED345FRAINO6T7HSUE3P6FBOI","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-26T14:56:33Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3bab6ae890db0fa7c436fa5cff2c792a82fbfdb16c3446a605301a0c4eb8f24a","abstract_canon_sha256":"a6a33e9f1b3430809a889d778bb2286c66b6513a69b43fb82ab6e15fc7d749dc"},"schema_version":"1.0"},"canonical_sha256":"a907be74b1021aef4fe79509b7f8a17212aea13942a93e1726c8cfc928e12b06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:37.337989Z","signature_b64":"k7qL+3jBmeEv2uvt03gkHa12xGR3AJ8z6B01SuwkfpWNwnFdmParBgsHy9+FFztMhq6Yhn0A4y1ZZ66nBaeWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a907be74b1021aef4fe79509b7f8a17212aea13942a93e1726c8cfc928e12b06","last_reissued_at":"2026-05-18T03:52:37.337148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:37.337148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6015","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-18T03:52:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JxwKkY/74kurKmlvJeJ+27zNBOAdYCNjuE8V5urvGZ4nIEsMo73rWk77C1wRTjVX28EY9VEHh8k/HlbntERBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:40:22.885233Z"},"content_sha256":"59b83e763c9c41446d4cbf0f22cd16dffe677e0fd35161ab9d863a44edacca27","schema_version":"1.0","event_id":"sha256:59b83e763c9c41446d4cbf0f22cd16dffe677e0fd35161ab9d863a44edacca27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VED345FRAINO6T7HSUE3P6FBOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transductive Classification Methods for Mixed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Sathiya Keerthi Selvaraj, Sundararajan Sellamanickam","submitted_at":"2012-06-26T14:56:33Z","abstract_excerpt":"In this paper we provide a principled approach to solve a transductive classification problem involving a similar graph (edges tend to connect nodes with same labels) and a dissimilar graph (edges tend to connect nodes with opposing labels). Most of the existing methods, e.g., Information Regularization (IR), Weighted vote Relational Neighbor classifier (WvRN) etc, assume that the given graph is only a similar graph. We extend the IR and WvRN methods to deal with mixed graphs. We evaluate the proposed extensions on several benchmark datasets as well as two real world datasets and demonstrate t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6015","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-18T03:52:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7LOZilcUn+8AleOfhpNU2NfdQfM+4rnz+yQ8hZm/CiKsVBNmADcq/rysoz5/w6ueNCHGv9aq/5OlkcBCACyUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:40:22.885606Z"},"content_sha256":"2be16d2989949d77465b67ca9862e3662fe87ee6b1f703375f3cdc341e29999e","schema_version":"1.0","event_id":"sha256:2be16d2989949d77465b67ca9862e3662fe87ee6b1f703375f3cdc341e29999e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VED345FRAINO6T7HSUE3P6FBOI/bundle.json","state_url":"https://pith.science/pith/VED345FRAINO6T7HSUE3P6FBOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VED345FRAINO6T7HSUE3P6FBOI/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-02T21:40:22Z","links":{"resolver":"https://pith.science/pith/VED345FRAINO6T7HSUE3P6FBOI","bundle":"https://pith.science/pith/VED345FRAINO6T7HSUE3P6FBOI/bundle.json","state":"https://pith.science/pith/VED345FRAINO6T7HSUE3P6FBOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VED345FRAINO6T7HSUE3P6FBOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VED345FRAINO6T7HSUE3P6FBOI","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":"a6a33e9f1b3430809a889d778bb2286c66b6513a69b43fb82ab6e15fc7d749dc","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-26T14:56:33Z","title_canon_sha256":"3bab6ae890db0fa7c436fa5cff2c792a82fbfdb16c3446a605301a0c4eb8f24a"},"schema_version":"1.0","source":{"id":"1206.6015","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6015","created_at":"2026-05-18T03:52:37Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6015v1","created_at":"2026-05-18T03:52:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6015","created_at":"2026-05-18T03:52:37Z"},{"alias_kind":"pith_short_12","alias_value":"VED345FRAINO","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VED345FRAINO6T7H","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VED345FR","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:2be16d2989949d77465b67ca9862e3662fe87ee6b1f703375f3cdc341e29999e","target":"graph","created_at":"2026-05-18T03:52:37Z","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":"In this paper we provide a principled approach to solve a transductive classification problem involving a similar graph (edges tend to connect nodes with same labels) and a dissimilar graph (edges tend to connect nodes with opposing labels). Most of the existing methods, e.g., Information Regularization (IR), Weighted vote Relational Neighbor classifier (WvRN) etc, assume that the given graph is only a similar graph. We extend the IR and WvRN methods to deal with mixed graphs. We evaluate the proposed extensions on several benchmark datasets as well as two real world datasets and demonstrate t","authors_text":"Sathiya Keerthi Selvaraj, Sundararajan Sellamanickam","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-26T14:56:33Z","title":"Transductive Classification Methods for Mixed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6015","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:59b83e763c9c41446d4cbf0f22cd16dffe677e0fd35161ab9d863a44edacca27","target":"record","created_at":"2026-05-18T03:52:37Z","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":"a6a33e9f1b3430809a889d778bb2286c66b6513a69b43fb82ab6e15fc7d749dc","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-26T14:56:33Z","title_canon_sha256":"3bab6ae890db0fa7c436fa5cff2c792a82fbfdb16c3446a605301a0c4eb8f24a"},"schema_version":"1.0","source":{"id":"1206.6015","kind":"arxiv","version":1}},"canonical_sha256":"a907be74b1021aef4fe79509b7f8a17212aea13942a93e1726c8cfc928e12b06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a907be74b1021aef4fe79509b7f8a17212aea13942a93e1726c8cfc928e12b06","first_computed_at":"2026-05-18T03:52:37.337148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:37.337148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k7qL+3jBmeEv2uvt03gkHa12xGR3AJ8z6B01SuwkfpWNwnFdmParBgsHy9+FFztMhq6Yhn0A4y1ZZ66nBaeWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:37.337989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6015","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59b83e763c9c41446d4cbf0f22cd16dffe677e0fd35161ab9d863a44edacca27","sha256:2be16d2989949d77465b67ca9862e3662fe87ee6b1f703375f3cdc341e29999e"],"state_sha256":"3548f08e5f5f14a4c976b87fb1b483e1cc3756fccf2d37a0d4313751960ba0c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"95gngBxJ6gNTIyZQURAcWkmq3omCT1MuU7jpfoYD0zsvcO2KJnKMBm3pA3l0yMWKtInCC3jlwHq7lcarJ5wODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:40:22.887853Z","bundle_sha256":"19957bae48413f9c9d0ffcae30af8b178bd2e8b60c81ab9b02c846d1d18f8a8d"}}