{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:C3YTCNY6QIOJIPF3DHZCBYZJWZ","short_pith_number":"pith:C3YTCNY6","schema_version":"1.0","canonical_sha256":"16f131371e821c943cbb19f220e329b66e184c68cb8cdfcbcf26476767af3241","source":{"kind":"arxiv","id":"2307.06949","version":2},"attestation_state":"computed","paper":{"title":"HyperDreamBooth: HyperNetworks for Fast Personalization of Text-to-Image Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.GR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Kfir Aberman, Michael Rubinstein, Nataniel Ruiz, Neal Wadhwa, Tingbo Hou, Varun Jampani, Wei Wei, Yael Pritch, Yuanzhen Li","submitted_at":"2023-07-13T17:59:47Z","abstract_excerpt":"Personalization has emerged as a prominent aspect within the field of generative AI, enabling the synthesis of individuals in diverse contexts and styles, while retaining high-fidelity to their identities. However, the process of personalization presents inherent challenges in terms of time and memory requirements. Fine-tuning each personalized model needs considerable GPU time investment, and storing a personalized model per subject can be demanding in terms of storage capacity. To overcome these challenges, we propose HyperDreamBooth - a hypernetwork capable of efficiently generating a small"},"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":"2307.06949","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-07-13T17:59:47Z","cross_cats_sorted":["cs.AI","cs.GR","cs.LG"],"title_canon_sha256":"73fa1f6675d76f9ac99e95f9acf1987d4e4ecf161442f3a853e1de35c1041270","abstract_canon_sha256":"1a4c7f22e2824551f690f54ba8bcc5fbe22b4d87b6fc60027f5fa02624fbae17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:37.745968Z","signature_b64":"NyzIyxUpkwgcqQI2AD1dZwxkzckwxLYV7jn2yGAzrMqifYWhssGWKX58WU288lodWyxig0UJhsJHx2SofT0CAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16f131371e821c943cbb19f220e329b66e184c68cb8cdfcbcf26476767af3241","last_reissued_at":"2026-07-05T09:21:37.745487Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:37.745487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HyperDreamBooth: HyperNetworks for Fast Personalization of Text-to-Image Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.GR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Kfir Aberman, Michael Rubinstein, Nataniel Ruiz, Neal Wadhwa, Tingbo Hou, Varun Jampani, Wei Wei, Yael Pritch, Yuanzhen Li","submitted_at":"2023-07-13T17:59:47Z","abstract_excerpt":"Personalization has emerged as a prominent aspect within the field of generative AI, enabling the synthesis of individuals in diverse contexts and styles, while retaining high-fidelity to their identities. However, the process of personalization presents inherent challenges in terms of time and memory requirements. Fine-tuning each personalized model needs considerable GPU time investment, and storing a personalized model per subject can be demanding in terms of storage capacity. To overcome these challenges, we propose HyperDreamBooth - a hypernetwork capable of efficiently generating a small"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.06949","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/2307.06949/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":"2307.06949","created_at":"2026-07-05T09:21:37.745550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.06949v2","created_at":"2026-07-05T09:21:37.745550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.06949","created_at":"2026-07-05T09:21:37.745550+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3YTCNY6QIOJ","created_at":"2026-07-05T09:21:37.745550+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3YTCNY6QIOJIPF3","created_at":"2026-07-05T09:21:37.745550+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3YTCNY6","created_at":"2026-07-05T09:21:37.745550+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2411.19182","citing_title":"SOWing Information: Cultivating Contextual Coherence with MLLMs in Image Generation","ref_index":46,"is_internal_anchor":false},{"citing_arxiv_id":"2503.02537","citing_title":"RectifiedHR: Enable Efficient High-Resolution Synthesis via Energy Rectification","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16990","citing_title":"DreamEdit3D: Personalization of Multi-View Diffusion Models for 3D Editing","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2510.20512","citing_title":"Adversarial Concept Distillation for One-Step Diffusion Personalization","ref_index":69,"is_internal_anchor":false},{"citing_arxiv_id":"2410.13720","citing_title":"Movie Gen: A Cast of Media Foundation Models","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13863","citing_title":"PostureObjectstitch: Anomaly Image Generation Considering Assembly Relationships in Industrial Scenarios","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C3YTCNY6QIOJIPF3DHZCBYZJWZ","json":"https://pith.science/pith/C3YTCNY6QIOJIPF3DHZCBYZJWZ.json","graph_json":"https://pith.science/api/pith-number/C3YTCNY6QIOJIPF3DHZCBYZJWZ/graph.json","events_json":"https://pith.science/api/pith-number/C3YTCNY6QIOJIPF3DHZCBYZJWZ/events.json","paper":"https://pith.science/paper/C3YTCNY6"},"agent_actions":{"view_html":"https://pith.science/pith/C3YTCNY6QIOJIPF3DHZCBYZJWZ","download_json":"https://pith.science/pith/C3YTCNY6QIOJIPF3DHZCBYZJWZ.json","view_paper":"https://pith.science/paper/C3YTCNY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.06949&json=true","fetch_graph":"https://pith.science/api/pith-number/C3YTCNY6QIOJIPF3DHZCBYZJWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/C3YTCNY6QIOJIPF3DHZCBYZJWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3YTCNY6QIOJIPF3DHZCBYZJWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3YTCNY6QIOJIPF3DHZCBYZJWZ/action/storage_attestation","attest_author":"https://pith.science/pith/C3YTCNY6QIOJIPF3DHZCBYZJWZ/action/author_attestation","sign_citation":"https://pith.science/pith/C3YTCNY6QIOJIPF3DHZCBYZJWZ/action/citation_signature","submit_replication":"https://pith.science/pith/C3YTCNY6QIOJIPF3DHZCBYZJWZ/action/replication_record"}},"created_at":"2026-07-05T09:21:37.745550+00:00","updated_at":"2026-07-05T09:21:37.745550+00:00"}