{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GFVLOTDKH2JYQLMMS3RXRA7R2S","short_pith_number":"pith:GFVLOTDK","canonical_record":{"source":{"id":"1303.4169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-18T07:14:15Z","cross_cats_sorted":[],"title_canon_sha256":"7ac49049115c13f84e13588fe7bbd9b57b1cd3c8cb8595f644f11edb373e787e","abstract_canon_sha256":"d34f08a9234664d1fe9cd5d771e845208cda85a5a771b1b634684092ae72297a"},"schema_version":"1.0"},"canonical_sha256":"316ab74c6a3e93882d8c96e37883f1d4a62e872e6ddd8c9c4681b5bd008d99e2","source":{"kind":"arxiv","id":"1303.4169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4169","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4169v1","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4169","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"GFVLOTDKH2JY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GFVLOTDKH2JYQLMM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GFVLOTDK","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GFVLOTDKH2JYQLMMS3RXRA7R2S","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-18T07:14:15Z","cross_cats_sorted":[],"title_canon_sha256":"7ac49049115c13f84e13588fe7bbd9b57b1cd3c8cb8595f644f11edb373e787e","abstract_canon_sha256":"d34f08a9234664d1fe9cd5d771e845208cda85a5a771b1b634684092ae72297a"},"schema_version":"1.0"},"canonical_sha256":"316ab74c6a3e93882d8c96e37883f1d4a62e872e6ddd8c9c4681b5bd008d99e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:39.579248Z","signature_b64":"MP/kVcQFAhrZrtLpCVpY4EU26TKTyOsVN8eHsifEiv0Eq6EqpzIAJzg/JV+rrsZh+Cs6tCzNqrz9ywn3XG2VCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"316ab74c6a3e93882d8c96e37883f1d4a62e872e6ddd8c9c4681b5bd008d99e2","last_reissued_at":"2026-05-18T03:30:39.578311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:39.578311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4169","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-18T03:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9ROgmkL/SqpMp3nKju9VyKpOs/dmdSAFbtKwcRR9hKcTr0mDxKGRQEhu34Dv5akCq7S0jP8lAsL+lgdSk/TDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:02:46.364462Z"},"content_sha256":"71606c2f05aebd6785babfb76b5ac56aa19859e79d5c1a4720c851ba89988a37","schema_version":"1.0","event_id":"sha256:71606c2f05aebd6785babfb76b5ac56aa19859e79d5c1a4720c851ba89988a37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GFVLOTDKH2JYQLMMS3RXRA7R2S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Markov Chain Monte Carlo for Arrangement of Hyperplanes in Locality-Sensitive Hashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Makiko Konoshima, Yui Noma","submitted_at":"2013-03-18T07:14:15Z","abstract_excerpt":"Since Hamming distances can be calculated by bitwise computations, they can be calculated with less computational load than L2 distances. Similarity searches can therefore be performed faster in Hamming distance space. The elements of Hamming distance space are bit strings. On the other hand, the arrangement of hyperplanes induce the transformation from the feature vectors into feature bit strings. This transformation method is a type of locality-sensitive hashing that has been attracting attention as a way of performing approximate similarity searches at high speed. Supervised learning of hyp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4169","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-18T03:30:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXyJByKN1+DEyeOgG0qENbIs0dgiNk4T2eUnguX3CK+ds1B3ENsLM3i4f8MIY8YFnlPuAzv9efHmcCBRvZGBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:02:46.365074Z"},"content_sha256":"a5b57bcf9991c61106d5a808dc06898bb0c0288d99a577495544b161192e4d7c","schema_version":"1.0","event_id":"sha256:a5b57bcf9991c61106d5a808dc06898bb0c0288d99a577495544b161192e4d7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GFVLOTDKH2JYQLMMS3RXRA7R2S/bundle.json","state_url":"https://pith.science/pith/GFVLOTDKH2JYQLMMS3RXRA7R2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GFVLOTDKH2JYQLMMS3RXRA7R2S/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:02:46Z","links":{"resolver":"https://pith.science/pith/GFVLOTDKH2JYQLMMS3RXRA7R2S","bundle":"https://pith.science/pith/GFVLOTDKH2JYQLMMS3RXRA7R2S/bundle.json","state":"https://pith.science/pith/GFVLOTDKH2JYQLMMS3RXRA7R2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GFVLOTDKH2JYQLMMS3RXRA7R2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GFVLOTDKH2JYQLMMS3RXRA7R2S","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":"d34f08a9234664d1fe9cd5d771e845208cda85a5a771b1b634684092ae72297a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-18T07:14:15Z","title_canon_sha256":"7ac49049115c13f84e13588fe7bbd9b57b1cd3c8cb8595f644f11edb373e787e"},"schema_version":"1.0","source":{"id":"1303.4169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4169","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4169v1","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4169","created_at":"2026-05-18T03:30:39Z"},{"alias_kind":"pith_short_12","alias_value":"GFVLOTDKH2JY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GFVLOTDKH2JYQLMM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GFVLOTDK","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:a5b57bcf9991c61106d5a808dc06898bb0c0288d99a577495544b161192e4d7c","target":"graph","created_at":"2026-05-18T03:30:39Z","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":"Since Hamming distances can be calculated by bitwise computations, they can be calculated with less computational load than L2 distances. Similarity searches can therefore be performed faster in Hamming distance space. The elements of Hamming distance space are bit strings. On the other hand, the arrangement of hyperplanes induce the transformation from the feature vectors into feature bit strings. This transformation method is a type of locality-sensitive hashing that has been attracting attention as a way of performing approximate similarity searches at high speed. Supervised learning of hyp","authors_text":"Makiko Konoshima, Yui Noma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-18T07:14:15Z","title":"Markov Chain Monte Carlo for Arrangement of Hyperplanes in Locality-Sensitive Hashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4169","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:71606c2f05aebd6785babfb76b5ac56aa19859e79d5c1a4720c851ba89988a37","target":"record","created_at":"2026-05-18T03:30:39Z","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":"d34f08a9234664d1fe9cd5d771e845208cda85a5a771b1b634684092ae72297a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-18T07:14:15Z","title_canon_sha256":"7ac49049115c13f84e13588fe7bbd9b57b1cd3c8cb8595f644f11edb373e787e"},"schema_version":"1.0","source":{"id":"1303.4169","kind":"arxiv","version":1}},"canonical_sha256":"316ab74c6a3e93882d8c96e37883f1d4a62e872e6ddd8c9c4681b5bd008d99e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"316ab74c6a3e93882d8c96e37883f1d4a62e872e6ddd8c9c4681b5bd008d99e2","first_computed_at":"2026-05-18T03:30:39.578311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:39.578311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MP/kVcQFAhrZrtLpCVpY4EU26TKTyOsVN8eHsifEiv0Eq6EqpzIAJzg/JV+rrsZh+Cs6tCzNqrz9ywn3XG2VCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:39.579248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71606c2f05aebd6785babfb76b5ac56aa19859e79d5c1a4720c851ba89988a37","sha256:a5b57bcf9991c61106d5a808dc06898bb0c0288d99a577495544b161192e4d7c"],"state_sha256":"64a4fe0bfcc71ec54c2951b63a53ae8d07b74fea3bf76307d327465961fab313"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZYcCl6P1R2LiCB1p9Fx+jF9o2xxLRk7NXZ4ao1PEPm4UPP3+gqlUwpHioS9SovdL2RPY0/8sNzcjAsmQcwxBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:02:46.368262Z","bundle_sha256":"f37b935ef4d3699b8c9cb979b9c06a7b2d2172609ee1266b11fbdb6d3ebc6376"}}