{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:RVQ2PTXV354AGJZK7U7RDDJUJC","short_pith_number":"pith:RVQ2PTXV","canonical_record":{"source":{"id":"2407.07388","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-07-10T06:26:05Z","cross_cats_sorted":[],"title_canon_sha256":"b8df226bafb0cd99f061603e06b56349eeb7371748a1c0562d894d7f3705c34e","abstract_canon_sha256":"fabdd05ca52b6918a7a9c493b65d8fce07d91b8103bac4edd6d19a65f912ad3e"},"schema_version":"1.0"},"canonical_sha256":"8d61a7cef5df7803272afd3f118d3448b1e67836e37f5763dbedcf684cb16de7","source":{"kind":"arxiv","id":"2407.07388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.07388","created_at":"2026-07-05T08:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"2407.07388v1","created_at":"2026-07-05T08:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.07388","created_at":"2026-07-05T08:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"RVQ2PTXV354A","created_at":"2026-07-05T08:42:10Z"},{"alias_kind":"pith_short_16","alias_value":"RVQ2PTXV354AGJZK","created_at":"2026-07-05T08:42:10Z"},{"alias_kind":"pith_short_8","alias_value":"RVQ2PTXV","created_at":"2026-07-05T08:42:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:RVQ2PTXV354AGJZK7U7RDDJUJC","target":"record","payload":{"canonical_record":{"source":{"id":"2407.07388","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-07-10T06:26:05Z","cross_cats_sorted":[],"title_canon_sha256":"b8df226bafb0cd99f061603e06b56349eeb7371748a1c0562d894d7f3705c34e","abstract_canon_sha256":"fabdd05ca52b6918a7a9c493b65d8fce07d91b8103bac4edd6d19a65f912ad3e"},"schema_version":"1.0"},"canonical_sha256":"8d61a7cef5df7803272afd3f118d3448b1e67836e37f5763dbedcf684cb16de7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:10.998805Z","signature_b64":"vNSL6y9R9joJ6iRpnryKSfQaGrvKvm6pu31TrTa7tos1Ckcy8BINUS67iwySlDxhoqLPYkBiJY96K70Q9ebrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d61a7cef5df7803272afd3f118d3448b1e67836e37f5763dbedcf684cb16de7","last_reissued_at":"2026-07-05T08:42:10.998379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:10.998379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.07388","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-07-05T08:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WFh/dDP9Z6wibcLRoeniU0Hed9Dn/gw1ivpo30Ao3VDbIysMdcrQ7CLy9HA374Eu0M1CTggfXU0E+FwEq462DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:04:13.888984Z"},"content_sha256":"ebe2ef4633011dad3555c85dc6d0989ebd968c446ec781a170abf73900869137","schema_version":"1.0","event_id":"sha256:ebe2ef4633011dad3555c85dc6d0989ebd968c446ec781a170abf73900869137"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:RVQ2PTXV354AGJZK7U7RDDJUJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tail Bounds on the Runtime of Categorical Compact Genetic Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Daiki Morinaga, Kento Uchida, Ryoki Hamano, Shinichi Shirakawa, Youhei Akimoto","submitted_at":"2024-07-10T06:26:05Z","abstract_excerpt":"The majority of theoretical analyses of evolutionary algorithms in the discrete domain focus on binary optimization algorithms, even though black-box optimization on the categorical domain has a lot of practical applications. In this paper, we consider a probabilistic model-based algorithm using the family of categorical distributions as its underlying distribution and set the sample size as two. We term this specific algorithm the categorical compact genetic algorithm (ccGA). The ccGA can be considered as an extension of the compact genetic algorithm (cGA), which is an efficient binary optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.07388","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.07388/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:42:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bub79fZytaI8tWSSvD9ELsggkYigHkovcsKFxNrXkXKXwG/KzVvTRi0n6Jhn8Um7VjxBPLHxeq9alBjgDII5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:04:13.889580Z"},"content_sha256":"3b1f7cc70a265350384e4b1b54f12dbe2bee771c62fc983dfda395e55f0ef70d","schema_version":"1.0","event_id":"sha256:3b1f7cc70a265350384e4b1b54f12dbe2bee771c62fc983dfda395e55f0ef70d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVQ2PTXV354AGJZK7U7RDDJUJC/bundle.json","state_url":"https://pith.science/pith/RVQ2PTXV354AGJZK7U7RDDJUJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVQ2PTXV354AGJZK7U7RDDJUJC/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-07T04:04:13Z","links":{"resolver":"https://pith.science/pith/RVQ2PTXV354AGJZK7U7RDDJUJC","bundle":"https://pith.science/pith/RVQ2PTXV354AGJZK7U7RDDJUJC/bundle.json","state":"https://pith.science/pith/RVQ2PTXV354AGJZK7U7RDDJUJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVQ2PTXV354AGJZK7U7RDDJUJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:RVQ2PTXV354AGJZK7U7RDDJUJC","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":"fabdd05ca52b6918a7a9c493b65d8fce07d91b8103bac4edd6d19a65f912ad3e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-07-10T06:26:05Z","title_canon_sha256":"b8df226bafb0cd99f061603e06b56349eeb7371748a1c0562d894d7f3705c34e"},"schema_version":"1.0","source":{"id":"2407.07388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.07388","created_at":"2026-07-05T08:42:10Z"},{"alias_kind":"arxiv_version","alias_value":"2407.07388v1","created_at":"2026-07-05T08:42:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.07388","created_at":"2026-07-05T08:42:10Z"},{"alias_kind":"pith_short_12","alias_value":"RVQ2PTXV354A","created_at":"2026-07-05T08:42:10Z"},{"alias_kind":"pith_short_16","alias_value":"RVQ2PTXV354AGJZK","created_at":"2026-07-05T08:42:10Z"},{"alias_kind":"pith_short_8","alias_value":"RVQ2PTXV","created_at":"2026-07-05T08:42:10Z"}],"graph_snapshots":[{"event_id":"sha256:3b1f7cc70a265350384e4b1b54f12dbe2bee771c62fc983dfda395e55f0ef70d","target":"graph","created_at":"2026-07-05T08:42:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.07388/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The majority of theoretical analyses of evolutionary algorithms in the discrete domain focus on binary optimization algorithms, even though black-box optimization on the categorical domain has a lot of practical applications. In this paper, we consider a probabilistic model-based algorithm using the family of categorical distributions as its underlying distribution and set the sample size as two. We term this specific algorithm the categorical compact genetic algorithm (ccGA). The ccGA can be considered as an extension of the compact genetic algorithm (cGA), which is an efficient binary optimi","authors_text":"Daiki Morinaga, Kento Uchida, Ryoki Hamano, Shinichi Shirakawa, Youhei Akimoto","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-07-10T06:26:05Z","title":"Tail Bounds on the Runtime of Categorical Compact Genetic Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.07388","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:ebe2ef4633011dad3555c85dc6d0989ebd968c446ec781a170abf73900869137","target":"record","created_at":"2026-07-05T08:42:10Z","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":"fabdd05ca52b6918a7a9c493b65d8fce07d91b8103bac4edd6d19a65f912ad3e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-07-10T06:26:05Z","title_canon_sha256":"b8df226bafb0cd99f061603e06b56349eeb7371748a1c0562d894d7f3705c34e"},"schema_version":"1.0","source":{"id":"2407.07388","kind":"arxiv","version":1}},"canonical_sha256":"8d61a7cef5df7803272afd3f118d3448b1e67836e37f5763dbedcf684cb16de7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d61a7cef5df7803272afd3f118d3448b1e67836e37f5763dbedcf684cb16de7","first_computed_at":"2026-07-05T08:42:10.998379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:42:10.998379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vNSL6y9R9joJ6iRpnryKSfQaGrvKvm6pu31TrTa7tos1Ckcy8BINUS67iwySlDxhoqLPYkBiJY96K70Q9ebrAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:42:10.998805Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.07388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebe2ef4633011dad3555c85dc6d0989ebd968c446ec781a170abf73900869137","sha256:3b1f7cc70a265350384e4b1b54f12dbe2bee771c62fc983dfda395e55f0ef70d"],"state_sha256":"4c3daed4aa237336a117034ed772fa73a2aaba95d84bc3dddf106e2793ce85ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kfKWlYs3Sb27gEFNd4OnpqRGS0WrbnFC8wXBkDb3PBju+hJ+vppnyN5KOFVKJxfhold8PeQngZaZA4/Zf3RgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T04:04:13.893099Z","bundle_sha256":"7952ed260692c12377bd39ee7361e32ac8c3abc2b0d38bd843888f56ac6490de"}}