{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:N6TPNBWL64PYOLRJ4TMX3AMCUG","short_pith_number":"pith:N6TPNBWL","schema_version":"1.0","canonical_sha256":"6fa6f686cbf71f872e29e4d97d8182a196c775afcc837022eef862ea45877e9a","source":{"kind":"arxiv","id":"1603.01096","version":1},"attestation_state":"computed","paper":{"title":"Elastic Net Hypergraph Learning for Image Clustering and Semi-supervised Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cantian Wang, Dacheng Tao, Qingshan Liu, Tongliang Liu, Yubao Sun","submitted_at":"2016-03-03T13:37:23Z","abstract_excerpt":"Graph model is emerging as a very effective tool for learning the complex structures and relationships hidden in data. Generally, the critical purpose of graph-oriented learning algorithms is to construct an informative graph for image clustering and classification tasks. In addition to the classical $K$-nearest-neighbor and $r$-neighborhood methods for graph construction, $l_1$-graph and its variants are emerging methods for finding the neighboring samples of a center datum, where the corresponding ingoing edge weights are simultaneously derived by the sparse reconstruction coefficients of th"},"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":"1603.01096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-03T13:37:23Z","cross_cats_sorted":[],"title_canon_sha256":"b7abf57b16e46c82b748a216adfb118b64f20a36a53f2ee0d5c325de0d53d365","abstract_canon_sha256":"37b44c12c393a7dab2441c05fea82552f6154fb5197e61fadebd0b6cff9ab252"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:40.572038Z","signature_b64":"oklWKRu/m9cLJnHL6wJC9Pm4t2KXOHQet/DgT5tejXieX+HlxmjyPcnTOFGWXRgYBZB4EsJaT+BVrLoAW6GmAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fa6f686cbf71f872e29e4d97d8182a196c775afcc837022eef862ea45877e9a","last_reissued_at":"2026-05-18T00:54:40.571482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:40.571482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Elastic Net Hypergraph Learning for Image Clustering and Semi-supervised Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cantian Wang, Dacheng Tao, Qingshan Liu, Tongliang Liu, Yubao Sun","submitted_at":"2016-03-03T13:37:23Z","abstract_excerpt":"Graph model is emerging as a very effective tool for learning the complex structures and relationships hidden in data. Generally, the critical purpose of graph-oriented learning algorithms is to construct an informative graph for image clustering and classification tasks. In addition to the classical $K$-nearest-neighbor and $r$-neighborhood methods for graph construction, $l_1$-graph and its variants are emerging methods for finding the neighboring samples of a center datum, where the corresponding ingoing edge weights are simultaneously derived by the sparse reconstruction coefficients of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01096","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":""},"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":"1603.01096","created_at":"2026-05-18T00:54:40.571570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01096v1","created_at":"2026-05-18T00:54:40.571570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01096","created_at":"2026-05-18T00:54:40.571570+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6TPNBWL64PY","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6TPNBWL64PYOLRJ","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6TPNBWL","created_at":"2026-05-18T12:30:32.724797+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/N6TPNBWL64PYOLRJ4TMX3AMCUG","json":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG.json","graph_json":"https://pith.science/api/pith-number/N6TPNBWL64PYOLRJ4TMX3AMCUG/graph.json","events_json":"https://pith.science/api/pith-number/N6TPNBWL64PYOLRJ4TMX3AMCUG/events.json","paper":"https://pith.science/paper/N6TPNBWL"},"agent_actions":{"view_html":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG","download_json":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG.json","view_paper":"https://pith.science/paper/N6TPNBWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01096&json=true","fetch_graph":"https://pith.science/api/pith-number/N6TPNBWL64PYOLRJ4TMX3AMCUG/graph.json","fetch_events":"https://pith.science/api/pith-number/N6TPNBWL64PYOLRJ4TMX3AMCUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/action/storage_attestation","attest_author":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/action/author_attestation","sign_citation":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/action/citation_signature","submit_replication":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/action/replication_record"}},"created_at":"2026-05-18T00:54:40.571570+00:00","updated_at":"2026-05-18T00:54:40.571570+00:00"}