{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NVXCHIII5KMRSSEJF4WILDSJHI","short_pith_number":"pith:NVXCHIII","schema_version":"1.0","canonical_sha256":"6d6e23a108ea991948892f2c858e493a3d4a1fd1a428d0fff15e0f84bc8034db","source":{"kind":"arxiv","id":"1906.07589","version":1},"attestation_state":"computed","paper":{"title":"Learning with Average Precision: Training Image Retrieval with a Listwise Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cesar Roberto de Souza, Jerome Revaud, Jon Almazan, Rafael Sampaio de Rezende","submitted_at":"2019-06-18T13:59:34Z","abstract_excerpt":"Image retrieval can be formulated as a ranking problem where the goal is to order database images by decreasing similarity to the query. Recent deep models for image retrieval have outperformed traditional methods by leveraging ranking-tailored loss functions, but important theoretical and practical problems remain. First, rather than directly optimizing the global ranking, they minimize an upper-bound on the essential loss, which does not necessarily result in an optimal mean average precision (mAP). Second, these methods require significant engineering efforts to work well, e.g. special pre-"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1906.07589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-18T13:59:34Z","cross_cats_sorted":[],"title_canon_sha256":"911d99a0876682d96456604b74768c69e09b8b68d3479c783d30db10f3df1c29","abstract_canon_sha256":"71e39ce37e9332eb2d7025f0dd92a129dece751cc4d4c293702996f3384f0444"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:07.412837Z","signature_b64":"yhXOGYsuZ/06xaEe4tjUndmxZjcWWf+7WFag0d19cGKy9kH8YHmSS0GH4MKSECHLG3DBO+oQIwoWYE5ZMX72Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d6e23a108ea991948892f2c858e493a3d4a1fd1a428d0fff15e0f84bc8034db","last_reissued_at":"2026-05-17T23:43:07.412218Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:07.412218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning with Average Precision: Training Image Retrieval with a Listwise Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Cesar Roberto de Souza, Jerome Revaud, Jon Almazan, Rafael Sampaio de Rezende","submitted_at":"2019-06-18T13:59:34Z","abstract_excerpt":"Image retrieval can be formulated as a ranking problem where the goal is to order database images by decreasing similarity to the query. Recent deep models for image retrieval have outperformed traditional methods by leveraging ranking-tailored loss functions, but important theoretical and practical problems remain. First, rather than directly optimizing the global ranking, they minimize an upper-bound on the essential loss, which does not necessarily result in an optimal mean average precision (mAP). Second, these methods require significant engineering efforts to work well, e.g. special pre-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07589","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.07589","created_at":"2026-05-17T23:43:07.412332+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.07589v1","created_at":"2026-05-17T23:43:07.412332+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07589","created_at":"2026-05-17T23:43:07.412332+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVXCHIII5KMR","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVXCHIII5KMRSSEJ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVXCHIII","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NVXCHIII5KMRSSEJF4WILDSJHI","json":"https://pith.science/pith/NVXCHIII5KMRSSEJF4WILDSJHI.json","graph_json":"https://pith.science/api/pith-number/NVXCHIII5KMRSSEJF4WILDSJHI/graph.json","events_json":"https://pith.science/api/pith-number/NVXCHIII5KMRSSEJF4WILDSJHI/events.json","paper":"https://pith.science/paper/NVXCHIII"},"agent_actions":{"view_html":"https://pith.science/pith/NVXCHIII5KMRSSEJF4WILDSJHI","download_json":"https://pith.science/pith/NVXCHIII5KMRSSEJF4WILDSJHI.json","view_paper":"https://pith.science/paper/NVXCHIII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.07589&json=true","fetch_graph":"https://pith.science/api/pith-number/NVXCHIII5KMRSSEJF4WILDSJHI/graph.json","fetch_events":"https://pith.science/api/pith-number/NVXCHIII5KMRSSEJF4WILDSJHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVXCHIII5KMRSSEJF4WILDSJHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVXCHIII5KMRSSEJF4WILDSJHI/action/storage_attestation","attest_author":"https://pith.science/pith/NVXCHIII5KMRSSEJF4WILDSJHI/action/author_attestation","sign_citation":"https://pith.science/pith/NVXCHIII5KMRSSEJF4WILDSJHI/action/citation_signature","submit_replication":"https://pith.science/pith/NVXCHIII5KMRSSEJF4WILDSJHI/action/replication_record"}},"created_at":"2026-05-17T23:43:07.412332+00:00","updated_at":"2026-05-17T23:43:07.412332+00:00"}