{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LG52WBGBWTB7GCCAXEVXWWNL5L","short_pith_number":"pith:LG52WBGB","schema_version":"1.0","canonical_sha256":"59bbab04c1b4c3f30840b92b7b59abeadfd8cedb7f39159513238a4c45864163","source":{"kind":"arxiv","id":"1710.09471","version":2},"attestation_state":"computed","paper":{"title":"Inductive Representation Learning in Large Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Hoda Eldardiry, John Boaz Lee, Nesreen K. Ahmed, Rong Zhou, Ryan A. Rossi, Theodore L. Willke, Xiangnan Kong","submitted_at":"2017-10-25T21:40:57Z","abstract_excerpt":"Graphs (networks) are ubiquitous and allow us to model entities (nodes) and the dependencies (edges) between them. Learning a useful feature representation from graph data lies at the heart and success of many machine learning tasks such as classification, anomaly detection, link prediction, among many others. Many existing techniques use random walks as a basis for learning features or estimating the parameters of a graph model for a downstream prediction task. Examples include recent node embedding methods such as DeepWalk, node2vec, as well as graph-based deep learning algorithms. However, "},"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":"1710.09471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-25T21:40:57Z","cross_cats_sorted":["cs.AI","cs.LG","cs.SI"],"title_canon_sha256":"2aad1f463d568d3606f92b8eae9fee493d361701608677f9b37ec1193f8be319","abstract_canon_sha256":"f95b0759ac8d94ef7960b0f94da932108a359dc559a6f0b0ac71bb195176a381"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:45.372088Z","signature_b64":"M/BYS06aSY1+822t6ldSftYMtA4I7Vxl7R1KMDXcLPJcafhf8XnBrk7xDV7WQiEI4BDoEf0SmO2zD+ht1rMXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59bbab04c1b4c3f30840b92b7b59abeadfd8cedb7f39159513238a4c45864163","last_reissued_at":"2026-05-18T00:29:45.371622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:45.371622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inductive Representation Learning in Large Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Hoda Eldardiry, John Boaz Lee, Nesreen K. Ahmed, Rong Zhou, Ryan A. Rossi, Theodore L. Willke, Xiangnan Kong","submitted_at":"2017-10-25T21:40:57Z","abstract_excerpt":"Graphs (networks) are ubiquitous and allow us to model entities (nodes) and the dependencies (edges) between them. Learning a useful feature representation from graph data lies at the heart and success of many machine learning tasks such as classification, anomaly detection, link prediction, among many others. Many existing techniques use random walks as a basis for learning features or estimating the parameters of a graph model for a downstream prediction task. Examples include recent node embedding methods such as DeepWalk, node2vec, as well as graph-based deep learning algorithms. However, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09471","kind":"arxiv","version":2},"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":"1710.09471","created_at":"2026-05-18T00:29:45.371700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09471v2","created_at":"2026-05-18T00:29:45.371700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09471","created_at":"2026-05-18T00:29:45.371700+00:00"},{"alias_kind":"pith_short_12","alias_value":"LG52WBGBWTB7","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LG52WBGBWTB7GCCA","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LG52WBGB","created_at":"2026-05-18T12:31:28.150371+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/LG52WBGBWTB7GCCAXEVXWWNL5L","json":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L.json","graph_json":"https://pith.science/api/pith-number/LG52WBGBWTB7GCCAXEVXWWNL5L/graph.json","events_json":"https://pith.science/api/pith-number/LG52WBGBWTB7GCCAXEVXWWNL5L/events.json","paper":"https://pith.science/paper/LG52WBGB"},"agent_actions":{"view_html":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L","download_json":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L.json","view_paper":"https://pith.science/paper/LG52WBGB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09471&json=true","fetch_graph":"https://pith.science/api/pith-number/LG52WBGBWTB7GCCAXEVXWWNL5L/graph.json","fetch_events":"https://pith.science/api/pith-number/LG52WBGBWTB7GCCAXEVXWWNL5L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/action/storage_attestation","attest_author":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/action/author_attestation","sign_citation":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/action/citation_signature","submit_replication":"https://pith.science/pith/LG52WBGBWTB7GCCAXEVXWWNL5L/action/replication_record"}},"created_at":"2026-05-18T00:29:45.371700+00:00","updated_at":"2026-05-18T00:29:45.371700+00:00"}