{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HXSASVIK26BNHKKTGZTFAPSKDZ","short_pith_number":"pith:HXSASVIK","schema_version":"1.0","canonical_sha256":"3de409550ad782d3a9533666503e4a1e7c6ce87934ba4fb0071fbdd0d57bafe9","source":{"kind":"arxiv","id":"1904.01098","version":2},"attestation_state":"computed","paper":{"title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Agustin Marinovic, Hao Ding, Ken Gu, Ting Chen, Wei Wang, Yang Qiao, Yizhou Sun, Yunsheng Bai","submitted_at":"2019-04-01T20:33:27Z","abstract_excerpt":"We introduce a novel approach to graph-level representation learning, which is to embed an entire graph into a vector space where the embeddings of two graphs preserve their graph-graph proximity. Our approach, UGRAPHEMB, is a general framework that provides a novel means to performing graph-level embedding in a completely unsupervised and inductive manner. The learned neural network can be considered as a function that receives any graph as input, either seen or unseen in the training set, and transforms it into an embedding. A novel graph-level embedding generation mechanism called Multi-Sca"},"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":"1904.01098","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-01T20:33:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8c50dece98ef5cff4827d58184ee392ce0e1ff7111642c227f000b4a4c65cd6c","abstract_canon_sha256":"1a42e8c1b2682593ada5b60bccea3b7e206d0542ef5d8b08ffa749a5b86a555d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:28.852597Z","signature_b64":"19FWKfZvzt4h7YSbVjftmqiXYLAaJ3ezyJlCdoI7I+A0aGKPB9uoPkFGtAP2LR8QoobpL+W5PwhjGvgc/4AoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3de409550ad782d3a9533666503e4a1e7c6ce87934ba4fb0071fbdd0d57bafe9","last_reissued_at":"2026-05-17T23:44:28.852134Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:28.852134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Agustin Marinovic, Hao Ding, Ken Gu, Ting Chen, Wei Wang, Yang Qiao, Yizhou Sun, Yunsheng Bai","submitted_at":"2019-04-01T20:33:27Z","abstract_excerpt":"We introduce a novel approach to graph-level representation learning, which is to embed an entire graph into a vector space where the embeddings of two graphs preserve their graph-graph proximity. Our approach, UGRAPHEMB, is a general framework that provides a novel means to performing graph-level embedding in a completely unsupervised and inductive manner. The learned neural network can be considered as a function that receives any graph as input, either seen or unseen in the training set, and transforms it into an embedding. A novel graph-level embedding generation mechanism called Multi-Sca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01098","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":"1904.01098","created_at":"2026-05-17T23:44:28.852201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.01098v2","created_at":"2026-05-17T23:44:28.852201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01098","created_at":"2026-05-17T23:44:28.852201+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXSASVIK26BN","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXSASVIK26BNHKKT","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXSASVIK","created_at":"2026-05-18T12:33:18.533446+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/HXSASVIK26BNHKKTGZTFAPSKDZ","json":"https://pith.science/pith/HXSASVIK26BNHKKTGZTFAPSKDZ.json","graph_json":"https://pith.science/api/pith-number/HXSASVIK26BNHKKTGZTFAPSKDZ/graph.json","events_json":"https://pith.science/api/pith-number/HXSASVIK26BNHKKTGZTFAPSKDZ/events.json","paper":"https://pith.science/paper/HXSASVIK"},"agent_actions":{"view_html":"https://pith.science/pith/HXSASVIK26BNHKKTGZTFAPSKDZ","download_json":"https://pith.science/pith/HXSASVIK26BNHKKTGZTFAPSKDZ.json","view_paper":"https://pith.science/paper/HXSASVIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.01098&json=true","fetch_graph":"https://pith.science/api/pith-number/HXSASVIK26BNHKKTGZTFAPSKDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HXSASVIK26BNHKKTGZTFAPSKDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXSASVIK26BNHKKTGZTFAPSKDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXSASVIK26BNHKKTGZTFAPSKDZ/action/storage_attestation","attest_author":"https://pith.science/pith/HXSASVIK26BNHKKTGZTFAPSKDZ/action/author_attestation","sign_citation":"https://pith.science/pith/HXSASVIK26BNHKKTGZTFAPSKDZ/action/citation_signature","submit_replication":"https://pith.science/pith/HXSASVIK26BNHKKTGZTFAPSKDZ/action/replication_record"}},"created_at":"2026-05-17T23:44:28.852201+00:00","updated_at":"2026-05-17T23:44:28.852201+00:00"}