{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G2HP4FR2PBCQFQHBOOT3ADCQTI","short_pith_number":"pith:G2HP4FR2","schema_version":"1.0","canonical_sha256":"368efe163a784502c0e173a7b00c509a0603991db1ae2719045267d9dc227783","source":{"kind":"arxiv","id":"2505.17764","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Graph Embedding Through Hub-aware Random Walks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Aleksandar Tom\\v{c}i\\'c, Du\\v{s}an Simi\\'c, Milo\\v{s} Radovanovi\\'c, Milo\\v{s} Savi\\'c","submitted_at":"2025-05-23T11:35:24Z","abstract_excerpt":"The role of high-degree nodes, or hubs, in shaping graph dynamics and structure is well-recognized in network science, yet their influence remains underexplored in the context of dynamic graph embedding. Recent advances in representation learning for graphs have shown that random walk-based methods can capture both structural and temporal patterns, but often overlook the impact of hubs on walk trajectories and embedding stability. In this paper, we introduce DeepHub, a method for dynamic graph embedding that explicitly integrates hub sensitivity into random walk sampling strategies. Focusing o"},"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":"2505.17764","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2025-05-23T11:35:24Z","cross_cats_sorted":[],"title_canon_sha256":"be498b7d151d1aa9d5fa2d02587625b63ca1f07779a0108a8728d73889a845e0","abstract_canon_sha256":"ca6ae27685277fda62af560c098ec984252994e51e531d4c440bb6f1b220b205"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:41:42.073734Z","signature_b64":"umUSi1HeXkVNAeFQHJIhsyBkETpfaEFyQNjP6ZlEJPjA2x1GvMK4AbunJApnR4p7HZK9tB+SIwJQv8uKgKpoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"368efe163a784502c0e173a7b00c509a0603991db1ae2719045267d9dc227783","last_reissued_at":"2026-07-05T11:41:42.073313Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:41:42.073313Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Graph Embedding Through Hub-aware Random Walks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Aleksandar Tom\\v{c}i\\'c, Du\\v{s}an Simi\\'c, Milo\\v{s} Radovanovi\\'c, Milo\\v{s} Savi\\'c","submitted_at":"2025-05-23T11:35:24Z","abstract_excerpt":"The role of high-degree nodes, or hubs, in shaping graph dynamics and structure is well-recognized in network science, yet their influence remains underexplored in the context of dynamic graph embedding. Recent advances in representation learning for graphs have shown that random walk-based methods can capture both structural and temporal patterns, but often overlook the impact of hubs on walk trajectories and embedding stability. In this paper, we introduce DeepHub, a method for dynamic graph embedding that explicitly integrates hub sensitivity into random walk sampling strategies. Focusing o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17764","kind":"arxiv","version":2},"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/2505.17764/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":"2505.17764","created_at":"2026-07-05T11:41:42.073380+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.17764v2","created_at":"2026-07-05T11:41:42.073380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17764","created_at":"2026-07-05T11:41:42.073380+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2HP4FR2PBCQ","created_at":"2026-07-05T11:41:42.073380+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2HP4FR2PBCQFQHB","created_at":"2026-07-05T11:41:42.073380+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2HP4FR2","created_at":"2026-07-05T11:41:42.073380+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/G2HP4FR2PBCQFQHBOOT3ADCQTI","json":"https://pith.science/pith/G2HP4FR2PBCQFQHBOOT3ADCQTI.json","graph_json":"https://pith.science/api/pith-number/G2HP4FR2PBCQFQHBOOT3ADCQTI/graph.json","events_json":"https://pith.science/api/pith-number/G2HP4FR2PBCQFQHBOOT3ADCQTI/events.json","paper":"https://pith.science/paper/G2HP4FR2"},"agent_actions":{"view_html":"https://pith.science/pith/G2HP4FR2PBCQFQHBOOT3ADCQTI","download_json":"https://pith.science/pith/G2HP4FR2PBCQFQHBOOT3ADCQTI.json","view_paper":"https://pith.science/paper/G2HP4FR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.17764&json=true","fetch_graph":"https://pith.science/api/pith-number/G2HP4FR2PBCQFQHBOOT3ADCQTI/graph.json","fetch_events":"https://pith.science/api/pith-number/G2HP4FR2PBCQFQHBOOT3ADCQTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2HP4FR2PBCQFQHBOOT3ADCQTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2HP4FR2PBCQFQHBOOT3ADCQTI/action/storage_attestation","attest_author":"https://pith.science/pith/G2HP4FR2PBCQFQHBOOT3ADCQTI/action/author_attestation","sign_citation":"https://pith.science/pith/G2HP4FR2PBCQFQHBOOT3ADCQTI/action/citation_signature","submit_replication":"https://pith.science/pith/G2HP4FR2PBCQFQHBOOT3ADCQTI/action/replication_record"}},"created_at":"2026-07-05T11:41:42.073380+00:00","updated_at":"2026-07-05T11:41:42.073380+00:00"}