{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LJZTXMFXCODNDPLR66GU2EREPU","short_pith_number":"pith:LJZTXMFX","schema_version":"1.0","canonical_sha256":"5a733bb0b71386d1bd71f78d4d12247d36e1a816df869c680c9afb1870880f7a","source":{"kind":"arxiv","id":"2012.14929","version":2},"attestation_state":"computed","paper":{"title":"SALA: Soft Assignment Local Aggregation for Parameter Efficient 3D Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ali Thabet, Bernard Ghanem, Hani Itani, Silvio Giancola","submitted_at":"2020-12-29T20:16:37Z","abstract_excerpt":"In this work, we focus on designing a point local aggregation function that yields parameter efficient networks for 3D point cloud semantic segmentation. We explore the idea of using learnable neighbor-to-grid soft assignment in grid-based aggregation functions. Previous methods in literature operate on a predefined geometric grid such as local volume partitions or irregular kernel points. A more general alternative is to allow the network to learn an assignment function that best suits the end task. Since it is learnable, this mapping is allowed to be different per layer instead of being appl"},"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":"2012.14929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-12-29T20:16:37Z","cross_cats_sorted":[],"title_canon_sha256":"188b8606782c2673f614a7b9f5eaa830007990c9c56fa5438a83e6a8a8932d0f","abstract_canon_sha256":"f370daa1672a246a02670d657dd7c162c44d0001b554cf419f5f3fd54cbe0ac4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:54.789418Z","signature_b64":"z06Bm+n3Fiw9El6pgX2pLeL0oAC3X3fDUZ0VSyodi2Zigd4zh4AePoHRmwYxG0siX+pImeERH/tP5QczBPobBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a733bb0b71386d1bd71f78d4d12247d36e1a816df869c680c9afb1870880f7a","last_reissued_at":"2026-07-05T02:28:54.788946Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:54.788946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SALA: Soft Assignment Local Aggregation for Parameter Efficient 3D Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ali Thabet, Bernard Ghanem, Hani Itani, Silvio Giancola","submitted_at":"2020-12-29T20:16:37Z","abstract_excerpt":"In this work, we focus on designing a point local aggregation function that yields parameter efficient networks for 3D point cloud semantic segmentation. We explore the idea of using learnable neighbor-to-grid soft assignment in grid-based aggregation functions. Previous methods in literature operate on a predefined geometric grid such as local volume partitions or irregular kernel points. A more general alternative is to allow the network to learn an assignment function that best suits the end task. Since it is learnable, this mapping is allowed to be different per layer instead of being appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.14929","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/2012.14929/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":"2012.14929","created_at":"2026-07-05T02:28:54.789002+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.14929v2","created_at":"2026-07-05T02:28:54.789002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.14929","created_at":"2026-07-05T02:28:54.789002+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJZTXMFXCODN","created_at":"2026-07-05T02:28:54.789002+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJZTXMFXCODNDPLR","created_at":"2026-07-05T02:28:54.789002+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJZTXMFX","created_at":"2026-07-05T02:28:54.789002+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJZTXMFXCODNDPLR66GU2EREPU","json":"https://pith.science/pith/LJZTXMFXCODNDPLR66GU2EREPU.json","graph_json":"https://pith.science/api/pith-number/LJZTXMFXCODNDPLR66GU2EREPU/graph.json","events_json":"https://pith.science/api/pith-number/LJZTXMFXCODNDPLR66GU2EREPU/events.json","paper":"https://pith.science/paper/LJZTXMFX"},"agent_actions":{"view_html":"https://pith.science/pith/LJZTXMFXCODNDPLR66GU2EREPU","download_json":"https://pith.science/pith/LJZTXMFXCODNDPLR66GU2EREPU.json","view_paper":"https://pith.science/paper/LJZTXMFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.14929&json=true","fetch_graph":"https://pith.science/api/pith-number/LJZTXMFXCODNDPLR66GU2EREPU/graph.json","fetch_events":"https://pith.science/api/pith-number/LJZTXMFXCODNDPLR66GU2EREPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJZTXMFXCODNDPLR66GU2EREPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJZTXMFXCODNDPLR66GU2EREPU/action/storage_attestation","attest_author":"https://pith.science/pith/LJZTXMFXCODNDPLR66GU2EREPU/action/author_attestation","sign_citation":"https://pith.science/pith/LJZTXMFXCODNDPLR66GU2EREPU/action/citation_signature","submit_replication":"https://pith.science/pith/LJZTXMFXCODNDPLR66GU2EREPU/action/replication_record"}},"created_at":"2026-07-05T02:28:54.789002+00:00","updated_at":"2026-07-05T02:28:54.789002+00:00"}