{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IHNNYDMGQYA75A7PI6HDKTGWCI","short_pith_number":"pith:IHNNYDMG","schema_version":"1.0","canonical_sha256":"41dadc0d868601fe83ef478e354cd6122bf19d187686999036ec5cbfe67a8851","source":{"kind":"arxiv","id":"2208.11986","version":2},"attestation_state":"computed","paper":{"title":"Local Intrinsic Dimensionality Measures for Graphs, with Applications to Graph Embeddings","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Milo\\v{s} Radovanovi\\'c, Milo\\v{s} Savi\\'c, Vladimir Kurbalija","submitted_at":"2022-08-25T10:32:07Z","abstract_excerpt":"The notion of local intrinsic dimensionality (LID) is an important advancement in data dimensionality analysis, with applications in data mining, machine learning and similarity search problems. Existing distance-based LID estimators were designed for tabular datasets encompassing data points represented as vectors in a Euclidean space. After discussing their limitations for graph-structured data considering graph embeddings and graph distances, we propose NC-LID, a novel LID-related measure for quantifying the discriminatory power of the shortest-path distance with respect to natural communit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2208.11986","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-08-25T10:32:07Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"13c3dd79b8c31c3fe4a7136cdf58f0f0d4e01c7b89d2ab080d9bb25138636045","abstract_canon_sha256":"66cf57e9f62a53a78eeae75fcac7ab734fdbfa33fcb7beeb47f5f842e5bdaf98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:30:25.606825Z","signature_b64":"O8CFRUpLFUnaHM6Pe4CvKw+PZiBnCxdy1e3C4wM2FoCkbn3JNfonBWh+OXiZ3u4FLzM2/3u9S4X2Jxf3nlpuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41dadc0d868601fe83ef478e354cd6122bf19d187686999036ec5cbfe67a8851","last_reissued_at":"2026-07-05T06:30:25.606291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:30:25.606291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Intrinsic Dimensionality Measures for Graphs, with Applications to Graph Embeddings","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Milo\\v{s} Radovanovi\\'c, Milo\\v{s} Savi\\'c, Vladimir Kurbalija","submitted_at":"2022-08-25T10:32:07Z","abstract_excerpt":"The notion of local intrinsic dimensionality (LID) is an important advancement in data dimensionality analysis, with applications in data mining, machine learning and similarity search problems. Existing distance-based LID estimators were designed for tabular datasets encompassing data points represented as vectors in a Euclidean space. After discussing their limitations for graph-structured data considering graph embeddings and graph distances, we propose NC-LID, a novel LID-related measure for quantifying the discriminatory power of the shortest-path distance with respect to natural communit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.11986","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/2208.11986/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2208.11986","created_at":"2026-07-05T06:30:25.606364+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.11986v2","created_at":"2026-07-05T06:30:25.606364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.11986","created_at":"2026-07-05T06:30:25.606364+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHNNYDMGQYA7","created_at":"2026-07-05T06:30:25.606364+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHNNYDMGQYA75A7P","created_at":"2026-07-05T06:30:25.606364+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHNNYDMG","created_at":"2026-07-05T06:30:25.606364+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IHNNYDMGQYA75A7PI6HDKTGWCI","json":"https://pith.science/pith/IHNNYDMGQYA75A7PI6HDKTGWCI.json","graph_json":"https://pith.science/api/pith-number/IHNNYDMGQYA75A7PI6HDKTGWCI/graph.json","events_json":"https://pith.science/api/pith-number/IHNNYDMGQYA75A7PI6HDKTGWCI/events.json","paper":"https://pith.science/paper/IHNNYDMG"},"agent_actions":{"view_html":"https://pith.science/pith/IHNNYDMGQYA75A7PI6HDKTGWCI","download_json":"https://pith.science/pith/IHNNYDMGQYA75A7PI6HDKTGWCI.json","view_paper":"https://pith.science/paper/IHNNYDMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.11986&json=true","fetch_graph":"https://pith.science/api/pith-number/IHNNYDMGQYA75A7PI6HDKTGWCI/graph.json","fetch_events":"https://pith.science/api/pith-number/IHNNYDMGQYA75A7PI6HDKTGWCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHNNYDMGQYA75A7PI6HDKTGWCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHNNYDMGQYA75A7PI6HDKTGWCI/action/storage_attestation","attest_author":"https://pith.science/pith/IHNNYDMGQYA75A7PI6HDKTGWCI/action/author_attestation","sign_citation":"https://pith.science/pith/IHNNYDMGQYA75A7PI6HDKTGWCI/action/citation_signature","submit_replication":"https://pith.science/pith/IHNNYDMGQYA75A7PI6HDKTGWCI/action/replication_record"}},"created_at":"2026-07-05T06:30:25.606364+00:00","updated_at":"2026-07-05T06:30:25.606364+00:00"}