{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LOJR6TYJ6PBK4W5B5GOCHLRVTN","short_pith_number":"pith:LOJR6TYJ","canonical_record":{"source":{"id":"1405.7229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T13:39:20Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"b0d549e9027e2025878ee69b281e3e62e47fd9c9889afcf99e6b2d5ea67e9aeb","abstract_canon_sha256":"bf0951fc166b961bfe723baf1f5276b32814523aaa0d45a57a9361b72d676748"},"schema_version":"1.0"},"canonical_sha256":"5b931f4f09f3c2ae5ba1e99c23ae359b4eebded6801b4fe095b47e84e56bb575","source":{"kind":"arxiv","id":"1405.7229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7229","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7229v1","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7229","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"LOJR6TYJ6PBK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LOJR6TYJ6PBK4W5B","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LOJR6TYJ","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LOJR6TYJ6PBK4W5B5GOCHLRVTN","target":"record","payload":{"canonical_record":{"source":{"id":"1405.7229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T13:39:20Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"b0d549e9027e2025878ee69b281e3e62e47fd9c9889afcf99e6b2d5ea67e9aeb","abstract_canon_sha256":"bf0951fc166b961bfe723baf1f5276b32814523aaa0d45a57a9361b72d676748"},"schema_version":"1.0"},"canonical_sha256":"5b931f4f09f3c2ae5ba1e99c23ae359b4eebded6801b4fe095b47e84e56bb575","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:58.346070Z","signature_b64":"N70+r01UT07LUby5LTP6N+jo5QO7isabnfYupDgK17dn+yGV3UCcEXrkfg1YKCTtg0WnV9isIqcAG2JkNPPfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b931f4f09f3c2ae5ba1e99c23ae359b4eebded6801b4fe095b47e84e56bb575","last_reissued_at":"2026-05-18T02:50:58.345281Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:58.345281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.7229","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:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTKXMTBs/O/mWXvGmL0o+2Tgx0EPz3PzWvGozBW3o9wuFF1qOh97Ihd9FTRldyLQtFbkvjcyj1eh7LxOmH+EAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T12:20:19.668211Z"},"content_sha256":"75d9dbac602f6bafd7a94a51f95877bb1bc3bfb1c5190c62bab006e33128a2a5","schema_version":"1.0","event_id":"sha256:75d9dbac602f6bafd7a94a51f95877bb1bc3bfb1c5190c62bab006e33128a2a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LOJR6TYJ6PBK4W5B5GOCHLRVTN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multi-threshold Segmentation Approach Based on Artificial Bee Colony Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CV","authors_text":"Daniel Zaldivar, Erik Cuevas, Felipe Sencion, Humberto Sossa, Marco Perez","submitted_at":"2014-05-28T13:39:20Z","abstract_excerpt":"This paper explores the use of the Artificial Bee Colony (ABC) algorithm to compute threshold selection for image segmentation. ABC is a heuristic algorithm motivated by the intelligent behavior of honey-bees which has been successfully employed to solve complex optimization problems. In this approach, an image 1D histogram is approximated through a Gaussian mixture model whose parameters are calculated by the ABC algorithm. For the approximation scheme, each Gaussian function represents a pixel class and therefore a threshold. Unlike the Expectation Maximization (EM) algorithm, the ABC based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7229","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:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUU+lqPhDXN1zBKBMuJpurefxrL+N1j+PiXM7KQc595eL/MAGddVfs9v5T6eQEfmCN2hJqIjH0Yk8IuUtE+lBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T12:20:19.668579Z"},"content_sha256":"8e061c85df9ccffb060555aea7e3e49b5827dab13a83f9352c718ca63196497e","schema_version":"1.0","event_id":"sha256:8e061c85df9ccffb060555aea7e3e49b5827dab13a83f9352c718ca63196497e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/bundle.json","state_url":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/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-08T12:20:19Z","links":{"resolver":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN","bundle":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/bundle.json","state":"https://pith.science/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOJR6TYJ6PBK4W5B5GOCHLRVTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LOJR6TYJ6PBK4W5B5GOCHLRVTN","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":"bf0951fc166b961bfe723baf1f5276b32814523aaa0d45a57a9361b72d676748","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T13:39:20Z","title_canon_sha256":"b0d549e9027e2025878ee69b281e3e62e47fd9c9889afcf99e6b2d5ea67e9aeb"},"schema_version":"1.0","source":{"id":"1405.7229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7229","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7229v1","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7229","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"LOJR6TYJ6PBK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LOJR6TYJ6PBK4W5B","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LOJR6TYJ","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:8e061c85df9ccffb060555aea7e3e49b5827dab13a83f9352c718ca63196497e","target":"graph","created_at":"2026-05-18T02:50: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":"This paper explores the use of the Artificial Bee Colony (ABC) algorithm to compute threshold selection for image segmentation. ABC is a heuristic algorithm motivated by the intelligent behavior of honey-bees which has been successfully employed to solve complex optimization problems. In this approach, an image 1D histogram is approximated through a Gaussian mixture model whose parameters are calculated by the ABC algorithm. For the approximation scheme, each Gaussian function represents a pixel class and therefore a threshold. Unlike the Expectation Maximization (EM) algorithm, the ABC based ","authors_text":"Daniel Zaldivar, Erik Cuevas, Felipe Sencion, Humberto Sossa, Marco Perez","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T13:39:20Z","title":"A Multi-threshold Segmentation Approach Based on Artificial Bee Colony Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7229","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:75d9dbac602f6bafd7a94a51f95877bb1bc3bfb1c5190c62bab006e33128a2a5","target":"record","created_at":"2026-05-18T02:50: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":"bf0951fc166b961bfe723baf1f5276b32814523aaa0d45a57a9361b72d676748","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-05-28T13:39:20Z","title_canon_sha256":"b0d549e9027e2025878ee69b281e3e62e47fd9c9889afcf99e6b2d5ea67e9aeb"},"schema_version":"1.0","source":{"id":"1405.7229","kind":"arxiv","version":1}},"canonical_sha256":"5b931f4f09f3c2ae5ba1e99c23ae359b4eebded6801b4fe095b47e84e56bb575","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b931f4f09f3c2ae5ba1e99c23ae359b4eebded6801b4fe095b47e84e56bb575","first_computed_at":"2026-05-18T02:50:58.345281Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:58.345281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N70+r01UT07LUby5LTP6N+jo5QO7isabnfYupDgK17dn+yGV3UCcEXrkfg1YKCTtg0WnV9isIqcAG2JkNPPfDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:58.346070Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75d9dbac602f6bafd7a94a51f95877bb1bc3bfb1c5190c62bab006e33128a2a5","sha256:8e061c85df9ccffb060555aea7e3e49b5827dab13a83f9352c718ca63196497e"],"state_sha256":"ee28a2bf809eb0538e2948b726deca0afe677e91261675000168ff92d419de0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4RKkmPcefLxFa3GZgt4890vYywMoAuFf+A4SjSkpU1Du/AHcwYz0lQoRuebrWsEocpbtFRtlL0hGoMMIFPQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T12:20:19.670802Z","bundle_sha256":"b7a6cc5fffeaa41a2abe4f63fca6a37c451e1f209258460cae7ec6679d8fae66"}}