{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XNL3BELOBRYSN2TK5R5HJSIFND","short_pith_number":"pith:XNL3BELO","canonical_record":{"source":{"id":"1610.04751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-15T16:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"dca94ee8f08bc631f589928da48b47b4ee3ba9d0260f8de8cc59252cba85c43d","abstract_canon_sha256":"b409207b35a8e1abc60e73027330773a9bf8cf0d59797f461a8ae1e7d29f5c4b"},"schema_version":"1.0"},"canonical_sha256":"bb57b0916e0c7126ea6aec7a74c90568c387f7bff91b937fc4006c1d1b7c1a32","source":{"kind":"arxiv","id":"1610.04751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04751","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04751v1","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04751","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"XNL3BELOBRYS","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XNL3BELOBRYSN2TK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XNL3BELO","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XNL3BELOBRYSN2TK5R5HJSIFND","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-15T16:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"dca94ee8f08bc631f589928da48b47b4ee3ba9d0260f8de8cc59252cba85c43d","abstract_canon_sha256":"b409207b35a8e1abc60e73027330773a9bf8cf0d59797f461a8ae1e7d29f5c4b"},"schema_version":"1.0"},"canonical_sha256":"bb57b0916e0c7126ea6aec7a74c90568c387f7bff91b937fc4006c1d1b7c1a32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:31.547680Z","signature_b64":"vt5kRHzzrsZjTTO/Xm3XadAh7HwSqQV4zJRgtnwFrkUp2zehoWr6koePXFR1ep1LxqsMZp1dACZH2OEDXwgVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb57b0916e0c7126ea6aec7a74c90568c387f7bff91b937fc4006c1d1b7c1a32","last_reissued_at":"2026-05-18T00:31:31.546889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:31.546889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04751","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:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3iJ0r8GXJI76tg6/yHIAahuhnbMjkAgR/uZvbxBqk85e1719jfklSj0rJqxobu75AxnIJSKw0/RPITOACv0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:57:28.769930Z"},"content_sha256":"7bdf5c529635ab752e766a42252f9320fdd62f4b174655849be28af9956321e2","schema_version":"1.0","event_id":"sha256:7bdf5c529635ab752e766a42252f9320fdd62f4b174655849be28af9956321e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XNL3BELOBRYSN2TK5R5HJSIFND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised clustering under the Union of Polyhedral Cones (UOPC) model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Shuchin Aeron, Vaneet Aggarwal, Wenqi Wang","submitted_at":"2016-10-15T16:04:49Z","abstract_excerpt":"In this paper, we consider clustering data that is assumed to come from one of finitely many pointed convex polyhedral cones. This model is referred to as the Union of Polyhedral Cones (UOPC) model. Similar to the Union of Subspaces (UOS) model where each data from each subspace is generated from a (unknown) basis, in the UOPC model each data from each cone is assumed to be generated from a finite number of (unknown) \\emph{extreme rays}.To cluster data under this model, we consider several algorithms - (a) Sparse Subspace Clustering by Non-negative constraints Lasso (NCL), (b) Least squares ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04751","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:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MFxWDTwKhdC/KZSCTo2Kh71sjzeBKcBevLFHxdvOJ54BTYgeE1VIRYBE+/7aDyT61fluCj/WJ0+Ix1EZcbfzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:57:28.770647Z"},"content_sha256":"3e8669f18eb6fc20e083c88f59b4c16275f7a3d1de90d7c217f5177169df95b4","schema_version":"1.0","event_id":"sha256:3e8669f18eb6fc20e083c88f59b4c16275f7a3d1de90d7c217f5177169df95b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XNL3BELOBRYSN2TK5R5HJSIFND/bundle.json","state_url":"https://pith.science/pith/XNL3BELOBRYSN2TK5R5HJSIFND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XNL3BELOBRYSN2TK5R5HJSIFND/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-08T17:57:28Z","links":{"resolver":"https://pith.science/pith/XNL3BELOBRYSN2TK5R5HJSIFND","bundle":"https://pith.science/pith/XNL3BELOBRYSN2TK5R5HJSIFND/bundle.json","state":"https://pith.science/pith/XNL3BELOBRYSN2TK5R5HJSIFND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XNL3BELOBRYSN2TK5R5HJSIFND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XNL3BELOBRYSN2TK5R5HJSIFND","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":"b409207b35a8e1abc60e73027330773a9bf8cf0d59797f461a8ae1e7d29f5c4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-15T16:04:49Z","title_canon_sha256":"dca94ee8f08bc631f589928da48b47b4ee3ba9d0260f8de8cc59252cba85c43d"},"schema_version":"1.0","source":{"id":"1610.04751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04751","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04751v1","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04751","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"XNL3BELOBRYS","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XNL3BELOBRYSN2TK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XNL3BELO","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:3e8669f18eb6fc20e083c88f59b4c16275f7a3d1de90d7c217f5177169df95b4","target":"graph","created_at":"2026-05-18T00:31:31Z","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 consider clustering data that is assumed to come from one of finitely many pointed convex polyhedral cones. This model is referred to as the Union of Polyhedral Cones (UOPC) model. Similar to the Union of Subspaces (UOS) model where each data from each subspace is generated from a (unknown) basis, in the UOPC model each data from each cone is assumed to be generated from a finite number of (unknown) \\emph{extreme rays}.To cluster data under this model, we consider several algorithms - (a) Sparse Subspace Clustering by Non-negative constraints Lasso (NCL), (b) Least squares ap","authors_text":"Shuchin Aeron, Vaneet Aggarwal, Wenqi Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-15T16:04:49Z","title":"Unsupervised clustering under the Union of Polyhedral Cones (UOPC) model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04751","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:7bdf5c529635ab752e766a42252f9320fdd62f4b174655849be28af9956321e2","target":"record","created_at":"2026-05-18T00:31:31Z","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":"b409207b35a8e1abc60e73027330773a9bf8cf0d59797f461a8ae1e7d29f5c4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-15T16:04:49Z","title_canon_sha256":"dca94ee8f08bc631f589928da48b47b4ee3ba9d0260f8de8cc59252cba85c43d"},"schema_version":"1.0","source":{"id":"1610.04751","kind":"arxiv","version":1}},"canonical_sha256":"bb57b0916e0c7126ea6aec7a74c90568c387f7bff91b937fc4006c1d1b7c1a32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb57b0916e0c7126ea6aec7a74c90568c387f7bff91b937fc4006c1d1b7c1a32","first_computed_at":"2026-05-18T00:31:31.546889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:31.546889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vt5kRHzzrsZjTTO/Xm3XadAh7HwSqQV4zJRgtnwFrkUp2zehoWr6koePXFR1ep1LxqsMZp1dACZH2OEDXwgVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:31.547680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bdf5c529635ab752e766a42252f9320fdd62f4b174655849be28af9956321e2","sha256:3e8669f18eb6fc20e083c88f59b4c16275f7a3d1de90d7c217f5177169df95b4"],"state_sha256":"78cbcc32f297442200c59053cae74395b7c2dc08be77ec957d12d9e51a185ed4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNwlMdDmp/3xuZYkbKujlF12H9DqvKGwjluG8TgcRYbvfY7l7NIhWc3io86ZLbfhs4NttllgVkBJiTPJNQFCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:57:28.774789Z","bundle_sha256":"3e15af70d734c06f6eab024a5632a1232fe94216ea819e37bde0b8339831168f"}}