{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6SSQ5SHUN3VPW7QQHBBUUTXIFI","short_pith_number":"pith:6SSQ5SHU","schema_version":"1.0","canonical_sha256":"f4a50ec8f46eeafb7e1038434a4ee82a18c0e76c3fbee130968f24327f612fee","source":{"kind":"arxiv","id":"1912.07871","version":1},"attestation_state":"computed","paper":{"title":"Constructing the F-Graph with a Symmetric Constraint for Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kai Xu, Wen-Bo Hu, Xiao-Jun Wu","submitted_at":"2019-12-17T08:40:01Z","abstract_excerpt":"Based on further studying the low-rank subspace clustering (LRSC) and L2-graph subspace clustering algorithms, we propose a F-graph subspace clustering algorithm with a symmetric constraint (FSSC), which constructs a new objective function with a symmetric constraint basing on F-norm, whose the most significant advantage is to obtain a closed-form solution of the coefficient matrix. Then, take the absolute value of each element of the coefficient matrix, and retain the k largest coefficients per column, set the other elements to 0, to get a new coefficient matrix. Finally, FSSC performs spectr"},"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":"1912.07871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-12-17T08:40:01Z","cross_cats_sorted":[],"title_canon_sha256":"5878b846f08fd4861522288fc940f8de78d83fcbd6e23968e43af7cebd7e018c","abstract_canon_sha256":"e46391aa96036d236816bebe6dc272bc8932c39f6160ae7083f3ee26a5295d0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:26:46.756107Z","signature_b64":"DFIXb40Dbdhogw25wDxQm0VyALou+WuAZNXaSTP9TcV0S9d7/8gl27UYXdllVWmFLLldXQdAasERmXAEIfs/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4a50ec8f46eeafb7e1038434a4ee82a18c0e76c3fbee130968f24327f612fee","last_reissued_at":"2026-07-05T00:26:46.755663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:26:46.755663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructing the F-Graph with a Symmetric Constraint for Subspace Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kai Xu, Wen-Bo Hu, Xiao-Jun Wu","submitted_at":"2019-12-17T08:40:01Z","abstract_excerpt":"Based on further studying the low-rank subspace clustering (LRSC) and L2-graph subspace clustering algorithms, we propose a F-graph subspace clustering algorithm with a symmetric constraint (FSSC), which constructs a new objective function with a symmetric constraint basing on F-norm, whose the most significant advantage is to obtain a closed-form solution of the coefficient matrix. Then, take the absolute value of each element of the coefficient matrix, and retain the k largest coefficients per column, set the other elements to 0, to get a new coefficient matrix. Finally, FSSC performs spectr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.07871","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/1912.07871/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":"1912.07871","created_at":"2026-07-05T00:26:46.755726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.07871v1","created_at":"2026-07-05T00:26:46.755726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.07871","created_at":"2026-07-05T00:26:46.755726+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SSQ5SHUN3VP","created_at":"2026-07-05T00:26:46.755726+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SSQ5SHUN3VPW7QQ","created_at":"2026-07-05T00:26:46.755726+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SSQ5SHU","created_at":"2026-07-05T00:26:46.755726+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/6SSQ5SHUN3VPW7QQHBBUUTXIFI","json":"https://pith.science/pith/6SSQ5SHUN3VPW7QQHBBUUTXIFI.json","graph_json":"https://pith.science/api/pith-number/6SSQ5SHUN3VPW7QQHBBUUTXIFI/graph.json","events_json":"https://pith.science/api/pith-number/6SSQ5SHUN3VPW7QQHBBUUTXIFI/events.json","paper":"https://pith.science/paper/6SSQ5SHU"},"agent_actions":{"view_html":"https://pith.science/pith/6SSQ5SHUN3VPW7QQHBBUUTXIFI","download_json":"https://pith.science/pith/6SSQ5SHUN3VPW7QQHBBUUTXIFI.json","view_paper":"https://pith.science/paper/6SSQ5SHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.07871&json=true","fetch_graph":"https://pith.science/api/pith-number/6SSQ5SHUN3VPW7QQHBBUUTXIFI/graph.json","fetch_events":"https://pith.science/api/pith-number/6SSQ5SHUN3VPW7QQHBBUUTXIFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SSQ5SHUN3VPW7QQHBBUUTXIFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SSQ5SHUN3VPW7QQHBBUUTXIFI/action/storage_attestation","attest_author":"https://pith.science/pith/6SSQ5SHUN3VPW7QQHBBUUTXIFI/action/author_attestation","sign_citation":"https://pith.science/pith/6SSQ5SHUN3VPW7QQHBBUUTXIFI/action/citation_signature","submit_replication":"https://pith.science/pith/6SSQ5SHUN3VPW7QQHBBUUTXIFI/action/replication_record"}},"created_at":"2026-07-05T00:26:46.755726+00:00","updated_at":"2026-07-05T00:26:46.755726+00:00"}