{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:N6TPNBWL64PYOLRJ4TMX3AMCUG","short_pith_number":"pith:N6TPNBWL","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"},"canonical_sha256":"6fa6f686cbf71f872e29e4d97d8182a196c775afcc837022eef862ea45877e9a","source":{"kind":"arxiv","id":"1603.01096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01096","created_at":"2026-05-18T00:54:40Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01096v1","created_at":"2026-05-18T00:54:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01096","created_at":"2026-05-18T00:54:40Z"},{"alias_kind":"pith_short_12","alias_value":"N6TPNBWL64PY","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N6TPNBWL64PYOLRJ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N6TPNBWL","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:N6TPNBWL64PYOLRJ4TMX3AMCUG","target":"record","payload":{"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"},"canonical_sha256":"6fa6f686cbf71f872e29e4d97d8182a196c775afcc837022eef862ea45877e9a","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"},"source_kind":"arxiv","source_id":"1603.01096","source_version":1,"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-18T00:54:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRzw34BIZnLfvRaGp9mcBa2oIXDnK41zP+8t5ARGum8t0JAVvqbb1jr2jvL809fXO5eGl4uLmtsYlyh9Uh9QCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:37:58.169962Z"},"content_sha256":"1da4be65902abe931a16b7dc6932f7b26ad8c427959ba0a7121d36fa145e93a4","schema_version":"1.0","event_id":"sha256:1da4be65902abe931a16b7dc6932f7b26ad8c427959ba0a7121d36fa145e93a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:N6TPNBWL64PYOLRJ4TMX3AMCUG","target":"graph","payload":{"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"},"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-18T00:54:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmjSH/edAuKd3zES3ZOs7hEQLEFXQzNmQe6Mr/OfwDb9avk2G1vJtH4YnKF8xx6O0vfNHelYcU37xq1NeFaqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:37:58.170629Z"},"content_sha256":"81393ba22b4e9baf384ef4c1f7aa804ead386f5f6bc468353a230da7df0f193e","schema_version":"1.0","event_id":"sha256:81393ba22b4e9baf384ef4c1f7aa804ead386f5f6bc468353a230da7df0f193e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/bundle.json","state_url":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/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-31T15:37:58Z","links":{"resolver":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG","bundle":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/bundle.json","state":"https://pith.science/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6TPNBWL64PYOLRJ4TMX3AMCUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:N6TPNBWL64PYOLRJ4TMX3AMCUG","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":"37b44c12c393a7dab2441c05fea82552f6154fb5197e61fadebd0b6cff9ab252","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-03T13:37:23Z","title_canon_sha256":"b7abf57b16e46c82b748a216adfb118b64f20a36a53f2ee0d5c325de0d53d365"},"schema_version":"1.0","source":{"id":"1603.01096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01096","created_at":"2026-05-18T00:54:40Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01096v1","created_at":"2026-05-18T00:54:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01096","created_at":"2026-05-18T00:54:40Z"},{"alias_kind":"pith_short_12","alias_value":"N6TPNBWL64PY","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N6TPNBWL64PYOLRJ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N6TPNBWL","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:81393ba22b4e9baf384ef4c1f7aa804ead386f5f6bc468353a230da7df0f193e","target":"graph","created_at":"2026-05-18T00:54:40Z","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":"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","authors_text":"Cantian Wang, Dacheng Tao, Qingshan Liu, Tongliang Liu, Yubao Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-03T13:37:23Z","title":"Elastic Net Hypergraph Learning for Image Clustering and Semi-supervised Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01096","kind":"arxiv","version":1},"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:1da4be65902abe931a16b7dc6932f7b26ad8c427959ba0a7121d36fa145e93a4","target":"record","created_at":"2026-05-18T00:54:40Z","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":"37b44c12c393a7dab2441c05fea82552f6154fb5197e61fadebd0b6cff9ab252","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-03-03T13:37:23Z","title_canon_sha256":"b7abf57b16e46c82b748a216adfb118b64f20a36a53f2ee0d5c325de0d53d365"},"schema_version":"1.0","source":{"id":"1603.01096","kind":"arxiv","version":1}},"canonical_sha256":"6fa6f686cbf71f872e29e4d97d8182a196c775afcc837022eef862ea45877e9a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fa6f686cbf71f872e29e4d97d8182a196c775afcc837022eef862ea45877e9a","first_computed_at":"2026-05-18T00:54:40.571482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:40.571482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oklWKRu/m9cLJnHL6wJC9Pm4t2KXOHQet/DgT5tejXieX+HlxmjyPcnTOFGWXRgYBZB4EsJaT+BVrLoAW6GmAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:40.572038Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1da4be65902abe931a16b7dc6932f7b26ad8c427959ba0a7121d36fa145e93a4","sha256:81393ba22b4e9baf384ef4c1f7aa804ead386f5f6bc468353a230da7df0f193e"],"state_sha256":"0bf44dc9b822ed98d92f5e120626049305cb5d4172030a456d3eb36594b8b9cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAAe7gOU2zOiqR5tgab6h5cQPmF/X+3047hcXsYsYEl5JYR1cn+/o37eIpovueWX2eVlisS7qaQ3yYNL60hCBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:37:58.174114Z","bundle_sha256":"6b4d2b7c623cd1bb842a276a6cf756e399b35dfe5c7a09e925cfb22294b21ed3"}}