{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BRAS764NZETT7B3JSZ74YHPYB7","short_pith_number":"pith:BRAS764N","canonical_record":{"source":{"id":"2402.01146","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-02T05:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"82927baf0d3d66e6bfc335d60ffc57be788a95de02387b8dd428438953040f4b","abstract_canon_sha256":"e8222e5ad1573a04b2adbf3225264814007d1d1013b64090718575f927e31353"},"schema_version":"1.0"},"canonical_sha256":"0c412ffb8dc9273f8769967fcc1df80fc9b3cd25a34e66da4cf95a829f367532","source":{"kind":"arxiv","id":"2402.01146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.01146","created_at":"2026-07-05T07:40:31Z"},{"alias_kind":"arxiv_version","alias_value":"2402.01146v1","created_at":"2026-07-05T07:40:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.01146","created_at":"2026-07-05T07:40:31Z"},{"alias_kind":"pith_short_12","alias_value":"BRAS764NZETT","created_at":"2026-07-05T07:40:31Z"},{"alias_kind":"pith_short_16","alias_value":"BRAS764NZETT7B3J","created_at":"2026-07-05T07:40:31Z"},{"alias_kind":"pith_short_8","alias_value":"BRAS764N","created_at":"2026-07-05T07:40:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BRAS764NZETT7B3JSZ74YHPYB7","target":"record","payload":{"canonical_record":{"source":{"id":"2402.01146","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-02T05:21:50Z","cross_cats_sorted":[],"title_canon_sha256":"82927baf0d3d66e6bfc335d60ffc57be788a95de02387b8dd428438953040f4b","abstract_canon_sha256":"e8222e5ad1573a04b2adbf3225264814007d1d1013b64090718575f927e31353"},"schema_version":"1.0"},"canonical_sha256":"0c412ffb8dc9273f8769967fcc1df80fc9b3cd25a34e66da4cf95a829f367532","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:31.352348Z","signature_b64":"+md7A/pBkPsoQD3Dy4wVfW/d+0beNT7W29I92+NS1DM8q0/2ihK/69kYkuMcPg/0ACqs0eG1IV+1PgK4BDq/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c412ffb8dc9273f8769967fcc1df80fc9b3cd25a34e66da4cf95a829f367532","last_reissued_at":"2026-07-05T07:40:31.351891Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:31.351891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.01146","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-05T07:40:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMUiqEaGtxqNUkoi+B/NhzNbhB3WZZuZzZAtpmAct7P9mf6+AGnnyioAMVxciTe1dHqEpGue/r8Z86NydpyJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T19:53:22.469667Z"},"content_sha256":"ebb6cce2b9b38c8907e8076263c58f1744b640f7b8f66c4548b9df130e25dbbe","schema_version":"1.0","event_id":"sha256:ebb6cce2b9b38c8907e8076263c58f1744b640f7b8f66c4548b9df130e25dbbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BRAS764NZETT7B3JSZ74YHPYB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limited Memory Online Gradient Descent for Kernelized Pairwise Learning with Dynamic Averaging","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin Gu, Hilal AlQuabeh, William de Vazelhes","submitted_at":"2024-02-02T05:21:50Z","abstract_excerpt":"Pairwise learning, an important domain within machine learning, addresses loss functions defined on pairs of training examples, including those in metric learning and AUC maximization. Acknowledging the quadratic growth in computation complexity accompanying pairwise loss as the sample size grows, researchers have turned to online gradient descent (OGD) methods for enhanced scalability. Recently, an OGD algorithm emerged, employing gradient computation involving prior and most recent examples, a step that effectively reduces algorithmic complexity to $O(T)$, with $T$ being the number of receiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.01146","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/2402.01146/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-05T07:40:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTzFF3qG5pMBr5kSncvoCptYBalEitNPCGxMnKJmSmyfr4B4AX/FVEsUPPk9xQvRNEmdYlS2oUxa4/53RfRODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-13T19:53:22.470036Z"},"content_sha256":"5709f6b356d172ba521d4e1950d76d45f69622403c5c68ff0760a8179267596f","schema_version":"1.0","event_id":"sha256:5709f6b356d172ba521d4e1950d76d45f69622403c5c68ff0760a8179267596f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BRAS764NZETT7B3JSZ74YHPYB7/bundle.json","state_url":"https://pith.science/pith/BRAS764NZETT7B3JSZ74YHPYB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BRAS764NZETT7B3JSZ74YHPYB7/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-07-13T19:53:22Z","links":{"resolver":"https://pith.science/pith/BRAS764NZETT7B3JSZ74YHPYB7","bundle":"https://pith.science/pith/BRAS764NZETT7B3JSZ74YHPYB7/bundle.json","state":"https://pith.science/pith/BRAS764NZETT7B3JSZ74YHPYB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BRAS764NZETT7B3JSZ74YHPYB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BRAS764NZETT7B3JSZ74YHPYB7","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":"e8222e5ad1573a04b2adbf3225264814007d1d1013b64090718575f927e31353","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-02T05:21:50Z","title_canon_sha256":"82927baf0d3d66e6bfc335d60ffc57be788a95de02387b8dd428438953040f4b"},"schema_version":"1.0","source":{"id":"2402.01146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.01146","created_at":"2026-07-05T07:40:31Z"},{"alias_kind":"arxiv_version","alias_value":"2402.01146v1","created_at":"2026-07-05T07:40:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.01146","created_at":"2026-07-05T07:40:31Z"},{"alias_kind":"pith_short_12","alias_value":"BRAS764NZETT","created_at":"2026-07-05T07:40:31Z"},{"alias_kind":"pith_short_16","alias_value":"BRAS764NZETT7B3J","created_at":"2026-07-05T07:40:31Z"},{"alias_kind":"pith_short_8","alias_value":"BRAS764N","created_at":"2026-07-05T07:40:31Z"}],"graph_snapshots":[{"event_id":"sha256:5709f6b356d172ba521d4e1950d76d45f69622403c5c68ff0760a8179267596f","target":"graph","created_at":"2026-07-05T07:40:31Z","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/2402.01146/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Pairwise learning, an important domain within machine learning, addresses loss functions defined on pairs of training examples, including those in metric learning and AUC maximization. Acknowledging the quadratic growth in computation complexity accompanying pairwise loss as the sample size grows, researchers have turned to online gradient descent (OGD) methods for enhanced scalability. Recently, an OGD algorithm emerged, employing gradient computation involving prior and most recent examples, a step that effectively reduces algorithmic complexity to $O(T)$, with $T$ being the number of receiv","authors_text":"Bin Gu, Hilal AlQuabeh, William de Vazelhes","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-02T05:21:50Z","title":"Limited Memory Online Gradient Descent for Kernelized Pairwise Learning with Dynamic Averaging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.01146","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:ebb6cce2b9b38c8907e8076263c58f1744b640f7b8f66c4548b9df130e25dbbe","target":"record","created_at":"2026-07-05T07:40:31Z","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":"e8222e5ad1573a04b2adbf3225264814007d1d1013b64090718575f927e31353","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-02T05:21:50Z","title_canon_sha256":"82927baf0d3d66e6bfc335d60ffc57be788a95de02387b8dd428438953040f4b"},"schema_version":"1.0","source":{"id":"2402.01146","kind":"arxiv","version":1}},"canonical_sha256":"0c412ffb8dc9273f8769967fcc1df80fc9b3cd25a34e66da4cf95a829f367532","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c412ffb8dc9273f8769967fcc1df80fc9b3cd25a34e66da4cf95a829f367532","first_computed_at":"2026-07-05T07:40:31.351891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:40:31.351891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+md7A/pBkPsoQD3Dy4wVfW/d+0beNT7W29I92+NS1DM8q0/2ihK/69kYkuMcPg/0ACqs0eG1IV+1PgK4BDq/AA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:40:31.352348Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.01146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebb6cce2b9b38c8907e8076263c58f1744b640f7b8f66c4548b9df130e25dbbe","sha256:5709f6b356d172ba521d4e1950d76d45f69622403c5c68ff0760a8179267596f"],"state_sha256":"6ab5f966d78ddc5154dc9709c67600ba243a7a620f9d2a11c05c83415e1553c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vdo//LuYt+cXr0eszPadH9QZTM95nZ0z9CSzLSEk9r1CI5ECx25WkaDyv2yac/6N/DnI3y5gDe+6b0nsEqOKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-13T19:53:22.472149Z","bundle_sha256":"8a65437941674d50cbd11620238f0eb7fcdf4aa84aef23ebdbfaed18b90b31ec"}}