{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TOU5UPXBLPP7YEH45XBBS76AE7","short_pith_number":"pith:TOU5UPXB","canonical_record":{"source":{"id":"1608.01264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-03T17:33:16Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e895912210f3ea2d9d0e1d6d51467fb771ddb2b4ee4e7912e27989836ebc8950","abstract_canon_sha256":"306df5cf09e5d3acbcf0aaffa0a3ecc68960892aef1242721596352a4ca61431"},"schema_version":"1.0"},"canonical_sha256":"9ba9da3ee15bdffc10fcedc2197fc027d5ba0691646f4e1f8816c3c45659c1fc","source":{"kind":"arxiv","id":"1608.01264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01264","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01264v1","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01264","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"TOU5UPXBLPP7","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOU5UPXBLPP7YEH4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOU5UPXB","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TOU5UPXBLPP7YEH45XBBS76AE7","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-03T17:33:16Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e895912210f3ea2d9d0e1d6d51467fb771ddb2b4ee4e7912e27989836ebc8950","abstract_canon_sha256":"306df5cf09e5d3acbcf0aaffa0a3ecc68960892aef1242721596352a4ca61431"},"schema_version":"1.0"},"canonical_sha256":"9ba9da3ee15bdffc10fcedc2197fc027d5ba0691646f4e1f8816c3c45659c1fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:56.036858Z","signature_b64":"/2vJUMbYbUo5MltukZd0mJEZQ7owp+0gZhEzYJVL/BzO4MsL2LhU7glPMGLC8f9bmJa4yitTrCZvXSiP7Y8MCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ba9da3ee15bdffc10fcedc2197fc027d5ba0691646f4e1f8816c3c45659c1fc","last_reissued_at":"2026-05-18T01:09:56.036102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:56.036102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01264","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-18T01:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jastv4REBiI30qiAwMbXgdwXMza3P9b0a1jcGDZVFLJHNeThDdFNdts6kYvYNyrBnXsFC0yfjXJSBMSEwd7GAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:09:26.330762Z"},"content_sha256":"0e1020633e4da7f01cda7f48abd3b3938d304eab05fe5f7f80dab3863292e897","schema_version":"1.0","event_id":"sha256:0e1020633e4da7f01cda7f48abd3b3938d304eab05fe5f7f80dab3863292e897"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TOU5UPXBLPP7YEH45XBBS76AE7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and Simple Optimization for Poisson Likelihood Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Le Song, Niao He, Yichen Wang, Zaid Harchaoui","submitted_at":"2016-08-03T17:33:16Z","abstract_excerpt":"Poisson likelihood models have been prevalently used in imaging, social networks, and time series analysis. We propose fast, simple, theoretically-grounded, and versatile, optimization algorithms for Poisson likelihood modeling. The Poisson log-likelihood is concave but not Lipschitz-continuous. Since almost all gradient-based optimization algorithms rely on Lipschitz-continuity, optimizing Poisson likelihood models with a guarantee of convergence can be challenging, especially for large-scale problems.\n  We present a new perspective allowing to efficiently optimize a wide range of penalized P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01264","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-18T01:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84bRSyPGyafSYG5Wze6X9Y5hl32LzxjUMJOtd++xW8bTPHcd9VQ4nGMr329CEUtZk7vwByMfF7YOnk7onHl8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:09:26.331489Z"},"content_sha256":"2bf96df66f6af33ea000d8b4b0f32869c9d845a0c7f18d743f2da40307e765a9","schema_version":"1.0","event_id":"sha256:2bf96df66f6af33ea000d8b4b0f32869c9d845a0c7f18d743f2da40307e765a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7/bundle.json","state_url":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOU5UPXBLPP7YEH45XBBS76AE7/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-05-28T21:09:26Z","links":{"resolver":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7","bundle":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7/bundle.json","state":"https://pith.science/pith/TOU5UPXBLPP7YEH45XBBS76AE7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOU5UPXBLPP7YEH45XBBS76AE7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TOU5UPXBLPP7YEH45XBBS76AE7","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":"306df5cf09e5d3acbcf0aaffa0a3ecc68960892aef1242721596352a4ca61431","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-03T17:33:16Z","title_canon_sha256":"e895912210f3ea2d9d0e1d6d51467fb771ddb2b4ee4e7912e27989836ebc8950"},"schema_version":"1.0","source":{"id":"1608.01264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01264","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01264v1","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01264","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"TOU5UPXBLPP7","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TOU5UPXBLPP7YEH4","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TOU5UPXB","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:2bf96df66f6af33ea000d8b4b0f32869c9d845a0c7f18d743f2da40307e765a9","target":"graph","created_at":"2026-05-18T01:09:56Z","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":"Poisson likelihood models have been prevalently used in imaging, social networks, and time series analysis. We propose fast, simple, theoretically-grounded, and versatile, optimization algorithms for Poisson likelihood modeling. The Poisson log-likelihood is concave but not Lipschitz-continuous. Since almost all gradient-based optimization algorithms rely on Lipschitz-continuity, optimizing Poisson likelihood models with a guarantee of convergence can be challenging, especially for large-scale problems.\n  We present a new perspective allowing to efficiently optimize a wide range of penalized P","authors_text":"Le Song, Niao He, Yichen Wang, Zaid Harchaoui","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-03T17:33:16Z","title":"Fast and Simple Optimization for Poisson Likelihood Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01264","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:0e1020633e4da7f01cda7f48abd3b3938d304eab05fe5f7f80dab3863292e897","target":"record","created_at":"2026-05-18T01:09:56Z","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":"306df5cf09e5d3acbcf0aaffa0a3ecc68960892aef1242721596352a4ca61431","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-03T17:33:16Z","title_canon_sha256":"e895912210f3ea2d9d0e1d6d51467fb771ddb2b4ee4e7912e27989836ebc8950"},"schema_version":"1.0","source":{"id":"1608.01264","kind":"arxiv","version":1}},"canonical_sha256":"9ba9da3ee15bdffc10fcedc2197fc027d5ba0691646f4e1f8816c3c45659c1fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ba9da3ee15bdffc10fcedc2197fc027d5ba0691646f4e1f8816c3c45659c1fc","first_computed_at":"2026-05-18T01:09:56.036102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:56.036102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/2vJUMbYbUo5MltukZd0mJEZQ7owp+0gZhEzYJVL/BzO4MsL2LhU7glPMGLC8f9bmJa4yitTrCZvXSiP7Y8MCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:56.036858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e1020633e4da7f01cda7f48abd3b3938d304eab05fe5f7f80dab3863292e897","sha256:2bf96df66f6af33ea000d8b4b0f32869c9d845a0c7f18d743f2da40307e765a9"],"state_sha256":"9abfdc0216ccada300854f32b3ed130b8cb3cd77ee564d73a03a4447c60b5ca6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CervE40bR1f0+/bAjxIP9oIgRrA4RqJRPPNI+RmTHU8SuC8TbGJjdvZPbs1R/8c2YrtR9qU/d0viSsQ8ltLRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:09:26.334631Z","bundle_sha256":"65dff519a374b3e3949e4af0168061eca0c8bf33495d3ed7bdeb1d86a6779710"}}