{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MQYFX2THK2E7QBIRUSZFV6P6UC","short_pith_number":"pith:MQYFX2TH","canonical_record":{"source":{"id":"1402.6383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-26T00:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"7d5a14ace097aec353808eb94e6d7127c4a61cbb6b1310def7dc370c15a21391","abstract_canon_sha256":"b88b83e67a6aa572818c668f45a921dfd2866f347e5b628bb0b401c1eebf43ca"},"schema_version":"1.0"},"canonical_sha256":"64305bea675689f80511a4b25af9fea08b61f4eb169076081a2c4345d8d4eb76","source":{"kind":"arxiv","id":"1402.6383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6383","created_at":"2026-05-18T01:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6383v1","created_at":"2026-05-18T01:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6383","created_at":"2026-05-18T01:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"MQYFX2THK2E7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MQYFX2THK2E7QBIR","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MQYFX2TH","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MQYFX2THK2E7QBIRUSZFV6P6UC","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-26T00:22:50Z","cross_cats_sorted":[],"title_canon_sha256":"7d5a14ace097aec353808eb94e6d7127c4a61cbb6b1310def7dc370c15a21391","abstract_canon_sha256":"b88b83e67a6aa572818c668f45a921dfd2866f347e5b628bb0b401c1eebf43ca"},"schema_version":"1.0"},"canonical_sha256":"64305bea675689f80511a4b25af9fea08b61f4eb169076081a2c4345d8d4eb76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:44:27.108883Z","signature_b64":"YMCeSAKXYN2gZ5ptPLUgZWkTTm+XS+UHt8XgiMWhks61tnh+1Tc1TgmxdJm7GVOSq8LYxNcfsCKL98pxIT+GBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64305bea675689f80511a4b25af9fea08b61f4eb169076081a2c4345d8d4eb76","last_reissued_at":"2026-05-18T01:44:27.108518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:44:27.108518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6383","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-18T01:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2g73C0iso5Up8cVLznKnKpW6ja+Qsm5DehzoYx65nWuiIvPFOFWITCLtp4vOewe0vgO8wsmt0eG9FU/w4dxcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:52:04.495746Z"},"content_sha256":"81a1b70e38f13767a1b04fe1528a8a98f1ad3559ac96d916689f89008e080fbe","schema_version":"1.0","event_id":"sha256:81a1b70e38f13767a1b04fe1528a8a98f1ad3559ac96d916689f89008e080fbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MQYFX2THK2E7QBIRUSZFV6P6UC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-margin Learning of Compact Binary Image Encodings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anton van den Hengel, Chunhua Shen, Sakrapee Paisitkriangkrai","submitted_at":"2014-02-26T00:22:50Z","abstract_excerpt":"The use of high-dimensional features has become a normal practice in many computer vision applications. The large dimension of these features is a limiting factor upon the number of data points which may be effectively stored and processed, however. We address this problem by developing a novel approach to learning a compact binary encoding, which exploits both pair-wise proximity and class-label information on training data set. Exploiting this extra information allows the development of encodings which, although compact, outperform the original high-dimensional features in terms of final cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6383","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-18T01:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWt85vsMOI3ui9PX33l6HY0eu8piT6+Bxb0btCWsjH+mNH3s0X4cGTlLc2asv1ElAIrJF8oyLr1YVoh6S8j9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:52:04.496194Z"},"content_sha256":"50662ef51d26a97fddcc4e205e11b129766a05b592e488a5158add24081b4c07","schema_version":"1.0","event_id":"sha256:50662ef51d26a97fddcc4e205e11b129766a05b592e488a5158add24081b4c07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQYFX2THK2E7QBIRUSZFV6P6UC/bundle.json","state_url":"https://pith.science/pith/MQYFX2THK2E7QBIRUSZFV6P6UC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQYFX2THK2E7QBIRUSZFV6P6UC/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-26T06:52:04Z","links":{"resolver":"https://pith.science/pith/MQYFX2THK2E7QBIRUSZFV6P6UC","bundle":"https://pith.science/pith/MQYFX2THK2E7QBIRUSZFV6P6UC/bundle.json","state":"https://pith.science/pith/MQYFX2THK2E7QBIRUSZFV6P6UC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQYFX2THK2E7QBIRUSZFV6P6UC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MQYFX2THK2E7QBIRUSZFV6P6UC","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":"b88b83e67a6aa572818c668f45a921dfd2866f347e5b628bb0b401c1eebf43ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-26T00:22:50Z","title_canon_sha256":"7d5a14ace097aec353808eb94e6d7127c4a61cbb6b1310def7dc370c15a21391"},"schema_version":"1.0","source":{"id":"1402.6383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6383","created_at":"2026-05-18T01:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6383v1","created_at":"2026-05-18T01:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6383","created_at":"2026-05-18T01:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"MQYFX2THK2E7","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MQYFX2THK2E7QBIR","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MQYFX2TH","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:50662ef51d26a97fddcc4e205e11b129766a05b592e488a5158add24081b4c07","target":"graph","created_at":"2026-05-18T01:44:27Z","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":"The use of high-dimensional features has become a normal practice in many computer vision applications. The large dimension of these features is a limiting factor upon the number of data points which may be effectively stored and processed, however. We address this problem by developing a novel approach to learning a compact binary encoding, which exploits both pair-wise proximity and class-label information on training data set. Exploiting this extra information allows the development of encodings which, although compact, outperform the original high-dimensional features in terms of final cla","authors_text":"Anton van den Hengel, Chunhua Shen, Sakrapee Paisitkriangkrai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-26T00:22:50Z","title":"Large-margin Learning of Compact Binary Image Encodings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6383","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:81a1b70e38f13767a1b04fe1528a8a98f1ad3559ac96d916689f89008e080fbe","target":"record","created_at":"2026-05-18T01:44:27Z","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":"b88b83e67a6aa572818c668f45a921dfd2866f347e5b628bb0b401c1eebf43ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-02-26T00:22:50Z","title_canon_sha256":"7d5a14ace097aec353808eb94e6d7127c4a61cbb6b1310def7dc370c15a21391"},"schema_version":"1.0","source":{"id":"1402.6383","kind":"arxiv","version":1}},"canonical_sha256":"64305bea675689f80511a4b25af9fea08b61f4eb169076081a2c4345d8d4eb76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64305bea675689f80511a4b25af9fea08b61f4eb169076081a2c4345d8d4eb76","first_computed_at":"2026-05-18T01:44:27.108518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:44:27.108518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YMCeSAKXYN2gZ5ptPLUgZWkTTm+XS+UHt8XgiMWhks61tnh+1Tc1TgmxdJm7GVOSq8LYxNcfsCKL98pxIT+GBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:44:27.108883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81a1b70e38f13767a1b04fe1528a8a98f1ad3559ac96d916689f89008e080fbe","sha256:50662ef51d26a97fddcc4e205e11b129766a05b592e488a5158add24081b4c07"],"state_sha256":"10f64a31727b4ce18182466d7ac0b3e61aeb31eaa1c796661e028f4dffda0347"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDn7UYf6E2k/x4rMzmefQRHL2MV14XTv3qa4ZnQOamVs2dbriYTNR8YWVqOEYPWiDJtpCgZGgmQYsHNtGhKBAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:52:04.498653Z","bundle_sha256":"ebb0fd6e4dc9492c42e773c8914987859dcbf677849072008714060f7df4b6bc"}}