{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:X66CI4I47DXOOEG3SVSOQWADJT","short_pith_number":"pith:X66CI4I4","schema_version":"1.0","canonical_sha256":"bfbc24711cf8eee710db9564e858034cea5746c33415542dad1e558236f6d048","source":{"kind":"arxiv","id":"2306.11323","version":1},"attestation_state":"computed","paper":{"title":"A gradient projection method for semi-supervised hypergraph clustering problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dongdong Liu, Jingya Chang, Min Xi","submitted_at":"2023-06-20T06:47:32Z","abstract_excerpt":"Semi-supervised clustering problems focus on clustering data with labels. In this paper,we consider the semi-supervised hypergraph problems. We use the hypergraph related tensor to construct an orthogonal constrained optimization model. The optimization problem is solved by a retraction method, which employs the polar decomposition to map the gradient direction in the tangent space to the Stefiel manifold. A nonmonotone curvilinear search is implemented to guarantee reduction in the objective function value. Convergence analysis demonstrates that the first order optimality condition is satisfi"},"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":"2306.11323","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2023-06-20T06:47:32Z","cross_cats_sorted":[],"title_canon_sha256":"4f996190ac4671bdda40de0a488559da7021e1564ea944681816a41e24db32d0","abstract_canon_sha256":"a9904f77e2d193c5345807ef55a810dbdb70807a513a4d1eeecfb1cd0b3f3de4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:22:18.310625Z","signature_b64":"8EQN745PaEccgciadUbfCFk887XOlAjYt6YWWL1x1IEtkLFw66S6wdIa3m71HwiaA6pSZigpvXAkcmhduP3pCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfbc24711cf8eee710db9564e858034cea5746c33415542dad1e558236f6d048","last_reissued_at":"2026-07-05T06:22:18.310044Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:22:18.310044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A gradient projection method for semi-supervised hypergraph clustering problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dongdong Liu, Jingya Chang, Min Xi","submitted_at":"2023-06-20T06:47:32Z","abstract_excerpt":"Semi-supervised clustering problems focus on clustering data with labels. In this paper,we consider the semi-supervised hypergraph problems. We use the hypergraph related tensor to construct an orthogonal constrained optimization model. The optimization problem is solved by a retraction method, which employs the polar decomposition to map the gradient direction in the tangent space to the Stefiel manifold. A nonmonotone curvilinear search is implemented to guarantee reduction in the objective function value. Convergence analysis demonstrates that the first order optimality condition is satisfi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11323","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/2306.11323/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":"2306.11323","created_at":"2026-07-05T06:22:18.310109+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.11323v1","created_at":"2026-07-05T06:22:18.310109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11323","created_at":"2026-07-05T06:22:18.310109+00:00"},{"alias_kind":"pith_short_12","alias_value":"X66CI4I47DXO","created_at":"2026-07-05T06:22:18.310109+00:00"},{"alias_kind":"pith_short_16","alias_value":"X66CI4I47DXOOEG3","created_at":"2026-07-05T06:22:18.310109+00:00"},{"alias_kind":"pith_short_8","alias_value":"X66CI4I4","created_at":"2026-07-05T06:22:18.310109+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/X66CI4I47DXOOEG3SVSOQWADJT","json":"https://pith.science/pith/X66CI4I47DXOOEG3SVSOQWADJT.json","graph_json":"https://pith.science/api/pith-number/X66CI4I47DXOOEG3SVSOQWADJT/graph.json","events_json":"https://pith.science/api/pith-number/X66CI4I47DXOOEG3SVSOQWADJT/events.json","paper":"https://pith.science/paper/X66CI4I4"},"agent_actions":{"view_html":"https://pith.science/pith/X66CI4I47DXOOEG3SVSOQWADJT","download_json":"https://pith.science/pith/X66CI4I47DXOOEG3SVSOQWADJT.json","view_paper":"https://pith.science/paper/X66CI4I4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.11323&json=true","fetch_graph":"https://pith.science/api/pith-number/X66CI4I47DXOOEG3SVSOQWADJT/graph.json","fetch_events":"https://pith.science/api/pith-number/X66CI4I47DXOOEG3SVSOQWADJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X66CI4I47DXOOEG3SVSOQWADJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X66CI4I47DXOOEG3SVSOQWADJT/action/storage_attestation","attest_author":"https://pith.science/pith/X66CI4I47DXOOEG3SVSOQWADJT/action/author_attestation","sign_citation":"https://pith.science/pith/X66CI4I47DXOOEG3SVSOQWADJT/action/citation_signature","submit_replication":"https://pith.science/pith/X66CI4I47DXOOEG3SVSOQWADJT/action/replication_record"}},"created_at":"2026-07-05T06:22:18.310109+00:00","updated_at":"2026-07-05T06:22:18.310109+00:00"}