{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YAVN33MH3DPNBRFFXLXUJK7TVP","short_pith_number":"pith:YAVN33MH","canonical_record":{"source":{"id":"1504.00722","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-03T01:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"dc731fe991629bb6b800ab0cdcf8f8e8dc7e220441e62ad0d848ee8378af75e0","abstract_canon_sha256":"1e5b1f810e4d5a717b84895365d524e8a8e3161c64f9ef03b07b089f6ef23dab"},"schema_version":"1.0"},"canonical_sha256":"c02added87d8ded0c4a5baef44abf3abf608888543788317180e00457ad490bc","source":{"kind":"arxiv","id":"1504.00722","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00722","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00722v2","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00722","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"YAVN33MH3DPN","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YAVN33MH3DPNBRFF","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YAVN33MH","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YAVN33MH3DPNBRFFXLXUJK7TVP","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00722","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-03T01:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"dc731fe991629bb6b800ab0cdcf8f8e8dc7e220441e62ad0d848ee8378af75e0","abstract_canon_sha256":"1e5b1f810e4d5a717b84895365d524e8a8e3161c64f9ef03b07b089f6ef23dab"},"schema_version":"1.0"},"canonical_sha256":"c02added87d8ded0c4a5baef44abf3abf608888543788317180e00457ad490bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:46.190973Z","signature_b64":"osc0SE2RAZG7O/GSwghAt236HgRev7FaA/5YFKEpesP8COQUNhgvP0SyowlQcKVRi37BYTEzto/ein7RgIJNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c02added87d8ded0c4a5baef44abf3abf608888543788317180e00457ad490bc","last_reissued_at":"2026-05-18T01:27:46.190401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:46.190401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00722","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:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4vauWDz6KPKgWeZc8EwnpGFr2RNGC6eiWZZlugHreYCDr1SyLpvQsoay3ixDNHs2QEhwRAor745LdUMgp2kZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:04:14.000196Z"},"content_sha256":"f4e6af8eb663d6ad621e0c0965b80c040dddae55a0d71471ce4d4aadcde292c4","schema_version":"1.0","event_id":"sha256:f4e6af8eb663d6ad621e0c0965b80c040dddae55a0d71471ce4d4aadcde292c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YAVN33MH3DPNBRFFXLXUJK7TVP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Point Localization and Density Estimation from Ordinal kNN graphs using Synchronization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Joseph Woodworth, Mihai Cucuringu","submitted_at":"2015-04-03T01:16:12Z","abstract_excerpt":"We consider the problem of embedding unweighted, directed k-nearest neighbor graphs in low-dimensional Euclidean space. The k-nearest neighbors of each vertex provides ordinal information on the distances between points, but not the distances themselves. We use this ordinal information along with the low-dimensionality to recover the coordinates of the points up to arbitrary similarity transformations (rigid transformations and scaling). Furthermore, we also illustrate the possibility of robustly recovering the underlying density via the Total Variation Maximum Penalized Likelihood Estimation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00722","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:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agtazQGNWHCNl0/TQjh5qqPDKDrpXSfVbWtiHcZ7tEHIdX/L2Ijl/9eOeEqh4bdYe8ASMpg54qud7wXQNtKeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:04:14.000759Z"},"content_sha256":"73ec4da3aa8848dc25cabd138884950ff38d005aee8f0a42c198102c57fd50c9","schema_version":"1.0","event_id":"sha256:73ec4da3aa8848dc25cabd138884950ff38d005aee8f0a42c198102c57fd50c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YAVN33MH3DPNBRFFXLXUJK7TVP/bundle.json","state_url":"https://pith.science/pith/YAVN33MH3DPNBRFFXLXUJK7TVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YAVN33MH3DPNBRFFXLXUJK7TVP/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-28T23:04:14Z","links":{"resolver":"https://pith.science/pith/YAVN33MH3DPNBRFFXLXUJK7TVP","bundle":"https://pith.science/pith/YAVN33MH3DPNBRFFXLXUJK7TVP/bundle.json","state":"https://pith.science/pith/YAVN33MH3DPNBRFFXLXUJK7TVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YAVN33MH3DPNBRFFXLXUJK7TVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YAVN33MH3DPNBRFFXLXUJK7TVP","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":"1e5b1f810e4d5a717b84895365d524e8a8e3161c64f9ef03b07b089f6ef23dab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-03T01:16:12Z","title_canon_sha256":"dc731fe991629bb6b800ab0cdcf8f8e8dc7e220441e62ad0d848ee8378af75e0"},"schema_version":"1.0","source":{"id":"1504.00722","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00722","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00722v2","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00722","created_at":"2026-05-18T01:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"YAVN33MH3DPN","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YAVN33MH3DPNBRFF","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YAVN33MH","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:73ec4da3aa8848dc25cabd138884950ff38d005aee8f0a42c198102c57fd50c9","target":"graph","created_at":"2026-05-18T01:27:46Z","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 consider the problem of embedding unweighted, directed k-nearest neighbor graphs in low-dimensional Euclidean space. The k-nearest neighbors of each vertex provides ordinal information on the distances between points, but not the distances themselves. We use this ordinal information along with the low-dimensionality to recover the coordinates of the points up to arbitrary similarity transformations (rigid transformations and scaling). Furthermore, we also illustrate the possibility of robustly recovering the underlying density via the Total Variation Maximum Penalized Likelihood Estimation ","authors_text":"Joseph Woodworth, Mihai Cucuringu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-03T01:16:12Z","title":"Point Localization and Density Estimation from Ordinal kNN graphs using Synchronization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00722","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:f4e6af8eb663d6ad621e0c0965b80c040dddae55a0d71471ce4d4aadcde292c4","target":"record","created_at":"2026-05-18T01:27:46Z","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":"1e5b1f810e4d5a717b84895365d524e8a8e3161c64f9ef03b07b089f6ef23dab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-03T01:16:12Z","title_canon_sha256":"dc731fe991629bb6b800ab0cdcf8f8e8dc7e220441e62ad0d848ee8378af75e0"},"schema_version":"1.0","source":{"id":"1504.00722","kind":"arxiv","version":2}},"canonical_sha256":"c02added87d8ded0c4a5baef44abf3abf608888543788317180e00457ad490bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c02added87d8ded0c4a5baef44abf3abf608888543788317180e00457ad490bc","first_computed_at":"2026-05-18T01:27:46.190401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:46.190401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"osc0SE2RAZG7O/GSwghAt236HgRev7FaA/5YFKEpesP8COQUNhgvP0SyowlQcKVRi37BYTEzto/ein7RgIJNCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:46.190973Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00722","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4e6af8eb663d6ad621e0c0965b80c040dddae55a0d71471ce4d4aadcde292c4","sha256:73ec4da3aa8848dc25cabd138884950ff38d005aee8f0a42c198102c57fd50c9"],"state_sha256":"fd23146b5e247653b33250a0b6840cc4f6abe4498f97ff354c75ed909f153d0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmo1Pan3a0TVGLVE0Nho+vL6V8UXXadgRqi+XvAEJd2R1lvnLiJ+yFRv64y/tpsEeV4abtvij5QPJW5lrMteBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:04:14.004391Z","bundle_sha256":"59942e1bcd5cd958fc4e900caaa83c31b9efb239c596c5f963b840aefe5b2249"}}