{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CPRKHPTXXNHZVCDJPEIQ7OOUD5","short_pith_number":"pith:CPRKHPTX","canonical_record":{"source":{"id":"1509.01698","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-05T12:48:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bab5fb3e86f67d7f94f3252a9474f773f2bee770b562e3083c64ddb7335bc9f7","abstract_canon_sha256":"1a97e7884d8bf6de8c3a3eb3c6111d9f6c1f1004c85d3c68f542b287110c1a21"},"schema_version":"1.0"},"canonical_sha256":"13e2a3be77bb4f9a886979110fb9d41f7b3f579ec0e95fbde84425f2707642e7","source":{"kind":"arxiv","id":"1509.01698","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01698","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01698v4","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01698","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"CPRKHPTXXNHZ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CPRKHPTXXNHZVCDJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CPRKHPTX","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CPRKHPTXXNHZVCDJPEIQ7OOUD5","target":"record","payload":{"canonical_record":{"source":{"id":"1509.01698","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-05T12:48:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"bab5fb3e86f67d7f94f3252a9474f773f2bee770b562e3083c64ddb7335bc9f7","abstract_canon_sha256":"1a97e7884d8bf6de8c3a3eb3c6111d9f6c1f1004c85d3c68f542b287110c1a21"},"schema_version":"1.0"},"canonical_sha256":"13e2a3be77bb4f9a886979110fb9d41f7b3f579ec0e95fbde84425f2707642e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:40.143872Z","signature_b64":"Wvna7Ybua7xSud0mxZFWnOaY+hTOklBxfDvvx0AKXC+LPb9H9FvTee9XQlgI4gOtmMfFlGyux6djYGwJapf9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13e2a3be77bb4f9a886979110fb9d41f7b3f579ec0e95fbde84425f2707642e7","last_reissued_at":"2026-05-18T00:38:40.143391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:40.143391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.01698","source_version":4,"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-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROpM7rthCH3eoZ1q2opWUjSNUDETKZEKdqLatf3ZucFH4Isn0qxmCNpQcmASA8qUvXe1orTBGh+7K8HxoOklCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:22:18.958568Z"},"content_sha256":"f27d8b1708ade696c29ccdbffb8b8b70fb0f6bd14c7b508a692039d35dcca844","schema_version":"1.0","event_id":"sha256:f27d8b1708ade696c29ccdbffb8b8b70fb0f6bd14c7b508a692039d35dcca844"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CPRKHPTXXNHZVCDJPEIQ7OOUD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HAMSI: A Parallel Incremental Optimization Algorithm Using Quadratic Approximations for Solving Partially Separable Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"A. Taylan Cemgil, \\c{S}. \\.Ilker Birbil, Figen \\\"Oztoprak, Hazal Koptagel, Kamer Kaya, M. Kaan \\\"Ozt\\\"urk, Nurdan Kuru, Umut \\c{S}im\\c{s}ekli","submitted_at":"2015-09-05T12:48:01Z","abstract_excerpt":"We propose HAMSI (Hessian Approximated Multiple Subsets Iteration), which is a provably convergent, second order incremental algorithm for solving large-scale partially separable optimization problems. The algorithm is based on a local quadratic approximation, and hence, allows incorporating curvature information to speed-up the convergence. HAMSI is inherently parallel and it scales nicely with the number of processors. Combined with techniques for effectively utilizing modern parallel computer architectures, we illustrate that the proposed method converges more rapidly than a parallel stocha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01698","kind":"arxiv","version":4},"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-18T00:38:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9BxK/rzvyOQpOGdw8I+gHTdM5q07wCCmvQHlpSNez8yINOFc6jfRkDA8WIx2d6vVg+67KjMTzVFLcbafX0bKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:22:18.959243Z"},"content_sha256":"7391f2242e907ab88b052326af5c3952557ada89fe356cce32fac1af9be8d801","schema_version":"1.0","event_id":"sha256:7391f2242e907ab88b052326af5c3952557ada89fe356cce32fac1af9be8d801"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CPRKHPTXXNHZVCDJPEIQ7OOUD5/bundle.json","state_url":"https://pith.science/pith/CPRKHPTXXNHZVCDJPEIQ7OOUD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CPRKHPTXXNHZVCDJPEIQ7OOUD5/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-26T20:22:18Z","links":{"resolver":"https://pith.science/pith/CPRKHPTXXNHZVCDJPEIQ7OOUD5","bundle":"https://pith.science/pith/CPRKHPTXXNHZVCDJPEIQ7OOUD5/bundle.json","state":"https://pith.science/pith/CPRKHPTXXNHZVCDJPEIQ7OOUD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CPRKHPTXXNHZVCDJPEIQ7OOUD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CPRKHPTXXNHZVCDJPEIQ7OOUD5","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":"1a97e7884d8bf6de8c3a3eb3c6111d9f6c1f1004c85d3c68f542b287110c1a21","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-05T12:48:01Z","title_canon_sha256":"bab5fb3e86f67d7f94f3252a9474f773f2bee770b562e3083c64ddb7335bc9f7"},"schema_version":"1.0","source":{"id":"1509.01698","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.01698","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"arxiv_version","alias_value":"1509.01698v4","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.01698","created_at":"2026-05-18T00:38:40Z"},{"alias_kind":"pith_short_12","alias_value":"CPRKHPTXXNHZ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CPRKHPTXXNHZVCDJ","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CPRKHPTX","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:7391f2242e907ab88b052326af5c3952557ada89fe356cce32fac1af9be8d801","target":"graph","created_at":"2026-05-18T00:38:40Z","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":"We propose HAMSI (Hessian Approximated Multiple Subsets Iteration), which is a provably convergent, second order incremental algorithm for solving large-scale partially separable optimization problems. The algorithm is based on a local quadratic approximation, and hence, allows incorporating curvature information to speed-up the convergence. HAMSI is inherently parallel and it scales nicely with the number of processors. Combined with techniques for effectively utilizing modern parallel computer architectures, we illustrate that the proposed method converges more rapidly than a parallel stocha","authors_text":"A. Taylan Cemgil, \\c{S}. \\.Ilker Birbil, Figen \\\"Oztoprak, Hazal Koptagel, Kamer Kaya, M. Kaan \\\"Ozt\\\"urk, Nurdan Kuru, Umut \\c{S}im\\c{s}ekli","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-05T12:48:01Z","title":"HAMSI: A Parallel Incremental Optimization Algorithm Using Quadratic Approximations for Solving Partially Separable Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.01698","kind":"arxiv","version":4},"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:f27d8b1708ade696c29ccdbffb8b8b70fb0f6bd14c7b508a692039d35dcca844","target":"record","created_at":"2026-05-18T00:38:40Z","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":"1a97e7884d8bf6de8c3a3eb3c6111d9f6c1f1004c85d3c68f542b287110c1a21","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-05T12:48:01Z","title_canon_sha256":"bab5fb3e86f67d7f94f3252a9474f773f2bee770b562e3083c64ddb7335bc9f7"},"schema_version":"1.0","source":{"id":"1509.01698","kind":"arxiv","version":4}},"canonical_sha256":"13e2a3be77bb4f9a886979110fb9d41f7b3f579ec0e95fbde84425f2707642e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13e2a3be77bb4f9a886979110fb9d41f7b3f579ec0e95fbde84425f2707642e7","first_computed_at":"2026-05-18T00:38:40.143391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:40.143391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wvna7Ybua7xSud0mxZFWnOaY+hTOklBxfDvvx0AKXC+LPb9H9FvTee9XQlgI4gOtmMfFlGyux6djYGwJapf9AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:40.143872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.01698","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f27d8b1708ade696c29ccdbffb8b8b70fb0f6bd14c7b508a692039d35dcca844","sha256:7391f2242e907ab88b052326af5c3952557ada89fe356cce32fac1af9be8d801"],"state_sha256":"3b79cceaf07a0c4401e7d8b6122489ddb93b384a1cdd95fb295f769c84efb9e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"62qoRykJ2wbbYuH61wneLSrFjvpY/Vtp3vFUcZlIutl65cZR61H+1tePV4K1o+sAh0caU7LcqdlctKH1U12YCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:22:18.962830Z","bundle_sha256":"abf69e9d5f3076b5c1df543480a38169364c8a91f15f676f4ba9e59412315380"}}