{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QX7Z5FLNWOONDOIBPDGMJJRMFQ","short_pith_number":"pith:QX7Z5FLN","canonical_record":{"source":{"id":"2001.07463","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-21T12:04:21Z","cross_cats_sorted":["cs.DC","cs.SI","stat.ML"],"title_canon_sha256":"51e857f514ee741b2cec602226ebbc8695f9a4ee8b6a109185487b40e5ce89d6","abstract_canon_sha256":"d42ea3900b974f2c7700662384d201f816b074a0e9e4c2ef7e2bf4e1eb629e79"},"schema_version":"1.0"},"canonical_sha256":"85ff9e956db39cd1b90178ccc4a62c2c110c4f8a214cf3ce2a68551e1175ab72","source":{"kind":"arxiv","id":"2001.07463","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.07463","created_at":"2026-07-05T00:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"2001.07463v1","created_at":"2026-07-05T00:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.07463","created_at":"2026-07-05T00:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"QX7Z5FLNWOON","created_at":"2026-07-05T00:34:55Z"},{"alias_kind":"pith_short_16","alias_value":"QX7Z5FLNWOONDOIB","created_at":"2026-07-05T00:34:55Z"},{"alias_kind":"pith_short_8","alias_value":"QX7Z5FLN","created_at":"2026-07-05T00:34:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QX7Z5FLNWOONDOIBPDGMJJRMFQ","target":"record","payload":{"canonical_record":{"source":{"id":"2001.07463","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-21T12:04:21Z","cross_cats_sorted":["cs.DC","cs.SI","stat.ML"],"title_canon_sha256":"51e857f514ee741b2cec602226ebbc8695f9a4ee8b6a109185487b40e5ce89d6","abstract_canon_sha256":"d42ea3900b974f2c7700662384d201f816b074a0e9e4c2ef7e2bf4e1eb629e79"},"schema_version":"1.0"},"canonical_sha256":"85ff9e956db39cd1b90178ccc4a62c2c110c4f8a214cf3ce2a68551e1175ab72","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:34:55.722172Z","signature_b64":"mZjbi9K/haiOVEQHgcyxo+6e1kMhdxADhM2RnbKL/pmOJWNf+LicadQd0idSySbsbp+yay7bmne6LEPnLqirDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85ff9e956db39cd1b90178ccc4a62c2c110c4f8a214cf3ce2a68551e1175ab72","last_reissued_at":"2026-07-05T00:34:55.721701Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:34:55.721701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.07463","source_version":1,"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-05T00:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"reTs07DiMMAv2HHOrq4CxYEt5OMqKdWly6ZYKGRekRegv1c3BjPSA6IIYq8tvJr5bszgAFTPrf0/DxX9O6zjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T21:00:07.958401Z"},"content_sha256":"3681ea1ce2114788e449fdc9ba7f242b6ce1d667d55a8e3974e116079ed77cbd","schema_version":"1.0","event_id":"sha256:3681ea1ce2114788e449fdc9ba7f242b6ce1d667d55a8e3974e116079ed77cbd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QX7Z5FLNWOONDOIBPDGMJJRMFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Sequence-Based Embedding with Diffusion Graphs","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DC","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Benedek Rozemberczki, Rik Sarkar","submitted_at":"2020-01-21T12:04:21Z","abstract_excerpt":"A graph embedding is a representation of graph vertices in a low-dimensional space, which approximately preserves properties such as distances between nodes. Vertex sequence-based embedding procedures use features extracted from linear sequences of nodes to create embeddings using a neural network. In this paper, we propose diffusion graphs as a method to rapidly generate vertex sequences for network embedding. Its computational efficiency is superior to previous methods due to simpler sequence generation, and it produces more accurate results. In experiments, we found that the performance rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.07463","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/2001.07463/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-05T00:34:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0iC3GCqGQaxseJZvBEwHCI3CMnSrNlVq90Z4OIW//APH0prifX9Aur/ggNT8omwFh3I1hzFJ0ENlEte5sq2PDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-25T21:00:07.958762Z"},"content_sha256":"9a3702e3d89df731c16333ca0c9ae4135876d0717bcb9502463a9a90b9ce47a1","schema_version":"1.0","event_id":"sha256:9a3702e3d89df731c16333ca0c9ae4135876d0717bcb9502463a9a90b9ce47a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QX7Z5FLNWOONDOIBPDGMJJRMFQ/bundle.json","state_url":"https://pith.science/pith/QX7Z5FLNWOONDOIBPDGMJJRMFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QX7Z5FLNWOONDOIBPDGMJJRMFQ/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-07-25T21:00:07Z","links":{"resolver":"https://pith.science/pith/QX7Z5FLNWOONDOIBPDGMJJRMFQ","bundle":"https://pith.science/pith/QX7Z5FLNWOONDOIBPDGMJJRMFQ/bundle.json","state":"https://pith.science/pith/QX7Z5FLNWOONDOIBPDGMJJRMFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QX7Z5FLNWOONDOIBPDGMJJRMFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QX7Z5FLNWOONDOIBPDGMJJRMFQ","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":"d42ea3900b974f2c7700662384d201f816b074a0e9e4c2ef7e2bf4e1eb629e79","cross_cats_sorted":["cs.DC","cs.SI","stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-21T12:04:21Z","title_canon_sha256":"51e857f514ee741b2cec602226ebbc8695f9a4ee8b6a109185487b40e5ce89d6"},"schema_version":"1.0","source":{"id":"2001.07463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.07463","created_at":"2026-07-05T00:34:55Z"},{"alias_kind":"arxiv_version","alias_value":"2001.07463v1","created_at":"2026-07-05T00:34:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.07463","created_at":"2026-07-05T00:34:55Z"},{"alias_kind":"pith_short_12","alias_value":"QX7Z5FLNWOON","created_at":"2026-07-05T00:34:55Z"},{"alias_kind":"pith_short_16","alias_value":"QX7Z5FLNWOONDOIB","created_at":"2026-07-05T00:34:55Z"},{"alias_kind":"pith_short_8","alias_value":"QX7Z5FLN","created_at":"2026-07-05T00:34:55Z"}],"graph_snapshots":[{"event_id":"sha256:9a3702e3d89df731c16333ca0c9ae4135876d0717bcb9502463a9a90b9ce47a1","target":"graph","created_at":"2026-07-05T00:34:55Z","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/2001.07463/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph embedding is a representation of graph vertices in a low-dimensional space, which approximately preserves properties such as distances between nodes. Vertex sequence-based embedding procedures use features extracted from linear sequences of nodes to create embeddings using a neural network. In this paper, we propose diffusion graphs as a method to rapidly generate vertex sequences for network embedding. Its computational efficiency is superior to previous methods due to simpler sequence generation, and it produces more accurate results. In experiments, we found that the performance rel","authors_text":"Benedek Rozemberczki, Rik Sarkar","cross_cats":["cs.DC","cs.SI","stat.ML"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-21T12:04:21Z","title":"Fast Sequence-Based Embedding with Diffusion Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.07463","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:3681ea1ce2114788e449fdc9ba7f242b6ce1d667d55a8e3974e116079ed77cbd","target":"record","created_at":"2026-07-05T00:34:55Z","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":"d42ea3900b974f2c7700662384d201f816b074a0e9e4c2ef7e2bf4e1eb629e79","cross_cats_sorted":["cs.DC","cs.SI","stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-21T12:04:21Z","title_canon_sha256":"51e857f514ee741b2cec602226ebbc8695f9a4ee8b6a109185487b40e5ce89d6"},"schema_version":"1.0","source":{"id":"2001.07463","kind":"arxiv","version":1}},"canonical_sha256":"85ff9e956db39cd1b90178ccc4a62c2c110c4f8a214cf3ce2a68551e1175ab72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85ff9e956db39cd1b90178ccc4a62c2c110c4f8a214cf3ce2a68551e1175ab72","first_computed_at":"2026-07-05T00:34:55.721701Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:34:55.721701Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mZjbi9K/haiOVEQHgcyxo+6e1kMhdxADhM2RnbKL/pmOJWNf+LicadQd0idSySbsbp+yay7bmne6LEPnLqirDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:34:55.722172Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.07463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3681ea1ce2114788e449fdc9ba7f242b6ce1d667d55a8e3974e116079ed77cbd","sha256:9a3702e3d89df731c16333ca0c9ae4135876d0717bcb9502463a9a90b9ce47a1"],"state_sha256":"865847392777aabbc22ebd56b158aae8d65d19839ce18cfbfa31f705985c7f7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"naFZWWsZOkoaWo08kNkzsHaz3QJrdCnBoT1xoMFKJGcFmXqhWrK9omuQU2uGCFIwTqlQStRuerThIAoWBqcJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-25T21:00:07.960809Z","bundle_sha256":"2a5b15e5ac37ab393a36858d96e942104730460cbb4681a7b3263cbcb926a53b"}}