{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RUYMVOWL5PHZHGNPFKZTRWNN2A","short_pith_number":"pith:RUYMVOWL","canonical_record":{"source":{"id":"1806.11078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-28T16:49:19Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"be4ad003bd88844b23352eed3112c78ace8ed3b901d886414f7adf4293ab7c8a","abstract_canon_sha256":"4b674effadaec2feaf2fd525b63c5d8543c92daa94a4af50f0c5b5ed26eb2bcf"},"schema_version":"1.0"},"canonical_sha256":"8d30cabacbebcf9399af2ab338d9add003b6404c8fe37ce5e406c8477e4d6b45","source":{"kind":"arxiv","id":"1806.11078","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11078","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11078v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11078","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"RUYMVOWL5PHZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RUYMVOWL5PHZHGNP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RUYMVOWL","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RUYMVOWL5PHZHGNPFKZTRWNN2A","target":"record","payload":{"canonical_record":{"source":{"id":"1806.11078","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-28T16:49:19Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"be4ad003bd88844b23352eed3112c78ace8ed3b901d886414f7adf4293ab7c8a","abstract_canon_sha256":"4b674effadaec2feaf2fd525b63c5d8543c92daa94a4af50f0c5b5ed26eb2bcf"},"schema_version":"1.0"},"canonical_sha256":"8d30cabacbebcf9399af2ab338d9add003b6404c8fe37ce5e406c8477e4d6b45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:07.066709Z","signature_b64":"PkB7l0JB8fHxODfHeqS12F4OWLeXUu8NZDjfRV8oi8FfjBhlJH7wuKMtzlczkomQwkidYSjv3Zc8wZ0VaLxDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d30cabacbebcf9399af2ab338d9add003b6404c8fe37ce5e406c8477e4d6b45","last_reissued_at":"2026-05-18T00:12:07.066134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:07.066134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.11078","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-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABuBSLoQEdluNRFpiM50a9gh/WtWQVPkloYC98lpybaswKul0cVh3CPJJ2bMsYcAkwaeuxNX4tCTCa2dIBpMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:09:36.958020Z"},"content_sha256":"86af3ac40165ebf5f711150504e400003f2ded27e48d2ac8cb66ca9c40888c19","schema_version":"1.0","event_id":"sha256:86af3ac40165ebf5f711150504e400003f2ded27e48d2ac8cb66ca9c40888c19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RUYMVOWL5PHZHGNPFKZTRWNN2A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A probabilistic constrained clustering for transfer learning and image category discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Joel Schlosser, Phillip Odom, Yen-Chang Hsu, Zhaoyang Lv, Zsolt Kira","submitted_at":"2018-06-28T16:49:19Z","abstract_excerpt":"Neural network-based clustering has recently gained popularity, and in particular a constrained clustering formulation has been proposed to perform transfer learning and image category discovery using deep learning. The core idea is to formulate a clustering objective with pairwise constraints that can be used to train a deep clustering network; therefore the cluster assignments and their underlying feature representations are jointly optimized end-to-end. In this work, we provide a novel clustering formulation to address scalability issues of previous work in terms of optimizing deeper networ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11078","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-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9WLDLlP07o2D+3OYerC4bupkdcc2keJ1hg/RIDuimh3Ko87hBv0DKu+su90Um0RJjJnCQNJcluU1G/7qfrgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:09:36.958372Z"},"content_sha256":"e00f14b270e0871330367f983c1d92f6bf059f0cc7044618a47b85f9dbd67f31","schema_version":"1.0","event_id":"sha256:e00f14b270e0871330367f983c1d92f6bf059f0cc7044618a47b85f9dbd67f31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUYMVOWL5PHZHGNPFKZTRWNN2A/bundle.json","state_url":"https://pith.science/pith/RUYMVOWL5PHZHGNPFKZTRWNN2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUYMVOWL5PHZHGNPFKZTRWNN2A/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-08T13:09:36Z","links":{"resolver":"https://pith.science/pith/RUYMVOWL5PHZHGNPFKZTRWNN2A","bundle":"https://pith.science/pith/RUYMVOWL5PHZHGNPFKZTRWNN2A/bundle.json","state":"https://pith.science/pith/RUYMVOWL5PHZHGNPFKZTRWNN2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUYMVOWL5PHZHGNPFKZTRWNN2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RUYMVOWL5PHZHGNPFKZTRWNN2A","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":"4b674effadaec2feaf2fd525b63c5d8543c92daa94a4af50f0c5b5ed26eb2bcf","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-28T16:49:19Z","title_canon_sha256":"be4ad003bd88844b23352eed3112c78ace8ed3b901d886414f7adf4293ab7c8a"},"schema_version":"1.0","source":{"id":"1806.11078","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11078","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11078v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11078","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"RUYMVOWL5PHZ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RUYMVOWL5PHZHGNP","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RUYMVOWL","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:e00f14b270e0871330367f983c1d92f6bf059f0cc7044618a47b85f9dbd67f31","target":"graph","created_at":"2026-05-18T00:12:07Z","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":"Neural network-based clustering has recently gained popularity, and in particular a constrained clustering formulation has been proposed to perform transfer learning and image category discovery using deep learning. The core idea is to formulate a clustering objective with pairwise constraints that can be used to train a deep clustering network; therefore the cluster assignments and their underlying feature representations are jointly optimized end-to-end. In this work, we provide a novel clustering formulation to address scalability issues of previous work in terms of optimizing deeper networ","authors_text":"Joel Schlosser, Phillip Odom, Yen-Chang Hsu, Zhaoyang Lv, Zsolt Kira","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-28T16:49:19Z","title":"A probabilistic constrained clustering for transfer learning and image category discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11078","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:86af3ac40165ebf5f711150504e400003f2ded27e48d2ac8cb66ca9c40888c19","target":"record","created_at":"2026-05-18T00:12:07Z","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":"4b674effadaec2feaf2fd525b63c5d8543c92daa94a4af50f0c5b5ed26eb2bcf","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-06-28T16:49:19Z","title_canon_sha256":"be4ad003bd88844b23352eed3112c78ace8ed3b901d886414f7adf4293ab7c8a"},"schema_version":"1.0","source":{"id":"1806.11078","kind":"arxiv","version":1}},"canonical_sha256":"8d30cabacbebcf9399af2ab338d9add003b6404c8fe37ce5e406c8477e4d6b45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d30cabacbebcf9399af2ab338d9add003b6404c8fe37ce5e406c8477e4d6b45","first_computed_at":"2026-05-18T00:12:07.066134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:07.066134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PkB7l0JB8fHxODfHeqS12F4OWLeXUu8NZDjfRV8oi8FfjBhlJH7wuKMtzlczkomQwkidYSjv3Zc8wZ0VaLxDCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:07.066709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.11078","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86af3ac40165ebf5f711150504e400003f2ded27e48d2ac8cb66ca9c40888c19","sha256:e00f14b270e0871330367f983c1d92f6bf059f0cc7044618a47b85f9dbd67f31"],"state_sha256":"1ea67a3e88fcbfc868864d732ce771b0c28c0903c97452923266565ca209f156"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQroRSw09Q1w2ppE1nupKKq6U8s2z834qn29Yl3Urz3b1l8d/4NFTds85vXzXLIC5pe1WEhEUppPqDsZT3ObDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:09:36.960250Z","bundle_sha256":"216957a10f96ff57e259226adf39d7085abeb165590a30aab1b2d296fbf62e7c"}}