{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:R3OTTDFLXKX4U5YYDRD2KMDMHR","short_pith_number":"pith:R3OTTDFL","canonical_record":{"source":{"id":"2103.14455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2021-03-26T13:22:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"20f029bebb7bd410dba19eb302008a1c32ad10758513b119d5eb616323e16e6a","abstract_canon_sha256":"1e311b54c3138ce12d59aec86c92b97ed61d1e260cdf42327d0565bc81d21ab0"},"schema_version":"1.0"},"canonical_sha256":"8edd398cabbaafca77181c47a5306c3c67c87a4d91f43d27b19b9312ff7c0478","source":{"kind":"arxiv","id":"2103.14455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.14455","created_at":"2026-07-05T02:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"2103.14455v1","created_at":"2026-07-05T02:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.14455","created_at":"2026-07-05T02:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"R3OTTDFLXKX4","created_at":"2026-07-05T02:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"R3OTTDFLXKX4U5YY","created_at":"2026-07-05T02:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"R3OTTDFL","created_at":"2026-07-05T02:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:R3OTTDFLXKX4U5YYDRD2KMDMHR","target":"record","payload":{"canonical_record":{"source":{"id":"2103.14455","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2021-03-26T13:22:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"20f029bebb7bd410dba19eb302008a1c32ad10758513b119d5eb616323e16e6a","abstract_canon_sha256":"1e311b54c3138ce12d59aec86c92b97ed61d1e260cdf42327d0565bc81d21ab0"},"schema_version":"1.0"},"canonical_sha256":"8edd398cabbaafca77181c47a5306c3c67c87a4d91f43d27b19b9312ff7c0478","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:41.131336Z","signature_b64":"djFfrlBZZWhHbYifJpWdqkEDcMN9xvCPwoZDec0ACkXuE2KMKdna/LZELcljgHGlk00E1kZGzeF2vDG41mU8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8edd398cabbaafca77181c47a5306c3c67c87a4d91f43d27b19b9312ff7c0478","last_reissued_at":"2026-07-05T02:26:41.130931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:41.130931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.14455","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-07-05T02:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5s/w0JROU0dWvWQAHZXHBFGIBY7D2d0/OjlAm206vSoDVnS9H933BjXla87l1FP5FBSQ7qQCNsppnFfJsSVqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:51:09.394804Z"},"content_sha256":"ca7fd8f984e14e9729b7e7b9fce89c3f8e43b8a4df5dc0ea04e48a9b13aff478","schema_version":"1.0","event_id":"sha256:ca7fd8f984e14e9729b7e7b9fce89c3f8e43b8a4df5dc0ea04e48a9b13aff478"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:R3OTTDFLXKX4U5YYDRD2KMDMHR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Projected Hamming Dissimilarity for Bit-Level Importance Coding in Collaborative Filtering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Casper Hansen, Christian Hansen, Christina Lioma, Jakob Grue Simonsen","submitted_at":"2021-03-26T13:22:31Z","abstract_excerpt":"When reasoning about tasks that involve large amounts of data, a common approach is to represent data items as objects in the Hamming space where operations can be done efficiently and effectively. Object similarity can then be computed by learning binary representations (hash codes) of the objects and computing their Hamming distance. While this is highly efficient, each bit dimension is equally weighted, which means that potentially discriminative information of the data is lost. A more expressive alternative is to use real-valued vector representations and compute their inner product; this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.14455","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.14455/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-05T02:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFNLQir5GzswWboBVg24PSwe2tHg2hm9xLrrDHXLgCml1ZEZhg2lpDNbBFcVThSlut/YPYNyYcyioMWrJ/nhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:51:09.395178Z"},"content_sha256":"66e013bafb5790ba6b5d9f6ce162768b1b23e7cc8864b0b9bc53c8c0189f638c","schema_version":"1.0","event_id":"sha256:66e013bafb5790ba6b5d9f6ce162768b1b23e7cc8864b0b9bc53c8c0189f638c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3OTTDFLXKX4U5YYDRD2KMDMHR/bundle.json","state_url":"https://pith.science/pith/R3OTTDFLXKX4U5YYDRD2KMDMHR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3OTTDFLXKX4U5YYDRD2KMDMHR/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-06T20:51:09Z","links":{"resolver":"https://pith.science/pith/R3OTTDFLXKX4U5YYDRD2KMDMHR","bundle":"https://pith.science/pith/R3OTTDFLXKX4U5YYDRD2KMDMHR/bundle.json","state":"https://pith.science/pith/R3OTTDFLXKX4U5YYDRD2KMDMHR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3OTTDFLXKX4U5YYDRD2KMDMHR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:R3OTTDFLXKX4U5YYDRD2KMDMHR","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":"1e311b54c3138ce12d59aec86c92b97ed61d1e260cdf42327d0565bc81d21ab0","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2021-03-26T13:22:31Z","title_canon_sha256":"20f029bebb7bd410dba19eb302008a1c32ad10758513b119d5eb616323e16e6a"},"schema_version":"1.0","source":{"id":"2103.14455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.14455","created_at":"2026-07-05T02:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"2103.14455v1","created_at":"2026-07-05T02:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.14455","created_at":"2026-07-05T02:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"R3OTTDFLXKX4","created_at":"2026-07-05T02:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"R3OTTDFLXKX4U5YY","created_at":"2026-07-05T02:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"R3OTTDFL","created_at":"2026-07-05T02:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:66e013bafb5790ba6b5d9f6ce162768b1b23e7cc8864b0b9bc53c8c0189f638c","target":"graph","created_at":"2026-07-05T02:26:41Z","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/2103.14455/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"When reasoning about tasks that involve large amounts of data, a common approach is to represent data items as objects in the Hamming space where operations can be done efficiently and effectively. Object similarity can then be computed by learning binary representations (hash codes) of the objects and computing their Hamming distance. While this is highly efficient, each bit dimension is equally weighted, which means that potentially discriminative information of the data is lost. A more expressive alternative is to use real-valued vector representations and compute their inner product; this ","authors_text":"Casper Hansen, Christian Hansen, Christina Lioma, Jakob Grue Simonsen","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2021-03-26T13:22:31Z","title":"Projected Hamming Dissimilarity for Bit-Level Importance Coding in Collaborative Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.14455","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:ca7fd8f984e14e9729b7e7b9fce89c3f8e43b8a4df5dc0ea04e48a9b13aff478","target":"record","created_at":"2026-07-05T02:26:41Z","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":"1e311b54c3138ce12d59aec86c92b97ed61d1e260cdf42327d0565bc81d21ab0","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2021-03-26T13:22:31Z","title_canon_sha256":"20f029bebb7bd410dba19eb302008a1c32ad10758513b119d5eb616323e16e6a"},"schema_version":"1.0","source":{"id":"2103.14455","kind":"arxiv","version":1}},"canonical_sha256":"8edd398cabbaafca77181c47a5306c3c67c87a4d91f43d27b19b9312ff7c0478","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8edd398cabbaafca77181c47a5306c3c67c87a4d91f43d27b19b9312ff7c0478","first_computed_at":"2026-07-05T02:26:41.130931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:26:41.130931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"djFfrlBZZWhHbYifJpWdqkEDcMN9xvCPwoZDec0ACkXuE2KMKdna/LZELcljgHGlk00E1kZGzeF2vDG41mU8Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:26:41.131336Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.14455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca7fd8f984e14e9729b7e7b9fce89c3f8e43b8a4df5dc0ea04e48a9b13aff478","sha256:66e013bafb5790ba6b5d9f6ce162768b1b23e7cc8864b0b9bc53c8c0189f638c"],"state_sha256":"ac5605b4e6a7c2e3283779297a93af42d098bdda11858ef7cd0d04d70af5b769"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxARwfVd0BW3y3ES+rWDl9oZ5LHJ8LBCqB96OTvyQlZF8vCliWgDQJP0BFcbRDKSLVCNgmrWwURwd3L9gCCKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:51:09.397158Z","bundle_sha256":"f247a0ce519b58fc2fcf85064f5d82499ea6621966a1070be5fbc0e963b95baa"}}