{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:T6IHTOGYKKGCG4AWBUGPALRAN7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aa4c895e40a01ec275c95af3c24b603dfa2e1011a6930a6e8d6267b8042546d5","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-09-06T15:41:44Z","title_canon_sha256":"1a97a56f5d3882b0a368aec2b337311c393de5594517cdfb6dd2f5682880ce3c"},"schema_version":"1.0","source":{"id":"1909.02977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.02977","created_at":"2026-07-05T00:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1909.02977v1","created_at":"2026-07-05T00:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.02977","created_at":"2026-07-05T00:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"T6IHTOGYKKGC","created_at":"2026-07-05T00:02:50Z"},{"alias_kind":"pith_short_16","alias_value":"T6IHTOGYKKGCG4AW","created_at":"2026-07-05T00:02:50Z"},{"alias_kind":"pith_short_8","alias_value":"T6IHTOGY","created_at":"2026-07-05T00:02:50Z"}],"graph_snapshots":[{"event_id":"sha256:acf62c4c4e9401b5e9cd30e4c9ec52f82335b419f65e6e41741f6d8eaf7b54e6","target":"graph","created_at":"2026-07-05T00:02:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.02977/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph embedding aims at learning a vector-based representation of vertices that incorporates the structure of the graph. This representation then enables inference of graph properties. Existing graph embedding techniques, however, do not scale well to large graphs. We therefore propose a framework for parallel computation of a graph embedding using a cluster of compute nodes with resource constraints. We show how to distribute any existing embedding technique by first splitting a graph for any given set of constrained compute nodes and then reconciling the embedding spaces derived for these su","authors_text":"Chi Thang Duong, Hongzhi Yin, Karl Aberer, Matthias Weidlich, Quoc Viet Hung Nguyen, Thanh Dat Hoang, Truong Giang Le Ba","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-09-06T15:41:44Z","title":"Parallel Computation of Graph Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.02977","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:464dd93cd5a0291fb6ffe91230ef46757ba714806e61749b90fad9ee2c6628ad","target":"record","created_at":"2026-07-05T00:02:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aa4c895e40a01ec275c95af3c24b603dfa2e1011a6930a6e8d6267b8042546d5","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-09-06T15:41:44Z","title_canon_sha256":"1a97a56f5d3882b0a368aec2b337311c393de5594517cdfb6dd2f5682880ce3c"},"schema_version":"1.0","source":{"id":"1909.02977","kind":"arxiv","version":1}},"canonical_sha256":"9f9079b8d8528c2370160d0cf02e206fdf9f947239d993226d5f62475b651d91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f9079b8d8528c2370160d0cf02e206fdf9f947239d993226d5f62475b651d91","first_computed_at":"2026-07-05T00:02:50.872339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:02:50.872339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZwCwM4EwM9rajGIIO5tn5Qc1c3i01Epvs5xRiZMT/t1sl0eCQgAS3t/KL6q6QYw80xkuEKkDYK5aAvNsyqacCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:02:50.872803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.02977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:464dd93cd5a0291fb6ffe91230ef46757ba714806e61749b90fad9ee2c6628ad","sha256:acf62c4c4e9401b5e9cd30e4c9ec52f82335b419f65e6e41741f6d8eaf7b54e6"],"state_sha256":"c91e6ce296bf00ee218ccd91504f8afe809f018ef4d2e428f108cd503d100056"}