{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5CWRWE3BAMRR5GQOHHLGOL4QRC","short_pith_number":"pith:5CWRWE3B","schema_version":"1.0","canonical_sha256":"e8ad1b136103231e9a0e39d6672f90888145ce92c8c59e2ab028f92444171691","source":{"kind":"arxiv","id":"2503.01723","version":1},"attestation_state":"computed","paper":{"title":"How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Andreas Lyhne Fiehn, Morten M{\\o}rup, Niels Raunkj{\\ae}r Holm, Nikolaos Nakis","submitted_at":"2025-03-03T16:37:38Z","abstract_excerpt":"Low-dimensional embeddings are essential for machine learning tasks involving graphs, such as node classification, link prediction, community detection, network visualization, and network compression. Although recent studies have identified exact low-dimensional embeddings, the limits of the required embedding dimensions remain unclear. We presently prove that lower dimensional embeddings are possible when using Euclidean metric embeddings as opposed to vector-based Logistic PCA (LPCA) embeddings. In particular, we provide an efficient logarithmic search procedure for identifying the exact emb"},"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":"2503.01723","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-03T16:37:38Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"c4245ab7d908eb659aca8c67a7f164671ab76572d405c1011db99a10c76c970c","abstract_canon_sha256":"1aeee57cfff8bfd021b95194ddb96797aec51979d18d62878613c1d05aeba3ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:13.526286Z","signature_b64":"jYZYe4U0tXcxYAhZCC4HP1e55GOFisWwsRNn5SZU8LEx/1876T1IlKcZE795w4mRckfBjuJ+HsqC7+S1h/HADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8ad1b136103231e9a0e39d6672f90888145ce92c8c59e2ab028f92444171691","last_reissued_at":"2026-07-05T10:23:13.525405Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:13.525405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Andreas Lyhne Fiehn, Morten M{\\o}rup, Niels Raunkj{\\ae}r Holm, Nikolaos Nakis","submitted_at":"2025-03-03T16:37:38Z","abstract_excerpt":"Low-dimensional embeddings are essential for machine learning tasks involving graphs, such as node classification, link prediction, community detection, network visualization, and network compression. Although recent studies have identified exact low-dimensional embeddings, the limits of the required embedding dimensions remain unclear. We presently prove that lower dimensional embeddings are possible when using Euclidean metric embeddings as opposed to vector-based Logistic PCA (LPCA) embeddings. In particular, we provide an efficient logarithmic search procedure for identifying the exact emb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01723","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.01723/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":"2503.01723","created_at":"2026-07-05T10:23:13.525516+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.01723v1","created_at":"2026-07-05T10:23:13.525516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01723","created_at":"2026-07-05T10:23:13.525516+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CWRWE3BAMRR","created_at":"2026-07-05T10:23:13.525516+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CWRWE3BAMRR5GQO","created_at":"2026-07-05T10:23:13.525516+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CWRWE3B","created_at":"2026-07-05T10:23:13.525516+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/5CWRWE3BAMRR5GQOHHLGOL4QRC","json":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC.json","graph_json":"https://pith.science/api/pith-number/5CWRWE3BAMRR5GQOHHLGOL4QRC/graph.json","events_json":"https://pith.science/api/pith-number/5CWRWE3BAMRR5GQOHHLGOL4QRC/events.json","paper":"https://pith.science/paper/5CWRWE3B"},"agent_actions":{"view_html":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC","download_json":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC.json","view_paper":"https://pith.science/paper/5CWRWE3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.01723&json=true","fetch_graph":"https://pith.science/api/pith-number/5CWRWE3BAMRR5GQOHHLGOL4QRC/graph.json","fetch_events":"https://pith.science/api/pith-number/5CWRWE3BAMRR5GQOHHLGOL4QRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/action/storage_attestation","attest_author":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/action/author_attestation","sign_citation":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/action/citation_signature","submit_replication":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/action/replication_record"}},"created_at":"2026-07-05T10:23:13.525516+00:00","updated_at":"2026-07-05T10:23:13.525516+00:00"}