{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Z5WALXGZ4DSYESNNAXI3ABQU3U","short_pith_number":"pith:Z5WALXGZ","schema_version":"1.0","canonical_sha256":"cf6c05dcd9e0e58249ad05d1b00614dd075e6c31eb0bb66975cd311fe5776d45","source":{"kind":"arxiv","id":"2312.05519","version":1},"attestation_state":"computed","paper":{"title":"Isomorphic-Consistent Variational Graph Auto-Encoders for Multi-Level Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hanxuan Yang, Qingchao Kong, Wenji Mao","submitted_at":"2023-12-09T10:16:53Z","abstract_excerpt":"Graph representation learning is a fundamental research theme and can be generalized to benefit multiple downstream tasks from the node and link levels to the higher graph level. In practice, it is desirable to develop task-agnostic general graph representation learning methods that are typically trained in an unsupervised manner. Related research reveals that the power of graph representation learning methods depends on whether they can differentiate distinct graph structures as different embeddings and map isomorphic graphs to consistent embeddings (i.e., the isomorphic consistency of graph "},"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":"2312.05519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-12-09T10:16:53Z","cross_cats_sorted":[],"title_canon_sha256":"3602e1760ca543326fadb8bba2127395687f00bb0d6ea3f0d8d787013d347183","abstract_canon_sha256":"9e63b0a20c35b955a66afe64976b4a5a26131f0f022cb168c687e279406c0e5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:22:28.424909Z","signature_b64":"ax4bqLnHDCuP/0K2/OWr+pzlQR3/oDYbpMIhdVybAsiUeAZZNcp5Ya6nHtIm8F6poPYOSIBfJ9NZ8dBqMmX8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf6c05dcd9e0e58249ad05d1b00614dd075e6c31eb0bb66975cd311fe5776d45","last_reissued_at":"2026-07-05T07:22:28.424452Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:22:28.424452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Isomorphic-Consistent Variational Graph Auto-Encoders for Multi-Level Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hanxuan Yang, Qingchao Kong, Wenji Mao","submitted_at":"2023-12-09T10:16:53Z","abstract_excerpt":"Graph representation learning is a fundamental research theme and can be generalized to benefit multiple downstream tasks from the node and link levels to the higher graph level. In practice, it is desirable to develop task-agnostic general graph representation learning methods that are typically trained in an unsupervised manner. Related research reveals that the power of graph representation learning methods depends on whether they can differentiate distinct graph structures as different embeddings and map isomorphic graphs to consistent embeddings (i.e., the isomorphic consistency of graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05519","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/2312.05519/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":"2312.05519","created_at":"2026-07-05T07:22:28.424515+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.05519v1","created_at":"2026-07-05T07:22:28.424515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05519","created_at":"2026-07-05T07:22:28.424515+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5WALXGZ4DSY","created_at":"2026-07-05T07:22:28.424515+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5WALXGZ4DSYESNN","created_at":"2026-07-05T07:22:28.424515+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5WALXGZ","created_at":"2026-07-05T07:22:28.424515+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.14114","citing_title":"Evaluating Loss Functions for Graph Neural Networks: Towards Pretraining and Generalization","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z5WALXGZ4DSYESNNAXI3ABQU3U","json":"https://pith.science/pith/Z5WALXGZ4DSYESNNAXI3ABQU3U.json","graph_json":"https://pith.science/api/pith-number/Z5WALXGZ4DSYESNNAXI3ABQU3U/graph.json","events_json":"https://pith.science/api/pith-number/Z5WALXGZ4DSYESNNAXI3ABQU3U/events.json","paper":"https://pith.science/paper/Z5WALXGZ"},"agent_actions":{"view_html":"https://pith.science/pith/Z5WALXGZ4DSYESNNAXI3ABQU3U","download_json":"https://pith.science/pith/Z5WALXGZ4DSYESNNAXI3ABQU3U.json","view_paper":"https://pith.science/paper/Z5WALXGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.05519&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5WALXGZ4DSYESNNAXI3ABQU3U/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5WALXGZ4DSYESNNAXI3ABQU3U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5WALXGZ4DSYESNNAXI3ABQU3U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5WALXGZ4DSYESNNAXI3ABQU3U/action/storage_attestation","attest_author":"https://pith.science/pith/Z5WALXGZ4DSYESNNAXI3ABQU3U/action/author_attestation","sign_citation":"https://pith.science/pith/Z5WALXGZ4DSYESNNAXI3ABQU3U/action/citation_signature","submit_replication":"https://pith.science/pith/Z5WALXGZ4DSYESNNAXI3ABQU3U/action/replication_record"}},"created_at":"2026-07-05T07:22:28.424515+00:00","updated_at":"2026-07-05T07:22:28.424515+00:00"}