{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:I6GLGG5JKSCX7DQCYMUGNBA34R","short_pith_number":"pith:I6GLGG5J","canonical_record":{"source":{"id":"1210.2640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-09T15:25:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a0c1553ec7eb9eeb42ff75ab2887d07643dafc944c6f8000b411abd5e79f7e1b","abstract_canon_sha256":"77a7fb140ebd761f7a3db2e83cea2dd0707bf706d22df069302221af3dbb4c80"},"schema_version":"1.0"},"canonical_sha256":"478cb31ba954857f8e02c32866841be45eeec814a81c7236bd464ea39d82664c","source":{"kind":"arxiv","id":"1210.2640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2640","created_at":"2026-05-18T02:38:59Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2640v1","created_at":"2026-05-18T02:38:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2640","created_at":"2026-05-18T02:38:59Z"},{"alias_kind":"pith_short_12","alias_value":"I6GLGG5JKSCX","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"I6GLGG5JKSCX7DQC","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"I6GLGG5J","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:I6GLGG5JKSCX7DQCYMUGNBA34R","target":"record","payload":{"canonical_record":{"source":{"id":"1210.2640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-09T15:25:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a0c1553ec7eb9eeb42ff75ab2887d07643dafc944c6f8000b411abd5e79f7e1b","abstract_canon_sha256":"77a7fb140ebd761f7a3db2e83cea2dd0707bf706d22df069302221af3dbb4c80"},"schema_version":"1.0"},"canonical_sha256":"478cb31ba954857f8e02c32866841be45eeec814a81c7236bd464ea39d82664c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:59.591256Z","signature_b64":"OFtFjXTT/biH/n+h7jYVhJlqHPjkl3vw/6Lm/olA/64rjB/d2nRZeHiNPuL8Afng98WN93KCJSS+GEAWkEzuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"478cb31ba954857f8e02c32866841be45eeec814a81c7236bd464ea39d82664c","last_reissued_at":"2026-05-18T02:38:59.590875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:59.590875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.2640","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-18T02:38:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ch9em+OCNDcovXeqSsNKF4pgzkDc3ac5NgZAnLqzyyKTJcToPt4MS60HR2sMA3vIk5Px5dNrhYp4KiVJnb+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:34:00.940805Z"},"content_sha256":"45af40cb8b6ae03aead6d166a83a2f2ff4d99867eae18d0563d72d48d8013558","schema_version":"1.0","event_id":"sha256:45af40cb8b6ae03aead6d166a83a2f2ff4d99867eae18d0563d72d48d8013558"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:I6GLGG5JKSCX7DQCYMUGNBA34R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-view constrained clustering with an incomplete mapping between views","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Eric Eaton, Marie desJardins, Sara Jacob","submitted_at":"2012-10-09T15:25:01Z","abstract_excerpt":"Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, many applications provide only a partial mapping between the views, creating a challenge for current methods. To address this problem, we propose a multi-view algorithm based on constrained clustering that can operate with an incomplete mapping. Given a set of pairwise constraints in each view, our approach propagates these constraints using a local similarity measure to those instances that can be mapped to the other vi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2640","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-18T02:38:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4IsxLjZa1Mj0/8XRIc3XbEjdOk/iDZU0bnvemjKFcjbJYk3y769ZBbdWMLBO0husc5aBDC58W0pT4/U1SspBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:34:00.941163Z"},"content_sha256":"65594c7e4c4debc4779c028ca85f95ac7f1ec810f0a76da36ea2404a76eb903e","schema_version":"1.0","event_id":"sha256:65594c7e4c4debc4779c028ca85f95ac7f1ec810f0a76da36ea2404a76eb903e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I6GLGG5JKSCX7DQCYMUGNBA34R/bundle.json","state_url":"https://pith.science/pith/I6GLGG5JKSCX7DQCYMUGNBA34R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I6GLGG5JKSCX7DQCYMUGNBA34R/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-30T21:34:00Z","links":{"resolver":"https://pith.science/pith/I6GLGG5JKSCX7DQCYMUGNBA34R","bundle":"https://pith.science/pith/I6GLGG5JKSCX7DQCYMUGNBA34R/bundle.json","state":"https://pith.science/pith/I6GLGG5JKSCX7DQCYMUGNBA34R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I6GLGG5JKSCX7DQCYMUGNBA34R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:I6GLGG5JKSCX7DQCYMUGNBA34R","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":"77a7fb140ebd761f7a3db2e83cea2dd0707bf706d22df069302221af3dbb4c80","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-09T15:25:01Z","title_canon_sha256":"a0c1553ec7eb9eeb42ff75ab2887d07643dafc944c6f8000b411abd5e79f7e1b"},"schema_version":"1.0","source":{"id":"1210.2640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2640","created_at":"2026-05-18T02:38:59Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2640v1","created_at":"2026-05-18T02:38:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2640","created_at":"2026-05-18T02:38:59Z"},{"alias_kind":"pith_short_12","alias_value":"I6GLGG5JKSCX","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"I6GLGG5JKSCX7DQC","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"I6GLGG5J","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:65594c7e4c4debc4779c028ca85f95ac7f1ec810f0a76da36ea2404a76eb903e","target":"graph","created_at":"2026-05-18T02:38:59Z","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":"Multi-view learning algorithms typically assume a complete bipartite mapping between the different views in order to exchange information during the learning process. However, many applications provide only a partial mapping between the views, creating a challenge for current methods. To address this problem, we propose a multi-view algorithm based on constrained clustering that can operate with an incomplete mapping. Given a set of pairwise constraints in each view, our approach propagates these constraints using a local similarity measure to those instances that can be mapped to the other vi","authors_text":"Eric Eaton, Marie desJardins, Sara Jacob","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-09T15:25:01Z","title":"Multi-view constrained clustering with an incomplete mapping between views"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2640","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:45af40cb8b6ae03aead6d166a83a2f2ff4d99867eae18d0563d72d48d8013558","target":"record","created_at":"2026-05-18T02:38:59Z","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":"77a7fb140ebd761f7a3db2e83cea2dd0707bf706d22df069302221af3dbb4c80","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-09T15:25:01Z","title_canon_sha256":"a0c1553ec7eb9eeb42ff75ab2887d07643dafc944c6f8000b411abd5e79f7e1b"},"schema_version":"1.0","source":{"id":"1210.2640","kind":"arxiv","version":1}},"canonical_sha256":"478cb31ba954857f8e02c32866841be45eeec814a81c7236bd464ea39d82664c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"478cb31ba954857f8e02c32866841be45eeec814a81c7236bd464ea39d82664c","first_computed_at":"2026-05-18T02:38:59.590875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:59.590875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OFtFjXTT/biH/n+h7jYVhJlqHPjkl3vw/6Lm/olA/64rjB/d2nRZeHiNPuL8Afng98WN93KCJSS+GEAWkEzuAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:59.591256Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45af40cb8b6ae03aead6d166a83a2f2ff4d99867eae18d0563d72d48d8013558","sha256:65594c7e4c4debc4779c028ca85f95ac7f1ec810f0a76da36ea2404a76eb903e"],"state_sha256":"1da631306b94c931f51d31906e12ff12f3318ac966a28c5aaf8f200ded091cff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/upXvl4shcP9hGewtp/jnXvjSJcedF5ZEVtKSPv9PccRKj01snFLfxUtNarXwpNpIw1clWgpF6Fe9yLwBNHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:34:00.943161Z","bundle_sha256":"e947de49c9a104d731c2ec04dbfdd41996d52f6069fb75e5f9097398281eb6ec"}}