{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DJO4QO2BO7JCUDDR2RXDS3UW5B","short_pith_number":"pith:DJO4QO2B","canonical_record":{"source":{"id":"1701.05290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-01-19T03:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"ca7d65f1e0faa8dd059c4b058cea5247ffde3984e77b0c31ba51100866d0a552","abstract_canon_sha256":"e50adff11e3bf1941499c5734a000efb5ce45bc297beff4130adbeaeefc30e5e"},"schema_version":"1.0"},"canonical_sha256":"1a5dc83b4177d22a0c71d46e396e96e86bedd9105b762c11f6358de7ba79a470","source":{"kind":"arxiv","id":"1701.05290","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05290","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05290v2","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05290","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"DJO4QO2BO7JC","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DJO4QO2BO7JCUDDR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DJO4QO2B","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DJO4QO2BO7JCUDDR2RXDS3UW5B","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-01-19T03:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"ca7d65f1e0faa8dd059c4b058cea5247ffde3984e77b0c31ba51100866d0a552","abstract_canon_sha256":"e50adff11e3bf1941499c5734a000efb5ce45bc297beff4130adbeaeefc30e5e"},"schema_version":"1.0"},"canonical_sha256":"1a5dc83b4177d22a0c71d46e396e96e86bedd9105b762c11f6358de7ba79a470","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:35.148127Z","signature_b64":"QLvYVj7sNukk0Z+RlzlOadCsWwJqc/7IIlN+6h34qzTOeKOLQ43kafrEFJfr5dZplewkL6d261QvkBTPCFWJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a5dc83b4177d22a0c71d46e396e96e86bedd9105b762c11f6358de7ba79a470","last_reissued_at":"2026-05-18T00:34:35.147746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:35.147746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05290","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-18T00:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TkiH2HEwXWXgzqzKKFN8joYKawPkMvEaVFLhTvS9FX/mSi0a3SHDLOtLNrivftHaWIhA9HBQgFNDUxMUdofrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:08:40.950704Z"},"content_sha256":"7f5b2761dd98f0fe35a2ec75f3fc8a6c3f93e4f97f3cdd91b03f45435c136f43","schema_version":"1.0","event_id":"sha256:7f5b2761dd98f0fe35a2ec75f3fc8a6c3f93e4f97f3cdd91b03f45435c136f43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DJO4QO2BO7JCUDDR2RXDS3UW5B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Range-efficient consistent sampling and locality-sensitive hashing for polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Joachim Gudmundsson, Rasmus Pagh","submitted_at":"2017-01-19T03:57:28Z","abstract_excerpt":"Locality-sensitive hashing (LSH) is a fundamental technique for similarity search and similarity estimation in high-dimensional spaces. The basic idea is that similar objects should produce hash collisions with probability significantly larger than objects with low similarity. We consider LSH for objects that can be represented as point sets in either one or two dimensions. To make the point sets finite size we consider the subset of points on a grid. Directly applying LSH (e.g. min-wise hashing) to these point sets would require time proportional to the number of points. We seek to achieve ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05290","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-18T00:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZvT1+2HpZ5a/Z/bj04YVSmg4lW/bC8kd82ymXEHKMgOuNXj5f/ubloim/bpVxyU0ojO0UywvfdNv4ZCghpQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:08:40.951183Z"},"content_sha256":"b4b2fad3879b1d74b1da72da2873cbfbd8113a61f140761959792637a9f379d5","schema_version":"1.0","event_id":"sha256:b4b2fad3879b1d74b1da72da2873cbfbd8113a61f140761959792637a9f379d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJO4QO2BO7JCUDDR2RXDS3UW5B/bundle.json","state_url":"https://pith.science/pith/DJO4QO2BO7JCUDDR2RXDS3UW5B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJO4QO2BO7JCUDDR2RXDS3UW5B/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-05-26T14:08:40Z","links":{"resolver":"https://pith.science/pith/DJO4QO2BO7JCUDDR2RXDS3UW5B","bundle":"https://pith.science/pith/DJO4QO2BO7JCUDDR2RXDS3UW5B/bundle.json","state":"https://pith.science/pith/DJO4QO2BO7JCUDDR2RXDS3UW5B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJO4QO2BO7JCUDDR2RXDS3UW5B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DJO4QO2BO7JCUDDR2RXDS3UW5B","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":"e50adff11e3bf1941499c5734a000efb5ce45bc297beff4130adbeaeefc30e5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-01-19T03:57:28Z","title_canon_sha256":"ca7d65f1e0faa8dd059c4b058cea5247ffde3984e77b0c31ba51100866d0a552"},"schema_version":"1.0","source":{"id":"1701.05290","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05290","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05290v2","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05290","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"DJO4QO2BO7JC","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DJO4QO2BO7JCUDDR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DJO4QO2B","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:b4b2fad3879b1d74b1da72da2873cbfbd8113a61f140761959792637a9f379d5","target":"graph","created_at":"2026-05-18T00:34:35Z","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":"Locality-sensitive hashing (LSH) is a fundamental technique for similarity search and similarity estimation in high-dimensional spaces. The basic idea is that similar objects should produce hash collisions with probability significantly larger than objects with low similarity. We consider LSH for objects that can be represented as point sets in either one or two dimensions. To make the point sets finite size we consider the subset of points on a grid. Directly applying LSH (e.g. min-wise hashing) to these point sets would require time proportional to the number of points. We seek to achieve ti","authors_text":"Joachim Gudmundsson, Rasmus Pagh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-01-19T03:57:28Z","title":"Range-efficient consistent sampling and locality-sensitive hashing for polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05290","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:7f5b2761dd98f0fe35a2ec75f3fc8a6c3f93e4f97f3cdd91b03f45435c136f43","target":"record","created_at":"2026-05-18T00:34:35Z","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":"e50adff11e3bf1941499c5734a000efb5ce45bc297beff4130adbeaeefc30e5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-01-19T03:57:28Z","title_canon_sha256":"ca7d65f1e0faa8dd059c4b058cea5247ffde3984e77b0c31ba51100866d0a552"},"schema_version":"1.0","source":{"id":"1701.05290","kind":"arxiv","version":2}},"canonical_sha256":"1a5dc83b4177d22a0c71d46e396e96e86bedd9105b762c11f6358de7ba79a470","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a5dc83b4177d22a0c71d46e396e96e86bedd9105b762c11f6358de7ba79a470","first_computed_at":"2026-05-18T00:34:35.147746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:35.147746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QLvYVj7sNukk0Z+RlzlOadCsWwJqc/7IIlN+6h34qzTOeKOLQ43kafrEFJfr5dZplewkL6d261QvkBTPCFWJAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:35.148127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05290","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f5b2761dd98f0fe35a2ec75f3fc8a6c3f93e4f97f3cdd91b03f45435c136f43","sha256:b4b2fad3879b1d74b1da72da2873cbfbd8113a61f140761959792637a9f379d5"],"state_sha256":"949f32b548b17f3b9b7552c0af6de893b3347b8354d6533ab615656dc554b2b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2FgkmChA1NFvC7JFrKI2esyZuyfous155fw3nSz7hpR4wGqF0FmujhrDGMD7ZAkNFEQBhDk8dPVEN9zIlFYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:08:40.954124Z","bundle_sha256":"4f9d00a2da228853ec0b63dd1d4109f4ac9a9e21b02c3693e78f342a004e1aca"}}