{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RU2CHVW3IIQJH3NIUWY7BOFOVS","short_pith_number":"pith:RU2CHVW3","schema_version":"1.0","canonical_sha256":"8d3423d6db422093eda8a5b1f0b8aeaca3ab5e2216d0c583b88ee3fd99cc7a8b","source":{"kind":"arxiv","id":"1904.10814","version":1},"attestation_state":"computed","paper":{"title":"Mercator: uncovering faithful hyperbolic embeddings of complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Antoine Allard, Guillermo Garc\\'ia-P\\'erez, M. \\'Angeles Serrano, Mari\\'an Bogu\\~n\\'a","submitted_at":"2019-04-24T13:39:17Z","abstract_excerpt":"We introduce Mercator, a reliable embedding method to map real complex networks into their hyperbolic latent geometry. The method assumes that the structure of networks is well described by the Popularity$\\times$Similarity $\\mathbb{S}^1/\\mathbb{H}^2$ static geometric network model, which can accommodate arbitrary degree distributions and reproduces many pivotal properties of real networks, including self-similarity patterns. The algorithm mixes machine learning and maximum likelihood approaches to infer the coordinates of the nodes in the underlying hyperbolic disk with the best matching betwe"},"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":"1904.10814","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2019-04-24T13:39:17Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"79804f15dd9df48875faf965f70ac9c5b2bd6a5593f72706e22dd7df9d5810f1","abstract_canon_sha256":"14aad5be9241ab898411058bb4d16e146604f57da5bd8679222813c4af44c67b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:49.947231Z","signature_b64":"pvlJeDN/cAYFpYgfhe8T64L7SF8EN7czqf6WYgtuRSCR/SXxQ7hTjichxqtJ9Pfr51Wqvr0RC1Ns9Apq6TtVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d3423d6db422093eda8a5b1f0b8aeaca3ab5e2216d0c583b88ee3fd99cc7a8b","last_reissued_at":"2026-05-17T23:47:49.946630Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:49.946630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mercator: uncovering faithful hyperbolic embeddings of complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Antoine Allard, Guillermo Garc\\'ia-P\\'erez, M. \\'Angeles Serrano, Mari\\'an Bogu\\~n\\'a","submitted_at":"2019-04-24T13:39:17Z","abstract_excerpt":"We introduce Mercator, a reliable embedding method to map real complex networks into their hyperbolic latent geometry. The method assumes that the structure of networks is well described by the Popularity$\\times$Similarity $\\mathbb{S}^1/\\mathbb{H}^2$ static geometric network model, which can accommodate arbitrary degree distributions and reproduces many pivotal properties of real networks, including self-similarity patterns. The algorithm mixes machine learning and maximum likelihood approaches to infer the coordinates of the nodes in the underlying hyperbolic disk with the best matching betwe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10814","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.10814","created_at":"2026-05-17T23:47:49.946723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10814v1","created_at":"2026-05-17T23:47:49.946723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10814","created_at":"2026-05-17T23:47:49.946723+00:00"},{"alias_kind":"pith_short_12","alias_value":"RU2CHVW3IIQJ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RU2CHVW3IIQJH3NI","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RU2CHVW3","created_at":"2026-05-18T12:33:27.125529+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/RU2CHVW3IIQJH3NIUWY7BOFOVS","json":"https://pith.science/pith/RU2CHVW3IIQJH3NIUWY7BOFOVS.json","graph_json":"https://pith.science/api/pith-number/RU2CHVW3IIQJH3NIUWY7BOFOVS/graph.json","events_json":"https://pith.science/api/pith-number/RU2CHVW3IIQJH3NIUWY7BOFOVS/events.json","paper":"https://pith.science/paper/RU2CHVW3"},"agent_actions":{"view_html":"https://pith.science/pith/RU2CHVW3IIQJH3NIUWY7BOFOVS","download_json":"https://pith.science/pith/RU2CHVW3IIQJH3NIUWY7BOFOVS.json","view_paper":"https://pith.science/paper/RU2CHVW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10814&json=true","fetch_graph":"https://pith.science/api/pith-number/RU2CHVW3IIQJH3NIUWY7BOFOVS/graph.json","fetch_events":"https://pith.science/api/pith-number/RU2CHVW3IIQJH3NIUWY7BOFOVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RU2CHVW3IIQJH3NIUWY7BOFOVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RU2CHVW3IIQJH3NIUWY7BOFOVS/action/storage_attestation","attest_author":"https://pith.science/pith/RU2CHVW3IIQJH3NIUWY7BOFOVS/action/author_attestation","sign_citation":"https://pith.science/pith/RU2CHVW3IIQJH3NIUWY7BOFOVS/action/citation_signature","submit_replication":"https://pith.science/pith/RU2CHVW3IIQJH3NIUWY7BOFOVS/action/replication_record"}},"created_at":"2026-05-17T23:47:49.946723+00:00","updated_at":"2026-05-17T23:47:49.946723+00:00"}