{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2QB3R3MG3XYHULSGGIKJ6C2BTH","short_pith_number":"pith:2QB3R3MG","schema_version":"1.0","canonical_sha256":"d403b8ed86ddf07a2e4632149f0b4199fdb49f121d3ca783bb445b63d8f53199","source":{"kind":"arxiv","id":"1912.04976","version":1},"attestation_state":"computed","paper":{"title":"Learning to Optimally Segment Point Clouds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"David Held, Deva Ramanan, Peiyun Hu","submitted_at":"2019-12-10T20:53:18Z","abstract_excerpt":"We focus on the problem of class-agnostic instance segmentation of LiDAR point clouds. We propose an approach that combines graph-theoretic search with data-driven learning: it searches over a set of candidate segmentations and returns one where individual segments score well according to a data-driven point-based model of \"objectness\". We prove that if we score a segmentation by the worst objectness among its individual segments, there is an efficient algorithm that finds the optimal worst-case segmentation among an exponentially large number of candidate segmentations. We also present an eff"},"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":"1912.04976","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-12-10T20:53:18Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"ee145153bfe4fa98ef6c3648c1835376bedc1539f1abf8bfdc7d5fe7fe847fda","abstract_canon_sha256":"21d25638933756dfe7d00cc655d8410ed67bdc5b355ae1336e7716ac79bb0838"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:25:30.569278Z","signature_b64":"+LrIo8DDqsPU9f6Nm01n1QQKpVTIjVtN3QRBoy+MXjOAiiyq/0PtGPfRm4YoSqlsYJrogpDLg+p539HALjjPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d403b8ed86ddf07a2e4632149f0b4199fdb49f121d3ca783bb445b63d8f53199","last_reissued_at":"2026-07-05T00:25:30.568835Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:25:30.568835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Optimally Segment Point Clouds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"David Held, Deva Ramanan, Peiyun Hu","submitted_at":"2019-12-10T20:53:18Z","abstract_excerpt":"We focus on the problem of class-agnostic instance segmentation of LiDAR point clouds. We propose an approach that combines graph-theoretic search with data-driven learning: it searches over a set of candidate segmentations and returns one where individual segments score well according to a data-driven point-based model of \"objectness\". We prove that if we score a segmentation by the worst objectness among its individual segments, there is an efficient algorithm that finds the optimal worst-case segmentation among an exponentially large number of candidate segmentations. We also present an eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.04976","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/1912.04976/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":"1912.04976","created_at":"2026-07-05T00:25:30.568885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.04976v1","created_at":"2026-07-05T00:25:30.568885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.04976","created_at":"2026-07-05T00:25:30.568885+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QB3R3MG3XYH","created_at":"2026-07-05T00:25:30.568885+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QB3R3MG3XYHULSG","created_at":"2026-07-05T00:25:30.568885+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QB3R3MG","created_at":"2026-07-05T00:25:30.568885+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/2QB3R3MG3XYHULSGGIKJ6C2BTH","json":"https://pith.science/pith/2QB3R3MG3XYHULSGGIKJ6C2BTH.json","graph_json":"https://pith.science/api/pith-number/2QB3R3MG3XYHULSGGIKJ6C2BTH/graph.json","events_json":"https://pith.science/api/pith-number/2QB3R3MG3XYHULSGGIKJ6C2BTH/events.json","paper":"https://pith.science/paper/2QB3R3MG"},"agent_actions":{"view_html":"https://pith.science/pith/2QB3R3MG3XYHULSGGIKJ6C2BTH","download_json":"https://pith.science/pith/2QB3R3MG3XYHULSGGIKJ6C2BTH.json","view_paper":"https://pith.science/paper/2QB3R3MG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.04976&json=true","fetch_graph":"https://pith.science/api/pith-number/2QB3R3MG3XYHULSGGIKJ6C2BTH/graph.json","fetch_events":"https://pith.science/api/pith-number/2QB3R3MG3XYHULSGGIKJ6C2BTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QB3R3MG3XYHULSGGIKJ6C2BTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QB3R3MG3XYHULSGGIKJ6C2BTH/action/storage_attestation","attest_author":"https://pith.science/pith/2QB3R3MG3XYHULSGGIKJ6C2BTH/action/author_attestation","sign_citation":"https://pith.science/pith/2QB3R3MG3XYHULSGGIKJ6C2BTH/action/citation_signature","submit_replication":"https://pith.science/pith/2QB3R3MG3XYHULSGGIKJ6C2BTH/action/replication_record"}},"created_at":"2026-07-05T00:25:30.568885+00:00","updated_at":"2026-07-05T00:25:30.568885+00:00"}