{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PX2C26354QXAV6KRDCOWJBSEL6","short_pith_number":"pith:PX2C2635","canonical_record":{"source":{"id":"1608.02146","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-06T19:29:58Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"a78df01ab2191c35cb8c42debf356ddfe182d38217b394dddbb0174e135149f7","abstract_canon_sha256":"d3d9d9a830a762350d47c7b7b98db8d2eb16a0bead7fee51e98512b18d0e3fe6"},"schema_version":"1.0"},"canonical_sha256":"7df42d7b7de42e0af951189d6486445fa4c1f7a77971bc87e09c39d03afbbd0a","source":{"kind":"arxiv","id":"1608.02146","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02146","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02146v2","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02146","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"PX2C26354QXA","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PX2C26354QXAV6KR","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PX2C2635","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PX2C26354QXAV6KRDCOWJBSEL6","target":"record","payload":{"canonical_record":{"source":{"id":"1608.02146","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-06T19:29:58Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"a78df01ab2191c35cb8c42debf356ddfe182d38217b394dddbb0174e135149f7","abstract_canon_sha256":"d3d9d9a830a762350d47c7b7b98db8d2eb16a0bead7fee51e98512b18d0e3fe6"},"schema_version":"1.0"},"canonical_sha256":"7df42d7b7de42e0af951189d6486445fa4c1f7a77971bc87e09c39d03afbbd0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:14.024141Z","signature_b64":"bI53EwsboKEj/UK5JtsX1cTMYeP+qzkIpWmzZqhZv/emmcK0l63QGurT9O0DBOkzGTRl4IycZlJ5aT2vodFUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7df42d7b7de42e0af951189d6486445fa4c1f7a77971bc87e09c39d03afbbd0a","last_reissued_at":"2026-05-18T00:35:14.023639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:14.023639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.02146","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:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilqcdjLk2QgOlnwoDYxxEzKrgExtoranr7kJ6YcNGm/Dq6l/0cXw7Lqs3h6NIT4LEeoqaG90F1oLkcIfo5A5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:31:52.954105Z"},"content_sha256":"ee1be9f2b10ade8256f506c2a7b1e1714016e54ee82cd2b334fa3204380f55d0","schema_version":"1.0","event_id":"sha256:ee1be9f2b10ade8256f506c2a7b1e1714016e54ee82cd2b334fa3204380f55d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PX2C26354QXAV6KRDCOWJBSEL6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leveraging Union of Subspace Structure to Improve Constrained Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"John Lipor, Laura Balzano","submitted_at":"2016-08-06T19:29:58Z","abstract_excerpt":"Many clustering problems in computer vision and other contexts are also classification problems, where each cluster shares a meaningful label. Subspace clustering algorithms in particular are often applied to problems that fit this description, for example with face images or handwritten digits. While it is straightforward to request human input on these datasets, our goal is to reduce this input as much as possible. We present a pairwise-constrained clustering algorithm that actively selects queries based on the union-of-subspaces model. The central step of the algorithm is in querying points"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02146","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:35:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SXL3K4Lpaj0XfoZM/jydLB2s1HasfHEhPGVFUhQWhUEjXeAMcEbZup5C/2DZ/9spvhlZS6ywPE+JsESs7kOpCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:31:52.954484Z"},"content_sha256":"ce997136088d380487b28a1ae8b8fd207103dbfa8896a07bd7919c82c5a71651","schema_version":"1.0","event_id":"sha256:ce997136088d380487b28a1ae8b8fd207103dbfa8896a07bd7919c82c5a71651"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PX2C26354QXAV6KRDCOWJBSEL6/bundle.json","state_url":"https://pith.science/pith/PX2C26354QXAV6KRDCOWJBSEL6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PX2C26354QXAV6KRDCOWJBSEL6/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-31T02:31:52Z","links":{"resolver":"https://pith.science/pith/PX2C26354QXAV6KRDCOWJBSEL6","bundle":"https://pith.science/pith/PX2C26354QXAV6KRDCOWJBSEL6/bundle.json","state":"https://pith.science/pith/PX2C26354QXAV6KRDCOWJBSEL6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PX2C26354QXAV6KRDCOWJBSEL6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PX2C26354QXAV6KRDCOWJBSEL6","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":"d3d9d9a830a762350d47c7b7b98db8d2eb16a0bead7fee51e98512b18d0e3fe6","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-06T19:29:58Z","title_canon_sha256":"a78df01ab2191c35cb8c42debf356ddfe182d38217b394dddbb0174e135149f7"},"schema_version":"1.0","source":{"id":"1608.02146","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02146","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02146v2","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02146","created_at":"2026-05-18T00:35:14Z"},{"alias_kind":"pith_short_12","alias_value":"PX2C26354QXA","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PX2C26354QXAV6KR","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PX2C2635","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:ce997136088d380487b28a1ae8b8fd207103dbfa8896a07bd7919c82c5a71651","target":"graph","created_at":"2026-05-18T00:35:14Z","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":"Many clustering problems in computer vision and other contexts are also classification problems, where each cluster shares a meaningful label. Subspace clustering algorithms in particular are often applied to problems that fit this description, for example with face images or handwritten digits. While it is straightforward to request human input on these datasets, our goal is to reduce this input as much as possible. We present a pairwise-constrained clustering algorithm that actively selects queries based on the union-of-subspaces model. The central step of the algorithm is in querying points","authors_text":"John Lipor, Laura Balzano","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-06T19:29:58Z","title":"Leveraging Union of Subspace Structure to Improve Constrained Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02146","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:ee1be9f2b10ade8256f506c2a7b1e1714016e54ee82cd2b334fa3204380f55d0","target":"record","created_at":"2026-05-18T00:35:14Z","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":"d3d9d9a830a762350d47c7b7b98db8d2eb16a0bead7fee51e98512b18d0e3fe6","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-06T19:29:58Z","title_canon_sha256":"a78df01ab2191c35cb8c42debf356ddfe182d38217b394dddbb0174e135149f7"},"schema_version":"1.0","source":{"id":"1608.02146","kind":"arxiv","version":2}},"canonical_sha256":"7df42d7b7de42e0af951189d6486445fa4c1f7a77971bc87e09c39d03afbbd0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7df42d7b7de42e0af951189d6486445fa4c1f7a77971bc87e09c39d03afbbd0a","first_computed_at":"2026-05-18T00:35:14.023639Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:14.023639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bI53EwsboKEj/UK5JtsX1cTMYeP+qzkIpWmzZqhZv/emmcK0l63QGurT9O0DBOkzGTRl4IycZlJ5aT2vodFUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:14.024141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02146","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee1be9f2b10ade8256f506c2a7b1e1714016e54ee82cd2b334fa3204380f55d0","sha256:ce997136088d380487b28a1ae8b8fd207103dbfa8896a07bd7919c82c5a71651"],"state_sha256":"74aee4f8b618c8a6a7d74ec2a5b1f1cd6ac65bc6c8b87d7dc156495f9886a675"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yXrrN7v240O3+s3eDH60nrnOEHwYIUDupSczMLEqc2a8jjmEF6D9sYJlk7ilOOIDmp3rAJfzwK1XFoSsX/s1Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:31:52.959140Z","bundle_sha256":"2a0757ff11f1a7347d7508756ce0f5370edd9ba3e59a4718d56a97119335c048"}}