{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:DEVZKBJVTA4NKIWODUYBQWHB42","short_pith_number":"pith:DEVZKBJV","schema_version":"1.0","canonical_sha256":"192b9505359838d522ce1d301858e1e6887491b63bf793675ce73e09bf13f8a0","source":{"kind":"arxiv","id":"2205.10481","version":2},"attestation_state":"computed","paper":{"title":"Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Guanxing Lu, Hui Liu, Junhui Hou, Yuheng Jia","submitted_at":"2022-05-21T01:47:17Z","abstract_excerpt":"In this letter, we propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. By representing the limited amount of supervisory information as a pairwise constraint matrix, we observe that the ideal affinity matrix for clustering shares the same low-rank structure as the ideal pairwise constraint matrix. Thus, we stack the two matrices into a 3-D tensor, where a global low-rank constraint is imposed to promote the affinity matrix construction and augment the initial pair"},"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":"2205.10481","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-05-21T01:47:17Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"996804d755c1a9c6a2d2c04be7a15ec295bd556fa1d2febca731932a050fce7d","abstract_canon_sha256":"40077f94de26b621587ee70e6c920d2c824b75e5f072a72ea4bca90e62dd5453"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:30:29.315832Z","signature_b64":"NpUbrZgScU6puQ7krEs42pi4jd2TESU34FTr/y7lHKrNwmz3USLno8r3fXsw7IlbpjH0eKN25I28cEajZRGeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"192b9505359838d522ce1d301858e1e6887491b63bf793675ce73e09bf13f8a0","last_reissued_at":"2026-07-05T05:30:29.315331Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:30:29.315331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Guanxing Lu, Hui Liu, Junhui Hou, Yuheng Jia","submitted_at":"2022-05-21T01:47:17Z","abstract_excerpt":"In this letter, we propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix. By representing the limited amount of supervisory information as a pairwise constraint matrix, we observe that the ideal affinity matrix for clustering shares the same low-rank structure as the ideal pairwise constraint matrix. Thus, we stack the two matrices into a 3-D tensor, where a global low-rank constraint is imposed to promote the affinity matrix construction and augment the initial pair"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.10481","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.10481/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":"2205.10481","created_at":"2026-07-05T05:30:29.315394+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.10481v2","created_at":"2026-07-05T05:30:29.315394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.10481","created_at":"2026-07-05T05:30:29.315394+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEVZKBJVTA4N","created_at":"2026-07-05T05:30:29.315394+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEVZKBJVTA4NKIWO","created_at":"2026-07-05T05:30:29.315394+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEVZKBJV","created_at":"2026-07-05T05:30:29.315394+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/DEVZKBJVTA4NKIWODUYBQWHB42","json":"https://pith.science/pith/DEVZKBJVTA4NKIWODUYBQWHB42.json","graph_json":"https://pith.science/api/pith-number/DEVZKBJVTA4NKIWODUYBQWHB42/graph.json","events_json":"https://pith.science/api/pith-number/DEVZKBJVTA4NKIWODUYBQWHB42/events.json","paper":"https://pith.science/paper/DEVZKBJV"},"agent_actions":{"view_html":"https://pith.science/pith/DEVZKBJVTA4NKIWODUYBQWHB42","download_json":"https://pith.science/pith/DEVZKBJVTA4NKIWODUYBQWHB42.json","view_paper":"https://pith.science/paper/DEVZKBJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.10481&json=true","fetch_graph":"https://pith.science/api/pith-number/DEVZKBJVTA4NKIWODUYBQWHB42/graph.json","fetch_events":"https://pith.science/api/pith-number/DEVZKBJVTA4NKIWODUYBQWHB42/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEVZKBJVTA4NKIWODUYBQWHB42/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEVZKBJVTA4NKIWODUYBQWHB42/action/storage_attestation","attest_author":"https://pith.science/pith/DEVZKBJVTA4NKIWODUYBQWHB42/action/author_attestation","sign_citation":"https://pith.science/pith/DEVZKBJVTA4NKIWODUYBQWHB42/action/citation_signature","submit_replication":"https://pith.science/pith/DEVZKBJVTA4NKIWODUYBQWHB42/action/replication_record"}},"created_at":"2026-07-05T05:30:29.315394+00:00","updated_at":"2026-07-05T05:30:29.315394+00:00"}