{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:O4HBVJF6XRUB3XX3CJZ5IJ6JNT","short_pith_number":"pith:O4HBVJF6","schema_version":"1.0","canonical_sha256":"770e1aa4bebc681ddefb1273d427c96cfdf682868cbd7d07893b887e78426ffe","source":{"kind":"arxiv","id":"1908.02947","version":1},"attestation_state":"computed","paper":{"title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ryan Wright, Sourav Mukherjee, Tim Oates","submitted_at":"2019-08-08T06:45:05Z","abstract_excerpt":"The recent proliferation of publicly available graph-structured data has sparked an interest in machine learning algorithms for graph data. Since most traditional machine learning algorithms assume data to be tabular, embedding algorithms for mapping graph data to real-valued vector spaces has become an active area of research. Existing graph embedding approaches are based purely on structural information and ignore any semantic information from the underlying domain. In this paper, we demonstrate that semantic information can play a useful role in computing graph embeddings. Specifically, we "},"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":"1908.02947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-08T06:45:05Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"95273b34598df2d5181e831ef1c45645278d918dc99adf5458312d40af5f1fde","abstract_canon_sha256":"51630118e948a10f2fa0ee1f79877373c854a0a6b7c4421124e03a6d61a5c0a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:25.223770Z","signature_b64":"Cdb0nNNUh4wgLY7wl4HBTNLOcNEmVBywIKB8RdSoCmPakkO594WymMRvffPWOSfFLUkJfRkuG0GsIDQpTEfSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"770e1aa4bebc681ddefb1273d427c96cfdf682868cbd7d07893b887e78426ffe","last_reissued_at":"2026-07-04T23:52:25.223402Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:25.223402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Node Embeddings using Domain-Aware Biased Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ryan Wright, Sourav Mukherjee, Tim Oates","submitted_at":"2019-08-08T06:45:05Z","abstract_excerpt":"The recent proliferation of publicly available graph-structured data has sparked an interest in machine learning algorithms for graph data. Since most traditional machine learning algorithms assume data to be tabular, embedding algorithms for mapping graph data to real-valued vector spaces has become an active area of research. Existing graph embedding approaches are based purely on structural information and ignore any semantic information from the underlying domain. In this paper, we demonstrate that semantic information can play a useful role in computing graph embeddings. Specifically, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02947","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/1908.02947/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":"1908.02947","created_at":"2026-07-04T23:52:25.223459+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02947v1","created_at":"2026-07-04T23:52:25.223459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02947","created_at":"2026-07-04T23:52:25.223459+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4HBVJF6XRUB","created_at":"2026-07-04T23:52:25.223459+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4HBVJF6XRUB3XX3","created_at":"2026-07-04T23:52:25.223459+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4HBVJF6","created_at":"2026-07-04T23:52:25.223459+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/O4HBVJF6XRUB3XX3CJZ5IJ6JNT","json":"https://pith.science/pith/O4HBVJF6XRUB3XX3CJZ5IJ6JNT.json","graph_json":"https://pith.science/api/pith-number/O4HBVJF6XRUB3XX3CJZ5IJ6JNT/graph.json","events_json":"https://pith.science/api/pith-number/O4HBVJF6XRUB3XX3CJZ5IJ6JNT/events.json","paper":"https://pith.science/paper/O4HBVJF6"},"agent_actions":{"view_html":"https://pith.science/pith/O4HBVJF6XRUB3XX3CJZ5IJ6JNT","download_json":"https://pith.science/pith/O4HBVJF6XRUB3XX3CJZ5IJ6JNT.json","view_paper":"https://pith.science/paper/O4HBVJF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02947&json=true","fetch_graph":"https://pith.science/api/pith-number/O4HBVJF6XRUB3XX3CJZ5IJ6JNT/graph.json","fetch_events":"https://pith.science/api/pith-number/O4HBVJF6XRUB3XX3CJZ5IJ6JNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4HBVJF6XRUB3XX3CJZ5IJ6JNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4HBVJF6XRUB3XX3CJZ5IJ6JNT/action/storage_attestation","attest_author":"https://pith.science/pith/O4HBVJF6XRUB3XX3CJZ5IJ6JNT/action/author_attestation","sign_citation":"https://pith.science/pith/O4HBVJF6XRUB3XX3CJZ5IJ6JNT/action/citation_signature","submit_replication":"https://pith.science/pith/O4HBVJF6XRUB3XX3CJZ5IJ6JNT/action/replication_record"}},"created_at":"2026-07-04T23:52:25.223459+00:00","updated_at":"2026-07-04T23:52:25.223459+00:00"}