{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZP6AKFXRIXBH4B2FRX4HB4HB2Y","short_pith_number":"pith:ZP6AKFXR","canonical_record":{"source":{"id":"1205.0610","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2012-05-03T04:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"c85a3461270b30ab5f75e339dba0f750674b117b1f4dbbe217ebd3b945a2bcd0","abstract_canon_sha256":"a95a3cc31847467fb367f3a5a0cca60f4046677bbd97645a10d584e85da45ce8"},"schema_version":"1.0"},"canonical_sha256":"cbfc0516f145c27e07458df870f0e1d6155451eb31539be9da07165e90e08012","source":{"kind":"arxiv","id":"1205.0610","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0610","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0610v1","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0610","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZP6AKFXRIXBH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZP6AKFXRIXBH4B2F","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZP6AKFXR","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZP6AKFXRIXBH4B2FRX4HB4HB2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1205.0610","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2012-05-03T04:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"c85a3461270b30ab5f75e339dba0f750674b117b1f4dbbe217ebd3b945a2bcd0","abstract_canon_sha256":"a95a3cc31847467fb367f3a5a0cca60f4046677bbd97645a10d584e85da45ce8"},"schema_version":"1.0"},"canonical_sha256":"cbfc0516f145c27e07458df870f0e1d6155451eb31539be9da07165e90e08012","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:25.397967Z","signature_b64":"IBhLnxp914cPNiOBKCWJDRmkpADgy6w4PtGD8VGQsUZLC2vXe2bVBEhD4avLc5osPBmiFEUfUzG6ALE7hM78Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbfc0516f145c27e07458df870f0e1d6155451eb31539be9da07165e90e08012","last_reissued_at":"2026-05-18T03:56:25.397479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:25.397479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.0610","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-05-18T03:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gI8cZaIx9H0fP7ABLN4Mv81BJQUQWZmMOHVftGzVv9HdG1SvrfINDi3jURIwqxA7RShHbGOn06LRoWtPb6RtDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T01:10:16.914669Z"},"content_sha256":"165af9faac713d64a9fa6cb14cec1f87d64cb5a6c4603095723f195f7f648f68","schema_version":"1.0","event_id":"sha256:165af9faac713d64a9fa6cb14cec1f87d64cb5a6c4603095723f195f7f648f68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZP6AKFXRIXBH4B2FRX4HB4HB2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Multiple Instance Learning via Codebook Learning and Nearest Neighbor Voting","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gang Chen, Jason Corso","submitted_at":"2012-05-03T04:09:19Z","abstract_excerpt":"Multiple instance learning (MIL) has attracted great attention recently in machine learning community. However, most MIL algorithms are very slow and cannot be applied to large datasets. In this paper, we propose a greedy strategy to speed up the multiple instance learning process. Our contribution is two fold. First, we propose a density ratio model, and show that maximizing a density ratio function is the low bound of the DD model under certain conditions. Secondly, we make use of a histogram ratio between positive bags and negative bags to represent the density ratio function and find codeb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0610","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"},"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-18T03:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1xX/wZ34PQL0VwykUtgQLG/3zGlK+PMQEFPIc0vELInu9cZLg54tjFt4H94ZR8a/8R2BGfZRXQATvyrnz/3nBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T01:10:16.915278Z"},"content_sha256":"02b72dd1265381547adf8eb74e9a9e30f7b7379bbfcf0306399c90e4a7f71439","schema_version":"1.0","event_id":"sha256:02b72dd1265381547adf8eb74e9a9e30f7b7379bbfcf0306399c90e4a7f71439"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZP6AKFXRIXBH4B2FRX4HB4HB2Y/bundle.json","state_url":"https://pith.science/pith/ZP6AKFXRIXBH4B2FRX4HB4HB2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZP6AKFXRIXBH4B2FRX4HB4HB2Y/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-08-24T01:10:16Z","links":{"resolver":"https://pith.science/pith/ZP6AKFXRIXBH4B2FRX4HB4HB2Y","bundle":"https://pith.science/pith/ZP6AKFXRIXBH4B2FRX4HB4HB2Y/bundle.json","state":"https://pith.science/pith/ZP6AKFXRIXBH4B2FRX4HB4HB2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZP6AKFXRIXBH4B2FRX4HB4HB2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZP6AKFXRIXBH4B2FRX4HB4HB2Y","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":"a95a3cc31847467fb367f3a5a0cca60f4046677bbd97645a10d584e85da45ce8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2012-05-03T04:09:19Z","title_canon_sha256":"c85a3461270b30ab5f75e339dba0f750674b117b1f4dbbe217ebd3b945a2bcd0"},"schema_version":"1.0","source":{"id":"1205.0610","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.0610","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1205.0610v1","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0610","created_at":"2026-05-18T03:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZP6AKFXRIXBH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZP6AKFXRIXBH4B2F","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZP6AKFXR","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:02b72dd1265381547adf8eb74e9a9e30f7b7379bbfcf0306399c90e4a7f71439","target":"graph","created_at":"2026-05-18T03:56:25Z","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":"Multiple instance learning (MIL) has attracted great attention recently in machine learning community. However, most MIL algorithms are very slow and cannot be applied to large datasets. In this paper, we propose a greedy strategy to speed up the multiple instance learning process. Our contribution is two fold. First, we propose a density ratio model, and show that maximizing a density ratio function is the low bound of the DD model under certain conditions. Secondly, we make use of a histogram ratio between positive bags and negative bags to represent the density ratio function and find codeb","authors_text":"Gang Chen, Jason Corso","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2012-05-03T04:09:19Z","title":"Greedy Multiple Instance Learning via Codebook Learning and Nearest Neighbor Voting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0610","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:165af9faac713d64a9fa6cb14cec1f87d64cb5a6c4603095723f195f7f648f68","target":"record","created_at":"2026-05-18T03:56:25Z","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":"a95a3cc31847467fb367f3a5a0cca60f4046677bbd97645a10d584e85da45ce8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2012-05-03T04:09:19Z","title_canon_sha256":"c85a3461270b30ab5f75e339dba0f750674b117b1f4dbbe217ebd3b945a2bcd0"},"schema_version":"1.0","source":{"id":"1205.0610","kind":"arxiv","version":1}},"canonical_sha256":"cbfc0516f145c27e07458df870f0e1d6155451eb31539be9da07165e90e08012","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbfc0516f145c27e07458df870f0e1d6155451eb31539be9da07165e90e08012","first_computed_at":"2026-05-18T03:56:25.397479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:25.397479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IBhLnxp914cPNiOBKCWJDRmkpADgy6w4PtGD8VGQsUZLC2vXe2bVBEhD4avLc5osPBmiFEUfUzG6ALE7hM78Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:25.397967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.0610","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:165af9faac713d64a9fa6cb14cec1f87d64cb5a6c4603095723f195f7f648f68","sha256:02b72dd1265381547adf8eb74e9a9e30f7b7379bbfcf0306399c90e4a7f71439"],"state_sha256":"a138e63d3566204f585cbbf2f84481ae446b67071dd07e232d10822fd4f91158"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZh01a/nPa86H3M7tcKXNoYQBZoJuXZtKwmhibA9idKKy7NbQZOLcfTnQD2SEfT1hXnis+7nLqA2XLtChLddAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T01:10:16.922763Z","bundle_sha256":"4e0e51ea7ad661e05fb7d07cb7ae174539bd6e8c2ba27063dce6c598cf7d7811"}}