{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UHFAHBCRQ2GUOD2C6VRNJD3ZWD","short_pith_number":"pith:UHFAHBCR","schema_version":"1.0","canonical_sha256":"a1ca038451868d470f42f562d48f79b0c16009a8c80a050a864361a86b8736f1","source":{"kind":"arxiv","id":"2301.13865","version":1},"attestation_state":"computed","paper":{"title":"From Semi-supervised to Omni-supervised Room Layout Estimation Using Point Clouds","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Beiwen Tian, Guyue Zhou, Hao Zhao, Hongbin Zha, Huan-ang Gao, Pengfei Li, Xiaoxue Chen, Yurong Chen","submitted_at":"2023-01-31T18:58:41Z","abstract_excerpt":"Room layout estimation is a long-existing robotic vision task that benefits both environment sensing and motion planning. However, layout estimation using point clouds (PCs) still suffers from data scarcity due to annotation difficulty. As such, we address the semi-supervised setting of this task based upon the idea of model exponential moving averaging. But adapting this scheme to the state-of-the-art (SOTA) solution for PC-based layout estimation is not straightforward. To this end, we define a quad set matching strategy and several consistency losses based upon metrics tailored for layout q"},"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":"2301.13865","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2023-01-31T18:58:41Z","cross_cats_sorted":[],"title_canon_sha256":"4b0cde342b6e3f9a62b0767b33169da19b41e6bb4a294729acc15264dddcdfee","abstract_canon_sha256":"ff475bb1fb123685c8e3e71bb4b4e6d6efbdcb65d9881807dbb108ad93fa1f32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:37:19.672046Z","signature_b64":"jpLv9A/PiNDeWeXXflyI7BAqMcUIpPGy4+8JuhqnpVYBiNOel6YyJ6TAiPzMfv72k8lQ4MkiJYXzMNJwNGt5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1ca038451868d470f42f562d48f79b0c16009a8c80a050a864361a86b8736f1","last_reissued_at":"2026-07-05T05:37:19.671552Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:37:19.671552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Semi-supervised to Omni-supervised Room Layout Estimation Using Point Clouds","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Beiwen Tian, Guyue Zhou, Hao Zhao, Hongbin Zha, Huan-ang Gao, Pengfei Li, Xiaoxue Chen, Yurong Chen","submitted_at":"2023-01-31T18:58:41Z","abstract_excerpt":"Room layout estimation is a long-existing robotic vision task that benefits both environment sensing and motion planning. However, layout estimation using point clouds (PCs) still suffers from data scarcity due to annotation difficulty. As such, we address the semi-supervised setting of this task based upon the idea of model exponential moving averaging. But adapting this scheme to the state-of-the-art (SOTA) solution for PC-based layout estimation is not straightforward. To this end, we define a quad set matching strategy and several consistency losses based upon metrics tailored for layout q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.13865","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/2301.13865/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":"2301.13865","created_at":"2026-07-05T05:37:19.671627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.13865v1","created_at":"2026-07-05T05:37:19.671627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.13865","created_at":"2026-07-05T05:37:19.671627+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHFAHBCRQ2GU","created_at":"2026-07-05T05:37:19.671627+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHFAHBCRQ2GUOD2C","created_at":"2026-07-05T05:37:19.671627+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHFAHBCR","created_at":"2026-07-05T05:37:19.671627+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17617","citing_title":"Reusing Attention for One-stage Lane Topology Understanding","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UHFAHBCRQ2GUOD2C6VRNJD3ZWD","json":"https://pith.science/pith/UHFAHBCRQ2GUOD2C6VRNJD3ZWD.json","graph_json":"https://pith.science/api/pith-number/UHFAHBCRQ2GUOD2C6VRNJD3ZWD/graph.json","events_json":"https://pith.science/api/pith-number/UHFAHBCRQ2GUOD2C6VRNJD3ZWD/events.json","paper":"https://pith.science/paper/UHFAHBCR"},"agent_actions":{"view_html":"https://pith.science/pith/UHFAHBCRQ2GUOD2C6VRNJD3ZWD","download_json":"https://pith.science/pith/UHFAHBCRQ2GUOD2C6VRNJD3ZWD.json","view_paper":"https://pith.science/paper/UHFAHBCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.13865&json=true","fetch_graph":"https://pith.science/api/pith-number/UHFAHBCRQ2GUOD2C6VRNJD3ZWD/graph.json","fetch_events":"https://pith.science/api/pith-number/UHFAHBCRQ2GUOD2C6VRNJD3ZWD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHFAHBCRQ2GUOD2C6VRNJD3ZWD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHFAHBCRQ2GUOD2C6VRNJD3ZWD/action/storage_attestation","attest_author":"https://pith.science/pith/UHFAHBCRQ2GUOD2C6VRNJD3ZWD/action/author_attestation","sign_citation":"https://pith.science/pith/UHFAHBCRQ2GUOD2C6VRNJD3ZWD/action/citation_signature","submit_replication":"https://pith.science/pith/UHFAHBCRQ2GUOD2C6VRNJD3ZWD/action/replication_record"}},"created_at":"2026-07-05T05:37:19.671627+00:00","updated_at":"2026-07-05T05:37:19.671627+00:00"}