{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XOGR5HI7LPMCFNCDWSVSWGNHM2","short_pith_number":"pith:XOGR5HI7","schema_version":"1.0","canonical_sha256":"bb8d1e9d1f5bd822b443b4ab2b19a7668ae99e6da499c9c1675248d3dd6fbe41","source":{"kind":"arxiv","id":"2304.13195","version":1},"attestation_state":"computed","paper":{"title":"Connector 0.5: A unified framework for graph representation learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Jooho Lee, O-Joun Lee, Thanh Sang Nguyen, Van Thuy Hoang","submitted_at":"2023-04-25T23:28:38Z","abstract_excerpt":"Graph representation learning models aim to represent the graph structure and its features into low-dimensional vectors in a latent space, which can benefit various downstream tasks, such as node classification and link prediction. Due to its powerful graph data modelling capabilities, various graph embedding models and libraries have been proposed to learn embeddings and help researchers ease conducting experiments. In this paper, we introduce a novel graph representation framework covering various graph embedding models, ranging from shallow to state-of-the-art models, namely Connector. Firs"},"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":"2304.13195","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-04-25T23:28:38Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"0b2083f8789f464d1cfe1d9af6259c49a1c4593a137c579341b04a7a8fdb6759","abstract_canon_sha256":"49c53d6dc211c7b5ae6d8a211babd8da2f1f49f8335646f6f21ccb6b6e8a4d03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:04:40.857981Z","signature_b64":"TMzJtDR1jfZ3xfVV5NYk+9Q4G7LRg4i2enSc0VeFL0rtXmL17ch9W3lDGcWVHThxfNLlt43HtqeQsIC9FYbsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb8d1e9d1f5bd822b443b4ab2b19a7668ae99e6da499c9c1675248d3dd6fbe41","last_reissued_at":"2026-07-05T06:04:40.857561Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:04:40.857561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connector 0.5: A unified framework for graph representation learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Jooho Lee, O-Joun Lee, Thanh Sang Nguyen, Van Thuy Hoang","submitted_at":"2023-04-25T23:28:38Z","abstract_excerpt":"Graph representation learning models aim to represent the graph structure and its features into low-dimensional vectors in a latent space, which can benefit various downstream tasks, such as node classification and link prediction. Due to its powerful graph data modelling capabilities, various graph embedding models and libraries have been proposed to learn embeddings and help researchers ease conducting experiments. In this paper, we introduce a novel graph representation framework covering various graph embedding models, ranging from shallow to state-of-the-art models, namely Connector. Firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.13195","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/2304.13195/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":"2304.13195","created_at":"2026-07-05T06:04:40.857617+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.13195v1","created_at":"2026-07-05T06:04:40.857617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.13195","created_at":"2026-07-05T06:04:40.857617+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOGR5HI7LPMC","created_at":"2026-07-05T06:04:40.857617+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOGR5HI7LPMCFNCD","created_at":"2026-07-05T06:04:40.857617+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOGR5HI7","created_at":"2026-07-05T06:04:40.857617+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/XOGR5HI7LPMCFNCDWSVSWGNHM2","json":"https://pith.science/pith/XOGR5HI7LPMCFNCDWSVSWGNHM2.json","graph_json":"https://pith.science/api/pith-number/XOGR5HI7LPMCFNCDWSVSWGNHM2/graph.json","events_json":"https://pith.science/api/pith-number/XOGR5HI7LPMCFNCDWSVSWGNHM2/events.json","paper":"https://pith.science/paper/XOGR5HI7"},"agent_actions":{"view_html":"https://pith.science/pith/XOGR5HI7LPMCFNCDWSVSWGNHM2","download_json":"https://pith.science/pith/XOGR5HI7LPMCFNCDWSVSWGNHM2.json","view_paper":"https://pith.science/paper/XOGR5HI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.13195&json=true","fetch_graph":"https://pith.science/api/pith-number/XOGR5HI7LPMCFNCDWSVSWGNHM2/graph.json","fetch_events":"https://pith.science/api/pith-number/XOGR5HI7LPMCFNCDWSVSWGNHM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOGR5HI7LPMCFNCDWSVSWGNHM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOGR5HI7LPMCFNCDWSVSWGNHM2/action/storage_attestation","attest_author":"https://pith.science/pith/XOGR5HI7LPMCFNCDWSVSWGNHM2/action/author_attestation","sign_citation":"https://pith.science/pith/XOGR5HI7LPMCFNCDWSVSWGNHM2/action/citation_signature","submit_replication":"https://pith.science/pith/XOGR5HI7LPMCFNCDWSVSWGNHM2/action/replication_record"}},"created_at":"2026-07-05T06:04:40.857617+00:00","updated_at":"2026-07-05T06:04:40.857617+00:00"}