{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FTOJXKDJSXANOFWIVXZBLOWEJH","short_pith_number":"pith:FTOJXKDJ","schema_version":"1.0","canonical_sha256":"2cdc9ba86995c0d716c8adf215bac449df1ea76e7df9db0016a5ab3189476aff","source":{"kind":"arxiv","id":"2501.03451","version":1},"attestation_state":"computed","paper":{"title":"Structure-Preference Enabled Graph Embedding Generation under Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Haibo Hu, Qingqing Ye, Sen Zhang","submitted_at":"2025-01-07T00:43:18Z","abstract_excerpt":"Graph embedding generation techniques aim to learn low-dimensional vectors for each node in a graph and have recently gained increasing research attention. Publishing low-dimensional node vectors enables various graph analysis tasks, such as structural equivalence and link prediction. Yet, improper publication opens a backdoor to malicious attackers, who can infer sensitive information of individuals from the low-dimensional node vectors. Existing methods tackle this issue by developing deep graph learning models with differential privacy (DP). However, they often suffer from large noise injec"},"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":"2501.03451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-01-07T00:43:18Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"cce04e47a0e2024f61d8e317e5b8f22b7054bffdcc297f79ee58112521459547","abstract_canon_sha256":"d2690a0f02398787608b62103119301156ee8dae7987b3acde13d53883e0d06d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:55.029141Z","signature_b64":"7gdhbBnhpnjadZDxxL+oEWT1nTcXi7jEsY0pJ0fyQxg1XoT0sKMZgvnH/EPNcOkB4rYax14ZJpg9x4BixjdqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cdc9ba86995c0d716c8adf215bac449df1ea76e7df9db0016a5ab3189476aff","last_reissued_at":"2026-07-05T09:57:55.028735Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:55.028735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structure-Preference Enabled Graph Embedding Generation under Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Haibo Hu, Qingqing Ye, Sen Zhang","submitted_at":"2025-01-07T00:43:18Z","abstract_excerpt":"Graph embedding generation techniques aim to learn low-dimensional vectors for each node in a graph and have recently gained increasing research attention. Publishing low-dimensional node vectors enables various graph analysis tasks, such as structural equivalence and link prediction. Yet, improper publication opens a backdoor to malicious attackers, who can infer sensitive information of individuals from the low-dimensional node vectors. Existing methods tackle this issue by developing deep graph learning models with differential privacy (DP). However, they often suffer from large noise injec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.03451","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/2501.03451/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":"2501.03451","created_at":"2026-07-05T09:57:55.028789+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.03451v1","created_at":"2026-07-05T09:57:55.028789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.03451","created_at":"2026-07-05T09:57:55.028789+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTOJXKDJSXAN","created_at":"2026-07-05T09:57:55.028789+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTOJXKDJSXANOFWI","created_at":"2026-07-05T09:57:55.028789+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTOJXKDJ","created_at":"2026-07-05T09:57:55.028789+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.14114","citing_title":"Evaluating Loss Functions for Graph Neural Networks: Towards Pretraining and Generalization","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTOJXKDJSXANOFWIVXZBLOWEJH","json":"https://pith.science/pith/FTOJXKDJSXANOFWIVXZBLOWEJH.json","graph_json":"https://pith.science/api/pith-number/FTOJXKDJSXANOFWIVXZBLOWEJH/graph.json","events_json":"https://pith.science/api/pith-number/FTOJXKDJSXANOFWIVXZBLOWEJH/events.json","paper":"https://pith.science/paper/FTOJXKDJ"},"agent_actions":{"view_html":"https://pith.science/pith/FTOJXKDJSXANOFWIVXZBLOWEJH","download_json":"https://pith.science/pith/FTOJXKDJSXANOFWIVXZBLOWEJH.json","view_paper":"https://pith.science/paper/FTOJXKDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.03451&json=true","fetch_graph":"https://pith.science/api/pith-number/FTOJXKDJSXANOFWIVXZBLOWEJH/graph.json","fetch_events":"https://pith.science/api/pith-number/FTOJXKDJSXANOFWIVXZBLOWEJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTOJXKDJSXANOFWIVXZBLOWEJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTOJXKDJSXANOFWIVXZBLOWEJH/action/storage_attestation","attest_author":"https://pith.science/pith/FTOJXKDJSXANOFWIVXZBLOWEJH/action/author_attestation","sign_citation":"https://pith.science/pith/FTOJXKDJSXANOFWIVXZBLOWEJH/action/citation_signature","submit_replication":"https://pith.science/pith/FTOJXKDJSXANOFWIVXZBLOWEJH/action/replication_record"}},"created_at":"2026-07-05T09:57:55.028789+00:00","updated_at":"2026-07-05T09:57:55.028789+00:00"}