{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M6Y3DPKAF6LGDFASGUVSTMBVO3","short_pith_number":"pith:M6Y3DPKA","schema_version":"1.0","canonical_sha256":"67b1b1bd402f96619412352b29b03576c8cd4793f1594083019edd66720de9ee","source":{"kind":"arxiv","id":"1908.06543","version":3},"attestation_state":"computed","paper":{"title":"Benchmarks for Graph Embedding Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Ankita Goswami, Arquimedes Canedo, Di Huang, Emilio Ferrara, Palash Goyal, Sujit Rokka Chhetri","submitted_at":"2019-08-19T00:19:57Z","abstract_excerpt":"Graph embedding is the task of representing nodes of a graph in a low-dimensional space and its applications for graph tasks have gained significant traction in academia and industry. The primary difference among the many recently proposed graph embedding methods is the way they preserve the inherent properties of the graphs. However, in practice, comparing these methods is very challenging. The majority of methods report performance boosts on few selected real graphs. Therefore, it is difficult to generalize these performance improvements to other types of graphs. Given a graph, it is current"},"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":"1908.06543","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-19T00:19:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0529be36ca75f3b7cf2425e0e864ca74daf1366d87f56e312c42f2dc28ad1356","abstract_canon_sha256":"bef2730976cc699fdd2466ac1b947c6463a06d1ad087dad215c453c99bb47bdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:50.952650Z","signature_b64":"Wre8SZ2g1tL2SRCbCao/hvBBeOPJPaSCxfCz8gswohLmOt+ESWyrJ48yh5UfYSQPL0AktphvXkAGohGcfXtYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67b1b1bd402f96619412352b29b03576c8cd4793f1594083019edd66720de9ee","last_reissued_at":"2026-07-04T23:59:50.952187Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:50.952187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarks for Graph Embedding Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Ankita Goswami, Arquimedes Canedo, Di Huang, Emilio Ferrara, Palash Goyal, Sujit Rokka Chhetri","submitted_at":"2019-08-19T00:19:57Z","abstract_excerpt":"Graph embedding is the task of representing nodes of a graph in a low-dimensional space and its applications for graph tasks have gained significant traction in academia and industry. The primary difference among the many recently proposed graph embedding methods is the way they preserve the inherent properties of the graphs. However, in practice, comparing these methods is very challenging. The majority of methods report performance boosts on few selected real graphs. Therefore, it is difficult to generalize these performance improvements to other types of graphs. Given a graph, it is current"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06543","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06543/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":"1908.06543","created_at":"2026-07-04T23:59:50.952236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06543v3","created_at":"2026-07-04T23:59:50.952236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06543","created_at":"2026-07-04T23:59:50.952236+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6Y3DPKAF6LG","created_at":"2026-07-04T23:59:50.952236+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6Y3DPKAF6LGDFAS","created_at":"2026-07-04T23:59:50.952236+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6Y3DPKA","created_at":"2026-07-04T23:59:50.952236+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/M6Y3DPKAF6LGDFASGUVSTMBVO3","json":"https://pith.science/pith/M6Y3DPKAF6LGDFASGUVSTMBVO3.json","graph_json":"https://pith.science/api/pith-number/M6Y3DPKAF6LGDFASGUVSTMBVO3/graph.json","events_json":"https://pith.science/api/pith-number/M6Y3DPKAF6LGDFASGUVSTMBVO3/events.json","paper":"https://pith.science/paper/M6Y3DPKA"},"agent_actions":{"view_html":"https://pith.science/pith/M6Y3DPKAF6LGDFASGUVSTMBVO3","download_json":"https://pith.science/pith/M6Y3DPKAF6LGDFASGUVSTMBVO3.json","view_paper":"https://pith.science/paper/M6Y3DPKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06543&json=true","fetch_graph":"https://pith.science/api/pith-number/M6Y3DPKAF6LGDFASGUVSTMBVO3/graph.json","fetch_events":"https://pith.science/api/pith-number/M6Y3DPKAF6LGDFASGUVSTMBVO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6Y3DPKAF6LGDFASGUVSTMBVO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6Y3DPKAF6LGDFASGUVSTMBVO3/action/storage_attestation","attest_author":"https://pith.science/pith/M6Y3DPKAF6LGDFASGUVSTMBVO3/action/author_attestation","sign_citation":"https://pith.science/pith/M6Y3DPKAF6LGDFASGUVSTMBVO3/action/citation_signature","submit_replication":"https://pith.science/pith/M6Y3DPKAF6LGDFASGUVSTMBVO3/action/replication_record"}},"created_at":"2026-07-04T23:59:50.952236+00:00","updated_at":"2026-07-04T23:59:50.952236+00:00"}