{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CPOOU77WDODYV57BZDFOAA7V77","short_pith_number":"pith:CPOOU77W","schema_version":"1.0","canonical_sha256":"13dcea7ff61b878af7e1c8cae003f5fff513a410a4035458b09737104eb54c14","source":{"kind":"arxiv","id":"2407.10542","version":1},"attestation_state":"computed","paper":{"title":"3D Geometric Shape Assembly via Efficient Point Cloud Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Jaesik Park, Juhong Min, Junha Lee, Kanghee Lee, Minsu Cho, Nahyuk Lee, Seungwook Kim","submitted_at":"2024-07-15T08:50:02Z","abstract_excerpt":"Learning to assemble geometric shapes into a larger target structure is a pivotal task in various practical applications. In this work, we tackle this problem by establishing local correspondences between point clouds of part shapes in both coarse- and fine-levels. To this end, we introduce Proxy Match Transform (PMT), an approximate high-order feature transform layer that enables reliable matching between mating surfaces of parts while incurring low costs in memory and computation. Building upon PMT, we introduce a new framework, dubbed Proxy Match TransformeR (PMTR), for the geometric assemb"},"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":"2407.10542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-07-15T08:50:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3e9f12cd98b47ab8bb7d49a1e984c2f5e817f4f986cbe5d7ce303cf670e1292c","abstract_canon_sha256":"f88128f8ae37fd48ed4f55a629b8169be59e531002438461df1e85ada50ff77f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:44:00.942505Z","signature_b64":"csKHfSmTKp0eOeBKfet2cFShG+5MaJMOxpzcZdePn2lwgN+iUuKHgs2aPLgQ+S1F0qbF0Dns4dT+JcXNaR6hAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13dcea7ff61b878af7e1c8cae003f5fff513a410a4035458b09737104eb54c14","last_reissued_at":"2026-07-05T08:44:00.942100Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:44:00.942100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3D Geometric Shape Assembly via Efficient Point Cloud Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Jaesik Park, Juhong Min, Junha Lee, Kanghee Lee, Minsu Cho, Nahyuk Lee, Seungwook Kim","submitted_at":"2024-07-15T08:50:02Z","abstract_excerpt":"Learning to assemble geometric shapes into a larger target structure is a pivotal task in various practical applications. In this work, we tackle this problem by establishing local correspondences between point clouds of part shapes in both coarse- and fine-levels. To this end, we introduce Proxy Match Transform (PMT), an approximate high-order feature transform layer that enables reliable matching between mating surfaces of parts while incurring low costs in memory and computation. Building upon PMT, we introduce a new framework, dubbed Proxy Match TransformeR (PMTR), for the geometric assemb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.10542","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/2407.10542/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":"2407.10542","created_at":"2026-07-05T08:44:00.942157+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.10542v1","created_at":"2026-07-05T08:44:00.942157+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.10542","created_at":"2026-07-05T08:44:00.942157+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPOOU77WDODY","created_at":"2026-07-05T08:44:00.942157+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPOOU77WDODYV57B","created_at":"2026-07-05T08:44:00.942157+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPOOU77W","created_at":"2026-07-05T08:44:00.942157+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06221","citing_title":"BiAssemble: Learning Collaborative Affordance for Bimanual Geometric Assembly","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CPOOU77WDODYV57BZDFOAA7V77","json":"https://pith.science/pith/CPOOU77WDODYV57BZDFOAA7V77.json","graph_json":"https://pith.science/api/pith-number/CPOOU77WDODYV57BZDFOAA7V77/graph.json","events_json":"https://pith.science/api/pith-number/CPOOU77WDODYV57BZDFOAA7V77/events.json","paper":"https://pith.science/paper/CPOOU77W"},"agent_actions":{"view_html":"https://pith.science/pith/CPOOU77WDODYV57BZDFOAA7V77","download_json":"https://pith.science/pith/CPOOU77WDODYV57BZDFOAA7V77.json","view_paper":"https://pith.science/paper/CPOOU77W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.10542&json=true","fetch_graph":"https://pith.science/api/pith-number/CPOOU77WDODYV57BZDFOAA7V77/graph.json","fetch_events":"https://pith.science/api/pith-number/CPOOU77WDODYV57BZDFOAA7V77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPOOU77WDODYV57BZDFOAA7V77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPOOU77WDODYV57BZDFOAA7V77/action/storage_attestation","attest_author":"https://pith.science/pith/CPOOU77WDODYV57BZDFOAA7V77/action/author_attestation","sign_citation":"https://pith.science/pith/CPOOU77WDODYV57BZDFOAA7V77/action/citation_signature","submit_replication":"https://pith.science/pith/CPOOU77WDODYV57BZDFOAA7V77/action/replication_record"}},"created_at":"2026-07-05T08:44:00.942157+00:00","updated_at":"2026-07-05T08:44:00.942157+00:00"}