{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JRGODEYMYLJHOU4BSDTH6VGSEA","short_pith_number":"pith:JRGODEYM","schema_version":"1.0","canonical_sha256":"4c4ce1930cc2d277538190e67f54d2200fb1ddae309f12753c856a617d8781c6","source":{"kind":"arxiv","id":"2005.05556","version":1},"attestation_state":"computed","paper":{"title":"Agglomerative Neural Networks for Multi-view Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Lina Yao, Xianzhi Wang, Yun Li, Zhe Liu","submitted_at":"2020-05-12T05:39:10Z","abstract_excerpt":"Conventional multi-view clustering methods seek for a view consensus through minimizing the pairwise discrepancy between the consensus and subviews. However, the pairwise comparison cannot portray the inter-view relationship precisely if some of the subviews can be further agglomerated. To address the above challenge, we propose the agglomerative analysis to approximate the optimal consensus view, thereby describing the subview relationship within a view structure. We present Agglomerative Neural Network (ANN) based on Constrained Laplacian Rank to cluster multi-view data directly while avoidi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2005.05556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-12T05:39:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f038fd0ad84946a3f6970098e61c527ea15930767b7a2031d7158f979ed15acd","abstract_canon_sha256":"f7c8f582a5f5a80529e5ce24753125afa6ba5e60b8f4ee6bdeb8e49c6b695881"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:02:21.738778Z","signature_b64":"uBPIxDhtu1gjB4Z3zM/B5u8aST0bMx/3U43CVQyRIft11Q24a81v94KfccbsDmaVAxEonexc8zG+UtwWEiKFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c4ce1930cc2d277538190e67f54d2200fb1ddae309f12753c856a617d8781c6","last_reissued_at":"2026-07-05T01:02:21.738370Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:02:21.738370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Agglomerative Neural Networks for Multi-view Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Lina Yao, Xianzhi Wang, Yun Li, Zhe Liu","submitted_at":"2020-05-12T05:39:10Z","abstract_excerpt":"Conventional multi-view clustering methods seek for a view consensus through minimizing the pairwise discrepancy between the consensus and subviews. However, the pairwise comparison cannot portray the inter-view relationship precisely if some of the subviews can be further agglomerated. To address the above challenge, we propose the agglomerative analysis to approximate the optimal consensus view, thereby describing the subview relationship within a view structure. We present Agglomerative Neural Network (ANN) based on Constrained Laplacian Rank to cluster multi-view data directly while avoidi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.05556","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.05556/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2005.05556","created_at":"2026-07-05T01:02:21.738428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.05556v1","created_at":"2026-07-05T01:02:21.738428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.05556","created_at":"2026-07-05T01:02:21.738428+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRGODEYMYLJH","created_at":"2026-07-05T01:02:21.738428+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRGODEYMYLJHOU4B","created_at":"2026-07-05T01:02:21.738428+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRGODEYM","created_at":"2026-07-05T01:02:21.738428+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JRGODEYMYLJHOU4BSDTH6VGSEA","json":"https://pith.science/pith/JRGODEYMYLJHOU4BSDTH6VGSEA.json","graph_json":"https://pith.science/api/pith-number/JRGODEYMYLJHOU4BSDTH6VGSEA/graph.json","events_json":"https://pith.science/api/pith-number/JRGODEYMYLJHOU4BSDTH6VGSEA/events.json","paper":"https://pith.science/paper/JRGODEYM"},"agent_actions":{"view_html":"https://pith.science/pith/JRGODEYMYLJHOU4BSDTH6VGSEA","download_json":"https://pith.science/pith/JRGODEYMYLJHOU4BSDTH6VGSEA.json","view_paper":"https://pith.science/paper/JRGODEYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.05556&json=true","fetch_graph":"https://pith.science/api/pith-number/JRGODEYMYLJHOU4BSDTH6VGSEA/graph.json","fetch_events":"https://pith.science/api/pith-number/JRGODEYMYLJHOU4BSDTH6VGSEA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRGODEYMYLJHOU4BSDTH6VGSEA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRGODEYMYLJHOU4BSDTH6VGSEA/action/storage_attestation","attest_author":"https://pith.science/pith/JRGODEYMYLJHOU4BSDTH6VGSEA/action/author_attestation","sign_citation":"https://pith.science/pith/JRGODEYMYLJHOU4BSDTH6VGSEA/action/citation_signature","submit_replication":"https://pith.science/pith/JRGODEYMYLJHOU4BSDTH6VGSEA/action/replication_record"}},"created_at":"2026-07-05T01:02:21.738428+00:00","updated_at":"2026-07-05T01:02:21.738428+00:00"}