{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OWQ4IZH5L5Z6CFA6JTI4RYV3FM","short_pith_number":"pith:OWQ4IZH5","schema_version":"1.0","canonical_sha256":"75a1c464fd5f73e1141e4cd1c8e2bb2b236596fd4903ee7108393cafdfd8e28f","source":{"kind":"arxiv","id":"2504.04156","version":1},"attestation_state":"computed","paper":{"title":"CoMBO: Conflict Mitigation via Branched Optimization for Class Incremental Segmentation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anqi Zhang, Chi Harold Liu, Guangyu Gao, Jianbo Jiao, Kai Fang, Yunchao Wei","submitted_at":"2025-04-05T12:34:51Z","abstract_excerpt":"Effective Class Incremental Segmentation (CIS) requires simultaneously mitigating catastrophic forgetting and ensuring sufficient plasticity to integrate new classes. The inherent conflict above often leads to a back-and-forth, which turns the objective into finding the balance between the performance of previous~(old) and incremental~(new) classes. To address this conflict, we introduce a novel approach, Conflict Mitigation via Branched Optimization~(CoMBO). Within this approach, we present the Query Conflict Reduction module, designed to explicitly refine queries for new classes through ligh"},"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":"2504.04156","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-04-05T12:34:51Z","cross_cats_sorted":[],"title_canon_sha256":"b3bb3f8bbf41209aeda36b29c1ca1f57cf3174072ccf58271126f17cc04d063a","abstract_canon_sha256":"07c9f0bb36e071820e74d4a3f815bb86f1081738c6c5e97074cadf9adaab5bae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:54.970341Z","signature_b64":"zZeEaiKAoTLJ3932SZ6FdvzGOGg8lLsAgV4qrzNU0njAUh4xypaRDBDc2Lb9dgzlXG/jiy1G/otYmGvs8AQTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75a1c464fd5f73e1141e4cd1c8e2bb2b236596fd4903ee7108393cafdfd8e28f","last_reissued_at":"2026-07-05T10:44:54.969856Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:54.969856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CoMBO: Conflict Mitigation via Branched Optimization for Class Incremental Segmentation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anqi Zhang, Chi Harold Liu, Guangyu Gao, Jianbo Jiao, Kai Fang, Yunchao Wei","submitted_at":"2025-04-05T12:34:51Z","abstract_excerpt":"Effective Class Incremental Segmentation (CIS) requires simultaneously mitigating catastrophic forgetting and ensuring sufficient plasticity to integrate new classes. The inherent conflict above often leads to a back-and-forth, which turns the objective into finding the balance between the performance of previous~(old) and incremental~(new) classes. To address this conflict, we introduce a novel approach, Conflict Mitigation via Branched Optimization~(CoMBO). Within this approach, we present the Query Conflict Reduction module, designed to explicitly refine queries for new classes through ligh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.04156","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/2504.04156/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":"2504.04156","created_at":"2026-07-05T10:44:54.969913+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.04156v1","created_at":"2026-07-05T10:44:54.969913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.04156","created_at":"2026-07-05T10:44:54.969913+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWQ4IZH5L5Z6","created_at":"2026-07-05T10:44:54.969913+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWQ4IZH5L5Z6CFA6","created_at":"2026-07-05T10:44:54.969913+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWQ4IZH5","created_at":"2026-07-05T10:44:54.969913+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.10430","citing_title":"Interleaved Transceiver Design for a Continuous- Transmission MIMO-OFDM ISAC System","ref_index":68,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OWQ4IZH5L5Z6CFA6JTI4RYV3FM","json":"https://pith.science/pith/OWQ4IZH5L5Z6CFA6JTI4RYV3FM.json","graph_json":"https://pith.science/api/pith-number/OWQ4IZH5L5Z6CFA6JTI4RYV3FM/graph.json","events_json":"https://pith.science/api/pith-number/OWQ4IZH5L5Z6CFA6JTI4RYV3FM/events.json","paper":"https://pith.science/paper/OWQ4IZH5"},"agent_actions":{"view_html":"https://pith.science/pith/OWQ4IZH5L5Z6CFA6JTI4RYV3FM","download_json":"https://pith.science/pith/OWQ4IZH5L5Z6CFA6JTI4RYV3FM.json","view_paper":"https://pith.science/paper/OWQ4IZH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.04156&json=true","fetch_graph":"https://pith.science/api/pith-number/OWQ4IZH5L5Z6CFA6JTI4RYV3FM/graph.json","fetch_events":"https://pith.science/api/pith-number/OWQ4IZH5L5Z6CFA6JTI4RYV3FM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWQ4IZH5L5Z6CFA6JTI4RYV3FM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWQ4IZH5L5Z6CFA6JTI4RYV3FM/action/storage_attestation","attest_author":"https://pith.science/pith/OWQ4IZH5L5Z6CFA6JTI4RYV3FM/action/author_attestation","sign_citation":"https://pith.science/pith/OWQ4IZH5L5Z6CFA6JTI4RYV3FM/action/citation_signature","submit_replication":"https://pith.science/pith/OWQ4IZH5L5Z6CFA6JTI4RYV3FM/action/replication_record"}},"created_at":"2026-07-05T10:44:54.969913+00:00","updated_at":"2026-07-05T10:44:54.969913+00:00"}