{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QWHPPJSJ7SVZXIRAUGW5R3TBTP","short_pith_number":"pith:QWHPPJSJ","canonical_record":{"source":{"id":"1509.03453","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-11T10:33:34Z","cross_cats_sorted":[],"title_canon_sha256":"d47129dc84aa4654bd5d673feb3a3bc46588df693836018cf512ba27c97411e6","abstract_canon_sha256":"74ac39aa53c2d6560c2ee67cead6ff658c6dda0f723523661be7142701a1eef5"},"schema_version":"1.0"},"canonical_sha256":"858ef7a649fcab9ba220a1add8ee619be13e46ea0474f309297652a87b2a8cae","source":{"kind":"arxiv","id":"1509.03453","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03453","created_at":"2026-05-18T01:00:53Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03453v2","created_at":"2026-05-18T01:00:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03453","created_at":"2026-05-18T01:00:53Z"},{"alias_kind":"pith_short_12","alias_value":"QWHPPJSJ7SVZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QWHPPJSJ7SVZXIRA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QWHPPJSJ","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QWHPPJSJ7SVZXIRAUGW5R3TBTP","target":"record","payload":{"canonical_record":{"source":{"id":"1509.03453","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-11T10:33:34Z","cross_cats_sorted":[],"title_canon_sha256":"d47129dc84aa4654bd5d673feb3a3bc46588df693836018cf512ba27c97411e6","abstract_canon_sha256":"74ac39aa53c2d6560c2ee67cead6ff658c6dda0f723523661be7142701a1eef5"},"schema_version":"1.0"},"canonical_sha256":"858ef7a649fcab9ba220a1add8ee619be13e46ea0474f309297652a87b2a8cae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:53.740132Z","signature_b64":"gSaaKO8UKWrbUET3jQ/E3ofkEzq+GD22oq+dConpdaP1MY6DMdPKxUuhO7uux7nMdF9JHrSj2ZV1OJYmrBGEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"858ef7a649fcab9ba220a1add8ee619be13e46ea0474f309297652a87b2a8cae","last_reissued_at":"2026-05-18T01:00:53.739456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:53.739456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.03453","source_version":2,"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-18T01:00:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLgxcnxuWYPjKOPPM3Znb9COdaTzxCHFpXl7zzaWTYFTMwN6h969jUqEIeB0AWsg44yxVGc84xQ0snDp1VivDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:14:49.022734Z"},"content_sha256":"65c97c004437554c01deaf21842290f9d6648c943f2921b28209e824f17a989d","schema_version":"1.0","event_id":"sha256:65c97c004437554c01deaf21842290f9d6648c943f2921b28209e824f17a989d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QWHPPJSJ7SVZXIRAUGW5R3TBTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A reliable order-statistics-based approximate nearest neighbor search algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Davide Cozzolino, Giovanni Poggi, Luisa Verdoliva","submitted_at":"2015-09-11T10:33:34Z","abstract_excerpt":"We propose a new algorithm for fast approximate nearest neighbor search based on the properties of ordered vectors. Data vectors are classified based on the index and sign of their largest components, thereby partitioning the space in a number of cones centered in the origin. The query is itself classified, and the search starts from the selected cone and proceeds to neighboring ones. Overall, the proposed algorithm corresponds to locality sensitive hashing in the space of directions, with hashing based on the order of components. Thanks to the statistical features emerging through ordering, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03453","kind":"arxiv","version":2},"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-18T01:00:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UEwHqwjKKVhxipLbx7KaEx2p2R39s6wX7xuKLJk+RNij2PPq+nyKG2Rrw698O+XFhi0mOtg3CyOdkAQkZQ6PCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:14:49.023381Z"},"content_sha256":"472012384d95920f114376f28095401e6d528c47faa1131e03fe3cdaa2235998","schema_version":"1.0","event_id":"sha256:472012384d95920f114376f28095401e6d528c47faa1131e03fe3cdaa2235998"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWHPPJSJ7SVZXIRAUGW5R3TBTP/bundle.json","state_url":"https://pith.science/pith/QWHPPJSJ7SVZXIRAUGW5R3TBTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWHPPJSJ7SVZXIRAUGW5R3TBTP/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-02T14:14:49Z","links":{"resolver":"https://pith.science/pith/QWHPPJSJ7SVZXIRAUGW5R3TBTP","bundle":"https://pith.science/pith/QWHPPJSJ7SVZXIRAUGW5R3TBTP/bundle.json","state":"https://pith.science/pith/QWHPPJSJ7SVZXIRAUGW5R3TBTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWHPPJSJ7SVZXIRAUGW5R3TBTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QWHPPJSJ7SVZXIRAUGW5R3TBTP","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":"74ac39aa53c2d6560c2ee67cead6ff658c6dda0f723523661be7142701a1eef5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-11T10:33:34Z","title_canon_sha256":"d47129dc84aa4654bd5d673feb3a3bc46588df693836018cf512ba27c97411e6"},"schema_version":"1.0","source":{"id":"1509.03453","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03453","created_at":"2026-05-18T01:00:53Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03453v2","created_at":"2026-05-18T01:00:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03453","created_at":"2026-05-18T01:00:53Z"},{"alias_kind":"pith_short_12","alias_value":"QWHPPJSJ7SVZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"QWHPPJSJ7SVZXIRA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"QWHPPJSJ","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:472012384d95920f114376f28095401e6d528c47faa1131e03fe3cdaa2235998","target":"graph","created_at":"2026-05-18T01:00:53Z","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":"We propose a new algorithm for fast approximate nearest neighbor search based on the properties of ordered vectors. Data vectors are classified based on the index and sign of their largest components, thereby partitioning the space in a number of cones centered in the origin. The query is itself classified, and the search starts from the selected cone and proceeds to neighboring ones. Overall, the proposed algorithm corresponds to locality sensitive hashing in the space of directions, with hashing based on the order of components. Thanks to the statistical features emerging through ordering, i","authors_text":"Davide Cozzolino, Giovanni Poggi, Luisa Verdoliva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-11T10:33:34Z","title":"A reliable order-statistics-based approximate nearest neighbor search algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03453","kind":"arxiv","version":2},"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:65c97c004437554c01deaf21842290f9d6648c943f2921b28209e824f17a989d","target":"record","created_at":"2026-05-18T01:00:53Z","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":"74ac39aa53c2d6560c2ee67cead6ff658c6dda0f723523661be7142701a1eef5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-11T10:33:34Z","title_canon_sha256":"d47129dc84aa4654bd5d673feb3a3bc46588df693836018cf512ba27c97411e6"},"schema_version":"1.0","source":{"id":"1509.03453","kind":"arxiv","version":2}},"canonical_sha256":"858ef7a649fcab9ba220a1add8ee619be13e46ea0474f309297652a87b2a8cae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"858ef7a649fcab9ba220a1add8ee619be13e46ea0474f309297652a87b2a8cae","first_computed_at":"2026-05-18T01:00:53.739456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:53.739456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gSaaKO8UKWrbUET3jQ/E3ofkEzq+GD22oq+dConpdaP1MY6DMdPKxUuhO7uux7nMdF9JHrSj2ZV1OJYmrBGEDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:53.740132Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03453","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65c97c004437554c01deaf21842290f9d6648c943f2921b28209e824f17a989d","sha256:472012384d95920f114376f28095401e6d528c47faa1131e03fe3cdaa2235998"],"state_sha256":"01f899aaaf915a7570442c8740bf61a5f2b871ed88dca2b33a384c32d86db0bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHSU0fYSgfPS9zGRHG5qMl2oPqs78VWhLxnTizFiiHyiKz8Z6mT3/iBqx8FgU3Aog/qFQ5XvQSoH45PPr+/IDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:14:49.026496Z","bundle_sha256":"d0fa08a7ac7e164accac75220f073ac450de9f0522cb9bf6cbafa75d3042e63c"}}