{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MLXYYUZAXUPF6WS5EOX6TYY7XW","short_pith_number":"pith:MLXYYUZA","schema_version":"1.0","canonical_sha256":"62ef8c5320bd1e5f5a5d23afe9e31fbdbdda8dbee338017a05c318e83261d169","source":{"kind":"arxiv","id":"1902.03964","version":6},"attestation_state":"computed","paper":{"title":"Deep Node Ranking for Neuro-symbolic Structural Node Embedding and Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bla\\v{z} \\v{S}krlj, Janez Konc, Jan Kralj, Marko Robnik-\\v{S}ikonja, Nada Lavra\\v{c}","submitted_at":"2019-02-11T16:13:11Z","abstract_excerpt":"Network node embedding is an active research subfield of complex network analysis. This paper contributes a novel approach to learning network node embeddings and direct node classification using a node ranking scheme coupled with an autoencoder-based neural network architecture. The main advantages of the proposed Deep Node Ranking (DNR) algorithm are competitive or better classification performance, significantly higher learning speed and lower space requirements when compared to state-of-the-art approaches on 15 real-life node classification benchmarks. Furthermore, it enables exploration o"},"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":"1902.03964","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T16:13:11Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"31a120f307faf83971c3725321e25ab2fcd36e36e87cb077fb6bb3475ab0361d","abstract_canon_sha256":"13612d5a8d4bf8fb609437fa18d02fff0e901a377a16486095fd27c298b18ebc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:13:19.559688Z","signature_b64":"d6zzXjQIAM+o8ZavJnrcnF80T+MbVsgLVyfCxSi52yVCIgQH0UNQK/qYXPq+9F1uexgjUPsmltewwUmyROMGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62ef8c5320bd1e5f5a5d23afe9e31fbdbdda8dbee338017a05c318e83261d169","last_reissued_at":"2026-07-05T03:13:19.559302Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:13:19.559302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Node Ranking for Neuro-symbolic Structural Node Embedding and Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bla\\v{z} \\v{S}krlj, Janez Konc, Jan Kralj, Marko Robnik-\\v{S}ikonja, Nada Lavra\\v{c}","submitted_at":"2019-02-11T16:13:11Z","abstract_excerpt":"Network node embedding is an active research subfield of complex network analysis. This paper contributes a novel approach to learning network node embeddings and direct node classification using a node ranking scheme coupled with an autoencoder-based neural network architecture. The main advantages of the proposed Deep Node Ranking (DNR) algorithm are competitive or better classification performance, significantly higher learning speed and lower space requirements when compared to state-of-the-art approaches on 15 real-life node classification benchmarks. Furthermore, it enables exploration o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03964","kind":"arxiv","version":6},"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/1902.03964/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":"1902.03964","created_at":"2026-07-05T03:13:19.559375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03964v6","created_at":"2026-07-05T03:13:19.559375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03964","created_at":"2026-07-05T03:13:19.559375+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLXYYUZAXUPF","created_at":"2026-07-05T03:13:19.559375+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLXYYUZAXUPF6WS5","created_at":"2026-07-05T03:13:19.559375+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLXYYUZA","created_at":"2026-07-05T03:13:19.559375+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/MLXYYUZAXUPF6WS5EOX6TYY7XW","json":"https://pith.science/pith/MLXYYUZAXUPF6WS5EOX6TYY7XW.json","graph_json":"https://pith.science/api/pith-number/MLXYYUZAXUPF6WS5EOX6TYY7XW/graph.json","events_json":"https://pith.science/api/pith-number/MLXYYUZAXUPF6WS5EOX6TYY7XW/events.json","paper":"https://pith.science/paper/MLXYYUZA"},"agent_actions":{"view_html":"https://pith.science/pith/MLXYYUZAXUPF6WS5EOX6TYY7XW","download_json":"https://pith.science/pith/MLXYYUZAXUPF6WS5EOX6TYY7XW.json","view_paper":"https://pith.science/paper/MLXYYUZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03964&json=true","fetch_graph":"https://pith.science/api/pith-number/MLXYYUZAXUPF6WS5EOX6TYY7XW/graph.json","fetch_events":"https://pith.science/api/pith-number/MLXYYUZAXUPF6WS5EOX6TYY7XW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLXYYUZAXUPF6WS5EOX6TYY7XW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLXYYUZAXUPF6WS5EOX6TYY7XW/action/storage_attestation","attest_author":"https://pith.science/pith/MLXYYUZAXUPF6WS5EOX6TYY7XW/action/author_attestation","sign_citation":"https://pith.science/pith/MLXYYUZAXUPF6WS5EOX6TYY7XW/action/citation_signature","submit_replication":"https://pith.science/pith/MLXYYUZAXUPF6WS5EOX6TYY7XW/action/replication_record"}},"created_at":"2026-07-05T03:13:19.559375+00:00","updated_at":"2026-07-05T03:13:19.559375+00:00"}