{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZMTBPCILGOFVPADJVLFKMGKOUE","short_pith_number":"pith:ZMTBPCIL","schema_version":"1.0","canonical_sha256":"cb2617890b338b578069aacaa6194ea11fac9a3945f79c4fde0b305336ec58e2","source":{"kind":"arxiv","id":"2409.12849","version":1},"attestation_state":"computed","paper":{"title":"A Margin-Maximizing Fine-Grained Ensemble Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Hao Chen, Jinghui Yuan, Renwei Luo","submitted_at":"2024-09-19T15:48:12Z","abstract_excerpt":"Ensemble learning has achieved remarkable success in machine learning, but its reliance on numerous base learners limits its application in resource-constrained environments. This paper introduces an innovative \"Margin-Maximizing Fine-Grained Ensemble Method\" that achieves performance surpassing large-scale ensembles by meticulously optimizing a small number of learners and enhancing generalization capability. We propose a novel learnable confidence matrix, quantifying each classifier's confidence for each category, precisely capturing category-specific advantages of individual learners. Furth"},"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":"2409.12849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-09-19T15:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"149fba834e145a8b798b5f8089fef44b9f0fe8a1c979f500c4d1850d88f35f8a","abstract_canon_sha256":"5e40341b46b62b2a021f22ab6ada62edf601c6aa8665d7be81063f5834aa2a27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:13.039684Z","signature_b64":"0HoQHZaB9LpUzjHnUSx5/v6g9Lbc0la6QaaHbMRrM2rsq32IvF8EcUR+MZM/1f4SCivQpLjdfw1h4kQv6hAyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb2617890b338b578069aacaa6194ea11fac9a3945f79c4fde0b305336ec58e2","last_reissued_at":"2026-07-05T09:09:13.039226Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:13.039226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Margin-Maximizing Fine-Grained Ensemble Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Feiping Nie, Hao Chen, Jinghui Yuan, Renwei Luo","submitted_at":"2024-09-19T15:48:12Z","abstract_excerpt":"Ensemble learning has achieved remarkable success in machine learning, but its reliance on numerous base learners limits its application in resource-constrained environments. This paper introduces an innovative \"Margin-Maximizing Fine-Grained Ensemble Method\" that achieves performance surpassing large-scale ensembles by meticulously optimizing a small number of learners and enhancing generalization capability. We propose a novel learnable confidence matrix, quantifying each classifier's confidence for each category, precisely capturing category-specific advantages of individual learners. Furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12849","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.12849/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.12849","created_at":"2026-07-05T09:09:13.039277+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.12849v1","created_at":"2026-07-05T09:09:13.039277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12849","created_at":"2026-07-05T09:09:13.039277+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMTBPCILGOFV","created_at":"2026-07-05T09:09:13.039277+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMTBPCILGOFVPADJ","created_at":"2026-07-05T09:09:13.039277+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMTBPCIL","created_at":"2026-07-05T09:09:13.039277+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.20853","citing_title":"Cooperation of Experts: Fusing Heterogeneous Information with Large Margin","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMTBPCILGOFVPADJVLFKMGKOUE","json":"https://pith.science/pith/ZMTBPCILGOFVPADJVLFKMGKOUE.json","graph_json":"https://pith.science/api/pith-number/ZMTBPCILGOFVPADJVLFKMGKOUE/graph.json","events_json":"https://pith.science/api/pith-number/ZMTBPCILGOFVPADJVLFKMGKOUE/events.json","paper":"https://pith.science/paper/ZMTBPCIL"},"agent_actions":{"view_html":"https://pith.science/pith/ZMTBPCILGOFVPADJVLFKMGKOUE","download_json":"https://pith.science/pith/ZMTBPCILGOFVPADJVLFKMGKOUE.json","view_paper":"https://pith.science/paper/ZMTBPCIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.12849&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMTBPCILGOFVPADJVLFKMGKOUE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMTBPCILGOFVPADJVLFKMGKOUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMTBPCILGOFVPADJVLFKMGKOUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMTBPCILGOFVPADJVLFKMGKOUE/action/storage_attestation","attest_author":"https://pith.science/pith/ZMTBPCILGOFVPADJVLFKMGKOUE/action/author_attestation","sign_citation":"https://pith.science/pith/ZMTBPCILGOFVPADJVLFKMGKOUE/action/citation_signature","submit_replication":"https://pith.science/pith/ZMTBPCILGOFVPADJVLFKMGKOUE/action/replication_record"}},"created_at":"2026-07-05T09:09:13.039277+00:00","updated_at":"2026-07-05T09:09:13.039277+00:00"}