{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:3BNPUXJ3DW52OWKQI4HFMSBVM2","short_pith_number":"pith:3BNPUXJ3","schema_version":"1.0","canonical_sha256":"d85afa5d3b1dbba75950470e56483566b93473f9d0847ade1e0284a6ee9ce5cd","source":{"kind":"arxiv","id":"2111.08283","version":2},"attestation_state":"computed","paper":{"title":"Hierarchical Topometric Representation of 3D Robotic Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hao Sun, Jiawei Hou, S\\\"oren Schwertfeger, Yajun Ha, Zhenpeng He","submitted_at":"2021-11-16T08:20:33Z","abstract_excerpt":"In this paper, we propose a method for generating a hierarchical, volumetric topological map from 3D point clouds. There are three basic hierarchical levels in our map: $storey - region - volume$. The advantages of our method are reflected in both input and output. In terms of input, we accept multi-storey point clouds and building structures with sloping roofs or ceilings. In terms of output, we can generate results with metric information of different dimensionality, that are suitable for different robotics applications. The algorithm generates the volumetric representation by generating $vo"},"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":"2111.08283","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-11-16T08:20:33Z","cross_cats_sorted":[],"title_canon_sha256":"8dab00f5fdeec918317f593b5e56c821153f5f8355800eb55ba630feabccf632","abstract_canon_sha256":"2573e0db5d2a8139fb932742a1d35d4636974d262e8a4d16227d8d0777cbb2c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:34:47.752370Z","signature_b64":"79KBjr6w+pD6TlaVv0D56TurtK9KHebdW67yEVjyFKxA8QnqQ+KT2Hkfy0TM5+1ftS/mZQFK5D7tc6qht3CNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d85afa5d3b1dbba75950470e56483566b93473f9d0847ade1e0284a6ee9ce5cd","last_reissued_at":"2026-07-05T03:34:47.751905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:34:47.751905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Topometric Representation of 3D Robotic Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Hao Sun, Jiawei Hou, S\\\"oren Schwertfeger, Yajun Ha, Zhenpeng He","submitted_at":"2021-11-16T08:20:33Z","abstract_excerpt":"In this paper, we propose a method for generating a hierarchical, volumetric topological map from 3D point clouds. There are three basic hierarchical levels in our map: $storey - region - volume$. The advantages of our method are reflected in both input and output. In terms of input, we accept multi-storey point clouds and building structures with sloping roofs or ceilings. In terms of output, we can generate results with metric information of different dimensionality, that are suitable for different robotics applications. The algorithm generates the volumetric representation by generating $vo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.08283","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/2111.08283/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":"2111.08283","created_at":"2026-07-05T03:34:47.751955+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.08283v2","created_at":"2026-07-05T03:34:47.751955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.08283","created_at":"2026-07-05T03:34:47.751955+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BNPUXJ3DW52","created_at":"2026-07-05T03:34:47.751955+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BNPUXJ3DW52OWKQ","created_at":"2026-07-05T03:34:47.751955+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BNPUXJ3","created_at":"2026-07-05T03:34:47.751955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16009","citing_title":"Fast Expanding Safe Circular Regions for Efficient Local Path Planning","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3BNPUXJ3DW52OWKQI4HFMSBVM2","json":"https://pith.science/pith/3BNPUXJ3DW52OWKQI4HFMSBVM2.json","graph_json":"https://pith.science/api/pith-number/3BNPUXJ3DW52OWKQI4HFMSBVM2/graph.json","events_json":"https://pith.science/api/pith-number/3BNPUXJ3DW52OWKQI4HFMSBVM2/events.json","paper":"https://pith.science/paper/3BNPUXJ3"},"agent_actions":{"view_html":"https://pith.science/pith/3BNPUXJ3DW52OWKQI4HFMSBVM2","download_json":"https://pith.science/pith/3BNPUXJ3DW52OWKQI4HFMSBVM2.json","view_paper":"https://pith.science/paper/3BNPUXJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.08283&json=true","fetch_graph":"https://pith.science/api/pith-number/3BNPUXJ3DW52OWKQI4HFMSBVM2/graph.json","fetch_events":"https://pith.science/api/pith-number/3BNPUXJ3DW52OWKQI4HFMSBVM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BNPUXJ3DW52OWKQI4HFMSBVM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BNPUXJ3DW52OWKQI4HFMSBVM2/action/storage_attestation","attest_author":"https://pith.science/pith/3BNPUXJ3DW52OWKQI4HFMSBVM2/action/author_attestation","sign_citation":"https://pith.science/pith/3BNPUXJ3DW52OWKQI4HFMSBVM2/action/citation_signature","submit_replication":"https://pith.science/pith/3BNPUXJ3DW52OWKQI4HFMSBVM2/action/replication_record"}},"created_at":"2026-07-05T03:34:47.751955+00:00","updated_at":"2026-07-05T03:34:47.751955+00:00"}