{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PQHRZR6UITWNPB5LKRZSWEVUI7","short_pith_number":"pith:PQHRZR6U","canonical_record":{"source":{"id":"1406.6560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-06-25T13:15:08Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"1bc8a29b1f8e1b210c7262ddafe4b88ba331ac2f7103ce4aec799a95a69a4136","abstract_canon_sha256":"78ee1b15657c2e1453f459bfcaf7336485d7d8b75f0c84832b9d7373c209af3c"},"schema_version":"1.0"},"canonical_sha256":"7c0f1cc7d444ecd787ab54732b12b447fddabc0a443d983d8e8a47a473a68f48","source":{"kind":"arxiv","id":"1406.6560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6560","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6560v1","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6560","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"pith_short_12","alias_value":"PQHRZR6UITWN","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PQHRZR6UITWNPB5L","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PQHRZR6U","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PQHRZR6UITWNPB5LKRZSWEVUI7","target":"record","payload":{"canonical_record":{"source":{"id":"1406.6560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-06-25T13:15:08Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"1bc8a29b1f8e1b210c7262ddafe4b88ba331ac2f7103ce4aec799a95a69a4136","abstract_canon_sha256":"78ee1b15657c2e1453f459bfcaf7336485d7d8b75f0c84832b9d7373c209af3c"},"schema_version":"1.0"},"canonical_sha256":"7c0f1cc7d444ecd787ab54732b12b447fddabc0a443d983d8e8a47a473a68f48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:02.623603Z","signature_b64":"oBkgpxQF7EEPeFrSPTGM/gGO1NNZ/BJfIe97yD6IJhw24M1fnpB0Zm3xbPHgniLz8Wb6zmhQ+LyY0wCHrlqnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c0f1cc7d444ecd787ab54732b12b447fddabc0a443d983d8e8a47a473a68f48","last_reissued_at":"2026-05-18T02:49:02.623133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:02.623133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.6560","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:49:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kxOImjMND1qh7baBGUxM2JhZKLy2uBdmo/ko8m2p/7C8FmyvSUZl6YLSg8uWjvwWrS0U1TprhqZgP7Cla1FnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T08:40:39.575172Z"},"content_sha256":"98821a2aba00ea29dacb2d10e1b589424a9f4803131eb9191b199d5dbbf3f780","schema_version":"1.0","event_id":"sha256:98821a2aba00ea29dacb2d10e1b589424a9f4803131eb9191b199d5dbbf3f780"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PQHRZR6UITWNPB5LKRZSWEVUI7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi Circle Detection on Images Using Artificial Bee Colony (ABC) 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-Echauri, Marco Perez Cisneros","submitted_at":"2014-06-25T13:15:08Z","abstract_excerpt":"Hough transform (HT) has been the most common method for circle detection, exhibiting robustness, but adversely demanding considerable computational effort and large memory requirements. Alternative approaches include heuristic methods that employ iterative optimization procedures for detecting multiple circles. Since only one circle can be marked at each optimization cycle, multiple executions must be enforced in order to achieve multi detection. This paper presents an algorithm for automatic detection of multiple circular shapes that considers the overall process as a multi-modal optimizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6560","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:49:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5uOJepMEY0SZeIvpAoCwwqV4eP29GCHdCkLe80nZZmyUK+GZjBDkxGi9HuwBv19FX6uTydVNhgkkGoejSKFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T08:40:39.575658Z"},"content_sha256":"678a73d1a22281e2147b8b29fb4f8cd891a54d89263bbadbd9440ff89e84a1ce","schema_version":"1.0","event_id":"sha256:678a73d1a22281e2147b8b29fb4f8cd891a54d89263bbadbd9440ff89e84a1ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQHRZR6UITWNPB5LKRZSWEVUI7/bundle.json","state_url":"https://pith.science/pith/PQHRZR6UITWNPB5LKRZSWEVUI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQHRZR6UITWNPB5LKRZSWEVUI7/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-08-01T08:40:39Z","links":{"resolver":"https://pith.science/pith/PQHRZR6UITWNPB5LKRZSWEVUI7","bundle":"https://pith.science/pith/PQHRZR6UITWNPB5LKRZSWEVUI7/bundle.json","state":"https://pith.science/pith/PQHRZR6UITWNPB5LKRZSWEVUI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQHRZR6UITWNPB5LKRZSWEVUI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PQHRZR6UITWNPB5LKRZSWEVUI7","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":"78ee1b15657c2e1453f459bfcaf7336485d7d8b75f0c84832b9d7373c209af3c","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-06-25T13:15:08Z","title_canon_sha256":"1bc8a29b1f8e1b210c7262ddafe4b88ba331ac2f7103ce4aec799a95a69a4136"},"schema_version":"1.0","source":{"id":"1406.6560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6560","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6560v1","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6560","created_at":"2026-05-18T02:49:02Z"},{"alias_kind":"pith_short_12","alias_value":"PQHRZR6UITWN","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PQHRZR6UITWNPB5L","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PQHRZR6U","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:678a73d1a22281e2147b8b29fb4f8cd891a54d89263bbadbd9440ff89e84a1ce","target":"graph","created_at":"2026-05-18T02:49:02Z","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":"Hough transform (HT) has been the most common method for circle detection, exhibiting robustness, but adversely demanding considerable computational effort and large memory requirements. Alternative approaches include heuristic methods that employ iterative optimization procedures for detecting multiple circles. Since only one circle can be marked at each optimization cycle, multiple executions must be enforced in order to achieve multi detection. This paper presents an algorithm for automatic detection of multiple circular shapes that considers the overall process as a multi-modal optimizatio","authors_text":"Daniel Zaldivar, Erik Cuevas, Felipe Sencion-Echauri, Marco Perez Cisneros","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-06-25T13:15:08Z","title":"Multi Circle Detection on Images Using Artificial Bee Colony (ABC) Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6560","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:98821a2aba00ea29dacb2d10e1b589424a9f4803131eb9191b199d5dbbf3f780","target":"record","created_at":"2026-05-18T02:49:02Z","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":"78ee1b15657c2e1453f459bfcaf7336485d7d8b75f0c84832b9d7373c209af3c","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-06-25T13:15:08Z","title_canon_sha256":"1bc8a29b1f8e1b210c7262ddafe4b88ba331ac2f7103ce4aec799a95a69a4136"},"schema_version":"1.0","source":{"id":"1406.6560","kind":"arxiv","version":1}},"canonical_sha256":"7c0f1cc7d444ecd787ab54732b12b447fddabc0a443d983d8e8a47a473a68f48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c0f1cc7d444ecd787ab54732b12b447fddabc0a443d983d8e8a47a473a68f48","first_computed_at":"2026-05-18T02:49:02.623133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:02.623133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oBkgpxQF7EEPeFrSPTGM/gGO1NNZ/BJfIe97yD6IJhw24M1fnpB0Zm3xbPHgniLz8Wb6zmhQ+LyY0wCHrlqnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:02.623603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98821a2aba00ea29dacb2d10e1b589424a9f4803131eb9191b199d5dbbf3f780","sha256:678a73d1a22281e2147b8b29fb4f8cd891a54d89263bbadbd9440ff89e84a1ce"],"state_sha256":"5c2f219b4167d05e0f3740f181b6ea016b6e13e09bb1cf74fc125c7ff73577ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gi+boYOiMPxa9nwVRhQ9LpGH7/uYvjJJb4vxO6YbjZPhdF0Y5SQSvEBLQohXx6ptpnuuES5F3kuYT3mOxC+AAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T08:40:39.581115Z","bundle_sha256":"ded2e9c024f12398decf1bd7e6aba7ec43181eb35f61c2d782358961a6845911"}}