{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RROSG2VVDMWPCMWSUSVKSLX56L","short_pith_number":"pith:RROSG2VV","canonical_record":{"source":{"id":"1405.7361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T14:06:17Z","cross_cats_sorted":[],"title_canon_sha256":"a378a66dbc60e92ff7afce977791083f054ed81cb7c64307c2a0834cde100131","abstract_canon_sha256":"3476bac73e25a694f311a9c3e9daf568a4e28f8976d02ee95ed42af7dea52767"},"schema_version":"1.0"},"canonical_sha256":"8c5d236ab51b2cf132d2a4aaa92efdf2f338073777c781fc573f1fdffe8dc70b","source":{"kind":"arxiv","id":"1405.7361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7361","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7361v1","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7361","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"RROSG2VVDMWP","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RROSG2VVDMWPCMWS","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RROSG2VV","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RROSG2VVDMWPCMWSUSVKSLX56L","target":"record","payload":{"canonical_record":{"source":{"id":"1405.7361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T14:06:17Z","cross_cats_sorted":[],"title_canon_sha256":"a378a66dbc60e92ff7afce977791083f054ed81cb7c64307c2a0834cde100131","abstract_canon_sha256":"3476bac73e25a694f311a9c3e9daf568a4e28f8976d02ee95ed42af7dea52767"},"schema_version":"1.0"},"canonical_sha256":"8c5d236ab51b2cf132d2a4aaa92efdf2f338073777c781fc573f1fdffe8dc70b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:51.363010Z","signature_b64":"VTi8xEAYes1+jSw4mXY7TN2TmywnJb9wSI61vADgUp1qSBISOO3NcBTvEB4ISJrxvFVLBVPw/k7GGDrUSHPYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c5d236ab51b2cf132d2a4aaa92efdf2f338073777c781fc573f1fdffe8dc70b","last_reissued_at":"2026-05-18T02:50:51.362483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:51.362483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.7361","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-18T02:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UU153kySqPOODmcc+5AmaEauzCRRd1Gi6mZwODZIZYC3yAzm0VPtAH/HX/FZQkYhFQijkifBKfT+W00rx35cAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T16:20:40.035242Z"},"content_sha256":"8a284453df4ffea844ca440d9f9c34adfa78e766a01beb35d19c41890bfb7b95","schema_version":"1.0","event_id":"sha256:8a284453df4ffea844ca440d9f9c34adfa78e766a01beb35d19c41890bfb7b95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RROSG2VVDMWPCMWSUSVKSLX56L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Seeking multi-thresholds for image segmentation with Learning Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Zaldivar, Erik Cuevas, Marco Perez","submitted_at":"2014-05-28T14:06:17Z","abstract_excerpt":"This paper explores the use of the Learning Automata (LA) algorithm to compute threshold selection for image segmentation as it is a critical preprocessing step for image analysis, pattern recognition and computer vision. LA is a heuristic method which is able to solve complex optimization problems with interesting results in parameter estimation. Despite other techniques commonly seek through the parameter map, LA explores in the probability space providing appropriate convergence properties and robustness. The segmentation task is therefore considered as an optimization problem and the LA is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7361","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-18T02:50:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCk3yRcgnug+RvpWqRYUuJmF3eT472uevCyGCMS3tKC1OFaHUFlet6knycB5+EOIJ/q4bR+i4tk2j0sjneUOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T16:20:40.035608Z"},"content_sha256":"790c5b123a86a079f8eafe3912de6f7e5c219804501d24fb169742223d60ce85","schema_version":"1.0","event_id":"sha256:790c5b123a86a079f8eafe3912de6f7e5c219804501d24fb169742223d60ce85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RROSG2VVDMWPCMWSUSVKSLX56L/bundle.json","state_url":"https://pith.science/pith/RROSG2VVDMWPCMWSUSVKSLX56L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RROSG2VVDMWPCMWSUSVKSLX56L/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-07-08T16:20:40Z","links":{"resolver":"https://pith.science/pith/RROSG2VVDMWPCMWSUSVKSLX56L","bundle":"https://pith.science/pith/RROSG2VVDMWPCMWSUSVKSLX56L/bundle.json","state":"https://pith.science/pith/RROSG2VVDMWPCMWSUSVKSLX56L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RROSG2VVDMWPCMWSUSVKSLX56L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RROSG2VVDMWPCMWSUSVKSLX56L","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":"3476bac73e25a694f311a9c3e9daf568a4e28f8976d02ee95ed42af7dea52767","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T14:06:17Z","title_canon_sha256":"a378a66dbc60e92ff7afce977791083f054ed81cb7c64307c2a0834cde100131"},"schema_version":"1.0","source":{"id":"1405.7361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7361","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7361v1","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7361","created_at":"2026-05-18T02:50:51Z"},{"alias_kind":"pith_short_12","alias_value":"RROSG2VVDMWP","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RROSG2VVDMWPCMWS","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RROSG2VV","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:790c5b123a86a079f8eafe3912de6f7e5c219804501d24fb169742223d60ce85","target":"graph","created_at":"2026-05-18T02:50:51Z","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":"This paper explores the use of the Learning Automata (LA) algorithm to compute threshold selection for image segmentation as it is a critical preprocessing step for image analysis, pattern recognition and computer vision. LA is a heuristic method which is able to solve complex optimization problems with interesting results in parameter estimation. Despite other techniques commonly seek through the parameter map, LA explores in the probability space providing appropriate convergence properties and robustness. The segmentation task is therefore considered as an optimization problem and the LA is","authors_text":"Daniel Zaldivar, Erik Cuevas, Marco Perez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T14:06:17Z","title":"Seeking multi-thresholds for image segmentation with Learning Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7361","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:8a284453df4ffea844ca440d9f9c34adfa78e766a01beb35d19c41890bfb7b95","target":"record","created_at":"2026-05-18T02:50:51Z","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":"3476bac73e25a694f311a9c3e9daf568a4e28f8976d02ee95ed42af7dea52767","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T14:06:17Z","title_canon_sha256":"a378a66dbc60e92ff7afce977791083f054ed81cb7c64307c2a0834cde100131"},"schema_version":"1.0","source":{"id":"1405.7361","kind":"arxiv","version":1}},"canonical_sha256":"8c5d236ab51b2cf132d2a4aaa92efdf2f338073777c781fc573f1fdffe8dc70b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c5d236ab51b2cf132d2a4aaa92efdf2f338073777c781fc573f1fdffe8dc70b","first_computed_at":"2026-05-18T02:50:51.362483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:51.362483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VTi8xEAYes1+jSw4mXY7TN2TmywnJb9wSI61vADgUp1qSBISOO3NcBTvEB4ISJrxvFVLBVPw/k7GGDrUSHPYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:51.363010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a284453df4ffea844ca440d9f9c34adfa78e766a01beb35d19c41890bfb7b95","sha256:790c5b123a86a079f8eafe3912de6f7e5c219804501d24fb169742223d60ce85"],"state_sha256":"2634ba62099eedf1caea1a3fffcc503fb71d47a5e4ccd6df71984fe31d90a42b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftlzpeY48+fTXGLoOUmCAXvSeBhQwqcJRUMpT5PbQ1UJzYOV1W0DxcYEuqC3FyAlvbrKE0aW9Xt5xVrZBakHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T16:20:40.037858Z","bundle_sha256":"3b6b1756ce1b445456019ed68d97c9407870f4c97ca61bac9d75a9fa4e94416f"}}