{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MLPIR575GFMAPZGXNE2OODJSII","short_pith_number":"pith:MLPIR575","canonical_record":{"source":{"id":"1008.5231","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-31T07:07:27Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"72a367ea90ebd1f10b34c83ba89b0698f7c96cb25576cc390e8b58072f469113","abstract_canon_sha256":"58fcd108610596d082ba5545ac3396b1bcd20b0ddfee012c35840a4f432b9913"},"schema_version":"1.0"},"canonical_sha256":"62de88f7fd315807e4d76934e70d32422dc988e0555f0a63bc8d0e6b845a4e6a","source":{"kind":"arxiv","id":"1008.5231","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5231","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5231v3","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5231","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"pith_short_12","alias_value":"MLPIR575GFMA","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MLPIR575GFMAPZGX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MLPIR575","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MLPIR575GFMAPZGXNE2OODJSII","target":"record","payload":{"canonical_record":{"source":{"id":"1008.5231","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-31T07:07:27Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"72a367ea90ebd1f10b34c83ba89b0698f7c96cb25576cc390e8b58072f469113","abstract_canon_sha256":"58fcd108610596d082ba5545ac3396b1bcd20b0ddfee012c35840a4f432b9913"},"schema_version":"1.0"},"canonical_sha256":"62de88f7fd315807e4d76934e70d32422dc988e0555f0a63bc8d0e6b845a4e6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:12.155403Z","signature_b64":"Xbww/tFSIUSkirnYjzppGq/Dn6BVpdXvV/+d3JSt4OhXWjBa4vu0vqbuT69v9pqa8voWZ0pI/LB98ML+j02ICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62de88f7fd315807e4d76934e70d32422dc988e0555f0a63bc8d0e6b845a4e6a","last_reissued_at":"2026-05-18T04:16:12.154997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:12.154997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.5231","source_version":3,"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-18T04:16:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wGD2ZAiKLL0aGnmwmKxH158cAp6HgQRhl5mg2aBmUvwSs4xWpD4UeV3HnI8SSFvpS8/5+73tFPs5F5zI94RCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:02:19.613368Z"},"content_sha256":"dbf94d3fb9f9445afd079c3e33ba69c7cb31607bc25137128ac4f4383b743467","schema_version":"1.0","event_id":"sha256:dbf94d3fb9f9445afd079c3e33ba69c7cb31607bc25137128ac4f4383b743467"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MLPIR575GFMAPZGXNE2OODJSII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"math.OC","authors_text":"Isao Yamada, Konstantinos Slavakis","submitted_at":"2010-08-31T07:07:27Z","abstract_excerpt":"Many online, i.e., time-adaptive, inverse problems in signal processing and machine learning fall under the wide umbrella of the asymptotic minimization of a sequence of non-negative, convex, and continuous functions. To incorporate a-priori knowledge into the design, the asymptotic minimization task is usually constrained on a fixed closed convex set, which is dictated by the available a-priori information. To increase versatility towards the usage of the available information, the present manuscript extends the Adaptive Projected Subgradient Method (APSM) by introducing an algorithmic scheme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5231","kind":"arxiv","version":3},"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-18T04:16:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p52uEVak6PkO+IY0zvdoZkLgpxMAOw7yxv8TBcWmGAjIws37hyA/5llm1cZ2Qobv9c4ywTJFB9CU6H8lrhKCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:02:19.614102Z"},"content_sha256":"a5c6cbe5ab474d18e8145a92f3b72ed09e15ee50a6adb46090dd0afe77e276e6","schema_version":"1.0","event_id":"sha256:a5c6cbe5ab474d18e8145a92f3b72ed09e15ee50a6adb46090dd0afe77e276e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLPIR575GFMAPZGXNE2OODJSII/bundle.json","state_url":"https://pith.science/pith/MLPIR575GFMAPZGXNE2OODJSII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLPIR575GFMAPZGXNE2OODJSII/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-10T00:02:19Z","links":{"resolver":"https://pith.science/pith/MLPIR575GFMAPZGXNE2OODJSII","bundle":"https://pith.science/pith/MLPIR575GFMAPZGXNE2OODJSII/bundle.json","state":"https://pith.science/pith/MLPIR575GFMAPZGXNE2OODJSII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLPIR575GFMAPZGXNE2OODJSII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MLPIR575GFMAPZGXNE2OODJSII","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":"58fcd108610596d082ba5545ac3396b1bcd20b0ddfee012c35840a4f432b9913","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-31T07:07:27Z","title_canon_sha256":"72a367ea90ebd1f10b34c83ba89b0698f7c96cb25576cc390e8b58072f469113"},"schema_version":"1.0","source":{"id":"1008.5231","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.5231","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"arxiv_version","alias_value":"1008.5231v3","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.5231","created_at":"2026-05-18T04:16:12Z"},{"alias_kind":"pith_short_12","alias_value":"MLPIR575GFMA","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MLPIR575GFMAPZGX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MLPIR575","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:a5c6cbe5ab474d18e8145a92f3b72ed09e15ee50a6adb46090dd0afe77e276e6","target":"graph","created_at":"2026-05-18T04:16:12Z","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":"Many online, i.e., time-adaptive, inverse problems in signal processing and machine learning fall under the wide umbrella of the asymptotic minimization of a sequence of non-negative, convex, and continuous functions. To incorporate a-priori knowledge into the design, the asymptotic minimization task is usually constrained on a fixed closed convex set, which is dictated by the available a-priori information. To increase versatility towards the usage of the available information, the present manuscript extends the Adaptive Projected Subgradient Method (APSM) by introducing an algorithmic scheme","authors_text":"Isao Yamada, Konstantinos Slavakis","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-31T07:07:27Z","title":"The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.5231","kind":"arxiv","version":3},"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:dbf94d3fb9f9445afd079c3e33ba69c7cb31607bc25137128ac4f4383b743467","target":"record","created_at":"2026-05-18T04:16:12Z","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":"58fcd108610596d082ba5545ac3396b1bcd20b0ddfee012c35840a4f432b9913","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-08-31T07:07:27Z","title_canon_sha256":"72a367ea90ebd1f10b34c83ba89b0698f7c96cb25576cc390e8b58072f469113"},"schema_version":"1.0","source":{"id":"1008.5231","kind":"arxiv","version":3}},"canonical_sha256":"62de88f7fd315807e4d76934e70d32422dc988e0555f0a63bc8d0e6b845a4e6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62de88f7fd315807e4d76934e70d32422dc988e0555f0a63bc8d0e6b845a4e6a","first_computed_at":"2026-05-18T04:16:12.154997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:12.154997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xbww/tFSIUSkirnYjzppGq/Dn6BVpdXvV/+d3JSt4OhXWjBa4vu0vqbuT69v9pqa8voWZ0pI/LB98ML+j02ICw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:12.155403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.5231","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbf94d3fb9f9445afd079c3e33ba69c7cb31607bc25137128ac4f4383b743467","sha256:a5c6cbe5ab474d18e8145a92f3b72ed09e15ee50a6adb46090dd0afe77e276e6"],"state_sha256":"80dabe2288d4642c29d65ab61a6a1cc57ee209ad1872267ffcdd9955f1bb0e04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9rBvadWlkANA99u/zIZbG8UyEPQuLoOPVoFfhsLseDuinq1h+oilVx8i3gMh/HfTGF2+ny2MS3KHFs/w3WhBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:02:19.618681Z","bundle_sha256":"2d4691cc2942e3fb63dfae105ecfd8446fc44b13cccdd7e208b253fc177500bc"}}