{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JKE5GU6JJY2SCJLYTWY6K3NK3H","short_pith_number":"pith:JKE5GU6J","canonical_record":{"source":{"id":"2301.04312","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-01-11T05:21:00Z","cross_cats_sorted":[],"title_canon_sha256":"6375aeb9f821e11dfc584d4e003f2efd164ae4c96d2cdf7878499dc0dfb374df","abstract_canon_sha256":"2ef4acaab132c099549f369634ceecc6e295e4265ceb3820365500d99712fcb6"},"schema_version":"1.0"},"canonical_sha256":"4a89d353c94e352125789db1e56daad9f4e10edfd28b4c9fb918a05af72c1286","source":{"kind":"arxiv","id":"2301.04312","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.04312","created_at":"2026-07-05T07:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"2301.04312v6","created_at":"2026-07-05T07:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.04312","created_at":"2026-07-05T07:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"JKE5GU6JJY2S","created_at":"2026-07-05T07:28:08Z"},{"alias_kind":"pith_short_16","alias_value":"JKE5GU6JJY2SCJLY","created_at":"2026-07-05T07:28:08Z"},{"alias_kind":"pith_short_8","alias_value":"JKE5GU6J","created_at":"2026-07-05T07:28:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JKE5GU6JJY2SCJLYTWY6K3NK3H","target":"record","payload":{"canonical_record":{"source":{"id":"2301.04312","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-01-11T05:21:00Z","cross_cats_sorted":[],"title_canon_sha256":"6375aeb9f821e11dfc584d4e003f2efd164ae4c96d2cdf7878499dc0dfb374df","abstract_canon_sha256":"2ef4acaab132c099549f369634ceecc6e295e4265ceb3820365500d99712fcb6"},"schema_version":"1.0"},"canonical_sha256":"4a89d353c94e352125789db1e56daad9f4e10edfd28b4c9fb918a05af72c1286","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:28:08.655867Z","signature_b64":"mmok0YslUqqiWAwcLM+nCxJl7k9zmLF4RbBnmnBLNjoda9g+YsyTIL0SUcjcMX8PVsQtpuaw3dYpP6clkTDjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a89d353c94e352125789db1e56daad9f4e10edfd28b4c9fb918a05af72c1286","last_reissued_at":"2026-07-05T07:28:08.655454Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:28:08.655454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.04312","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzOszUI3E9FzNqidaMUWCo/skEoYYYPYamznBvupm9jqucu9KJc4Og79tD7rqyjWDsknPNcHbv1Efygv8yFgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:21:39.196361Z"},"content_sha256":"0e437a2004c1416a31a872af4615086d9849b3573568c9fade2c7aa702f22335","schema_version":"1.0","event_id":"sha256:0e437a2004c1416a31a872af4615086d9849b3573568c9fade2c7aa702f22335"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JKE5GU6JJY2SCJLYTWY6K3NK3H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Word-Graph2vec: An efficient word embedding approach on word co-occurrence graph using random walk technique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Feijuan Huang, Huacan Chen, Jiahong Xue, Wenting Li, Xi Zhang, Yuanzhe Cai, Zeyu Chen","submitted_at":"2023-01-11T05:21:00Z","abstract_excerpt":"Word embedding has become ubiquitous and is widely used in various natural language processing (NLP) tasks, such as web retrieval, web semantic analysis, and machine translation, and so on. Unfortunately, training the word embedding in a relatively large corpus is prohibitively expensive. We propose a graph-based word embedding algorithm, called Word-Graph2vec, which converts the large corpus into a word co-occurrence graph, then takes the word sequence samples from this graph by randomly traveling and trains the word embedding on this sampling corpus in the end. We posit that because of the l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.04312","kind":"arxiv","version":6},"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/2301.04312/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lP4f8zSPoBwf5AX9jHeW4iF+wnnh71vX56W+PC0Jw8Mkl5okDFi5aKSddxIlV3ASqSdlYMTYBMHjycT0PmF8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T18:21:39.198087Z"},"content_sha256":"876affb8c2660c41a5c6af538cc81423cc2afec5160599f09bc6870d40e40bc3","schema_version":"1.0","event_id":"sha256:876affb8c2660c41a5c6af538cc81423cc2afec5160599f09bc6870d40e40bc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKE5GU6JJY2SCJLYTWY6K3NK3H/bundle.json","state_url":"https://pith.science/pith/JKE5GU6JJY2SCJLYTWY6K3NK3H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKE5GU6JJY2SCJLYTWY6K3NK3H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-21T18:21:39Z","links":{"resolver":"https://pith.science/pith/JKE5GU6JJY2SCJLYTWY6K3NK3H","bundle":"https://pith.science/pith/JKE5GU6JJY2SCJLYTWY6K3NK3H/bundle.json","state":"https://pith.science/pith/JKE5GU6JJY2SCJLYTWY6K3NK3H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKE5GU6JJY2SCJLYTWY6K3NK3H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JKE5GU6JJY2SCJLYTWY6K3NK3H","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":"2ef4acaab132c099549f369634ceecc6e295e4265ceb3820365500d99712fcb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-01-11T05:21:00Z","title_canon_sha256":"6375aeb9f821e11dfc584d4e003f2efd164ae4c96d2cdf7878499dc0dfb374df"},"schema_version":"1.0","source":{"id":"2301.04312","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.04312","created_at":"2026-07-05T07:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"2301.04312v6","created_at":"2026-07-05T07:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.04312","created_at":"2026-07-05T07:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"JKE5GU6JJY2S","created_at":"2026-07-05T07:28:08Z"},{"alias_kind":"pith_short_16","alias_value":"JKE5GU6JJY2SCJLY","created_at":"2026-07-05T07:28:08Z"},{"alias_kind":"pith_short_8","alias_value":"JKE5GU6J","created_at":"2026-07-05T07:28:08Z"}],"graph_snapshots":[{"event_id":"sha256:876affb8c2660c41a5c6af538cc81423cc2afec5160599f09bc6870d40e40bc3","target":"graph","created_at":"2026-07-05T07:28:08Z","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/2301.04312/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Word embedding has become ubiquitous and is widely used in various natural language processing (NLP) tasks, such as web retrieval, web semantic analysis, and machine translation, and so on. Unfortunately, training the word embedding in a relatively large corpus is prohibitively expensive. We propose a graph-based word embedding algorithm, called Word-Graph2vec, which converts the large corpus into a word co-occurrence graph, then takes the word sequence samples from this graph by randomly traveling and trains the word embedding on this sampling corpus in the end. We posit that because of the l","authors_text":"Feijuan Huang, Huacan Chen, Jiahong Xue, Wenting Li, Xi Zhang, Yuanzhe Cai, Zeyu Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-01-11T05:21:00Z","title":"Word-Graph2vec: An efficient word embedding approach on word co-occurrence graph using random walk technique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.04312","kind":"arxiv","version":6},"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:0e437a2004c1416a31a872af4615086d9849b3573568c9fade2c7aa702f22335","target":"record","created_at":"2026-07-05T07:28:08Z","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":"2ef4acaab132c099549f369634ceecc6e295e4265ceb3820365500d99712fcb6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-01-11T05:21:00Z","title_canon_sha256":"6375aeb9f821e11dfc584d4e003f2efd164ae4c96d2cdf7878499dc0dfb374df"},"schema_version":"1.0","source":{"id":"2301.04312","kind":"arxiv","version":6}},"canonical_sha256":"4a89d353c94e352125789db1e56daad9f4e10edfd28b4c9fb918a05af72c1286","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a89d353c94e352125789db1e56daad9f4e10edfd28b4c9fb918a05af72c1286","first_computed_at":"2026-07-05T07:28:08.655454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:28:08.655454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mmok0YslUqqiWAwcLM+nCxJl7k9zmLF4RbBnmnBLNjoda9g+YsyTIL0SUcjcMX8PVsQtpuaw3dYpP6clkTDjDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:28:08.655867Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.04312","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e437a2004c1416a31a872af4615086d9849b3573568c9fade2c7aa702f22335","sha256:876affb8c2660c41a5c6af538cc81423cc2afec5160599f09bc6870d40e40bc3"],"state_sha256":"4aef0100d95c3b6f74e50ca5b020ccca5fa9b70e50ac6ec5030f8701cf14023b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbpzuBkDQ8/Tk38ukg5/qAQB07Z5PBxHMiRE0rwqI5tCDx84ouq7DVQ3V+YV8hXj4RB+XhHOYWwyftHT04WKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T18:21:39.208872Z","bundle_sha256":"d1aef81c085c9da5f030cd7fc648337098a3b7f73ef0bd7ba1b5743be713eb39"}}