{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4YD6WL54LCJUCWWQFLJL4ALDUN","short_pith_number":"pith:4YD6WL54","schema_version":"1.0","canonical_sha256":"e607eb2fbc5893415ad02ad2be0163a35c07f8f10c904c7c1746454848e4420c","source":{"kind":"arxiv","id":"1801.08981","version":1},"attestation_state":"computed","paper":{"title":"Efficient Hierarchical Graph-Based Segmentation of RGBD Videos","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Henrik Christensen, Irfan Essa, Stan Birchfield, Steven Hickson","submitted_at":"2018-01-26T21:21:25Z","abstract_excerpt":"We present an efficient and scalable algorithm for segmenting 3D RGBD point clouds by combining depth, color, and temporal information using a multistage, hierarchical graph-based approach. Our algorithm processes a moving window over several point clouds to group similar regions over a graph, resulting in an initial over-segmentation. These regions are then merged to yield a dendrogram using agglomerative clustering via a minimum spanning tree algorithm. Bipartite graph matching at a given level of the hierarchical tree yields the final segmentation of the point clouds by maintaining region i"},"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":"1801.08981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-26T21:21:25Z","cross_cats_sorted":[],"title_canon_sha256":"a3ce693461bd328fd9558d76fb15ebb7514d006d59f8e7dc0a4e84ba83459b30","abstract_canon_sha256":"5f199a17cc15db622124ad2bf4d0f08c06ae67508bfe970c49b0f47142c4fd5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:58.948916Z","signature_b64":"b3YschzWBM1zzhNGrCF0QgSJBfoPqeawowt+RLNywtwU5jMOo/hGh8yACHAN/Uy3oj61entUiE0QNIB74JuWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e607eb2fbc5893415ad02ad2be0163a35c07f8f10c904c7c1746454848e4420c","last_reissued_at":"2026-05-18T00:24:58.948237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:58.948237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Hierarchical Graph-Based Segmentation of RGBD Videos","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Henrik Christensen, Irfan Essa, Stan Birchfield, Steven Hickson","submitted_at":"2018-01-26T21:21:25Z","abstract_excerpt":"We present an efficient and scalable algorithm for segmenting 3D RGBD point clouds by combining depth, color, and temporal information using a multistage, hierarchical graph-based approach. Our algorithm processes a moving window over several point clouds to group similar regions over a graph, resulting in an initial over-segmentation. These regions are then merged to yield a dendrogram using agglomerative clustering via a minimum spanning tree algorithm. Bipartite graph matching at a given level of the hierarchical tree yields the final segmentation of the point clouds by maintaining region i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08981","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":""},"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":"1801.08981","created_at":"2026-05-18T00:24:58.948371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08981v1","created_at":"2026-05-18T00:24:58.948371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08981","created_at":"2026-05-18T00:24:58.948371+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YD6WL54LCJU","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YD6WL54LCJUCWWQ","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YD6WL54","created_at":"2026-05-18T12:32:05.422762+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/4YD6WL54LCJUCWWQFLJL4ALDUN","json":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN.json","graph_json":"https://pith.science/api/pith-number/4YD6WL54LCJUCWWQFLJL4ALDUN/graph.json","events_json":"https://pith.science/api/pith-number/4YD6WL54LCJUCWWQFLJL4ALDUN/events.json","paper":"https://pith.science/paper/4YD6WL54"},"agent_actions":{"view_html":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN","download_json":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN.json","view_paper":"https://pith.science/paper/4YD6WL54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08981&json=true","fetch_graph":"https://pith.science/api/pith-number/4YD6WL54LCJUCWWQFLJL4ALDUN/graph.json","fetch_events":"https://pith.science/api/pith-number/4YD6WL54LCJUCWWQFLJL4ALDUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/action/storage_attestation","attest_author":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/action/author_attestation","sign_citation":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/action/citation_signature","submit_replication":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/action/replication_record"}},"created_at":"2026-05-18T00:24:58.948371+00:00","updated_at":"2026-05-18T00:24:58.948371+00:00"}