{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SWPK3CZLQA355EEMVXSE4EBSAO","short_pith_number":"pith:SWPK3CZL","canonical_record":{"source":{"id":"1902.03876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T13:55:48Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"e1d8244bfdd38af3223f302bf0d3ec3e89d025d70846c5e8eb75419009606a1e","abstract_canon_sha256":"033a6fe9c2855d10ac56b406239481455c0adbbc20de6e665274f6d6dd017465"},"schema_version":"1.0"},"canonical_sha256":"959ead8b2b8037de908cade44e103203a6828fd3a6c758b004ea49255e53aee1","source":{"kind":"arxiv","id":"1902.03876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03876","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03876v1","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03876","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"pith_short_12","alias_value":"SWPK3CZLQA35","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SWPK3CZLQA355EEM","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SWPK3CZL","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SWPK3CZLQA355EEMVXSE4EBSAO","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T13:55:48Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"e1d8244bfdd38af3223f302bf0d3ec3e89d025d70846c5e8eb75419009606a1e","abstract_canon_sha256":"033a6fe9c2855d10ac56b406239481455c0adbbc20de6e665274f6d6dd017465"},"schema_version":"1.0"},"canonical_sha256":"959ead8b2b8037de908cade44e103203a6828fd3a6c758b004ea49255e53aee1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:17.661059Z","signature_b64":"x1JnXNxUwUrQ+qPsDMjjhuaC3+RlHD/uK+PBif6VDdwWTDIbGKrkNXSw0pYQo/cjF8QBQjE4L8q0PqqAdoz2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"959ead8b2b8037de908cade44e103203a6828fd3a6c758b004ea49255e53aee1","last_reissued_at":"2026-05-17T23:54:17.660528Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:17.660528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03876","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:54:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uu8AyD2BWtOHKnas37HT+jVbPN064b8o29aN355ga3gsAdEDZQ/5q2qIHtt0FyixQe6u3Qc/U/LpAvCzPkjkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:03:45.290754Z"},"content_sha256":"c263f327b02b27d3050fc94c4fb64dd2784204fab621f45024a4cc5d05c445ce","schema_version":"1.0","event_id":"sha256:c263f327b02b27d3050fc94c4fb64dd2784204fab621f45024a4cc5d05c445ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SWPK3CZLQA355EEMVXSE4EBSAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Hashing using Entropy Regularised Product Quantisation Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andy Aitken, Joost van Amersfoort, Jo Schlemper, Jose Caballero","submitted_at":"2019-02-11T13:55:48Z","abstract_excerpt":"In large scale systems, approximate nearest neighbour search is a crucial algorithm to enable efficient data retrievals. Recently, deep learning-based hashing algorithms have been proposed as a promising paradigm to enable data dependent schemes. Often their efficacy is only demonstrated on data sets with fixed, limited numbers of classes. In practical scenarios, those labels are not always available or one requires a method that can handle a higher input variability, as well as a higher granularity. To fulfil those requirements, we look at more flexible similarity measures. In this work, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03876","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:54:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgWic8jq8sjpnSxs2zbhppIAFlchkoqZ8Nuj81kmk+0vz3HkMloW7T3gOY2H/oFWtplPsd2xLtOVi2M++Y/SBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:03:45.291367Z"},"content_sha256":"ead847c1783744dbf37942fccf3e0251923f3800dca8ebfbf4da4e0f429fbc02","schema_version":"1.0","event_id":"sha256:ead847c1783744dbf37942fccf3e0251923f3800dca8ebfbf4da4e0f429fbc02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWPK3CZLQA355EEMVXSE4EBSAO/bundle.json","state_url":"https://pith.science/pith/SWPK3CZLQA355EEMVXSE4EBSAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWPK3CZLQA355EEMVXSE4EBSAO/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-06-04T05:03:45Z","links":{"resolver":"https://pith.science/pith/SWPK3CZLQA355EEMVXSE4EBSAO","bundle":"https://pith.science/pith/SWPK3CZLQA355EEMVXSE4EBSAO/bundle.json","state":"https://pith.science/pith/SWPK3CZLQA355EEMVXSE4EBSAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWPK3CZLQA355EEMVXSE4EBSAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SWPK3CZLQA355EEMVXSE4EBSAO","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":"033a6fe9c2855d10ac56b406239481455c0adbbc20de6e665274f6d6dd017465","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T13:55:48Z","title_canon_sha256":"e1d8244bfdd38af3223f302bf0d3ec3e89d025d70846c5e8eb75419009606a1e"},"schema_version":"1.0","source":{"id":"1902.03876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03876","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03876v1","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03876","created_at":"2026-05-17T23:54:17Z"},{"alias_kind":"pith_short_12","alias_value":"SWPK3CZLQA35","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SWPK3CZLQA355EEM","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SWPK3CZL","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:ead847c1783744dbf37942fccf3e0251923f3800dca8ebfbf4da4e0f429fbc02","target":"graph","created_at":"2026-05-17T23:54:17Z","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":"In large scale systems, approximate nearest neighbour search is a crucial algorithm to enable efficient data retrievals. Recently, deep learning-based hashing algorithms have been proposed as a promising paradigm to enable data dependent schemes. Often their efficacy is only demonstrated on data sets with fixed, limited numbers of classes. In practical scenarios, those labels are not always available or one requires a method that can handle a higher input variability, as well as a higher granularity. To fulfil those requirements, we look at more flexible similarity measures. In this work, we p","authors_text":"Andy Aitken, Joost van Amersfoort, Jo Schlemper, Jose Caballero","cross_cats":["cs.IR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T13:55:48Z","title":"Deep Hashing using Entropy Regularised Product Quantisation Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03876","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:c263f327b02b27d3050fc94c4fb64dd2784204fab621f45024a4cc5d05c445ce","target":"record","created_at":"2026-05-17T23:54:17Z","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":"033a6fe9c2855d10ac56b406239481455c0adbbc20de6e665274f6d6dd017465","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T13:55:48Z","title_canon_sha256":"e1d8244bfdd38af3223f302bf0d3ec3e89d025d70846c5e8eb75419009606a1e"},"schema_version":"1.0","source":{"id":"1902.03876","kind":"arxiv","version":1}},"canonical_sha256":"959ead8b2b8037de908cade44e103203a6828fd3a6c758b004ea49255e53aee1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"959ead8b2b8037de908cade44e103203a6828fd3a6c758b004ea49255e53aee1","first_computed_at":"2026-05-17T23:54:17.660528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:17.660528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x1JnXNxUwUrQ+qPsDMjjhuaC3+RlHD/uK+PBif6VDdwWTDIbGKrkNXSw0pYQo/cjF8QBQjE4L8q0PqqAdoz2Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:17.661059Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c263f327b02b27d3050fc94c4fb64dd2784204fab621f45024a4cc5d05c445ce","sha256:ead847c1783744dbf37942fccf3e0251923f3800dca8ebfbf4da4e0f429fbc02"],"state_sha256":"7f6561c1f279ad539e1d0e08d39d0517f05e5d5c44c021a3f456213cbd375c18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CbUsDHAw7mmj5pYjSeeYMrdGAjzRRt1mf3DVLMGL9tQYu7Y0BU6EQQ6kgAOsa5c9NKPMbhhWPPw5xuraXgKkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:03:45.293745Z","bundle_sha256":"9521f6b96498519806a25cb760e3e4d2e331c460f559a85c87613d542c63f8bc"}}