{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:N3SVGH7PMIEITTPKPM5UHPNZTR","short_pith_number":"pith:N3SVGH7P","canonical_record":{"source":{"id":"1411.5720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-20T23:16:09Z","cross_cats_sorted":["cs.SI","math.ST","stat.ME","stat.TH"],"title_canon_sha256":"41a5329d084daafc8deb78aed6ff51172b3fbc75a0e7948871aaf5b240e0df87","abstract_canon_sha256":"aa8139de5f31a4d22df30c92e593fb63bc9c8a568223f254ed94b23db683f3d3"},"schema_version":"1.0"},"canonical_sha256":"6ee5531fef620889cdea7b3b43bdb99c4548f78571cb3d88420b76a902889b4e","source":{"kind":"arxiv","id":"1411.5720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5720","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5720v1","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5720","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"N3SVGH7PMIEI","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N3SVGH7PMIEITTPK","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N3SVGH7P","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:N3SVGH7PMIEITTPKPM5UHPNZTR","target":"record","payload":{"canonical_record":{"source":{"id":"1411.5720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-20T23:16:09Z","cross_cats_sorted":["cs.SI","math.ST","stat.ME","stat.TH"],"title_canon_sha256":"41a5329d084daafc8deb78aed6ff51172b3fbc75a0e7948871aaf5b240e0df87","abstract_canon_sha256":"aa8139de5f31a4d22df30c92e593fb63bc9c8a568223f254ed94b23db683f3d3"},"schema_version":"1.0"},"canonical_sha256":"6ee5531fef620889cdea7b3b43bdb99c4548f78571cb3d88420b76a902889b4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:07.236480Z","signature_b64":"m7EfILFSGp10Ot9elL1SOpGK9ytRQJ3rIBfSea/e71SrR69mmQ3yEZnuuQHBlCoPyXu32zdWr6iR89wnaiZcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ee5531fef620889cdea7b3b43bdb99c4548f78571cb3d88420b76a902889b4e","last_reissued_at":"2026-05-18T02:33:07.236068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:07.236068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.5720","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-18T02:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q3IgWGEVTv3InmuE8y5fvdxBJMNoaeNH5mM5x2eocw/fI05OMoLdKQOBu2aXeRL+VTfPaJX4n+VxpGjHZ7onCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:13:53.871973Z"},"content_sha256":"1ae06e6a47b16af71ebc1e79806679fbee424f5c42e221995612d49aa98cf2cd","schema_version":"1.0","event_id":"sha256:1ae06e6a47b16af71ebc1e79806679fbee424f5c42e221995612d49aa98cf2cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:N3SVGH7PMIEITTPKPM5UHPNZTR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Metric recovery from directed unweighted graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.ST","stat.ME","stat.TH"],"primary_cat":"stat.ML","authors_text":"Tatsunori B. Hashimoto, Tommi S. Jaakkola, Yi Sun","submitted_at":"2014-11-20T23:16:09Z","abstract_excerpt":"We analyze directed, unweighted graphs obtained from $x_i\\in \\mathbb{R}^d$ by connecting vertex $i$ to $j$ iff $|x_i - x_j| < \\epsilon(x_i)$. Examples of such graphs include $k$-nearest neighbor graphs, where $\\epsilon(x_i)$ varies from point to point, and, arguably, many real world graphs such as co-purchasing graphs. We ask whether we can recover the underlying Euclidean metric $\\epsilon(x_i)$ and the associated density $p(x_i)$ given only the directed graph and $d$.\n  We show that consistent recovery is possible up to isometric scaling when the vertex degree is at least $\\omega(n^{2/(2+d)}\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5720","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-18T02:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"og+NwyknoI+hAuCBp2GwOp35btQIYyhOuse+C1apdj4JFDPq8VJ9jtyUVADUrH8dM81BgybzQwI4Yem0SQdhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:13:53.872694Z"},"content_sha256":"d362b04afed14d56e824f4505272e52f1387e4de75577b2824265a1d46369b4b","schema_version":"1.0","event_id":"sha256:d362b04afed14d56e824f4505272e52f1387e4de75577b2824265a1d46369b4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3SVGH7PMIEITTPKPM5UHPNZTR/bundle.json","state_url":"https://pith.science/pith/N3SVGH7PMIEITTPKPM5UHPNZTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3SVGH7PMIEITTPKPM5UHPNZTR/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-06T11:13:53Z","links":{"resolver":"https://pith.science/pith/N3SVGH7PMIEITTPKPM5UHPNZTR","bundle":"https://pith.science/pith/N3SVGH7PMIEITTPKPM5UHPNZTR/bundle.json","state":"https://pith.science/pith/N3SVGH7PMIEITTPKPM5UHPNZTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3SVGH7PMIEITTPKPM5UHPNZTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:N3SVGH7PMIEITTPKPM5UHPNZTR","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":"aa8139de5f31a4d22df30c92e593fb63bc9c8a568223f254ed94b23db683f3d3","cross_cats_sorted":["cs.SI","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-20T23:16:09Z","title_canon_sha256":"41a5329d084daafc8deb78aed6ff51172b3fbc75a0e7948871aaf5b240e0df87"},"schema_version":"1.0","source":{"id":"1411.5720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.5720","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1411.5720v1","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.5720","created_at":"2026-05-18T02:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"N3SVGH7PMIEI","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"N3SVGH7PMIEITTPK","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"N3SVGH7P","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d362b04afed14d56e824f4505272e52f1387e4de75577b2824265a1d46369b4b","target":"graph","created_at":"2026-05-18T02:33:07Z","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 analyze directed, unweighted graphs obtained from $x_i\\in \\mathbb{R}^d$ by connecting vertex $i$ to $j$ iff $|x_i - x_j| < \\epsilon(x_i)$. Examples of such graphs include $k$-nearest neighbor graphs, where $\\epsilon(x_i)$ varies from point to point, and, arguably, many real world graphs such as co-purchasing graphs. We ask whether we can recover the underlying Euclidean metric $\\epsilon(x_i)$ and the associated density $p(x_i)$ given only the directed graph and $d$.\n  We show that consistent recovery is possible up to isometric scaling when the vertex degree is at least $\\omega(n^{2/(2+d)}\\","authors_text":"Tatsunori B. Hashimoto, Tommi S. Jaakkola, Yi Sun","cross_cats":["cs.SI","math.ST","stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-20T23:16:09Z","title":"Metric recovery from directed unweighted graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.5720","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:1ae06e6a47b16af71ebc1e79806679fbee424f5c42e221995612d49aa98cf2cd","target":"record","created_at":"2026-05-18T02:33:07Z","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":"aa8139de5f31a4d22df30c92e593fb63bc9c8a568223f254ed94b23db683f3d3","cross_cats_sorted":["cs.SI","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-20T23:16:09Z","title_canon_sha256":"41a5329d084daafc8deb78aed6ff51172b3fbc75a0e7948871aaf5b240e0df87"},"schema_version":"1.0","source":{"id":"1411.5720","kind":"arxiv","version":1}},"canonical_sha256":"6ee5531fef620889cdea7b3b43bdb99c4548f78571cb3d88420b76a902889b4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ee5531fef620889cdea7b3b43bdb99c4548f78571cb3d88420b76a902889b4e","first_computed_at":"2026-05-18T02:33:07.236068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:07.236068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m7EfILFSGp10Ot9elL1SOpGK9ytRQJ3rIBfSea/e71SrR69mmQ3yEZnuuQHBlCoPyXu32zdWr6iR89wnaiZcAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:07.236480Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.5720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ae06e6a47b16af71ebc1e79806679fbee424f5c42e221995612d49aa98cf2cd","sha256:d362b04afed14d56e824f4505272e52f1387e4de75577b2824265a1d46369b4b"],"state_sha256":"cfdead3a0391d6ea88fa9fbcfe187011ba5a75c786d37d31aa1f83919c66989e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SuH/ijSS+GbU7RxvoV52wFc/Hborx9wFJJRqTVyyXb3iXWLFBV1XorAhmVdl0fRRvBz2jtaq7lndgmMYgTDIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:13:53.876367Z","bundle_sha256":"5dda221cd95137c0d6e13fb9e8baf812a0eb3af128eeb2b277497473b2c51692"}}