{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4YD6WL54LCJUCWWQFLJL4ALDUN","short_pith_number":"pith:4YD6WL54","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"},"canonical_sha256":"e607eb2fbc5893415ad02ad2be0163a35c07f8f10c904c7c1746454848e4420c","source":{"kind":"arxiv","id":"1801.08981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08981","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08981v1","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08981","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"pith_short_12","alias_value":"4YD6WL54LCJU","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4YD6WL54LCJUCWWQ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4YD6WL54","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4YD6WL54LCJUCWWQFLJL4ALDUN","target":"record","payload":{"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"},"canonical_sha256":"e607eb2fbc5893415ad02ad2be0163a35c07f8f10c904c7c1746454848e4420c","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"},"source_kind":"arxiv","source_id":"1801.08981","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:24:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iowrbSCprqw3vfhb37n3wmxOPQjU7ZcUItrXVb7x0VVou3rfeNkn2H3PI1EaElAVA3LAoFHHN7IHRMlrtvSgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:42:36.772521Z"},"content_sha256":"8128b4cca66e7256f06ea64d8bbc964a566f0895797bb01539aeafb40e49854a","schema_version":"1.0","event_id":"sha256:8128b4cca66e7256f06ea64d8bbc964a566f0895797bb01539aeafb40e49854a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4YD6WL54LCJUCWWQFLJL4ALDUN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:24:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+iS/7jl2J9MI1D8YKAu2zeT4cZlhzkUmazJ8+1Tq/zfN9H3PjIbtakjjSFeWMzKQHYViTpreVKcUaQqazbcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:42:36.772869Z"},"content_sha256":"339f3c3218749035b3525aef718706f2197edd94c091edea27005e7f18af244b","schema_version":"1.0","event_id":"sha256:339f3c3218749035b3525aef718706f2197edd94c091edea27005e7f18af244b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/bundle.json","state_url":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T01:42:36Z","links":{"resolver":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN","bundle":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/bundle.json","state":"https://pith.science/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YD6WL54LCJUCWWQFLJL4ALDUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4YD6WL54LCJUCWWQFLJL4ALDUN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5f199a17cc15db622124ad2bf4d0f08c06ae67508bfe970c49b0f47142c4fd5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-26T21:21:25Z","title_canon_sha256":"a3ce693461bd328fd9558d76fb15ebb7514d006d59f8e7dc0a4e84ba83459b30"},"schema_version":"1.0","source":{"id":"1801.08981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.08981","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.08981v1","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08981","created_at":"2026-05-18T00:24:58Z"},{"alias_kind":"pith_short_12","alias_value":"4YD6WL54LCJU","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4YD6WL54LCJUCWWQ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4YD6WL54","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:339f3c3218749035b3525aef718706f2197edd94c091edea27005e7f18af244b","target":"graph","created_at":"2026-05-18T00:24:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Henrik Christensen, Irfan Essa, Stan Birchfield, Steven Hickson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-26T21:21:25Z","title":"Efficient Hierarchical Graph-Based Segmentation of RGBD Videos"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08981","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8128b4cca66e7256f06ea64d8bbc964a566f0895797bb01539aeafb40e49854a","target":"record","created_at":"2026-05-18T00:24:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5f199a17cc15db622124ad2bf4d0f08c06ae67508bfe970c49b0f47142c4fd5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-26T21:21:25Z","title_canon_sha256":"a3ce693461bd328fd9558d76fb15ebb7514d006d59f8e7dc0a4e84ba83459b30"},"schema_version":"1.0","source":{"id":"1801.08981","kind":"arxiv","version":1}},"canonical_sha256":"e607eb2fbc5893415ad02ad2be0163a35c07f8f10c904c7c1746454848e4420c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e607eb2fbc5893415ad02ad2be0163a35c07f8f10c904c7c1746454848e4420c","first_computed_at":"2026-05-18T00:24:58.948237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:58.948237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b3YschzWBM1zzhNGrCF0QgSJBfoPqeawowt+RLNywtwU5jMOo/hGh8yACHAN/Uy3oj61entUiE0QNIB74JuWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:58.948916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.08981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8128b4cca66e7256f06ea64d8bbc964a566f0895797bb01539aeafb40e49854a","sha256:339f3c3218749035b3525aef718706f2197edd94c091edea27005e7f18af244b"],"state_sha256":"e543a945678d682d78a8c7d95aba267986143172c13d6edd31927aba584c67e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i1NfpI97BiljBMdawC7crFFBPDFRQIyJrGQZWgSaYGp7vNG0JQgdsVvVh1tUshKdAqPdaHxqA/0s64XuXcfXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:42:36.774813Z","bundle_sha256":"a6dd3b540d637e04687a358295f7d9e097c11deb7d3191b27bb58aee5d642aa8"}}