{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NGYFCR45A2T2ONBRA52QLRBWP4","short_pith_number":"pith:NGYFCR45","canonical_record":{"source":{"id":"1810.00644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-01T12:12:35Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"795326e4f912d913dc013a535b255e520381fb604e1192999657aa0afccdf49b","abstract_canon_sha256":"dcd625e9debdcc080bc303f735749a2051274451efd8c40322fb231beac3ac42"},"schema_version":"1.0"},"canonical_sha256":"69b051479d06a7a73431077505c4367f0b85e6770f10dadf1b3818bea4e9e42e","source":{"kind":"arxiv","id":"1810.00644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00644","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00644v1","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00644","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"NGYFCR45A2T2","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGYFCR45A2T2ONBR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGYFCR45","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NGYFCR45A2T2ONBRA52QLRBWP4","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-01T12:12:35Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"795326e4f912d913dc013a535b255e520381fb604e1192999657aa0afccdf49b","abstract_canon_sha256":"dcd625e9debdcc080bc303f735749a2051274451efd8c40322fb231beac3ac42"},"schema_version":"1.0"},"canonical_sha256":"69b051479d06a7a73431077505c4367f0b85e6770f10dadf1b3818bea4e9e42e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:25.229367Z","signature_b64":"OiFoYEWG/JwDG18X88gBCCkg/+s1tKW+bCBWeLBZeelSbIIDtRLx4dlvkd7yfJAViHKchNoLDXVWwifLntb9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69b051479d06a7a73431077505c4367f0b85e6770f10dadf1b3818bea4e9e42e","last_reissued_at":"2026-05-18T00:04:25.228941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:25.228941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00644","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-18T00:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4macc7xkkoGd5RL0dZzJ2xh4nQXICDcDreMi18pgl+gSb9I/4107uCdzqso2nPrjsLCrtN7YRzFdtoJQLuuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:21:15.291150Z"},"content_sha256":"7b2bfd2760d4149c71e7386f9562850e90a359ef58c083ff230db945de8648af","schema_version":"1.0","event_id":"sha256:7b2bfd2760d4149c71e7386f9562850e90a359ef58c083ff230db945de8648af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NGYFCR45A2T2ONBRA52QLRBWP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fusion Hashing: A General Framework for Self-improvement of Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.DS","authors_text":"Xingbo Liu, Xiushan Nie, Yilong Yin","submitted_at":"2018-10-01T12:12:35Z","abstract_excerpt":"Hashing has been widely used for efficient similarity search based on its query and storage efficiency. To obtain better precision, most studies focus on designing different objective functions with different constraints or penalty terms that consider neighborhood information. In this paper, in contrast to existing hashing methods, we propose a novel generalized framework called fusion hashing (FH) to improve the precision of existing hashing methods without adding new constraints or penalty terms. In the proposed FH, given an existing hashing method, we first execute it several times to get s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00644","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-18T00:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cp0WMXOuGvyxBXJj18rLH9FkqtV+yEASs9eZvSP26MsVa7FABIFg7MxutkAslFXFsL9UOG5GDUgbtoaBMtElDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:21:15.291724Z"},"content_sha256":"974d0697049942859e974603f40a9b09712a0a5ff3786815100b450d372d4c0a","schema_version":"1.0","event_id":"sha256:974d0697049942859e974603f40a9b09712a0a5ff3786815100b450d372d4c0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGYFCR45A2T2ONBRA52QLRBWP4/bundle.json","state_url":"https://pith.science/pith/NGYFCR45A2T2ONBRA52QLRBWP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGYFCR45A2T2ONBRA52QLRBWP4/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-07T06:21:15Z","links":{"resolver":"https://pith.science/pith/NGYFCR45A2T2ONBRA52QLRBWP4","bundle":"https://pith.science/pith/NGYFCR45A2T2ONBRA52QLRBWP4/bundle.json","state":"https://pith.science/pith/NGYFCR45A2T2ONBRA52QLRBWP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGYFCR45A2T2ONBRA52QLRBWP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NGYFCR45A2T2ONBRA52QLRBWP4","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":"dcd625e9debdcc080bc303f735749a2051274451efd8c40322fb231beac3ac42","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-01T12:12:35Z","title_canon_sha256":"795326e4f912d913dc013a535b255e520381fb604e1192999657aa0afccdf49b"},"schema_version":"1.0","source":{"id":"1810.00644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00644","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00644v1","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00644","created_at":"2026-05-18T00:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"NGYFCR45A2T2","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NGYFCR45A2T2ONBR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NGYFCR45","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:974d0697049942859e974603f40a9b09712a0a5ff3786815100b450d372d4c0a","target":"graph","created_at":"2026-05-18T00:04:25Z","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":"Hashing has been widely used for efficient similarity search based on its query and storage efficiency. To obtain better precision, most studies focus on designing different objective functions with different constraints or penalty terms that consider neighborhood information. In this paper, in contrast to existing hashing methods, we propose a novel generalized framework called fusion hashing (FH) to improve the precision of existing hashing methods without adding new constraints or penalty terms. In the proposed FH, given an existing hashing method, we first execute it several times to get s","authors_text":"Xingbo Liu, Xiushan Nie, Yilong Yin","cross_cats":["cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-01T12:12:35Z","title":"Fusion Hashing: A General Framework for Self-improvement of Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00644","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:7b2bfd2760d4149c71e7386f9562850e90a359ef58c083ff230db945de8648af","target":"record","created_at":"2026-05-18T00:04:25Z","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":"dcd625e9debdcc080bc303f735749a2051274451efd8c40322fb231beac3ac42","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-01T12:12:35Z","title_canon_sha256":"795326e4f912d913dc013a535b255e520381fb604e1192999657aa0afccdf49b"},"schema_version":"1.0","source":{"id":"1810.00644","kind":"arxiv","version":1}},"canonical_sha256":"69b051479d06a7a73431077505c4367f0b85e6770f10dadf1b3818bea4e9e42e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69b051479d06a7a73431077505c4367f0b85e6770f10dadf1b3818bea4e9e42e","first_computed_at":"2026-05-18T00:04:25.228941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:25.228941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OiFoYEWG/JwDG18X88gBCCkg/+s1tKW+bCBWeLBZeelSbIIDtRLx4dlvkd7yfJAViHKchNoLDXVWwifLntb9DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:25.229367Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b2bfd2760d4149c71e7386f9562850e90a359ef58c083ff230db945de8648af","sha256:974d0697049942859e974603f40a9b09712a0a5ff3786815100b450d372d4c0a"],"state_sha256":"23721728b20bd03643ccd6351fdfc6f8258549b1b91ecb975f75d7d32e583892"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pRf/PpJ070zZjKoxgFp57sExeAmjanpn2INCt6euskjaNkoXBQFR7tw0TKC7IJMNL6mAt7eqEYej4DRLn6aMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:21:15.296628Z","bundle_sha256":"f1d7dcb03b20931f4e33e437a0b7eee3f453c426471e7c8a3e15c5437a6cde9f"}}