{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:46QYKHTDV5LSCVQSGGX5LXI3WW","short_pith_number":"pith:46QYKHTD","schema_version":"1.0","canonical_sha256":"e7a1851e63af5721561231afd5dd1bb5b0fa61a4d8476db750e5ec3b48d23808","source":{"kind":"arxiv","id":"2607.10074","version":1},"attestation_state":"computed","paper":{"title":"Distance-Preserving Embeddings in Inhomogeneous Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Luana Ruiz, My Le, Souvik Dhara","submitted_at":"2026-07-11T01:59:00Z","abstract_excerpt":"Graph machine learning provides powerful tools for understanding complex networks and learning meaningful node representations. A central challenge, however, is designing embeddings with minimal distortion of both local and global functionals, such as shortest path lengths. Prior distortion guarantees for distance-preserving embeddings are worst-case in nature, producing overly pessimistic bounds that fail to capture the structure of typical large-scale networks. To address this, we analyze shortest-path approximation via landmark-based embeddings on inhomogeneous random graphs, a general mode"},"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":"2607.10074","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-11T01:59:00Z","cross_cats_sorted":[],"title_canon_sha256":"5771693031ad0838c2f2bc65d5d419e78945b5d1c0be06deb8abdf7133e0d06e","abstract_canon_sha256":"78cd36983037c2c22aad847222f23725b4596bdfd5a6daa87a7fc00befbd8788"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T00:18:50.507631Z","signature_b64":"nG6l/MLSTfvUl5JhNZkjdxK5Gg8MOzsrH5MhXFTLgzSv/VOfrJsyUGwWPpOVi8iPUKSlBAWyJbrws5NG6k1vAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7a1851e63af5721561231afd5dd1bb5b0fa61a4d8476db750e5ec3b48d23808","last_reissued_at":"2026-07-14T00:18:50.506850Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T00:18:50.506850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance-Preserving Embeddings in Inhomogeneous Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Luana Ruiz, My Le, Souvik Dhara","submitted_at":"2026-07-11T01:59:00Z","abstract_excerpt":"Graph machine learning provides powerful tools for understanding complex networks and learning meaningful node representations. A central challenge, however, is designing embeddings with minimal distortion of both local and global functionals, such as shortest path lengths. Prior distortion guarantees for distance-preserving embeddings are worst-case in nature, producing overly pessimistic bounds that fail to capture the structure of typical large-scale networks. To address this, we analyze shortest-path approximation via landmark-based embeddings on inhomogeneous random graphs, a general mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10074","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/2607.10074/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":"2607.10074","created_at":"2026-07-14T00:18:50.507271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10074v1","created_at":"2026-07-14T00:18:50.507271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10074","created_at":"2026-07-14T00:18:50.507271+00:00"},{"alias_kind":"pith_short_12","alias_value":"46QYKHTDV5LS","created_at":"2026-07-14T00:18:50.507271+00:00"},{"alias_kind":"pith_short_16","alias_value":"46QYKHTDV5LSCVQS","created_at":"2026-07-14T00:18:50.507271+00:00"},{"alias_kind":"pith_short_8","alias_value":"46QYKHTD","created_at":"2026-07-14T00:18:50.507271+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/46QYKHTDV5LSCVQSGGX5LXI3WW","json":"https://pith.science/pith/46QYKHTDV5LSCVQSGGX5LXI3WW.json","graph_json":"https://pith.science/api/pith-number/46QYKHTDV5LSCVQSGGX5LXI3WW/graph.json","events_json":"https://pith.science/api/pith-number/46QYKHTDV5LSCVQSGGX5LXI3WW/events.json","paper":"https://pith.science/paper/46QYKHTD"},"agent_actions":{"view_html":"https://pith.science/pith/46QYKHTDV5LSCVQSGGX5LXI3WW","download_json":"https://pith.science/pith/46QYKHTDV5LSCVQSGGX5LXI3WW.json","view_paper":"https://pith.science/paper/46QYKHTD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10074&json=true","fetch_graph":"https://pith.science/api/pith-number/46QYKHTDV5LSCVQSGGX5LXI3WW/graph.json","fetch_events":"https://pith.science/api/pith-number/46QYKHTDV5LSCVQSGGX5LXI3WW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/46QYKHTDV5LSCVQSGGX5LXI3WW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/46QYKHTDV5LSCVQSGGX5LXI3WW/action/storage_attestation","attest_author":"https://pith.science/pith/46QYKHTDV5LSCVQSGGX5LXI3WW/action/author_attestation","sign_citation":"https://pith.science/pith/46QYKHTDV5LSCVQSGGX5LXI3WW/action/citation_signature","submit_replication":"https://pith.science/pith/46QYKHTDV5LSCVQSGGX5LXI3WW/action/replication_record"}},"created_at":"2026-07-14T00:18:50.507271+00:00","updated_at":"2026-07-14T00:18:50.507271+00:00"}