{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CHUSHKHUOTDUDXJ6OLWJUVBM4V","short_pith_number":"pith:CHUSHKHU","canonical_record":{"source":{"id":"1509.00151","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-01T06:12:29Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"629c608409c5b0c56db6e1dd62e5c262fecdd8879db530c83f6a031c486b6909","abstract_canon_sha256":"ed2af3631789220c16e3adfda45ddf07e09d20118d459b53001279a9b2486da0"},"schema_version":"1.0"},"canonical_sha256":"11e923a8f474c741dd3e72ec9a542ce55bbde2f35b23e41c2e187d78f35fd426","source":{"kind":"arxiv","id":"1509.00151","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00151","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00151v3","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00151","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"CHUSHKHUOTDU","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CHUSHKHUOTDUDXJ6","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CHUSHKHU","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CHUSHKHUOTDUDXJ6OLWJUVBM4V","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00151","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-01T06:12:29Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"629c608409c5b0c56db6e1dd62e5c262fecdd8879db530c83f6a031c486b6909","abstract_canon_sha256":"ed2af3631789220c16e3adfda45ddf07e09d20118d459b53001279a9b2486da0"},"schema_version":"1.0"},"canonical_sha256":"11e923a8f474c741dd3e72ec9a542ce55bbde2f35b23e41c2e187d78f35fd426","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:00.794651Z","signature_b64":"MhpU0vv6OQplp5rSL9gy2HR68SeRk2Vf2nBsE0FYuhyjnpj5DGiuiVmyevSrvhyI/nqsSEOK6HtgSfN0XaWSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11e923a8f474c741dd3e72ec9a542ce55bbde2f35b23e41c2e187d78f35fd426","last_reissued_at":"2026-05-18T01:30:00.793820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:00.793820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00151","source_version":3,"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-18T01:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z19kItmAN1mofVX7m/5xH3xfXeEKRvKPWCXsCxwzhPtqmgmd1CwnbPHohbze7AqxigrMV+N/P6jql71xQr/eAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:14:45.616404Z"},"content_sha256":"8d34dc4fa8dd4097387b8c69b53686ad947a24f81313a5b75644e4589dc2f197","schema_version":"1.0","event_id":"sha256:8d34dc4fa8dd4097387b8c69b53686ad947a24f81313a5b75644e4589dc2f197"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CHUSHKHUOTDUDXJ6OLWJUVBM4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning A Task-Specific Deep Architecture For Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiayu Zhou, Meng Wang, Shiyu Chang, Thomas S. Huang, Zhangyang Wang","submitted_at":"2015-09-01T06:12:29Z","abstract_excerpt":"While sparse coding-based clustering methods have shown to be successful, their bottlenecks in both efficiency and scalability limit the practical usage. In recent years, deep learning has been proved to be a highly effective, efficient and scalable feature learning tool. In this paper, we propose to emulate the sparse coding-based clustering pipeline in the context of deep learning, leading to a carefully crafted deep model benefiting from both. A feed-forward network structure, named TAGnet, is constructed based on a graph-regularized sparse coding algorithm. It is then trained with task-spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00151","kind":"arxiv","version":3},"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-18T01:30:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDY2xCsCFT2PooQW9WR9eKS+Uwtah0Bw7/CL2L4FZQi2slqSTIzHNhrV56epWHkmQAIfRvkRQi0xce0MsLsNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:14:45.617328Z"},"content_sha256":"0be3b23017044278e7a038cabedf54ed263cc772e7011aaf61f92db139467e50","schema_version":"1.0","event_id":"sha256:0be3b23017044278e7a038cabedf54ed263cc772e7011aaf61f92db139467e50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHUSHKHUOTDUDXJ6OLWJUVBM4V/bundle.json","state_url":"https://pith.science/pith/CHUSHKHUOTDUDXJ6OLWJUVBM4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHUSHKHUOTDUDXJ6OLWJUVBM4V/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-31T20:14:45Z","links":{"resolver":"https://pith.science/pith/CHUSHKHUOTDUDXJ6OLWJUVBM4V","bundle":"https://pith.science/pith/CHUSHKHUOTDUDXJ6OLWJUVBM4V/bundle.json","state":"https://pith.science/pith/CHUSHKHUOTDUDXJ6OLWJUVBM4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHUSHKHUOTDUDXJ6OLWJUVBM4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CHUSHKHUOTDUDXJ6OLWJUVBM4V","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":"ed2af3631789220c16e3adfda45ddf07e09d20118d459b53001279a9b2486da0","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-01T06:12:29Z","title_canon_sha256":"629c608409c5b0c56db6e1dd62e5c262fecdd8879db530c83f6a031c486b6909"},"schema_version":"1.0","source":{"id":"1509.00151","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00151","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00151v3","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00151","created_at":"2026-05-18T01:30:00Z"},{"alias_kind":"pith_short_12","alias_value":"CHUSHKHUOTDU","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CHUSHKHUOTDUDXJ6","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CHUSHKHU","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:0be3b23017044278e7a038cabedf54ed263cc772e7011aaf61f92db139467e50","target":"graph","created_at":"2026-05-18T01:30:00Z","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":"While sparse coding-based clustering methods have shown to be successful, their bottlenecks in both efficiency and scalability limit the practical usage. In recent years, deep learning has been proved to be a highly effective, efficient and scalable feature learning tool. In this paper, we propose to emulate the sparse coding-based clustering pipeline in the context of deep learning, leading to a carefully crafted deep model benefiting from both. A feed-forward network structure, named TAGnet, is constructed based on a graph-regularized sparse coding algorithm. It is then trained with task-spe","authors_text":"Jiayu Zhou, Meng Wang, Shiyu Chang, Thomas S. Huang, Zhangyang Wang","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-01T06:12:29Z","title":"Learning A Task-Specific Deep Architecture For Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00151","kind":"arxiv","version":3},"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:8d34dc4fa8dd4097387b8c69b53686ad947a24f81313a5b75644e4589dc2f197","target":"record","created_at":"2026-05-18T01:30:00Z","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":"ed2af3631789220c16e3adfda45ddf07e09d20118d459b53001279a9b2486da0","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-01T06:12:29Z","title_canon_sha256":"629c608409c5b0c56db6e1dd62e5c262fecdd8879db530c83f6a031c486b6909"},"schema_version":"1.0","source":{"id":"1509.00151","kind":"arxiv","version":3}},"canonical_sha256":"11e923a8f474c741dd3e72ec9a542ce55bbde2f35b23e41c2e187d78f35fd426","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11e923a8f474c741dd3e72ec9a542ce55bbde2f35b23e41c2e187d78f35fd426","first_computed_at":"2026-05-18T01:30:00.793820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:00.793820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MhpU0vv6OQplp5rSL9gy2HR68SeRk2Vf2nBsE0FYuhyjnpj5DGiuiVmyevSrvhyI/nqsSEOK6HtgSfN0XaWSDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:00.794651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00151","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d34dc4fa8dd4097387b8c69b53686ad947a24f81313a5b75644e4589dc2f197","sha256:0be3b23017044278e7a038cabedf54ed263cc772e7011aaf61f92db139467e50"],"state_sha256":"bab8d90e4ed396abcf89712c4f4c36f3e64a6e02392d24c093fba29ce2ab3b09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1GAkN2iQE6DeAQreL3/28eBxfJGLyZK3O2giP3dW0VnxeswysjzbaGftqihIAbjM7uSbA56JuMqNWWkDIXoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:14:45.623059Z","bundle_sha256":"b7776058d69dae994042fb02609de525593bb402378d884b0f5c4998e625001c"}}