{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7ERQV2M72IS3KZ5HPEEW4DJ6IR","short_pith_number":"pith:7ERQV2M7","schema_version":"1.0","canonical_sha256":"f9230ae99fd225b567a779096e0d3e4462a506767283663fd7ba4269faf0720d","source":{"kind":"arxiv","id":"1510.01027","version":1},"attestation_state":"computed","paper":{"title":"Relaxed Multiple-Instance SVM with Application to Object Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Cong Yao, Xiang Bai, Xinggang Wang, Zhuotun Zhu","submitted_at":"2015-10-05T04:18:18Z","abstract_excerpt":"Multiple-instance learning (MIL) has served as an important tool for a wide range of vision applications, for instance, image classification, object detection, and visual tracking. In this paper, we propose a novel method to solve the classical MIL problem, named relaxed multiple-instance SVM (RMI-SVM). We treat the positiveness of instance as a continuous variable, use Noisy-OR model to enforce the MIL constraints, and jointly optimize the bag label and instance label in a unified framework. The optimization problem can be efficiently solved using stochastic gradient decent. The extensive exp"},"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":"1510.01027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-10-05T04:18:18Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ee1dedbfacb6a192be38ac5ea2cacf2aaaee60b134fb95703dedf52fc910590e","abstract_canon_sha256":"1603406c2a24bfc7fb287ac10cbc71614142874d6abbf290504317c7e2c44466"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:04.955835Z","signature_b64":"YeupA+WXxmK9D+Bqg8aPiwVMelxq/2U+UbwRCju+CMr7igLpC+YIeD6LT49igdpj+cU7Ap4XWhnV4/WVlpoeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9230ae99fd225b567a779096e0d3e4462a506767283663fd7ba4269faf0720d","last_reissued_at":"2026-05-18T01:31:04.955132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:04.955132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxed Multiple-Instance SVM with Application to Object Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Cong Yao, Xiang Bai, Xinggang Wang, Zhuotun Zhu","submitted_at":"2015-10-05T04:18:18Z","abstract_excerpt":"Multiple-instance learning (MIL) has served as an important tool for a wide range of vision applications, for instance, image classification, object detection, and visual tracking. In this paper, we propose a novel method to solve the classical MIL problem, named relaxed multiple-instance SVM (RMI-SVM). We treat the positiveness of instance as a continuous variable, use Noisy-OR model to enforce the MIL constraints, and jointly optimize the bag label and instance label in a unified framework. The optimization problem can be efficiently solved using stochastic gradient decent. The extensive exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01027","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":"1510.01027","created_at":"2026-05-18T01:31:04.955239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01027v1","created_at":"2026-05-18T01:31:04.955239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01027","created_at":"2026-05-18T01:31:04.955239+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ERQV2M72IS3","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ERQV2M72IS3KZ5H","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ERQV2M7","created_at":"2026-05-18T12:29:10.953037+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/7ERQV2M72IS3KZ5HPEEW4DJ6IR","json":"https://pith.science/pith/7ERQV2M72IS3KZ5HPEEW4DJ6IR.json","graph_json":"https://pith.science/api/pith-number/7ERQV2M72IS3KZ5HPEEW4DJ6IR/graph.json","events_json":"https://pith.science/api/pith-number/7ERQV2M72IS3KZ5HPEEW4DJ6IR/events.json","paper":"https://pith.science/paper/7ERQV2M7"},"agent_actions":{"view_html":"https://pith.science/pith/7ERQV2M72IS3KZ5HPEEW4DJ6IR","download_json":"https://pith.science/pith/7ERQV2M72IS3KZ5HPEEW4DJ6IR.json","view_paper":"https://pith.science/paper/7ERQV2M7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01027&json=true","fetch_graph":"https://pith.science/api/pith-number/7ERQV2M72IS3KZ5HPEEW4DJ6IR/graph.json","fetch_events":"https://pith.science/api/pith-number/7ERQV2M72IS3KZ5HPEEW4DJ6IR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ERQV2M72IS3KZ5HPEEW4DJ6IR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ERQV2M72IS3KZ5HPEEW4DJ6IR/action/storage_attestation","attest_author":"https://pith.science/pith/7ERQV2M72IS3KZ5HPEEW4DJ6IR/action/author_attestation","sign_citation":"https://pith.science/pith/7ERQV2M72IS3KZ5HPEEW4DJ6IR/action/citation_signature","submit_replication":"https://pith.science/pith/7ERQV2M72IS3KZ5HPEEW4DJ6IR/action/replication_record"}},"created_at":"2026-05-18T01:31:04.955239+00:00","updated_at":"2026-05-18T01:31:04.955239+00:00"}