{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DRD5OFREXQYYCQ4Y2ACIGLQ2XS","short_pith_number":"pith:DRD5OFRE","schema_version":"1.0","canonical_sha256":"1c47d71624bc31814398d004832e1abc8486c3c88e286a17fd66158755be29e3","source":{"kind":"arxiv","id":"1805.11921","version":3},"attestation_state":"computed","paper":{"title":"Anonymous Walk Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Evgeny Burnaev, Sergey Ivanov","submitted_at":"2018-05-30T12:43:47Z","abstract_excerpt":"The task of representing entire graphs has seen a surge of prominent results, mainly due to learning convolutional neural networks (CNNs) on graph-structured data. While CNNs demonstrate state-of-the-art performance in graph classification task, such methods are supervised and therefore steer away from the original problem of network representation in task-agnostic manner. Here, we coherently propose an approach for embedding entire graphs and show that our feature representations with SVM classifier increase classification accuracy of CNN algorithms and traditional graph kernels. For this 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":"1805.11921","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-30T12:43:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2706edc5fb4bd61424d6be24234ad64949d0f942f18b667df16e2e95a408a17a","abstract_canon_sha256":"fdcb5a4c33ab2072092a16d42484346d2650c04e3fb16a1650b701207b656bd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:50.409762Z","signature_b64":"YGKV7gLBWb3wKs6RjuVHcMtNjZAJuHooHKA8IrlH4SeeozlQo6ng5dGfC9sNTlN7OpB4NsDtbURukrD2zWuhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c47d71624bc31814398d004832e1abc8486c3c88e286a17fd66158755be29e3","last_reissued_at":"2026-05-18T00:13:50.408917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:50.408917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anonymous Walk Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Evgeny Burnaev, Sergey Ivanov","submitted_at":"2018-05-30T12:43:47Z","abstract_excerpt":"The task of representing entire graphs has seen a surge of prominent results, mainly due to learning convolutional neural networks (CNNs) on graph-structured data. While CNNs demonstrate state-of-the-art performance in graph classification task, such methods are supervised and therefore steer away from the original problem of network representation in task-agnostic manner. Here, we coherently propose an approach for embedding entire graphs and show that our feature representations with SVM classifier increase classification accuracy of CNN algorithms and traditional graph kernels. For this we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11921","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.11921","created_at":"2026-05-18T00:13:50.409092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11921v3","created_at":"2026-05-18T00:13:50.409092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11921","created_at":"2026-05-18T00:13:50.409092+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRD5OFREXQYY","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRD5OFREXQYYCQ4Y","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRD5OFRE","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.01484","citing_title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DRD5OFREXQYYCQ4Y2ACIGLQ2XS","json":"https://pith.science/pith/DRD5OFREXQYYCQ4Y2ACIGLQ2XS.json","graph_json":"https://pith.science/api/pith-number/DRD5OFREXQYYCQ4Y2ACIGLQ2XS/graph.json","events_json":"https://pith.science/api/pith-number/DRD5OFREXQYYCQ4Y2ACIGLQ2XS/events.json","paper":"https://pith.science/paper/DRD5OFRE"},"agent_actions":{"view_html":"https://pith.science/pith/DRD5OFREXQYYCQ4Y2ACIGLQ2XS","download_json":"https://pith.science/pith/DRD5OFREXQYYCQ4Y2ACIGLQ2XS.json","view_paper":"https://pith.science/paper/DRD5OFRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11921&json=true","fetch_graph":"https://pith.science/api/pith-number/DRD5OFREXQYYCQ4Y2ACIGLQ2XS/graph.json","fetch_events":"https://pith.science/api/pith-number/DRD5OFREXQYYCQ4Y2ACIGLQ2XS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRD5OFREXQYYCQ4Y2ACIGLQ2XS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRD5OFREXQYYCQ4Y2ACIGLQ2XS/action/storage_attestation","attest_author":"https://pith.science/pith/DRD5OFREXQYYCQ4Y2ACIGLQ2XS/action/author_attestation","sign_citation":"https://pith.science/pith/DRD5OFREXQYYCQ4Y2ACIGLQ2XS/action/citation_signature","submit_replication":"https://pith.science/pith/DRD5OFREXQYYCQ4Y2ACIGLQ2XS/action/replication_record"}},"created_at":"2026-05-18T00:13:50.409092+00:00","updated_at":"2026-05-18T00:13:50.409092+00:00"}