{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2OAYI3IAF57HMKLBVN76IOXQ5D","short_pith_number":"pith:2OAYI3IA","canonical_record":{"source":{"id":"1905.13382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-31T02:12:41Z","cross_cats_sorted":["cs.AI","cs.MM"],"title_canon_sha256":"8921370de52e73960ed64d0161cb8acf014d6ede3cb96569facf894f181029f5","abstract_canon_sha256":"9fe55fde35ff08eb0c3d8b34437cd23a4574175bc3542324040c52f6d46fdce6"},"schema_version":"1.0"},"canonical_sha256":"d381846d002f7e762961ab7fe43af0e8cd1cd3c04fcc02ca00451b13f11980f3","source":{"kind":"arxiv","id":"1905.13382","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13382","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13382v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13382","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"2OAYI3IAF57H","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2OAYI3IAF57HMKLB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2OAYI3IA","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2OAYI3IAF57HMKLBVN76IOXQ5D","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-31T02:12:41Z","cross_cats_sorted":["cs.AI","cs.MM"],"title_canon_sha256":"8921370de52e73960ed64d0161cb8acf014d6ede3cb96569facf894f181029f5","abstract_canon_sha256":"9fe55fde35ff08eb0c3d8b34437cd23a4574175bc3542324040c52f6d46fdce6"},"schema_version":"1.0"},"canonical_sha256":"d381846d002f7e762961ab7fe43af0e8cd1cd3c04fcc02ca00451b13f11980f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:35.089688Z","signature_b64":"Vaad92HWgFgACbsYFBWpCZTyYOzZRgkhdgG1EiNljfN2VvkLFnsBD6ZfUd/yQluC+HMYDP6oIaiPhyyyhBexAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d381846d002f7e762961ab7fe43af0e8cd1cd3c04fcc02ca00451b13f11980f3","last_reissued_at":"2026-05-17T23:44:35.089016Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:35.089016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13382","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-17T23:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ob9nmrl0+Lzj4v24D+1KZNPYsUq+HH4d6YhZXEzCEr1t5FMHazkMI5NdN/WcekEizFM+ngYveFEiyO+Z2C0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:39:17.833666Z"},"content_sha256":"829fb1d2700ab01b595af886ccfaf232a807f9a016200e85764cebf1f2c7d3d3","schema_version":"1.0","event_id":"sha256:829fb1d2700ab01b595af886ccfaf232a807f9a016200e85764cebf1f2c7d3d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2OAYI3IAF57HMKLBVN76IOXQ5D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supervised Online Hashing via Similarity Distribution Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MM"],"primary_cat":"cs.CV","authors_text":"Baochang Zhang, Feiyue Huang, Feng Zheng, Guodong Guo, Liujuan Cao, Mingbao Lin, Rongrong Ji, Shen Chen, Xiaoshuai Sun","submitted_at":"2019-05-31T02:12:41Z","abstract_excerpt":"Online hashing has attracted extensive research attention when facing streaming data. Most online hashing methods, learning binary codes based on pairwise similarities of training instances, fail to capture the semantic relationship, and suffer from a poor generalization in large-scale applications due to large variations. In this paper, we propose to model the similarity distributions between the input data and the hashing codes, upon which a novel supervised online hashing method, dubbed as Similarity Distribution based Online Hashing (SDOH), is proposed, to keep the intrinsic semantic relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13382","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-17T23:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2/ly1Gphn05NiQtl2kVj8bVtuRLTjWfeDkc5bVbWOklv9VpiCD1uGNchscVj80/mCUVWfbUWIWNn75WSVTsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T11:39:17.834367Z"},"content_sha256":"8d0846504fb770f8b5cfaf7f9d5a8760d4c53036672cbd4c602a727fa9b19626","schema_version":"1.0","event_id":"sha256:8d0846504fb770f8b5cfaf7f9d5a8760d4c53036672cbd4c602a727fa9b19626"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OAYI3IAF57HMKLBVN76IOXQ5D/bundle.json","state_url":"https://pith.science/pith/2OAYI3IAF57HMKLBVN76IOXQ5D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OAYI3IAF57HMKLBVN76IOXQ5D/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-24T11:39:17Z","links":{"resolver":"https://pith.science/pith/2OAYI3IAF57HMKLBVN76IOXQ5D","bundle":"https://pith.science/pith/2OAYI3IAF57HMKLBVN76IOXQ5D/bundle.json","state":"https://pith.science/pith/2OAYI3IAF57HMKLBVN76IOXQ5D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OAYI3IAF57HMKLBVN76IOXQ5D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2OAYI3IAF57HMKLBVN76IOXQ5D","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":"9fe55fde35ff08eb0c3d8b34437cd23a4574175bc3542324040c52f6d46fdce6","cross_cats_sorted":["cs.AI","cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-31T02:12:41Z","title_canon_sha256":"8921370de52e73960ed64d0161cb8acf014d6ede3cb96569facf894f181029f5"},"schema_version":"1.0","source":{"id":"1905.13382","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13382","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13382v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13382","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"2OAYI3IAF57H","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2OAYI3IAF57HMKLB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2OAYI3IA","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:8d0846504fb770f8b5cfaf7f9d5a8760d4c53036672cbd4c602a727fa9b19626","target":"graph","created_at":"2026-05-17T23:44:35Z","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":"Online hashing has attracted extensive research attention when facing streaming data. Most online hashing methods, learning binary codes based on pairwise similarities of training instances, fail to capture the semantic relationship, and suffer from a poor generalization in large-scale applications due to large variations. In this paper, we propose to model the similarity distributions between the input data and the hashing codes, upon which a novel supervised online hashing method, dubbed as Similarity Distribution based Online Hashing (SDOH), is proposed, to keep the intrinsic semantic relat","authors_text":"Baochang Zhang, Feiyue Huang, Feng Zheng, Guodong Guo, Liujuan Cao, Mingbao Lin, Rongrong Ji, Shen Chen, Xiaoshuai Sun","cross_cats":["cs.AI","cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-31T02:12:41Z","title":"Supervised Online Hashing via Similarity Distribution Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13382","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:829fb1d2700ab01b595af886ccfaf232a807f9a016200e85764cebf1f2c7d3d3","target":"record","created_at":"2026-05-17T23:44:35Z","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":"9fe55fde35ff08eb0c3d8b34437cd23a4574175bc3542324040c52f6d46fdce6","cross_cats_sorted":["cs.AI","cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-31T02:12:41Z","title_canon_sha256":"8921370de52e73960ed64d0161cb8acf014d6ede3cb96569facf894f181029f5"},"schema_version":"1.0","source":{"id":"1905.13382","kind":"arxiv","version":1}},"canonical_sha256":"d381846d002f7e762961ab7fe43af0e8cd1cd3c04fcc02ca00451b13f11980f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d381846d002f7e762961ab7fe43af0e8cd1cd3c04fcc02ca00451b13f11980f3","first_computed_at":"2026-05-17T23:44:35.089016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:35.089016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vaad92HWgFgACbsYFBWpCZTyYOzZRgkhdgG1EiNljfN2VvkLFnsBD6ZfUd/yQluC+HMYDP6oIaiPhyyyhBexAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:35.089688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13382","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:829fb1d2700ab01b595af886ccfaf232a807f9a016200e85764cebf1f2c7d3d3","sha256:8d0846504fb770f8b5cfaf7f9d5a8760d4c53036672cbd4c602a727fa9b19626"],"state_sha256":"56f6e1d7249d332fd69b7e942f29171e499f8e93c7134d19b4b888c4ee58cc40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WCHJIMNQfxBMuYLXnU42tGHxcJ+VAjwt2tm55UO/jopyyZALZYUHe/Soq1oTSEGGyV3Ro4HwOWgOxJ+/dR8bCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T11:39:17.838173Z","bundle_sha256":"a1e86bf4bdaecd1b527e769e5c0aa6b7a521d6ea371ff49d13b3bd601eb59227"}}