{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:37FRZRXUATFQ3JIQJ3D4INZEZR","short_pith_number":"pith:37FRZRXU","canonical_record":{"source":{"id":"2408.16592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-29T14:55:33Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c769226f581a15b122fd2c3c77aee730605e6d0417cbe8472ad0d29cb48c0460","abstract_canon_sha256":"2f460762915ba429b478a7f73f98931b0168dd071a3f6d6ca272534bcc9f269d"},"schema_version":"1.0"},"canonical_sha256":"dfcb1cc6f404cb0da5104ec7c43724cc6ea8b330542326a598b806e86578d005","source":{"kind":"arxiv","id":"2408.16592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16592","created_at":"2026-07-05T09:00:43Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16592v1","created_at":"2026-07-05T09:00:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16592","created_at":"2026-07-05T09:00:43Z"},{"alias_kind":"pith_short_12","alias_value":"37FRZRXUATFQ","created_at":"2026-07-05T09:00:43Z"},{"alias_kind":"pith_short_16","alias_value":"37FRZRXUATFQ3JIQ","created_at":"2026-07-05T09:00:43Z"},{"alias_kind":"pith_short_8","alias_value":"37FRZRXU","created_at":"2026-07-05T09:00:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:37FRZRXUATFQ3JIQJ3D4INZEZR","target":"record","payload":{"canonical_record":{"source":{"id":"2408.16592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-29T14:55:33Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c769226f581a15b122fd2c3c77aee730605e6d0417cbe8472ad0d29cb48c0460","abstract_canon_sha256":"2f460762915ba429b478a7f73f98931b0168dd071a3f6d6ca272534bcc9f269d"},"schema_version":"1.0"},"canonical_sha256":"dfcb1cc6f404cb0da5104ec7c43724cc6ea8b330542326a598b806e86578d005","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:00:43.538820Z","signature_b64":"2uUz9nGKqKgAVVW6ZLuR1YPWiBi8Y5piN7uWpgq3DCO0oQEl48TQdyC1JNgO0jzTN6T2L6F6z/Oz/nkuINBqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfcb1cc6f404cb0da5104ec7c43724cc6ea8b330542326a598b806e86578d005","last_reissued_at":"2026-07-05T09:00:43.538426Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:00:43.538426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.16592","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-05T09:00:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snwt5wYeytnivQgJqvgeYDfODhJDyB0yPj9FYzd4H2VAnclfiWRPhRPyUGv7rOlyXuS/5E/8jkiezHEwe0SeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:16:42.796986Z"},"content_sha256":"13f567a42d3dd266b4fa97235e691443a604697ceee7a977f06db89748bb296a","schema_version":"1.0","event_id":"sha256:13f567a42d3dd266b4fa97235e691443a604697ceee7a977f06db89748bb296a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:37FRZRXUATFQ3JIQJ3D4INZEZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Dimensional Sparse Data Low-rank Representation via Accelerated Asynchronous Parallel Stochastic Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Hao Wu, Qicong Hu","submitted_at":"2024-08-29T14:55:33Z","abstract_excerpt":"Data characterized by high dimensionality and sparsity are commonly used to describe real-world node interactions. Low-rank representation (LR) can map high-dimensional sparse (HDS) data to low-dimensional feature spaces and infer node interactions via modeling data latent associations. Unfortunately, existing optimization algorithms for LR models are computationally inefficient and slowly convergent on large-scale datasets. To address this issue, this paper proposes an Accelerated Asynchronous Parallel Stochastic Gradient Descent A2PSGD for High-Dimensional Sparse Data Low-rank Representation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16592","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/2408.16592/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-05T09:00:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odw0dl3i1+7EMB/cKKhMbLUkzMZJ81TEZkB3+BA3TvNwCZ+25dr5ihIBn70rduoN5PDwhMu8sbxm6ZFte/qTCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:16:42.797882Z"},"content_sha256":"44f141b619e8e1895326518b6b32f7faee0102c34a0a4365366f2376725f84d6","schema_version":"1.0","event_id":"sha256:44f141b619e8e1895326518b6b32f7faee0102c34a0a4365366f2376725f84d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37FRZRXUATFQ3JIQJ3D4INZEZR/bundle.json","state_url":"https://pith.science/pith/37FRZRXUATFQ3JIQJ3D4INZEZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37FRZRXUATFQ3JIQJ3D4INZEZR/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-06T02:16:42Z","links":{"resolver":"https://pith.science/pith/37FRZRXUATFQ3JIQJ3D4INZEZR","bundle":"https://pith.science/pith/37FRZRXUATFQ3JIQJ3D4INZEZR/bundle.json","state":"https://pith.science/pith/37FRZRXUATFQ3JIQJ3D4INZEZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37FRZRXUATFQ3JIQJ3D4INZEZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:37FRZRXUATFQ3JIQJ3D4INZEZR","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":"2f460762915ba429b478a7f73f98931b0168dd071a3f6d6ca272534bcc9f269d","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-29T14:55:33Z","title_canon_sha256":"c769226f581a15b122fd2c3c77aee730605e6d0417cbe8472ad0d29cb48c0460"},"schema_version":"1.0","source":{"id":"2408.16592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16592","created_at":"2026-07-05T09:00:43Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16592v1","created_at":"2026-07-05T09:00:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16592","created_at":"2026-07-05T09:00:43Z"},{"alias_kind":"pith_short_12","alias_value":"37FRZRXUATFQ","created_at":"2026-07-05T09:00:43Z"},{"alias_kind":"pith_short_16","alias_value":"37FRZRXUATFQ3JIQ","created_at":"2026-07-05T09:00:43Z"},{"alias_kind":"pith_short_8","alias_value":"37FRZRXU","created_at":"2026-07-05T09:00:43Z"}],"graph_snapshots":[{"event_id":"sha256:44f141b619e8e1895326518b6b32f7faee0102c34a0a4365366f2376725f84d6","target":"graph","created_at":"2026-07-05T09:00:43Z","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/2408.16592/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Data characterized by high dimensionality and sparsity are commonly used to describe real-world node interactions. Low-rank representation (LR) can map high-dimensional sparse (HDS) data to low-dimensional feature spaces and infer node interactions via modeling data latent associations. Unfortunately, existing optimization algorithms for LR models are computationally inefficient and slowly convergent on large-scale datasets. To address this issue, this paper proposes an Accelerated Asynchronous Parallel Stochastic Gradient Descent A2PSGD for High-Dimensional Sparse Data Low-rank Representation","authors_text":"Hao Wu, Qicong Hu","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-29T14:55:33Z","title":"High-Dimensional Sparse Data Low-rank Representation via Accelerated Asynchronous Parallel Stochastic Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16592","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:13f567a42d3dd266b4fa97235e691443a604697ceee7a977f06db89748bb296a","target":"record","created_at":"2026-07-05T09:00:43Z","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":"2f460762915ba429b478a7f73f98931b0168dd071a3f6d6ca272534bcc9f269d","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-29T14:55:33Z","title_canon_sha256":"c769226f581a15b122fd2c3c77aee730605e6d0417cbe8472ad0d29cb48c0460"},"schema_version":"1.0","source":{"id":"2408.16592","kind":"arxiv","version":1}},"canonical_sha256":"dfcb1cc6f404cb0da5104ec7c43724cc6ea8b330542326a598b806e86578d005","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfcb1cc6f404cb0da5104ec7c43724cc6ea8b330542326a598b806e86578d005","first_computed_at":"2026-07-05T09:00:43.538426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:00:43.538426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2uUz9nGKqKgAVVW6ZLuR1YPWiBi8Y5piN7uWpgq3DCO0oQEl48TQdyC1JNgO0jzTN6T2L6F6z/Oz/nkuINBqAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:00:43.538820Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.16592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13f567a42d3dd266b4fa97235e691443a604697ceee7a977f06db89748bb296a","sha256:44f141b619e8e1895326518b6b32f7faee0102c34a0a4365366f2376725f84d6"],"state_sha256":"8c40f117de2dbbac27b195104409edbb87e18646ff58714e508d12e58d1372a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AIvHkc5i8FHlriQ9McHoH3Y43LyChCJbJGpHvrteRlCiuFIyFfWib3W1ciXVEOjmzdDoOerrflv/RGkTDVyuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T02:16:42.817280Z","bundle_sha256":"9e475563f1e7a962aa1124dee06d68698d03e6a7e25a8878b813e0bf0e4e4332"}}