{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GD6CHZUHC5OLMVLEHXRDOUXVXR","short_pith_number":"pith:GD6CHZUH","canonical_record":{"source":{"id":"1905.10714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-26T02:42:16Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"431eaf8f8b7ae97d10470c431c9b1103f9d38a0ad5ef04011d590e3e39a014f2","abstract_canon_sha256":"096bcc8b089e97cc6a44ab60871f8b274f554f0a6192fe38a676d5d2b011894c"},"schema_version":"1.0"},"canonical_sha256":"30fc23e687175cb655643de23752f5bc71c4b8bcbdc71dff3a45cc1e7e9cab56","source":{"kind":"arxiv","id":"1905.10714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10714","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10714v1","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10714","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"GD6CHZUHC5OL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GD6CHZUHC5OLMVLE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GD6CHZUH","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GD6CHZUHC5OLMVLEHXRDOUXVXR","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-26T02:42:16Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"431eaf8f8b7ae97d10470c431c9b1103f9d38a0ad5ef04011d590e3e39a014f2","abstract_canon_sha256":"096bcc8b089e97cc6a44ab60871f8b274f554f0a6192fe38a676d5d2b011894c"},"schema_version":"1.0"},"canonical_sha256":"30fc23e687175cb655643de23752f5bc71c4b8bcbdc71dff3a45cc1e7e9cab56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:05.509997Z","signature_b64":"ByWWQreXClvl/UZcwrQesmjZlirzYWFNFzksTjqmSQMyaS86H2fmF43KmcMkV27cxjytUr5Lfsq78oRLwlSPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30fc23e687175cb655643de23752f5bc71c4b8bcbdc71dff3a45cc1e7e9cab56","last_reissued_at":"2026-05-17T23:45:05.509433Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:05.509433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10714","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-05-17T23:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MplXna+C9nHXXRLYmDXVwx0M6RrdIH/hPBmh1liwJwqPeqq1MKnMQd3rhC3YZkJlcZsqKF6Qpri3CESdviDUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:49.122366Z"},"content_sha256":"2451aacc04660cbafbec2a5357192bef78b9ce3aa24017bf100b20de3910af26","schema_version":"1.0","event_id":"sha256:2451aacc04660cbafbec2a5357192bef78b9ce3aa24017bf100b20de3910af26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GD6CHZUHC5OLMVLEHXRDOUXVXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual Averaging Method for Online Graph-structured Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Baojian Zhou, Feng Chen, Yiming Ying","submitted_at":"2019-05-26T02:42:16Z","abstract_excerpt":"Online learning algorithms update models via one sample per iteration, thus efficient to process large-scale datasets and useful to detect malicious events for social benefits, such as disease outbreak and traffic congestion on the fly. However, existing algorithms for graph-structured models focused on the offline setting and the least square loss, incapable for online setting, while methods designed for online setting cannot be directly applied to the problem of complex (usually non-convex) graph-structured sparsity model. To address these limitations, in this paper we propose a new algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10714","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":""},"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-05-17T23:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zVLUXZcKXOLq5bh3uO2bN0oxMoD/NTW9ax9YqCxFvXUvgUl784mtqJfnsS8PenMcZH2mUKPKOesQo1ugJzLPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:49.122713Z"},"content_sha256":"f21177f874accaed2c0428d8af4767cd5079fb4fd892887227f53f163c485ffa","schema_version":"1.0","event_id":"sha256:f21177f874accaed2c0428d8af4767cd5079fb4fd892887227f53f163c485ffa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GD6CHZUHC5OLMVLEHXRDOUXVXR/bundle.json","state_url":"https://pith.science/pith/GD6CHZUHC5OLMVLEHXRDOUXVXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GD6CHZUHC5OLMVLEHXRDOUXVXR/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-06-01T19:38:49Z","links":{"resolver":"https://pith.science/pith/GD6CHZUHC5OLMVLEHXRDOUXVXR","bundle":"https://pith.science/pith/GD6CHZUHC5OLMVLEHXRDOUXVXR/bundle.json","state":"https://pith.science/pith/GD6CHZUHC5OLMVLEHXRDOUXVXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GD6CHZUHC5OLMVLEHXRDOUXVXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GD6CHZUHC5OLMVLEHXRDOUXVXR","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":"096bcc8b089e97cc6a44ab60871f8b274f554f0a6192fe38a676d5d2b011894c","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-26T02:42:16Z","title_canon_sha256":"431eaf8f8b7ae97d10470c431c9b1103f9d38a0ad5ef04011d590e3e39a014f2"},"schema_version":"1.0","source":{"id":"1905.10714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10714","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10714v1","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10714","created_at":"2026-05-17T23:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"GD6CHZUHC5OL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GD6CHZUHC5OLMVLE","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GD6CHZUH","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:f21177f874accaed2c0428d8af4767cd5079fb4fd892887227f53f163c485ffa","target":"graph","created_at":"2026-05-17T23:45:05Z","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"},"paper":{"abstract_excerpt":"Online learning algorithms update models via one sample per iteration, thus efficient to process large-scale datasets and useful to detect malicious events for social benefits, such as disease outbreak and traffic congestion on the fly. However, existing algorithms for graph-structured models focused on the offline setting and the least square loss, incapable for online setting, while methods designed for online setting cannot be directly applied to the problem of complex (usually non-convex) graph-structured sparsity model. To address these limitations, in this paper we propose a new algorith","authors_text":"Baojian Zhou, Feng Chen, Yiming Ying","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-26T02:42:16Z","title":"Dual Averaging Method for Online Graph-structured Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10714","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:2451aacc04660cbafbec2a5357192bef78b9ce3aa24017bf100b20de3910af26","target":"record","created_at":"2026-05-17T23:45:05Z","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":"096bcc8b089e97cc6a44ab60871f8b274f554f0a6192fe38a676d5d2b011894c","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-26T02:42:16Z","title_canon_sha256":"431eaf8f8b7ae97d10470c431c9b1103f9d38a0ad5ef04011d590e3e39a014f2"},"schema_version":"1.0","source":{"id":"1905.10714","kind":"arxiv","version":1}},"canonical_sha256":"30fc23e687175cb655643de23752f5bc71c4b8bcbdc71dff3a45cc1e7e9cab56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30fc23e687175cb655643de23752f5bc71c4b8bcbdc71dff3a45cc1e7e9cab56","first_computed_at":"2026-05-17T23:45:05.509433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:05.509433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ByWWQreXClvl/UZcwrQesmjZlirzYWFNFzksTjqmSQMyaS86H2fmF43KmcMkV27cxjytUr5Lfsq78oRLwlSPBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:05.509997Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2451aacc04660cbafbec2a5357192bef78b9ce3aa24017bf100b20de3910af26","sha256:f21177f874accaed2c0428d8af4767cd5079fb4fd892887227f53f163c485ffa"],"state_sha256":"399804a8033782b4bf5697b58dfc530c7da042ce89c52f6a1d0c643845e7110b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3q9u0tvLlcVxU4tSpTtSlltMduulhtbOKPCv3s6fR973R3Nz5EsJnWVLyWLJYwogaLvjs5EePEzgZUMtQVepDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:38:49.124614Z","bundle_sha256":"2e811d3b2fcb62abe56d1146e323479f10df24b3eb7080f37b4a4f139637ee41"}}