{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5CWRWE3BAMRR5GQOHHLGOL4QRC","short_pith_number":"pith:5CWRWE3B","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"},"canonical_sha256":"e8ad1b136103231e9a0e39d6672f90888145ce92c8c59e2ab028f92444171691","source":{"kind":"arxiv","id":"2503.01723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.01723","created_at":"2026-07-05T10:23:13Z"},{"alias_kind":"arxiv_version","alias_value":"2503.01723v1","created_at":"2026-07-05T10:23:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01723","created_at":"2026-07-05T10:23:13Z"},{"alias_kind":"pith_short_12","alias_value":"5CWRWE3BAMRR","created_at":"2026-07-05T10:23:13Z"},{"alias_kind":"pith_short_16","alias_value":"5CWRWE3BAMRR5GQO","created_at":"2026-07-05T10:23:13Z"},{"alias_kind":"pith_short_8","alias_value":"5CWRWE3B","created_at":"2026-07-05T10:23:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5CWRWE3BAMRR5GQOHHLGOL4QRC","target":"record","payload":{"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"},"canonical_sha256":"e8ad1b136103231e9a0e39d6672f90888145ce92c8c59e2ab028f92444171691","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"},"source_kind":"arxiv","source_id":"2503.01723","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-07-05T10:23:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOYIy5+XKSl/ztuXViipVlPHMrlZng++8lf+0IY/9JMdn4JhCGVcqhCFgaNcqOVml7mQwzlKS77wIp4Vtl3gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T13:49:48.369175Z"},"content_sha256":"ca7c00f716563c34cbe2cf4a7e5b897e19ffd1381efe820155237c3793fea659","schema_version":"1.0","event_id":"sha256:ca7c00f716563c34cbe2cf4a7e5b897e19ffd1381efe820155237c3793fea659"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5CWRWE3BAMRR5GQOHHLGOL4QRC","target":"graph","payload":{"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"},"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-05T10:23:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9Yb/DX+4vXZ8bY0J+mR8GumsRNSIvsXpj6YA4Ty6V5xaDQsqR17kWmOiDV1ZYQTQhDRa5J30oPHom4tZfktCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T13:49:48.369705Z"},"content_sha256":"d0e9c255db6a14b97c3059562d6d281d3c55e61ea0f1289eb41aee20624de97d","schema_version":"1.0","event_id":"sha256:d0e9c255db6a14b97c3059562d6d281d3c55e61ea0f1289eb41aee20624de97d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/bundle.json","state_url":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/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-20T13:49:48Z","links":{"resolver":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC","bundle":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/bundle.json","state":"https://pith.science/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CWRWE3BAMRR5GQOHHLGOL4QRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5CWRWE3BAMRR5GQOHHLGOL4QRC","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":"1aeee57cfff8bfd021b95194ddb96797aec51979d18d62878613c1d05aeba3ca","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-03T16:37:38Z","title_canon_sha256":"c4245ab7d908eb659aca8c67a7f164671ab76572d405c1011db99a10c76c970c"},"schema_version":"1.0","source":{"id":"2503.01723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.01723","created_at":"2026-07-05T10:23:13Z"},{"alias_kind":"arxiv_version","alias_value":"2503.01723v1","created_at":"2026-07-05T10:23:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01723","created_at":"2026-07-05T10:23:13Z"},{"alias_kind":"pith_short_12","alias_value":"5CWRWE3BAMRR","created_at":"2026-07-05T10:23:13Z"},{"alias_kind":"pith_short_16","alias_value":"5CWRWE3BAMRR5GQO","created_at":"2026-07-05T10:23:13Z"},{"alias_kind":"pith_short_8","alias_value":"5CWRWE3B","created_at":"2026-07-05T10:23:13Z"}],"graph_snapshots":[{"event_id":"sha256:d0e9c255db6a14b97c3059562d6d281d3c55e61ea0f1289eb41aee20624de97d","target":"graph","created_at":"2026-07-05T10:23:13Z","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/2503.01723/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andreas Lyhne Fiehn, Morten M{\\o}rup, Niels Raunkj{\\ae}r Holm, Nikolaos Nakis","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-03T16:37:38Z","title":"How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01723","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:ca7c00f716563c34cbe2cf4a7e5b897e19ffd1381efe820155237c3793fea659","target":"record","created_at":"2026-07-05T10:23:13Z","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":"1aeee57cfff8bfd021b95194ddb96797aec51979d18d62878613c1d05aeba3ca","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-03T16:37:38Z","title_canon_sha256":"c4245ab7d908eb659aca8c67a7f164671ab76572d405c1011db99a10c76c970c"},"schema_version":"1.0","source":{"id":"2503.01723","kind":"arxiv","version":1}},"canonical_sha256":"e8ad1b136103231e9a0e39d6672f90888145ce92c8c59e2ab028f92444171691","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8ad1b136103231e9a0e39d6672f90888145ce92c8c59e2ab028f92444171691","first_computed_at":"2026-07-05T10:23:13.525405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:23:13.525405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jYZYe4U0tXcxYAhZCC4HP1e55GOFisWwsRNn5SZU8LEx/1876T1IlKcZE795w4mRckfBjuJ+HsqC7+S1h/HADw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:23:13.526286Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.01723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca7c00f716563c34cbe2cf4a7e5b897e19ffd1381efe820155237c3793fea659","sha256:d0e9c255db6a14b97c3059562d6d281d3c55e61ea0f1289eb41aee20624de97d"],"state_sha256":"e937ecc2141c19f0717b3467784b718ac97ec141b142fc074c3b27261aae63b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8iWDrfkyiJ8inuDvjs8xlgM/if/STFZCn94TRlS11oL9LUiX6BzglRNXpKidDVRwbuBkDPV2yHMknv0x1U3PDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T13:49:48.376592Z","bundle_sha256":"9ffc5829c7afc0d7b7c2f764606fb2539b6db0d10392248e250f0d3e9a0687ba"}}