{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4DPKE7O2W5QX6XKICT5HR6PAB6","short_pith_number":"pith:4DPKE7O2","schema_version":"1.0","canonical_sha256":"e0dea27ddab7617f5d4814fa78f9e00fa4082ad02ac390e6fc667798010d1dea","source":{"kind":"arxiv","id":"1805.07544","version":3},"attestation_state":"computed","paper":{"title":"Conditional Network Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Bo Kang, Jefrey Lijffijt, Tijl De Bie","submitted_at":"2018-05-19T08:12:29Z","abstract_excerpt":"Network Embeddings (NEs) map the nodes of a given network into $d$-dimensional Euclidean space $\\mathbb{R}^d$. Ideally, this mapping is such that `similar' nodes are mapped onto nearby points, such that the NE can be used for purposes such as link prediction (if `similar' means being `more likely to be connected') or classification (if `similar' means `being more likely to have the same label'). In recent years various methods for NE have been introduced, all following a similar strategy: defining a notion of similarity between nodes (typically some distance measure within the network), a dist"},"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":"1805.07544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-19T08:12:29Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"7eb20ef25f4c3746ac04bf35b391b2529b5ed25f4ab71b7125590c1a5e41a551","abstract_canon_sha256":"1d3d7a4068523ba76fb0d0d734a221a94ebe6aaf7091835bffb28c32ca40fd2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:16.483031Z","signature_b64":"vBaMPIrxtli7HrAkau2qrTskqNmJR73OVo+jTNAFAUmjXiDkoIEH+IlDazTUmZMvMHz1kAo4bmsufvLvJ5nmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0dea27ddab7617f5d4814fa78f9e00fa4082ad02ac390e6fc667798010d1dea","last_reissued_at":"2026-05-18T00:03:16.482310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:16.482310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Network Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Bo Kang, Jefrey Lijffijt, Tijl De Bie","submitted_at":"2018-05-19T08:12:29Z","abstract_excerpt":"Network Embeddings (NEs) map the nodes of a given network into $d$-dimensional Euclidean space $\\mathbb{R}^d$. Ideally, this mapping is such that `similar' nodes are mapped onto nearby points, such that the NE can be used for purposes such as link prediction (if `similar' means being `more likely to be connected') or classification (if `similar' means `being more likely to have the same label'). In recent years various methods for NE have been introduced, all following a similar strategy: defining a notion of similarity between nodes (typically some distance measure within the network), a dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07544","kind":"arxiv","version":3},"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":"1805.07544","created_at":"2026-05-18T00:03:16.482426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07544v3","created_at":"2026-05-18T00:03:16.482426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07544","created_at":"2026-05-18T00:03:16.482426+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DPKE7O2W5QX","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DPKE7O2W5QX6XKI","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DPKE7O2","created_at":"2026-05-18T12:32:05.422762+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/4DPKE7O2W5QX6XKICT5HR6PAB6","json":"https://pith.science/pith/4DPKE7O2W5QX6XKICT5HR6PAB6.json","graph_json":"https://pith.science/api/pith-number/4DPKE7O2W5QX6XKICT5HR6PAB6/graph.json","events_json":"https://pith.science/api/pith-number/4DPKE7O2W5QX6XKICT5HR6PAB6/events.json","paper":"https://pith.science/paper/4DPKE7O2"},"agent_actions":{"view_html":"https://pith.science/pith/4DPKE7O2W5QX6XKICT5HR6PAB6","download_json":"https://pith.science/pith/4DPKE7O2W5QX6XKICT5HR6PAB6.json","view_paper":"https://pith.science/paper/4DPKE7O2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07544&json=true","fetch_graph":"https://pith.science/api/pith-number/4DPKE7O2W5QX6XKICT5HR6PAB6/graph.json","fetch_events":"https://pith.science/api/pith-number/4DPKE7O2W5QX6XKICT5HR6PAB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DPKE7O2W5QX6XKICT5HR6PAB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DPKE7O2W5QX6XKICT5HR6PAB6/action/storage_attestation","attest_author":"https://pith.science/pith/4DPKE7O2W5QX6XKICT5HR6PAB6/action/author_attestation","sign_citation":"https://pith.science/pith/4DPKE7O2W5QX6XKICT5HR6PAB6/action/citation_signature","submit_replication":"https://pith.science/pith/4DPKE7O2W5QX6XKICT5HR6PAB6/action/replication_record"}},"created_at":"2026-05-18T00:03:16.482426+00:00","updated_at":"2026-05-18T00:03:16.482426+00:00"}