{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QX26N5GSY6BNCOYCLITTBFMN7V","short_pith_number":"pith:QX26N5GS","canonical_record":{"source":{"id":"1206.2807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-06-13T13:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"9b3a4eb3de7195d384b4a0161ee60ea0a123143119a19437c79db48f3a224900","abstract_canon_sha256":"97f2655c2d5046d70746e13572058187ac61b82bfbf0a8656c985717d18891f7"},"schema_version":"1.0"},"canonical_sha256":"85f5e6f4d2c782d13b025a2730958dfd5af82900bd26a8a2bbdb0bc55a5564d1","source":{"kind":"arxiv","id":"1206.2807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2807","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2807v1","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2807","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"pith_short_12","alias_value":"QX26N5GSY6BN","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QX26N5GSY6BNCOYC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QX26N5GS","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QX26N5GSY6BNCOYCLITTBFMN7V","target":"record","payload":{"canonical_record":{"source":{"id":"1206.2807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-06-13T13:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"9b3a4eb3de7195d384b4a0161ee60ea0a123143119a19437c79db48f3a224900","abstract_canon_sha256":"97f2655c2d5046d70746e13572058187ac61b82bfbf0a8656c985717d18891f7"},"schema_version":"1.0"},"canonical_sha256":"85f5e6f4d2c782d13b025a2730958dfd5af82900bd26a8a2bbdb0bc55a5564d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:43.066734Z","signature_b64":"gxRaPxEQ/1KFSPNSvLtp0S9zQ6NR7+HwN6zP9b+jse07vDplYw4O9IQkJvTPy50KLOse4i/vYVDTR/o/Ee5gDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85f5e6f4d2c782d13b025a2730958dfd5af82900bd26a8a2bbdb0bc55a5564d1","last_reissued_at":"2026-05-18T03:53:43.066247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:43.066247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.2807","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-18T03:53:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uj0hrovwJf8vJz3GwpGBE6F4Qf5Kq2BlHLSwc9JXP9/Ks4gOdBpMS1sWxCz0SBS3Tup25MH/Y6xMnajA0ZbwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:51:24.432781Z"},"content_sha256":"50c7719865b7774cf2fad8beeff048c63bc9bed6fe3eabe1f66cfb3115135d68","schema_version":"1.0","event_id":"sha256:50c7719865b7774cf2fad8beeff048c63bc9bed6fe3eabe1f66cfb3115135d68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QX26N5GSY6BNCOYCLITTBFMN7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient hierarchical graph based image segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jean Cousty, Laurent Najman, Silvio Jamil F. Guimar\\~aes, Yukiko Kenmochi","submitted_at":"2012-06-13T13:49:23Z","abstract_excerpt":"Hierarchical image segmentation provides region-oriented scalespace, i.e., a set of image segmentations at different detail levels in which the segmentations at finer levels are nested with respect to those at coarser levels. Most image segmentation algorithms, such as region merging algorithms, rely on a criterion for merging that does not lead to a hierarchy, and for which the tuning of the parameters can be difficult. In this work, we propose a hierarchical graph based image segmentation relying on a criterion popularized by Felzenzwalb and Huttenlocher. We illustrate with both real and syn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2807","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-18T03:53:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPU/6NSdNDnzhwyiNecEvMICx3/IaSNi5hWNmX5SpxJW7fYlJqBiM3CPWP3vM1rwKWSCVs1U1IkmMkYCq9a+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T21:51:24.433373Z"},"content_sha256":"c1c68511cc8a9e157ac2e746eb7546b1d9fcdf8655811b820b281ca2e16f6448","schema_version":"1.0","event_id":"sha256:c1c68511cc8a9e157ac2e746eb7546b1d9fcdf8655811b820b281ca2e16f6448"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QX26N5GSY6BNCOYCLITTBFMN7V/bundle.json","state_url":"https://pith.science/pith/QX26N5GSY6BNCOYCLITTBFMN7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QX26N5GSY6BNCOYCLITTBFMN7V/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-30T21:51:24Z","links":{"resolver":"https://pith.science/pith/QX26N5GSY6BNCOYCLITTBFMN7V","bundle":"https://pith.science/pith/QX26N5GSY6BNCOYCLITTBFMN7V/bundle.json","state":"https://pith.science/pith/QX26N5GSY6BNCOYCLITTBFMN7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QX26N5GSY6BNCOYCLITTBFMN7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QX26N5GSY6BNCOYCLITTBFMN7V","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":"97f2655c2d5046d70746e13572058187ac61b82bfbf0a8656c985717d18891f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-06-13T13:49:23Z","title_canon_sha256":"9b3a4eb3de7195d384b4a0161ee60ea0a123143119a19437c79db48f3a224900"},"schema_version":"1.0","source":{"id":"1206.2807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.2807","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"arxiv_version","alias_value":"1206.2807v1","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.2807","created_at":"2026-05-18T03:53:43Z"},{"alias_kind":"pith_short_12","alias_value":"QX26N5GSY6BN","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QX26N5GSY6BNCOYC","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QX26N5GS","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:c1c68511cc8a9e157ac2e746eb7546b1d9fcdf8655811b820b281ca2e16f6448","target":"graph","created_at":"2026-05-18T03:53:43Z","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":"Hierarchical image segmentation provides region-oriented scalespace, i.e., a set of image segmentations at different detail levels in which the segmentations at finer levels are nested with respect to those at coarser levels. Most image segmentation algorithms, such as region merging algorithms, rely on a criterion for merging that does not lead to a hierarchy, and for which the tuning of the parameters can be difficult. In this work, we propose a hierarchical graph based image segmentation relying on a criterion popularized by Felzenzwalb and Huttenlocher. We illustrate with both real and syn","authors_text":"Jean Cousty, Laurent Najman, Silvio Jamil F. Guimar\\~aes, Yukiko Kenmochi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-06-13T13:49:23Z","title":"An efficient hierarchical graph based image segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.2807","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:50c7719865b7774cf2fad8beeff048c63bc9bed6fe3eabe1f66cfb3115135d68","target":"record","created_at":"2026-05-18T03:53:43Z","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":"97f2655c2d5046d70746e13572058187ac61b82bfbf0a8656c985717d18891f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-06-13T13:49:23Z","title_canon_sha256":"9b3a4eb3de7195d384b4a0161ee60ea0a123143119a19437c79db48f3a224900"},"schema_version":"1.0","source":{"id":"1206.2807","kind":"arxiv","version":1}},"canonical_sha256":"85f5e6f4d2c782d13b025a2730958dfd5af82900bd26a8a2bbdb0bc55a5564d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85f5e6f4d2c782d13b025a2730958dfd5af82900bd26a8a2bbdb0bc55a5564d1","first_computed_at":"2026-05-18T03:53:43.066247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:43.066247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gxRaPxEQ/1KFSPNSvLtp0S9zQ6NR7+HwN6zP9b+jse07vDplYw4O9IQkJvTPy50KLOse4i/vYVDTR/o/Ee5gDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:43.066734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.2807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50c7719865b7774cf2fad8beeff048c63bc9bed6fe3eabe1f66cfb3115135d68","sha256:c1c68511cc8a9e157ac2e746eb7546b1d9fcdf8655811b820b281ca2e16f6448"],"state_sha256":"86414608d5ad8027f21f50a5c664214400b90f2f950a72ba39947d6e51ac9f98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjGnBQZhr+p+rfzJ7l8+08yuJKpXh1AdSBwA+A589jqJfV+73SC+vspBJv/lR+XTkygR6NHxyWeATeicK7lyBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T21:51:24.436230Z","bundle_sha256":"1bc2d43ffd9a6736db2e5fde4698893d53b908a9718475c16748a6ce590344d7"}}