{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LKVXCVCL2B24VFGKEUUSEHSKNP","short_pith_number":"pith:LKVXCVCL","schema_version":"1.0","canonical_sha256":"5aab71544bd075ca94ca2529221e4a6bdedc56d2ab7914acf7eb5c2e4f1c263b","source":{"kind":"arxiv","id":"1711.10939","version":3},"attestation_state":"computed","paper":{"title":"Automatic Generation of Constrained Furniture Layouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Kartic Subr, Paul Henderson, Vittorio Ferrari","submitted_at":"2017-11-29T16:21:32Z","abstract_excerpt":"Efficient authoring of vast virtual environments hinges on algorithms that are able to automatically generate content while also being controllable. We propose a method to automatically generate furniture layouts for indoor environments. Our method is simple, efficient, human-interpretable and amenable to a wide variety of constraints. We model the composition of rooms into classes of objects and learn joint (co-occurrence) statistics from a database of training layouts. We generate new layouts by performing a sequence of conditional sampling steps, exploiting the statistics learned from the d"},"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":"1711.10939","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-11-29T16:21:32Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"8a3829a4ed6a1c31c9233d4c2d6b295c7755b7a24f9f091144ac3e15b250d73a","abstract_canon_sha256":"7d29556f4ed708bacee1015b77cf2fe6b3ff0b67c1f7d93cb098c06582126397"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:34.624302Z","signature_b64":"7+lehui8yt7zOBpPX3F1xDFz+QVS9KzEzvWabqqhIC+DSz34bkiYZPy1qbZvo/YIbEvL5e3mSPSmu9EwcdErAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aab71544bd075ca94ca2529221e4a6bdedc56d2ab7914acf7eb5c2e4f1c263b","last_reissued_at":"2026-05-17T23:55:34.623434Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:34.623434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Generation of Constrained Furniture Layouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.CV","authors_text":"Kartic Subr, Paul Henderson, Vittorio Ferrari","submitted_at":"2017-11-29T16:21:32Z","abstract_excerpt":"Efficient authoring of vast virtual environments hinges on algorithms that are able to automatically generate content while also being controllable. We propose a method to automatically generate furniture layouts for indoor environments. Our method is simple, efficient, human-interpretable and amenable to a wide variety of constraints. We model the composition of rooms into classes of objects and learn joint (co-occurrence) statistics from a database of training layouts. We generate new layouts by performing a sequence of conditional sampling steps, exploiting the statistics learned from the d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10939","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1711.10939","created_at":"2026-05-17T23:55:34.623568+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10939v3","created_at":"2026-05-17T23:55:34.623568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10939","created_at":"2026-05-17T23:55:34.623568+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKVXCVCL2B24","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKVXCVCL2B24VFGK","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKVXCVCL","created_at":"2026-05-18T12:31:28.150371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11308","citing_title":"SceneGraphNet: Neural Message Passing for 3D Indoor Scene Augmentation","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LKVXCVCL2B24VFGKEUUSEHSKNP","json":"https://pith.science/pith/LKVXCVCL2B24VFGKEUUSEHSKNP.json","graph_json":"https://pith.science/api/pith-number/LKVXCVCL2B24VFGKEUUSEHSKNP/graph.json","events_json":"https://pith.science/api/pith-number/LKVXCVCL2B24VFGKEUUSEHSKNP/events.json","paper":"https://pith.science/paper/LKVXCVCL"},"agent_actions":{"view_html":"https://pith.science/pith/LKVXCVCL2B24VFGKEUUSEHSKNP","download_json":"https://pith.science/pith/LKVXCVCL2B24VFGKEUUSEHSKNP.json","view_paper":"https://pith.science/paper/LKVXCVCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10939&json=true","fetch_graph":"https://pith.science/api/pith-number/LKVXCVCL2B24VFGKEUUSEHSKNP/graph.json","fetch_events":"https://pith.science/api/pith-number/LKVXCVCL2B24VFGKEUUSEHSKNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKVXCVCL2B24VFGKEUUSEHSKNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKVXCVCL2B24VFGKEUUSEHSKNP/action/storage_attestation","attest_author":"https://pith.science/pith/LKVXCVCL2B24VFGKEUUSEHSKNP/action/author_attestation","sign_citation":"https://pith.science/pith/LKVXCVCL2B24VFGKEUUSEHSKNP/action/citation_signature","submit_replication":"https://pith.science/pith/LKVXCVCL2B24VFGKEUUSEHSKNP/action/replication_record"}},"created_at":"2026-05-17T23:55:34.623568+00:00","updated_at":"2026-05-17T23:55:34.623568+00:00"}