{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:S7X6H3AYGEDZAVIYERTK5S76WE","short_pith_number":"pith:S7X6H3AY","canonical_record":{"source":{"id":"1608.04802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-16T23:11:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f4fa936cfe896e1245d6578b5eef25cb33bec03eaa8fb9d75582dceacb49d120","abstract_canon_sha256":"83d7c5cc7ca791da7d359a9f87daebfaa897a7135760a803539d2a6dba85f808"},"schema_version":"1.0"},"canonical_sha256":"97efe3ec1831079055182466aecbfeb13b8b0ef304d66168f5f18a7da0ba8072","source":{"kind":"arxiv","id":"1608.04802","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04802","created_at":"2026-05-18T00:49:46Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04802v2","created_at":"2026-05-18T00:49:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04802","created_at":"2026-05-18T00:49:46Z"},{"alias_kind":"pith_short_12","alias_value":"S7X6H3AYGEDZ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"S7X6H3AYGEDZAVIY","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"S7X6H3AY","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:S7X6H3AYGEDZAVIYERTK5S76WE","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-16T23:11:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"f4fa936cfe896e1245d6578b5eef25cb33bec03eaa8fb9d75582dceacb49d120","abstract_canon_sha256":"83d7c5cc7ca791da7d359a9f87daebfaa897a7135760a803539d2a6dba85f808"},"schema_version":"1.0"},"canonical_sha256":"97efe3ec1831079055182466aecbfeb13b8b0ef304d66168f5f18a7da0ba8072","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:46.862356Z","signature_b64":"af3ki4KyBDj25vttorjFzjClWMMmM7ZdJmUMP7IQV4gGNmNpLMD3UFD3XOANmwn1W04vdxwtk7tsH20VvI26BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97efe3ec1831079055182466aecbfeb13b8b0ef304d66168f5f18a7da0ba8072","last_reissued_at":"2026-05-18T00:49:46.861721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:46.861721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04802","source_version":2,"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:49:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8waYdxDyQnUbtf0ULe4mz522QU0VzmkePjF4ZM3XqoWwa4D8rYDM0/makg8eLVi0AbZMSfUcen/9Urh7iS/FAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:09:56.703759Z"},"content_sha256":"28f283db8318db5f26a95d76643350a37b6a2d6a8f82967b6f4d38e66dc4a1af","schema_version":"1.0","event_id":"sha256:28f283db8318db5f26a95d76643350a37b6a2d6a8f82967b6f4d38e66dc4a1af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:S7X6H3AYGEDZAVIYERTK5S76WE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Learning of Non-Decomposable Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Alan Mackey, Ariel Gordon, Elad ET. Eban, Gal Elidan, Mariano Schain, Rif A. Saurous","submitted_at":"2016-08-16T23:11:14Z","abstract_excerpt":"Modern retrieval systems are often driven by an underlying machine learning model. The goal of such systems is to identify and possibly rank the few most relevant items for a given query or context. Thus, such systems are typically evaluated using a ranking-based performance metric such as the area under the precision-recall curve, the $F_\\beta$ score, precision at fixed recall, etc. Obviously, it is desirable to train such systems to optimize the metric of interest.\n  In practice, due to the scalability limitations of existing approaches for optimizing such objectives, large-scale retrieval s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04802","kind":"arxiv","version":2},"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:49:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HtWY34mguXxdMFdZJRiNk4Ckq7tNVKUbj75ZVQPTgPAAl6/yem1BUI+3ub3stvhc+XmGCkZT9Y0CgeEoLSQWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T01:09:56.704100Z"},"content_sha256":"b99d81ec98c108c8221cf501aa1096d911002563d7c81b9e9935ce99b6c5b9be","schema_version":"1.0","event_id":"sha256:b99d81ec98c108c8221cf501aa1096d911002563d7c81b9e9935ce99b6c5b9be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7X6H3AYGEDZAVIYERTK5S76WE/bundle.json","state_url":"https://pith.science/pith/S7X6H3AYGEDZAVIYERTK5S76WE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7X6H3AYGEDZAVIYERTK5S76WE/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-09T01:09:56Z","links":{"resolver":"https://pith.science/pith/S7X6H3AYGEDZAVIYERTK5S76WE","bundle":"https://pith.science/pith/S7X6H3AYGEDZAVIYERTK5S76WE/bundle.json","state":"https://pith.science/pith/S7X6H3AYGEDZAVIYERTK5S76WE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7X6H3AYGEDZAVIYERTK5S76WE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:S7X6H3AYGEDZAVIYERTK5S76WE","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":"83d7c5cc7ca791da7d359a9f87daebfaa897a7135760a803539d2a6dba85f808","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-16T23:11:14Z","title_canon_sha256":"f4fa936cfe896e1245d6578b5eef25cb33bec03eaa8fb9d75582dceacb49d120"},"schema_version":"1.0","source":{"id":"1608.04802","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04802","created_at":"2026-05-18T00:49:46Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04802v2","created_at":"2026-05-18T00:49:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04802","created_at":"2026-05-18T00:49:46Z"},{"alias_kind":"pith_short_12","alias_value":"S7X6H3AYGEDZ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"S7X6H3AYGEDZAVIY","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"S7X6H3AY","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:b99d81ec98c108c8221cf501aa1096d911002563d7c81b9e9935ce99b6c5b9be","target":"graph","created_at":"2026-05-18T00:49:46Z","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":"Modern retrieval systems are often driven by an underlying machine learning model. The goal of such systems is to identify and possibly rank the few most relevant items for a given query or context. Thus, such systems are typically evaluated using a ranking-based performance metric such as the area under the precision-recall curve, the $F_\\beta$ score, precision at fixed recall, etc. Obviously, it is desirable to train such systems to optimize the metric of interest.\n  In practice, due to the scalability limitations of existing approaches for optimizing such objectives, large-scale retrieval s","authors_text":"Alan Mackey, Ariel Gordon, Elad ET. Eban, Gal Elidan, Mariano Schain, Rif A. Saurous","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-16T23:11:14Z","title":"Scalable Learning of Non-Decomposable Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04802","kind":"arxiv","version":2},"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:28f283db8318db5f26a95d76643350a37b6a2d6a8f82967b6f4d38e66dc4a1af","target":"record","created_at":"2026-05-18T00:49:46Z","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":"83d7c5cc7ca791da7d359a9f87daebfaa897a7135760a803539d2a6dba85f808","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-08-16T23:11:14Z","title_canon_sha256":"f4fa936cfe896e1245d6578b5eef25cb33bec03eaa8fb9d75582dceacb49d120"},"schema_version":"1.0","source":{"id":"1608.04802","kind":"arxiv","version":2}},"canonical_sha256":"97efe3ec1831079055182466aecbfeb13b8b0ef304d66168f5f18a7da0ba8072","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97efe3ec1831079055182466aecbfeb13b8b0ef304d66168f5f18a7da0ba8072","first_computed_at":"2026-05-18T00:49:46.861721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:46.861721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"af3ki4KyBDj25vttorjFzjClWMMmM7ZdJmUMP7IQV4gGNmNpLMD3UFD3XOANmwn1W04vdxwtk7tsH20VvI26BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:46.862356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04802","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28f283db8318db5f26a95d76643350a37b6a2d6a8f82967b6f4d38e66dc4a1af","sha256:b99d81ec98c108c8221cf501aa1096d911002563d7c81b9e9935ce99b6c5b9be"],"state_sha256":"0132e7b7c781e3c9661ba38edfd920be37888ae9bbbe40d173a1f63df9c7a651"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4x10X6A9cr3yVA+VZy4KgjQp+bkhwks/gTLYJYqHhz4p/Ta/DkxTDmfybX/egz75RMHw9KmVfFlrN9zpP2oXCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T01:09:56.706082Z","bundle_sha256":"ae3640c6322beb4e650d2a6083cbc6d3ae02bc3ffe7f898abec6dc3a31f6448a"}}