{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QWFOBZ2P43JG3VHD67M5OH3SEQ","short_pith_number":"pith:QWFOBZ2P","canonical_record":{"source":{"id":"1307.3811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2013-07-15T03:14:05Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"title_canon_sha256":"1f2788faa76800c0980e5385e0b244f44ceb06c788419536bcc233daf20cbf69","abstract_canon_sha256":"3b7d1de0d2e4cedb47c76d4c710a3af29077d9076b07569442b31772f5028c66"},"schema_version":"1.0"},"canonical_sha256":"858ae0e74fe6d26dd4e3f7d9d71f7224173606cbf5e0d990c9ce1dc6d1979669","source":{"kind":"arxiv","id":"1307.3811","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3811","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3811v1","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3811","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"QWFOBZ2P43JG","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QWFOBZ2P43JG3VHD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QWFOBZ2P","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QWFOBZ2P43JG3VHD67M5OH3SEQ","target":"record","payload":{"canonical_record":{"source":{"id":"1307.3811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2013-07-15T03:14:05Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"title_canon_sha256":"1f2788faa76800c0980e5385e0b244f44ceb06c788419536bcc233daf20cbf69","abstract_canon_sha256":"3b7d1de0d2e4cedb47c76d4c710a3af29077d9076b07569442b31772f5028c66"},"schema_version":"1.0"},"canonical_sha256":"858ae0e74fe6d26dd4e3f7d9d71f7224173606cbf5e0d990c9ce1dc6d1979669","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:06.424109Z","signature_b64":"LMJxafoidviTEprWg+POZnY1j6iPbEMflxU88JwYkQI1a6zQsRFxkJqhAuJ+7pvelxUCdDjkZXylwIlvmSO5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"858ae0e74fe6d26dd4e3f7d9d71f7224173606cbf5e0d990c9ce1dc6d1979669","last_reissued_at":"2026-05-18T03:04:06.423435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:06.423435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.3811","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-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3C/99imwZy1k4K6bE087MtiKVNk0JM95c/Yz8JOSnJzS7IMDGd4XQ7QAkR1160DD5WttHMxZQbwX21mPs8EpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:52:57.859746Z"},"content_sha256":"93cc2ca8d0682a1fe274f4a8c52ed49eee4de807897751d00277ea5ed8ccb590","schema_version":"1.0","event_id":"sha256:93cc2ca8d0682a1fe274f4a8c52ed49eee4de807897751d00277ea5ed8ccb590"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QWFOBZ2P43JG3VHD67M5OH3SEQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiview Hessian Discriminative Sparse Coding for Image Annotation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT"],"primary_cat":"cs.MM","authors_text":"Dacheng Tao, Jun Cheng, Weifeng Liu, Yuanyan Tang","submitted_at":"2013-07-15T03:14:05Z","abstract_excerpt":"Sparse coding represents a signal sparsely by using an overcomplete dictionary, and obtains promising performance in practical computer vision applications, especially for signal restoration tasks such as image denoising and image inpainting. In recent years, many discriminative sparse coding algorithms have been developed for classification problems, but they cannot naturally handle visual data represented by multiview features. In addition, existing sparse coding algorithms use graph Laplacian to model the local geometry of the data distribution. It has been identified that Laplacian regular"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3811","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-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQk35inJSR6ghPjQJ+Oxbte3d0fYnu5gX+rXDr2UZ5/AzyKWuj1oGMHEz0VYgflEktqG348/sSJAhRruU1HoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:52:57.860634Z"},"content_sha256":"5333bedc4d7fd2dbfda477239c9a0c3ba87a18e6ac574bed0ba5896be7212a1a","schema_version":"1.0","event_id":"sha256:5333bedc4d7fd2dbfda477239c9a0c3ba87a18e6ac574bed0ba5896be7212a1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWFOBZ2P43JG3VHD67M5OH3SEQ/bundle.json","state_url":"https://pith.science/pith/QWFOBZ2P43JG3VHD67M5OH3SEQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWFOBZ2P43JG3VHD67M5OH3SEQ/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-31T13:52:57Z","links":{"resolver":"https://pith.science/pith/QWFOBZ2P43JG3VHD67M5OH3SEQ","bundle":"https://pith.science/pith/QWFOBZ2P43JG3VHD67M5OH3SEQ/bundle.json","state":"https://pith.science/pith/QWFOBZ2P43JG3VHD67M5OH3SEQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWFOBZ2P43JG3VHD67M5OH3SEQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QWFOBZ2P43JG3VHD67M5OH3SEQ","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":"3b7d1de0d2e4cedb47c76d4c710a3af29077d9076b07569442b31772f5028c66","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2013-07-15T03:14:05Z","title_canon_sha256":"1f2788faa76800c0980e5385e0b244f44ceb06c788419536bcc233daf20cbf69"},"schema_version":"1.0","source":{"id":"1307.3811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3811","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3811v1","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3811","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"QWFOBZ2P43JG","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QWFOBZ2P43JG3VHD","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QWFOBZ2P","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:5333bedc4d7fd2dbfda477239c9a0c3ba87a18e6ac574bed0ba5896be7212a1a","target":"graph","created_at":"2026-05-18T03:04:06Z","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":"Sparse coding represents a signal sparsely by using an overcomplete dictionary, and obtains promising performance in practical computer vision applications, especially for signal restoration tasks such as image denoising and image inpainting. In recent years, many discriminative sparse coding algorithms have been developed for classification problems, but they cannot naturally handle visual data represented by multiview features. In addition, existing sparse coding algorithms use graph Laplacian to model the local geometry of the data distribution. It has been identified that Laplacian regular","authors_text":"Dacheng Tao, Jun Cheng, Weifeng Liu, Yuanyan Tang","cross_cats":["cs.CV","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2013-07-15T03:14:05Z","title":"Multiview Hessian Discriminative Sparse Coding for Image Annotation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3811","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:93cc2ca8d0682a1fe274f4a8c52ed49eee4de807897751d00277ea5ed8ccb590","target":"record","created_at":"2026-05-18T03:04:06Z","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":"3b7d1de0d2e4cedb47c76d4c710a3af29077d9076b07569442b31772f5028c66","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2013-07-15T03:14:05Z","title_canon_sha256":"1f2788faa76800c0980e5385e0b244f44ceb06c788419536bcc233daf20cbf69"},"schema_version":"1.0","source":{"id":"1307.3811","kind":"arxiv","version":1}},"canonical_sha256":"858ae0e74fe6d26dd4e3f7d9d71f7224173606cbf5e0d990c9ce1dc6d1979669","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"858ae0e74fe6d26dd4e3f7d9d71f7224173606cbf5e0d990c9ce1dc6d1979669","first_computed_at":"2026-05-18T03:04:06.423435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:06.423435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LMJxafoidviTEprWg+POZnY1j6iPbEMflxU88JwYkQI1a6zQsRFxkJqhAuJ+7pvelxUCdDjkZXylwIlvmSO5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:06.424109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93cc2ca8d0682a1fe274f4a8c52ed49eee4de807897751d00277ea5ed8ccb590","sha256:5333bedc4d7fd2dbfda477239c9a0c3ba87a18e6ac574bed0ba5896be7212a1a"],"state_sha256":"aae01937e4681c67b58136bcc768cdf11d66ad9197e7044f5f2ef37369c5d225"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C2MssttNIa+doVQQslUgNHUCJ8FfH/rtwt4DjJqnX7brHhsxupIFsPG4selB0posTkGL2v4hmnQWdRjpXdfcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:52:57.865261Z","bundle_sha256":"10dfe3762cd9bbdfb1dfe2e744cfa4859752b4c6f56465545e81a4000cb3a581"}}