{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NNVKMQSGMP2TK44GE55CT3IBXV","short_pith_number":"pith:NNVKMQSG","schema_version":"1.0","canonical_sha256":"6b6aa6424663f5357386277a29ed01bd7a9341bf1e5019562205f51bd8c98743","source":{"kind":"arxiv","id":"2412.03177","version":2},"attestation_state":"computed","paper":{"title":"PatchDPO: Patch-level DPO for Finetuning-free Personalized Image Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hao Jiang, Jie Song, Jinlong Liu, Mingli Song, Qihan Huang, Wanggui He, Weilong Dai","submitted_at":"2024-12-04T09:59:43Z","abstract_excerpt":"Finetuning-free personalized image generation can synthesize customized images without test-time finetuning, attracting wide research interest owing to its high efficiency. Current finetuning-free methods simply adopt a single training stage with a simple image reconstruction task, and they typically generate low-quality images inconsistent with the reference images during test-time. To mitigate this problem, inspired by the recent DPO (i.e., direct preference optimization) technique, this work proposes an additional training stage to improve the pre-trained personalized generation models. How"},"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":"2412.03177","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-12-04T09:59:43Z","cross_cats_sorted":[],"title_canon_sha256":"a2b1e5dc76ba87e0c87394526b4e8f5016d9cae9064f7ecfa8d533427c4de254","abstract_canon_sha256":"f304a3f55b55df382d2afd5f63f1043f28500d253c168dbc4d8513ff453c3406"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:12.627381Z","signature_b64":"OFYvGmSKO5jRt3GNSbmihAC/qvgBwZLiKDvINTam0/TUmnn7VqeZP+jgv4r0VGLg4CyuAMvckkG6yr3vbi4yCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b6aa6424663f5357386277a29ed01bd7a9341bf1e5019562205f51bd8c98743","last_reissued_at":"2026-07-05T11:28:12.626799Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:12.626799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PatchDPO: Patch-level DPO for Finetuning-free Personalized Image Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hao Jiang, Jie Song, Jinlong Liu, Mingli Song, Qihan Huang, Wanggui He, Weilong Dai","submitted_at":"2024-12-04T09:59:43Z","abstract_excerpt":"Finetuning-free personalized image generation can synthesize customized images without test-time finetuning, attracting wide research interest owing to its high efficiency. Current finetuning-free methods simply adopt a single training stage with a simple image reconstruction task, and they typically generate low-quality images inconsistent with the reference images during test-time. To mitigate this problem, inspired by the recent DPO (i.e., direct preference optimization) technique, this work proposes an additional training stage to improve the pre-trained personalized generation models. How"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03177","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/2412.03177/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":"2412.03177","created_at":"2026-07-05T11:28:12.626879+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03177v2","created_at":"2026-07-05T11:28:12.626879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03177","created_at":"2026-07-05T11:28:12.626879+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNVKMQSGMP2T","created_at":"2026-07-05T11:28:12.626879+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNVKMQSGMP2TK44G","created_at":"2026-07-05T11:28:12.626879+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNVKMQSG","created_at":"2026-07-05T11:28:12.626879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07693","citing_title":"Selective Timestep Weighting and Advantage-Based Replay for Sample-Efficient Diffusion RLHF","ref_index":15,"is_internal_anchor":true},{"citing_arxiv_id":"2605.09433","citing_title":"Offline Preference Optimization for Rectified Flow with Noise-Tracked Pairs","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NNVKMQSGMP2TK44GE55CT3IBXV","json":"https://pith.science/pith/NNVKMQSGMP2TK44GE55CT3IBXV.json","graph_json":"https://pith.science/api/pith-number/NNVKMQSGMP2TK44GE55CT3IBXV/graph.json","events_json":"https://pith.science/api/pith-number/NNVKMQSGMP2TK44GE55CT3IBXV/events.json","paper":"https://pith.science/paper/NNVKMQSG"},"agent_actions":{"view_html":"https://pith.science/pith/NNVKMQSGMP2TK44GE55CT3IBXV","download_json":"https://pith.science/pith/NNVKMQSGMP2TK44GE55CT3IBXV.json","view_paper":"https://pith.science/paper/NNVKMQSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03177&json=true","fetch_graph":"https://pith.science/api/pith-number/NNVKMQSGMP2TK44GE55CT3IBXV/graph.json","fetch_events":"https://pith.science/api/pith-number/NNVKMQSGMP2TK44GE55CT3IBXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNVKMQSGMP2TK44GE55CT3IBXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNVKMQSGMP2TK44GE55CT3IBXV/action/storage_attestation","attest_author":"https://pith.science/pith/NNVKMQSGMP2TK44GE55CT3IBXV/action/author_attestation","sign_citation":"https://pith.science/pith/NNVKMQSGMP2TK44GE55CT3IBXV/action/citation_signature","submit_replication":"https://pith.science/pith/NNVKMQSGMP2TK44GE55CT3IBXV/action/replication_record"}},"created_at":"2026-07-05T11:28:12.626879+00:00","updated_at":"2026-07-05T11:28:12.626879+00:00"}