{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GPETC2GIHGQWNRUKMFGSKJTFOS","short_pith_number":"pith:GPETC2GI","schema_version":"1.0","canonical_sha256":"33c93168c839a166c68a614d25266574b036b4b37590ff55545cfb6b1fdec891","source":{"kind":"arxiv","id":"2312.03341","version":2},"attestation_state":"computed","paper":{"title":"Online Vectorized HD Map Construction using Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Fusheng Jin, Xiangyu Yue, Xiaohan Ding, Yiyuan Zhang, Zhixin Zhang","submitted_at":"2023-12-06T08:26:26Z","abstract_excerpt":"The construction of online vectorized High-Definition (HD) maps is critical for downstream prediction and planning. Recent efforts have built strong baselines for this task, however, shapes and relations of instances in urban road systems are still under-explored, such as parallelism, perpendicular, or rectangle-shape. In our work, we propose GeMap ($\\textbf{Ge}$ometry $\\textbf{Map}$), which end-to-end learns Euclidean shapes and relations of map instances beyond basic perception. Specifically, we design a geometric loss based on angle and distance clues, which is robust to rigid transformatio"},"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":"2312.03341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-12-06T08:26:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8209ff57021b81d516271408ab2d7af31cc9088b7b4f423cbb9e577bff1dfa44","abstract_canon_sha256":"d479da1422748c75dabc7b900e30d730861f99723524b8f8d70c5d95037db217"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:00.700697Z","signature_b64":"CeZsodL3Pi/AyoL/YAKB2dpsJYhvcr7lVDC1z20zRBNo7AFOHgEb9gnBw7LNNL9dmXcEHY5qTmtt95hWaznYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33c93168c839a166c68a614d25266574b036b4b37590ff55545cfb6b1fdec891","last_reissued_at":"2026-07-05T08:42:00.700279Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:00.700279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Vectorized HD Map Construction using Geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Fusheng Jin, Xiangyu Yue, Xiaohan Ding, Yiyuan Zhang, Zhixin Zhang","submitted_at":"2023-12-06T08:26:26Z","abstract_excerpt":"The construction of online vectorized High-Definition (HD) maps is critical for downstream prediction and planning. Recent efforts have built strong baselines for this task, however, shapes and relations of instances in urban road systems are still under-explored, such as parallelism, perpendicular, or rectangle-shape. In our work, we propose GeMap ($\\textbf{Ge}$ometry $\\textbf{Map}$), which end-to-end learns Euclidean shapes and relations of map instances beyond basic perception. Specifically, we design a geometric loss based on angle and distance clues, which is robust to rigid transformatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.03341","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/2312.03341/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":"2312.03341","created_at":"2026-07-05T08:42:00.700347+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.03341v2","created_at":"2026-07-05T08:42:00.700347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.03341","created_at":"2026-07-05T08:42:00.700347+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPETC2GIHGQW","created_at":"2026-07-05T08:42:00.700347+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPETC2GIHGQWNRUK","created_at":"2026-07-05T08:42:00.700347+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPETC2GI","created_at":"2026-07-05T08:42:00.700347+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04513","citing_title":"MapAgent: An Industrial-Grade Agentic Framework for City-scale Lane-level Map Generation","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GPETC2GIHGQWNRUKMFGSKJTFOS","json":"https://pith.science/pith/GPETC2GIHGQWNRUKMFGSKJTFOS.json","graph_json":"https://pith.science/api/pith-number/GPETC2GIHGQWNRUKMFGSKJTFOS/graph.json","events_json":"https://pith.science/api/pith-number/GPETC2GIHGQWNRUKMFGSKJTFOS/events.json","paper":"https://pith.science/paper/GPETC2GI"},"agent_actions":{"view_html":"https://pith.science/pith/GPETC2GIHGQWNRUKMFGSKJTFOS","download_json":"https://pith.science/pith/GPETC2GIHGQWNRUKMFGSKJTFOS.json","view_paper":"https://pith.science/paper/GPETC2GI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.03341&json=true","fetch_graph":"https://pith.science/api/pith-number/GPETC2GIHGQWNRUKMFGSKJTFOS/graph.json","fetch_events":"https://pith.science/api/pith-number/GPETC2GIHGQWNRUKMFGSKJTFOS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPETC2GIHGQWNRUKMFGSKJTFOS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPETC2GIHGQWNRUKMFGSKJTFOS/action/storage_attestation","attest_author":"https://pith.science/pith/GPETC2GIHGQWNRUKMFGSKJTFOS/action/author_attestation","sign_citation":"https://pith.science/pith/GPETC2GIHGQWNRUKMFGSKJTFOS/action/citation_signature","submit_replication":"https://pith.science/pith/GPETC2GIHGQWNRUKMFGSKJTFOS/action/replication_record"}},"created_at":"2026-07-05T08:42:00.700347+00:00","updated_at":"2026-07-05T08:42:00.700347+00:00"}