{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R72GEXG57KBZ22ABXY5DX35IQJ","short_pith_number":"pith:R72GEXG5","canonical_record":{"source":{"id":"1508.00842","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-04T17:23:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"21ce3ee0bc8c644f99cdd62041ffed0060c4efe597b5baae46d236f8da4d3558","abstract_canon_sha256":"f6ab77f91000d8757cbf4fe29456744d9c0893c1b98c03527bba3e60b7bbd14f"},"schema_version":"1.0"},"canonical_sha256":"8ff4625cddfa839d6801be3a3befa88279b1c87220a522a1a95dd0fc05a518c1","source":{"kind":"arxiv","id":"1508.00842","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00842","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00842v4","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00842","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"pith_short_12","alias_value":"R72GEXG57KBZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R72GEXG57KBZ22AB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R72GEXG5","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R72GEXG57KBZ22ABXY5DX35IQJ","target":"record","payload":{"canonical_record":{"source":{"id":"1508.00842","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-04T17:23:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"21ce3ee0bc8c644f99cdd62041ffed0060c4efe597b5baae46d236f8da4d3558","abstract_canon_sha256":"f6ab77f91000d8757cbf4fe29456744d9c0893c1b98c03527bba3e60b7bbd14f"},"schema_version":"1.0"},"canonical_sha256":"8ff4625cddfa839d6801be3a3befa88279b1c87220a522a1a95dd0fc05a518c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:21.048745Z","signature_b64":"Hqmra9du8MTQjYKL4rN6TSZ+dj5G7b0V1mshp+bjdSRQbIoPWSdhZ28YFeLnJ6DPIaH2XJPRnxFqUL52TaS8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ff4625cddfa839d6801be3a3befa88279b1c87220a522a1a95dd0fc05a518c1","last_reissued_at":"2026-05-18T01:08:21.048118Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:21.048118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.00842","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-18T01:08:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HrkReTH4DpYyi+rs3gPGtrFb1v57MjQAypXtxxsFUb4RkhNi9LUHJX7+P3Xw2hJUrFPih76eYriyeTYrb7LzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:27:33.215355Z"},"content_sha256":"e6b4c56f5ad4a762cc914b2067490b5741efd522ab78d053bfdc180fc568b6e9","schema_version":"1.0","event_id":"sha256:e6b4c56f5ad4a762cc914b2067490b5741efd522ab78d053bfdc180fc568b6e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R72GEXG57KBZ22ABXY5DX35IQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perceptron like Algorithms for Online Learning to Rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ambuj Tewari, Sougata Chaudhuri","submitted_at":"2015-08-04T17:23:46Z","abstract_excerpt":"Perceptron is a classic online algorithm for learning a classification function. In this paper, we provide a novel extension of the perceptron algorithm to the learning to rank problem in information retrieval. We consider popular listwise performance measures such as Normalized Discounted Cumulative Gain (NDCG) and Average Precision (AP). A modern perspective on perceptron for classification is that it is simply an instance of online gradient descent (OGD), during mistake rounds, using the hinge loss function. Motivated by this interpretation, we propose a novel family of listwise, large marg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00842","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-18T01:08:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u9x/91XPMfSI1sGTke30454ix7+vs67PRuBmSKCoP2P7mLY/1pm+4CL4W2Bp/TeOzMag1B0OaxSsQeimrKGwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:27:33.215881Z"},"content_sha256":"02da44926bd598b7c73320da268efd895d9fd8c0240c4fac33851d0093ffe617","schema_version":"1.0","event_id":"sha256:02da44926bd598b7c73320da268efd895d9fd8c0240c4fac33851d0093ffe617"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R72GEXG57KBZ22ABXY5DX35IQJ/bundle.json","state_url":"https://pith.science/pith/R72GEXG57KBZ22ABXY5DX35IQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R72GEXG57KBZ22ABXY5DX35IQJ/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-31T14:27:33Z","links":{"resolver":"https://pith.science/pith/R72GEXG57KBZ22ABXY5DX35IQJ","bundle":"https://pith.science/pith/R72GEXG57KBZ22ABXY5DX35IQJ/bundle.json","state":"https://pith.science/pith/R72GEXG57KBZ22ABXY5DX35IQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R72GEXG57KBZ22ABXY5DX35IQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R72GEXG57KBZ22ABXY5DX35IQJ","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":"f6ab77f91000d8757cbf4fe29456744d9c0893c1b98c03527bba3e60b7bbd14f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-04T17:23:46Z","title_canon_sha256":"21ce3ee0bc8c644f99cdd62041ffed0060c4efe597b5baae46d236f8da4d3558"},"schema_version":"1.0","source":{"id":"1508.00842","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00842","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00842v4","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00842","created_at":"2026-05-18T01:08:21Z"},{"alias_kind":"pith_short_12","alias_value":"R72GEXG57KBZ","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R72GEXG57KBZ22AB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R72GEXG5","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:02da44926bd598b7c73320da268efd895d9fd8c0240c4fac33851d0093ffe617","target":"graph","created_at":"2026-05-18T01:08:21Z","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":"Perceptron is a classic online algorithm for learning a classification function. In this paper, we provide a novel extension of the perceptron algorithm to the learning to rank problem in information retrieval. We consider popular listwise performance measures such as Normalized Discounted Cumulative Gain (NDCG) and Average Precision (AP). A modern perspective on perceptron for classification is that it is simply an instance of online gradient descent (OGD), during mistake rounds, using the hinge loss function. Motivated by this interpretation, we propose a novel family of listwise, large marg","authors_text":"Ambuj Tewari, Sougata Chaudhuri","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-04T17:23:46Z","title":"Perceptron like Algorithms for Online Learning to Rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00842","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:e6b4c56f5ad4a762cc914b2067490b5741efd522ab78d053bfdc180fc568b6e9","target":"record","created_at":"2026-05-18T01:08:21Z","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":"f6ab77f91000d8757cbf4fe29456744d9c0893c1b98c03527bba3e60b7bbd14f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-08-04T17:23:46Z","title_canon_sha256":"21ce3ee0bc8c644f99cdd62041ffed0060c4efe597b5baae46d236f8da4d3558"},"schema_version":"1.0","source":{"id":"1508.00842","kind":"arxiv","version":4}},"canonical_sha256":"8ff4625cddfa839d6801be3a3befa88279b1c87220a522a1a95dd0fc05a518c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ff4625cddfa839d6801be3a3befa88279b1c87220a522a1a95dd0fc05a518c1","first_computed_at":"2026-05-18T01:08:21.048118Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:21.048118Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hqmra9du8MTQjYKL4rN6TSZ+dj5G7b0V1mshp+bjdSRQbIoPWSdhZ28YFeLnJ6DPIaH2XJPRnxFqUL52TaS8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:21.048745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00842","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6b4c56f5ad4a762cc914b2067490b5741efd522ab78d053bfdc180fc568b6e9","sha256:02da44926bd598b7c73320da268efd895d9fd8c0240c4fac33851d0093ffe617"],"state_sha256":"c514c272a75f1cb290d09b85b7d5244dde9322b2895e1c8e3d05e7a0bc98c3dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"woQtYSLxTjb+hIeYQ6xBrdTL1TexpZa1hwmah898usIta8c7xjFFyEtwSkzFtZIgskwDZwHhdWzjOIQpZ2euDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:27:33.220105Z","bundle_sha256":"99a62d1bedb2f678e026711746f6c9a0b16abd3b60fb3655ecf7f38aa37d215a"}}