{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GGDK43KWQHZOQIIWMFV3ERXNA6","short_pith_number":"pith:GGDK43KW","schema_version":"1.0","canonical_sha256":"3186ae6d5681f2e82116616bb246ed07a6c9daaf17bce35a6c5cf13efdcce34a","source":{"kind":"arxiv","id":"2502.10762","version":2},"attestation_state":"computed","paper":{"title":"Bone Soups: A Seek-and-Soup Model Merging Approach for Controllable Multi-Objective Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Guofu Xie, Ting Yao, Xiao Zhang, Yunsheng Shi","submitted_at":"2025-02-15T11:00:36Z","abstract_excerpt":"User information needs are often highly diverse and varied. A key challenge in current research is how to achieve controllable multi-objective generation while enabling rapid adaptation to accommodate diverse user demands during test time. Existing solutions, such as Rewarded Soup, focus on merging language models individually tuned on single objectives. While easy to implement and widely used, these approaches face limitations in achieving optimal performance due to their disregard for the impacts of competing objectives on model tuning. To address this issue, we propose Bone Soup, a novel mo"},"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":"2502.10762","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-15T11:00:36Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"ba75cea93061b177cafbde2d40f56727a6b56594b018e67792c719f3ed956467","abstract_canon_sha256":"36db334bac5dd96cfc34542f2d05a7e977af60e173e66f86069449a4fc2dcdd0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:03.991510Z","signature_b64":"HeXWWrP9Umpx82GLRNEHiUlTz85kacoePqFREHljVZ/sduc8i2ndppovdCFOjVRKvlt4ypxvJ7l3L9B4otfVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3186ae6d5681f2e82116616bb246ed07a6c9daaf17bce35a6c5cf13efdcce34a","last_reissued_at":"2026-07-05T11:14:03.990936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:03.990936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bone Soups: A Seek-and-Soup Model Merging Approach for Controllable Multi-Objective Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Guofu Xie, Ting Yao, Xiao Zhang, Yunsheng Shi","submitted_at":"2025-02-15T11:00:36Z","abstract_excerpt":"User information needs are often highly diverse and varied. A key challenge in current research is how to achieve controllable multi-objective generation while enabling rapid adaptation to accommodate diverse user demands during test time. Existing solutions, such as Rewarded Soup, focus on merging language models individually tuned on single objectives. While easy to implement and widely used, these approaches face limitations in achieving optimal performance due to their disregard for the impacts of competing objectives on model tuning. To address this issue, we propose Bone Soup, a novel mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.10762","kind":"arxiv","version":2},"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/2502.10762/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":"2502.10762","created_at":"2026-07-05T11:14:03.990997+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.10762v2","created_at":"2026-07-05T11:14:03.990997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.10762","created_at":"2026-07-05T11:14:03.990997+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGDK43KWQHZO","created_at":"2026-07-05T11:14:03.990997+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGDK43KWQHZOQIIW","created_at":"2026-07-05T11:14:03.990997+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGDK43KW","created_at":"2026-07-05T11:14:03.990997+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.20102","citing_title":"Steerable Adversarial Scenario Generation through Test-Time Preference Alignment","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GGDK43KWQHZOQIIWMFV3ERXNA6","json":"https://pith.science/pith/GGDK43KWQHZOQIIWMFV3ERXNA6.json","graph_json":"https://pith.science/api/pith-number/GGDK43KWQHZOQIIWMFV3ERXNA6/graph.json","events_json":"https://pith.science/api/pith-number/GGDK43KWQHZOQIIWMFV3ERXNA6/events.json","paper":"https://pith.science/paper/GGDK43KW"},"agent_actions":{"view_html":"https://pith.science/pith/GGDK43KWQHZOQIIWMFV3ERXNA6","download_json":"https://pith.science/pith/GGDK43KWQHZOQIIWMFV3ERXNA6.json","view_paper":"https://pith.science/paper/GGDK43KW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.10762&json=true","fetch_graph":"https://pith.science/api/pith-number/GGDK43KWQHZOQIIWMFV3ERXNA6/graph.json","fetch_events":"https://pith.science/api/pith-number/GGDK43KWQHZOQIIWMFV3ERXNA6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGDK43KWQHZOQIIWMFV3ERXNA6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGDK43KWQHZOQIIWMFV3ERXNA6/action/storage_attestation","attest_author":"https://pith.science/pith/GGDK43KWQHZOQIIWMFV3ERXNA6/action/author_attestation","sign_citation":"https://pith.science/pith/GGDK43KWQHZOQIIWMFV3ERXNA6/action/citation_signature","submit_replication":"https://pith.science/pith/GGDK43KWQHZOQIIWMFV3ERXNA6/action/replication_record"}},"created_at":"2026-07-05T11:14:03.990997+00:00","updated_at":"2026-07-05T11:14:03.990997+00:00"}