{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MWTQN6K3VOSGW6KI6ZDPK52IH6","short_pith_number":"pith:MWTQN6K3","canonical_record":{"source":{"id":"1603.01901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T00:30:10Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"709d69f42475cb43a73c307bb2d228b5a0ba7ccf11c3a39984beddb8434a9282","abstract_canon_sha256":"94267427d2cb5e26bb941e051fbba1dce7a316f90c5566fe40d53c0ad7d10b01"},"schema_version":"1.0"},"canonical_sha256":"65a706f95baba46b7948f646f577483fa130fa32f4dd43a1d5c3d7486644f358","source":{"kind":"arxiv","id":"1603.01901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01901","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01901v1","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01901","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"MWTQN6K3VOSG","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MWTQN6K3VOSGW6KI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MWTQN6K3","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MWTQN6K3VOSGW6KI6ZDPK52IH6","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T00:30:10Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"709d69f42475cb43a73c307bb2d228b5a0ba7ccf11c3a39984beddb8434a9282","abstract_canon_sha256":"94267427d2cb5e26bb941e051fbba1dce7a316f90c5566fe40d53c0ad7d10b01"},"schema_version":"1.0"},"canonical_sha256":"65a706f95baba46b7948f646f577483fa130fa32f4dd43a1d5c3d7486644f358","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:10.706769Z","signature_b64":"/IJ2r4GRNr6RyM93uzemcx5oQDhjqkiclYG99tjjmFGhi6LjbimMifEsjb75yfYLuURQuxE9SoeHgPjd1nCZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65a706f95baba46b7948f646f577483fa130fa32f4dd43a1d5c3d7486644f358","last_reissued_at":"2026-05-18T01:19:10.706173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:10.706173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01901","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-18T01:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dZRmIyCRbRxg1L5NLZDaH4OKc81bmaPuH1dZGmE6kWRBsh6o2Mf1PXiMtXIbBMjTBtyEBkggCLcSgmyywd7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:30:53.960444Z"},"content_sha256":"42fbef483ad28043fde26eb94b931a4eb5c60a2889ef50d9259f1259bcf8c234","schema_version":"1.0","event_id":"sha256:42fbef483ad28043fde26eb94b931a4eb5c60a2889ef50d9259f1259bcf8c234"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MWTQN6K3VOSGW6KI6ZDPK52IH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Confidence-Constrained Maximum Entropy Framework for Learning from Multi-Instance Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Behrouz Behmardi, Forrest Briggs, Raviv Raich, Xiaoli Z. Fern","submitted_at":"2016-03-07T00:30:10Z","abstract_excerpt":"Multi-instance data, in which each object (bag) contains a collection of instances, are widespread in machine learning, computer vision, bioinformatics, signal processing, and social sciences. We present a maximum entropy (ME) framework for learning from multi-instance data. In this approach each bag is represented as a distribution using the principle of ME. We introduce the concept of confidence-constrained ME (CME) to simultaneously learn the structure of distribution space and infer each distribution. The shared structure underlying each density is used to learn from instances inside each "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01901","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-18T01:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"evQCyXvpfrpEw1dtBBgf1f1+qMq2QCrKJJChpftjZkicuA2+TP1OD/7IIsBWYmeXimQ87ontb1Kw80URGnCCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:30:53.960923Z"},"content_sha256":"ffbc6b56362a11b8b65f351f47f93a06137773d7c25dec88de33945ecb35b9f5","schema_version":"1.0","event_id":"sha256:ffbc6b56362a11b8b65f351f47f93a06137773d7c25dec88de33945ecb35b9f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWTQN6K3VOSGW6KI6ZDPK52IH6/bundle.json","state_url":"https://pith.science/pith/MWTQN6K3VOSGW6KI6ZDPK52IH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWTQN6K3VOSGW6KI6ZDPK52IH6/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-24T17:30:53Z","links":{"resolver":"https://pith.science/pith/MWTQN6K3VOSGW6KI6ZDPK52IH6","bundle":"https://pith.science/pith/MWTQN6K3VOSGW6KI6ZDPK52IH6/bundle.json","state":"https://pith.science/pith/MWTQN6K3VOSGW6KI6ZDPK52IH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWTQN6K3VOSGW6KI6ZDPK52IH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MWTQN6K3VOSGW6KI6ZDPK52IH6","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":"94267427d2cb5e26bb941e051fbba1dce7a316f90c5566fe40d53c0ad7d10b01","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T00:30:10Z","title_canon_sha256":"709d69f42475cb43a73c307bb2d228b5a0ba7ccf11c3a39984beddb8434a9282"},"schema_version":"1.0","source":{"id":"1603.01901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01901","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01901v1","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01901","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"MWTQN6K3VOSG","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MWTQN6K3VOSGW6KI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MWTQN6K3","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:ffbc6b56362a11b8b65f351f47f93a06137773d7c25dec88de33945ecb35b9f5","target":"graph","created_at":"2026-05-18T01:19:10Z","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":"Multi-instance data, in which each object (bag) contains a collection of instances, are widespread in machine learning, computer vision, bioinformatics, signal processing, and social sciences. We present a maximum entropy (ME) framework for learning from multi-instance data. In this approach each bag is represented as a distribution using the principle of ME. We introduce the concept of confidence-constrained ME (CME) to simultaneously learn the structure of distribution space and infer each distribution. The shared structure underlying each density is used to learn from instances inside each ","authors_text":"Behrouz Behmardi, Forrest Briggs, Raviv Raich, Xiaoli Z. Fern","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T00:30:10Z","title":"Confidence-Constrained Maximum Entropy Framework for Learning from Multi-Instance Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01901","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:42fbef483ad28043fde26eb94b931a4eb5c60a2889ef50d9259f1259bcf8c234","target":"record","created_at":"2026-05-18T01:19:10Z","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":"94267427d2cb5e26bb941e051fbba1dce7a316f90c5566fe40d53c0ad7d10b01","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-07T00:30:10Z","title_canon_sha256":"709d69f42475cb43a73c307bb2d228b5a0ba7ccf11c3a39984beddb8434a9282"},"schema_version":"1.0","source":{"id":"1603.01901","kind":"arxiv","version":1}},"canonical_sha256":"65a706f95baba46b7948f646f577483fa130fa32f4dd43a1d5c3d7486644f358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65a706f95baba46b7948f646f577483fa130fa32f4dd43a1d5c3d7486644f358","first_computed_at":"2026-05-18T01:19:10.706173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:10.706173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/IJ2r4GRNr6RyM93uzemcx5oQDhjqkiclYG99tjjmFGhi6LjbimMifEsjb75yfYLuURQuxE9SoeHgPjd1nCZCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:10.706769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42fbef483ad28043fde26eb94b931a4eb5c60a2889ef50d9259f1259bcf8c234","sha256:ffbc6b56362a11b8b65f351f47f93a06137773d7c25dec88de33945ecb35b9f5"],"state_sha256":"c512faabe467dbdcc429cac02db60c4745bcad18cf59b259450528ec30b35d8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HL3IqXZkj5MMFBsWlGcP6NywhrNFppDMUbhrb7vYi5e9U8PGWjhjVDo75trfTt7ZUoIF5o+Lq7/FnjV6rChqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:30:53.964731Z","bundle_sha256":"5785b8926a5bbbaeb7818cc246ca7fa980f517ed69c40ac2d40e56dafc213cc9"}}