{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YZW5NCD7CVUMEZOBZXJGZJ5P3J","short_pith_number":"pith:YZW5NCD7","canonical_record":{"source":{"id":"1809.09329","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2018-09-25T05:46:36Z","cross_cats_sorted":[],"title_canon_sha256":"376b782b7c5aa68912000f006adaa85ce499c02c2801ba1df1c9f11b2633ed8d","abstract_canon_sha256":"3cfb1a1a392a27579aabcc388fe9cde01961f08165ab6cada7ae608926546d06"},"schema_version":"1.0"},"canonical_sha256":"c66dd6887f1568c265c1cdd26ca7afda7308b30267a3ecdb9c60f9446c03c6ea","source":{"kind":"arxiv","id":"1809.09329","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09329","created_at":"2026-07-05T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09329v3","created_at":"2026-07-05T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09329","created_at":"2026-07-05T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"YZW5NCD7CVUM","created_at":"2026-07-05T00:40:11Z"},{"alias_kind":"pith_short_16","alias_value":"YZW5NCD7CVUMEZOB","created_at":"2026-07-05T00:40:11Z"},{"alias_kind":"pith_short_8","alias_value":"YZW5NCD7","created_at":"2026-07-05T00:40:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YZW5NCD7CVUMEZOBZXJGZJ5P3J","target":"record","payload":{"canonical_record":{"source":{"id":"1809.09329","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2018-09-25T05:46:36Z","cross_cats_sorted":[],"title_canon_sha256":"376b782b7c5aa68912000f006adaa85ce499c02c2801ba1df1c9f11b2633ed8d","abstract_canon_sha256":"3cfb1a1a392a27579aabcc388fe9cde01961f08165ab6cada7ae608926546d06"},"schema_version":"1.0"},"canonical_sha256":"c66dd6887f1568c265c1cdd26ca7afda7308b30267a3ecdb9c60f9446c03c6ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:11.640275Z","signature_b64":"QI+6bpid+75/EFly0944QBIOcQn3kqBqAZBa2daKL/ep+bekcyyYcDONkMIZBvNKV2VKf0JVXQITv1MF99xeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c66dd6887f1568c265c1cdd26ca7afda7308b30267a3ecdb9c60f9446c03c6ea","last_reissued_at":"2026-07-05T00:40:11.639859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:11.639859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.09329","source_version":3,"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-07-05T00:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wj/4bnfSkKDST1gTGjvBW9g3z3IT9WAooJ8B5D48xwkgLL9Xn1Opmpma15RFdtop9VhgGISwM52RWcwNbeQNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:35:19.748230Z"},"content_sha256":"4d95ed5afbecf74ff06f09b96b5ab272b73ba0c5ca057d89bc6a2b7786d2d8e6","schema_version":"1.0","event_id":"sha256:4d95ed5afbecf74ff06f09b96b5ab272b73ba0c5ca057d89bc6a2b7786d2d8e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YZW5NCD7CVUMEZOBZXJGZJ5P3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collaborative Learning for Extremely Low Bit Asymmetric Hashing","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Fumin Shen, Peng Cui, Yadan Luo, Yang Li, Yang Yang, Zi Huang","submitted_at":"2018-09-25T05:46:36Z","abstract_excerpt":"Hashing techniques are in great demand for a wide range of real-world applications such as image retrieval and network compression. Nevertheless, existing approaches could hardly guarantee a satisfactory performance with the extremely low-bit (e.g., 4-bit) hash codes due to the severe information loss and the shrink of the discrete solution space. In this paper, we propose a novel \\textit{Collaborative Learning} strategy that is tailored for generating high-quality low-bit hash codes. The core idea is to jointly distill bit-specific and informative representations for a group of pre-defined co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09329","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1809.09329/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMwcGiUQ5bZWvTwqZtoSGB9hHT3ZX8uYcWcD0SihL2wAxU1URrh7Cg2k+HZaqyLTiJE9Ay5qQ/a9J59nxLXRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T08:35:19.748617Z"},"content_sha256":"a20bb996343db5b801a592ce94e5c0cd9ec0bc6efd10d572572be388f2e09392","schema_version":"1.0","event_id":"sha256:a20bb996343db5b801a592ce94e5c0cd9ec0bc6efd10d572572be388f2e09392"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZW5NCD7CVUMEZOBZXJGZJ5P3J/bundle.json","state_url":"https://pith.science/pith/YZW5NCD7CVUMEZOBZXJGZJ5P3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZW5NCD7CVUMEZOBZXJGZJ5P3J/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-07-05T08:35:19Z","links":{"resolver":"https://pith.science/pith/YZW5NCD7CVUMEZOBZXJGZJ5P3J","bundle":"https://pith.science/pith/YZW5NCD7CVUMEZOBZXJGZJ5P3J/bundle.json","state":"https://pith.science/pith/YZW5NCD7CVUMEZOBZXJGZJ5P3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZW5NCD7CVUMEZOBZXJGZJ5P3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YZW5NCD7CVUMEZOBZXJGZJ5P3J","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":"3cfb1a1a392a27579aabcc388fe9cde01961f08165ab6cada7ae608926546d06","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2018-09-25T05:46:36Z","title_canon_sha256":"376b782b7c5aa68912000f006adaa85ce499c02c2801ba1df1c9f11b2633ed8d"},"schema_version":"1.0","source":{"id":"1809.09329","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.09329","created_at":"2026-07-05T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1809.09329v3","created_at":"2026-07-05T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09329","created_at":"2026-07-05T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"YZW5NCD7CVUM","created_at":"2026-07-05T00:40:11Z"},{"alias_kind":"pith_short_16","alias_value":"YZW5NCD7CVUMEZOB","created_at":"2026-07-05T00:40:11Z"},{"alias_kind":"pith_short_8","alias_value":"YZW5NCD7","created_at":"2026-07-05T00:40:11Z"}],"graph_snapshots":[{"event_id":"sha256:a20bb996343db5b801a592ce94e5c0cd9ec0bc6efd10d572572be388f2e09392","target":"graph","created_at":"2026-07-05T00:40:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1809.09329/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hashing techniques are in great demand for a wide range of real-world applications such as image retrieval and network compression. Nevertheless, existing approaches could hardly guarantee a satisfactory performance with the extremely low-bit (e.g., 4-bit) hash codes due to the severe information loss and the shrink of the discrete solution space. In this paper, we propose a novel \\textit{Collaborative Learning} strategy that is tailored for generating high-quality low-bit hash codes. The core idea is to jointly distill bit-specific and informative representations for a group of pre-defined co","authors_text":"Fumin Shen, Peng Cui, Yadan Luo, Yang Li, Yang Yang, Zi Huang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2018-09-25T05:46:36Z","title":"Collaborative Learning for Extremely Low Bit Asymmetric Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09329","kind":"arxiv","version":3},"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:4d95ed5afbecf74ff06f09b96b5ab272b73ba0c5ca057d89bc6a2b7786d2d8e6","target":"record","created_at":"2026-07-05T00:40:11Z","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":"3cfb1a1a392a27579aabcc388fe9cde01961f08165ab6cada7ae608926546d06","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IR","submitted_at":"2018-09-25T05:46:36Z","title_canon_sha256":"376b782b7c5aa68912000f006adaa85ce499c02c2801ba1df1c9f11b2633ed8d"},"schema_version":"1.0","source":{"id":"1809.09329","kind":"arxiv","version":3}},"canonical_sha256":"c66dd6887f1568c265c1cdd26ca7afda7308b30267a3ecdb9c60f9446c03c6ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c66dd6887f1568c265c1cdd26ca7afda7308b30267a3ecdb9c60f9446c03c6ea","first_computed_at":"2026-07-05T00:40:11.639859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:40:11.639859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QI+6bpid+75/EFly0944QBIOcQn3kqBqAZBa2daKL/ep+bekcyyYcDONkMIZBvNKV2VKf0JVXQITv1MF99xeBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:40:11.640275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.09329","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d95ed5afbecf74ff06f09b96b5ab272b73ba0c5ca057d89bc6a2b7786d2d8e6","sha256:a20bb996343db5b801a592ce94e5c0cd9ec0bc6efd10d572572be388f2e09392"],"state_sha256":"a7c34c5127486e1205c12d0a72c6888e2f6899746a850640e228c65c3b804c40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NT6C2FAPz10FQvcWuZTyrm+PWqkaA468AFDHQLWdIY7mSouJ3LhdGHmmqoFMg70ti4UNOzHqmQbSUuzHYdp2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T08:35:19.750629Z","bundle_sha256":"f2c6e3f05ea1908caf463b324bb0904785a6898a599bf537fd25982a5d15c9de"}}