{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6JWKOL25ZPRU45Q4KBKSUUFOO3","short_pith_number":"pith:6JWKOL25","canonical_record":{"source":{"id":"1805.05809","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-15T14:32:31Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"3b7c39160da3ad8b187cb5cd57d71cd632096c63b6a2df0748fd06624d296f0d","abstract_canon_sha256":"6957c3abadd29b037403bd8a0c51871a8fb49face499a2a4a2e7925e1da13b88"},"schema_version":"1.0"},"canonical_sha256":"f26ca72f5dcbe34e761c50552a50ae76d40db42bddac4c4c3a544fefeb391263","source":{"kind":"arxiv","id":"1805.05809","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05809","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05809v3","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05809","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"pith_short_12","alias_value":"6JWKOL25ZPRU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6JWKOL25ZPRU45Q4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6JWKOL25","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6JWKOL25ZPRU45Q4KBKSUUFOO3","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05809","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-15T14:32:31Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"3b7c39160da3ad8b187cb5cd57d71cd632096c63b6a2df0748fd06624d296f0d","abstract_canon_sha256":"6957c3abadd29b037403bd8a0c51871a8fb49face499a2a4a2e7925e1da13b88"},"schema_version":"1.0"},"canonical_sha256":"f26ca72f5dcbe34e761c50552a50ae76d40db42bddac4c4c3a544fefeb391263","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:36.782704Z","signature_b64":"hzcqO5shlQKjslVsRrw8uqQqGgvSupzGz/MSgxWHKJRDyXJZcBxMkEYsVBGCSPeTaOKiFnu0vN7/rQJGLExSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f26ca72f5dcbe34e761c50552a50ae76d40db42bddac4c4c3a544fefeb391263","last_reissued_at":"2026-05-18T00:13:36.782052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:36.782052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05809","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-05-18T00:13:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPt6O7yGtReUfvBIS8mL0SKKi1p7Opu6rInaknTonnqH+hdFhnkiqXphrDvXmtuMC/wwVBMlqqR7OuNbCjkPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:42:10.418922Z"},"content_sha256":"3ba795a2eb09cec88e9379a4cb29ff27555352a5eef0d77203ac77d8546bc35d","schema_version":"1.0","event_id":"sha256:3ba795a2eb09cec88e9379a4cb29ff27555352a5eef0d77203ac77d8546bc35d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6JWKOL25ZPRU45Q4KBKSUUFOO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient end-to-end learning for quantizable representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hyun Oh Song, Yeonwoo Jeong","submitted_at":"2018-05-15T14:32:31Z","abstract_excerpt":"Embedding representation learning via neural networks is at the core foundation of modern similarity based search. While much effort has been put in developing algorithms for learning binary hamming code representations for search efficiency, this still requires a linear scan of the entire dataset per each query and trades off the search accuracy through binarization. To this end, we consider the problem of directly learning a quantizable embedding representation and the sparse binary hash code end-to-end which can be used to construct an efficient hash table not only providing significant sea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05809","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":""},"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:13:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44emSdif5m0o4OTKCfZc7M+YDIu89/9FYSNlDixTefavjligmExLcDiOkq9SHXUGWqDl3SnhwELaY8JfgdPKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:42:10.419659Z"},"content_sha256":"23636f154d0deb0aa2785cf8cf379af3100770072c7ed1a12aa6ac13fc189d96","schema_version":"1.0","event_id":"sha256:23636f154d0deb0aa2785cf8cf379af3100770072c7ed1a12aa6ac13fc189d96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JWKOL25ZPRU45Q4KBKSUUFOO3/bundle.json","state_url":"https://pith.science/pith/6JWKOL25ZPRU45Q4KBKSUUFOO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JWKOL25ZPRU45Q4KBKSUUFOO3/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-31T09:42:10Z","links":{"resolver":"https://pith.science/pith/6JWKOL25ZPRU45Q4KBKSUUFOO3","bundle":"https://pith.science/pith/6JWKOL25ZPRU45Q4KBKSUUFOO3/bundle.json","state":"https://pith.science/pith/6JWKOL25ZPRU45Q4KBKSUUFOO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JWKOL25ZPRU45Q4KBKSUUFOO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6JWKOL25ZPRU45Q4KBKSUUFOO3","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":"6957c3abadd29b037403bd8a0c51871a8fb49face499a2a4a2e7925e1da13b88","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-15T14:32:31Z","title_canon_sha256":"3b7c39160da3ad8b187cb5cd57d71cd632096c63b6a2df0748fd06624d296f0d"},"schema_version":"1.0","source":{"id":"1805.05809","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05809","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05809v3","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05809","created_at":"2026-05-18T00:13:36Z"},{"alias_kind":"pith_short_12","alias_value":"6JWKOL25ZPRU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6JWKOL25ZPRU45Q4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6JWKOL25","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:23636f154d0deb0aa2785cf8cf379af3100770072c7ed1a12aa6ac13fc189d96","target":"graph","created_at":"2026-05-18T00:13:36Z","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":"Embedding representation learning via neural networks is at the core foundation of modern similarity based search. While much effort has been put in developing algorithms for learning binary hamming code representations for search efficiency, this still requires a linear scan of the entire dataset per each query and trades off the search accuracy through binarization. To this end, we consider the problem of directly learning a quantizable embedding representation and the sparse binary hash code end-to-end which can be used to construct an efficient hash table not only providing significant sea","authors_text":"Hyun Oh Song, Yeonwoo Jeong","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-15T14:32:31Z","title":"Efficient end-to-end learning for quantizable representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05809","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:3ba795a2eb09cec88e9379a4cb29ff27555352a5eef0d77203ac77d8546bc35d","target":"record","created_at":"2026-05-18T00:13:36Z","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":"6957c3abadd29b037403bd8a0c51871a8fb49face499a2a4a2e7925e1da13b88","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-15T14:32:31Z","title_canon_sha256":"3b7c39160da3ad8b187cb5cd57d71cd632096c63b6a2df0748fd06624d296f0d"},"schema_version":"1.0","source":{"id":"1805.05809","kind":"arxiv","version":3}},"canonical_sha256":"f26ca72f5dcbe34e761c50552a50ae76d40db42bddac4c4c3a544fefeb391263","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f26ca72f5dcbe34e761c50552a50ae76d40db42bddac4c4c3a544fefeb391263","first_computed_at":"2026-05-18T00:13:36.782052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:36.782052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hzcqO5shlQKjslVsRrw8uqQqGgvSupzGz/MSgxWHKJRDyXJZcBxMkEYsVBGCSPeTaOKiFnu0vN7/rQJGLExSAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:36.782704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05809","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ba795a2eb09cec88e9379a4cb29ff27555352a5eef0d77203ac77d8546bc35d","sha256:23636f154d0deb0aa2785cf8cf379af3100770072c7ed1a12aa6ac13fc189d96"],"state_sha256":"c06a852f7d0d08292c005f341e57e1b4a026145e442e11acca96c18c7628e676"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rIXGcdczoRRH0CgIKw9ra8jeOi1rb9kacf61y41I5TvbV9dCzQJpuUeXh4pJE0vYEuARWH29plPcfhqnGgbYCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:42:10.423048Z","bundle_sha256":"608b44af9ceef3375dcefaf1e6554e04ebc6378e617ec1263906bed28b3d55e3"}}