{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OPNFNX3W6LJT3PWDC46AM7PNQW","short_pith_number":"pith:OPNFNX3W","canonical_record":{"source":{"id":"2302.12399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-02-24T02:03:40Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9191f28a6fb80d621a96d0d64d3c9834870ff4c0d3fce75cc8041fdb002e62a9","abstract_canon_sha256":"ab8077b29b248b14bd35d0496fc4084246f516f03893b9c5d7e39317e9bdfeba"},"schema_version":"1.0"},"canonical_sha256":"73da56df76f2d33dbec3173c067ded85ad0d2507d51454093ad879e0c8fd4064","source":{"kind":"arxiv","id":"2302.12399","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.12399","created_at":"2026-07-05T05:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"2302.12399v2","created_at":"2026-07-05T05:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12399","created_at":"2026-07-05T05:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"OPNFNX3W6LJT","created_at":"2026-07-05T05:56:56Z"},{"alias_kind":"pith_short_16","alias_value":"OPNFNX3W6LJT3PWD","created_at":"2026-07-05T05:56:56Z"},{"alias_kind":"pith_short_8","alias_value":"OPNFNX3W","created_at":"2026-07-05T05:56:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OPNFNX3W6LJT3PWDC46AM7PNQW","target":"record","payload":{"canonical_record":{"source":{"id":"2302.12399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-02-24T02:03:40Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9191f28a6fb80d621a96d0d64d3c9834870ff4c0d3fce75cc8041fdb002e62a9","abstract_canon_sha256":"ab8077b29b248b14bd35d0496fc4084246f516f03893b9c5d7e39317e9bdfeba"},"schema_version":"1.0"},"canonical_sha256":"73da56df76f2d33dbec3173c067ded85ad0d2507d51454093ad879e0c8fd4064","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:56.012493Z","signature_b64":"cPmljk4W1pAatEPsB6T1H5esJIgb+YmkVkCRInwrvUdVLeOQXjFLnQu7jGEhUgr9lMtRBq+7jjpSp1iEUBkHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73da56df76f2d33dbec3173c067ded85ad0d2507d51454093ad879e0c8fd4064","last_reissued_at":"2026-07-05T05:56:56.012027Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:56.012027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.12399","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-07-05T05:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMM5Ve2///wQJpfB61ERoYaUW8lVUFPFyU7AIxbD9X4RErPBXOB8kzfkZroAuy+2eRKFjSEalGtpdplai3aMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:38:38.458398Z"},"content_sha256":"8d585c88bc53f9b2869f43ee7dbb8b1be28bbc47c404279089bb9c03573cfd8d","schema_version":"1.0","event_id":"sha256:8d585c88bc53f9b2869f43ee7dbb8b1be28bbc47c404279089bb9c03573cfd8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OPNFNX3W6LJT3PWDC46AM7PNQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Laplacians on Shared Nearest Neighbor graphs and graph Laplacians on $k$-Nearest Neighbor graphs having the same limit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.ML","authors_text":"A. Martina Neuman","submitted_at":"2023-02-24T02:03:40Z","abstract_excerpt":"A Shared Nearest Neighbor (SNN) graph is a type of graph construction using shared nearest neighbor information, which is a secondary similarity measure based on the rankings induced by a primary $k$-nearest neighbor ($k$-NN) measure. SNN measures have been touted as being less prone to the curse of dimensionality than conventional distance measures, and thus methods using SNN graphs have been widely used in applications, particularly in clustering high-dimensional data sets and in finding outliers in subspaces of high dimensional data. Despite this, the theoretical study of SNN graphs and gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12399","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.12399/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-05T05:56:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRwXdQly6/Ad3V/6NHMnaaisELe385nZ5LH9rtXn2SoPKKorJl24DpXC/o8GyGFg9ljBKQH1vQnHIjBllYzmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:38:38.458890Z"},"content_sha256":"c02a002d3da37482adf8652f78493aaa49a037a5ca8b7dab44c94ad02fe66052","schema_version":"1.0","event_id":"sha256:c02a002d3da37482adf8652f78493aaa49a037a5ca8b7dab44c94ad02fe66052"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPNFNX3W6LJT3PWDC46AM7PNQW/bundle.json","state_url":"https://pith.science/pith/OPNFNX3W6LJT3PWDC46AM7PNQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPNFNX3W6LJT3PWDC46AM7PNQW/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-08-08T09:38:38Z","links":{"resolver":"https://pith.science/pith/OPNFNX3W6LJT3PWDC46AM7PNQW","bundle":"https://pith.science/pith/OPNFNX3W6LJT3PWDC46AM7PNQW/bundle.json","state":"https://pith.science/pith/OPNFNX3W6LJT3PWDC46AM7PNQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPNFNX3W6LJT3PWDC46AM7PNQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OPNFNX3W6LJT3PWDC46AM7PNQW","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":"ab8077b29b248b14bd35d0496fc4084246f516f03893b9c5d7e39317e9bdfeba","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-02-24T02:03:40Z","title_canon_sha256":"9191f28a6fb80d621a96d0d64d3c9834870ff4c0d3fce75cc8041fdb002e62a9"},"schema_version":"1.0","source":{"id":"2302.12399","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.12399","created_at":"2026-07-05T05:56:56Z"},{"alias_kind":"arxiv_version","alias_value":"2302.12399v2","created_at":"2026-07-05T05:56:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12399","created_at":"2026-07-05T05:56:56Z"},{"alias_kind":"pith_short_12","alias_value":"OPNFNX3W6LJT","created_at":"2026-07-05T05:56:56Z"},{"alias_kind":"pith_short_16","alias_value":"OPNFNX3W6LJT3PWD","created_at":"2026-07-05T05:56:56Z"},{"alias_kind":"pith_short_8","alias_value":"OPNFNX3W","created_at":"2026-07-05T05:56:56Z"}],"graph_snapshots":[{"event_id":"sha256:c02a002d3da37482adf8652f78493aaa49a037a5ca8b7dab44c94ad02fe66052","target":"graph","created_at":"2026-07-05T05:56:56Z","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/2302.12399/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A Shared Nearest Neighbor (SNN) graph is a type of graph construction using shared nearest neighbor information, which is a secondary similarity measure based on the rankings induced by a primary $k$-nearest neighbor ($k$-NN) measure. SNN measures have been touted as being less prone to the curse of dimensionality than conventional distance measures, and thus methods using SNN graphs have been widely used in applications, particularly in clustering high-dimensional data sets and in finding outliers in subspaces of high dimensional data. Despite this, the theoretical study of SNN graphs and gra","authors_text":"A. Martina Neuman","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-02-24T02:03:40Z","title":"Graph Laplacians on Shared Nearest Neighbor graphs and graph Laplacians on $k$-Nearest Neighbor graphs having the same limit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12399","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:8d585c88bc53f9b2869f43ee7dbb8b1be28bbc47c404279089bb9c03573cfd8d","target":"record","created_at":"2026-07-05T05:56:56Z","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":"ab8077b29b248b14bd35d0496fc4084246f516f03893b9c5d7e39317e9bdfeba","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2023-02-24T02:03:40Z","title_canon_sha256":"9191f28a6fb80d621a96d0d64d3c9834870ff4c0d3fce75cc8041fdb002e62a9"},"schema_version":"1.0","source":{"id":"2302.12399","kind":"arxiv","version":2}},"canonical_sha256":"73da56df76f2d33dbec3173c067ded85ad0d2507d51454093ad879e0c8fd4064","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73da56df76f2d33dbec3173c067ded85ad0d2507d51454093ad879e0c8fd4064","first_computed_at":"2026-07-05T05:56:56.012027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:56:56.012027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cPmljk4W1pAatEPsB6T1H5esJIgb+YmkVkCRInwrvUdVLeOQXjFLnQu7jGEhUgr9lMtRBq+7jjpSp1iEUBkHBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:56:56.012493Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.12399","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d585c88bc53f9b2869f43ee7dbb8b1be28bbc47c404279089bb9c03573cfd8d","sha256:c02a002d3da37482adf8652f78493aaa49a037a5ca8b7dab44c94ad02fe66052"],"state_sha256":"4684f8cdab3d2a0f181d8a1ffc6fa0b2ba73c265d9d7911cbdbcd259751a859f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wT4mitgJl/l4jvoc2DICqaa5uCrmIfh9/TfLA2sZz0uK44wo20k9+gXzX3D5qrjWShQbV29NCRZXk+bc8Y7CDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:38:38.463509Z","bundle_sha256":"4ed18d642d6d62994e31c0ba0ce26bdcb85077851f6e11410998d2b3b12d0a44"}}