{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:U4L2O4XQZG3FM5C6ULOGTFU6KW","short_pith_number":"pith:U4L2O4XQ","canonical_record":{"source":{"id":"1808.06958","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-21T15:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"d32412fee43a5ba90bbc62b3fa99c6dcd1052a8bf5a44b5a2a08b508f265e79f","abstract_canon_sha256":"e307843a4fedcd59f4b77201e0e33c4aa6e62cdc29eee918f3d7755aa0eaac9e"},"schema_version":"1.0"},"canonical_sha256":"a717a772f0c9b656745ea2dc69969e558e90d9fc939b1d378507eb068b131ae0","source":{"kind":"arxiv","id":"1808.06958","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06958","created_at":"2026-05-17T23:58:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06958v3","created_at":"2026-05-17T23:58:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06958","created_at":"2026-05-17T23:58:22Z"},{"alias_kind":"pith_short_12","alias_value":"U4L2O4XQZG3F","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U4L2O4XQZG3FM5C6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U4L2O4XQ","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:U4L2O4XQZG3FM5C6ULOGTFU6KW","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06958","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-21T15:06:55Z","cross_cats_sorted":[],"title_canon_sha256":"d32412fee43a5ba90bbc62b3fa99c6dcd1052a8bf5a44b5a2a08b508f265e79f","abstract_canon_sha256":"e307843a4fedcd59f4b77201e0e33c4aa6e62cdc29eee918f3d7755aa0eaac9e"},"schema_version":"1.0"},"canonical_sha256":"a717a772f0c9b656745ea2dc69969e558e90d9fc939b1d378507eb068b131ae0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:22.835600Z","signature_b64":"xWl015rAhmmfgieGCQJGHgTutFRJ+CNq4ka4SOHgO53qFgMYQuvfUDChMdZBm75Uo0JPh//IYc4l0clUbuCYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a717a772f0c9b656745ea2dc69969e558e90d9fc939b1d378507eb068b131ae0","last_reissued_at":"2026-05-17T23:58:22.834862Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:22.834862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06958","source_version":3,"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-17T23:58:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7clXR1BVOTSncI58FaynujThyzYjaS3+vXsr+vrDf5fwl0C0INz+GhLYBfF/4I8xIN/F2m5wBjuZ7c3AVE6MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:54:25.551581Z"},"content_sha256":"855f0c6d42125490d85e0b5bc0ed631736d2ed148a5889108890668572ee76b0","schema_version":"1.0","event_id":"sha256:855f0c6d42125490d85e0b5bc0ed631736d2ed148a5889108890668572ee76b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:U4L2O4XQZG3FM5C6ULOGTFU6KW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greedy Harmony Search Algorithm for the Hop Constrained Connected Facility Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bahram Sadeghi Bigham, Farzane Yahyanejad","submitted_at":"2018-08-21T15:06:55Z","abstract_excerpt":"We present a simple, robust and efficient harmony search algorithm for the Hop Constrained Connected Facility Location problem (HCConFL). The HCConFL problem is NP-hard that models the design of data-management and telecommunication networks in a manner of reliability. In this paper, we customize harmony search algorithm to solve the HCConFL problem. To arrive to quick, optimal cost of each solution, we use a new greedy approach expanding idea of Kruskal algorithm in our objective function. We also use a new greedy method combined with harmony search to obtain a good approximation in an effici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06958","kind":"arxiv","version":3},"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-17T23:58:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IMRxVVXWKsDqpl6XJPuHmej0OlmqMab6FRkifUpo2ybn57eXklpVUW8RSJzA+vc4zBl1pAe9F8djyXokjtnlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:54:25.552146Z"},"content_sha256":"8372541c5c664e4635b92b8c1203d76cb2316e24a79f5747a5ce70da70463106","schema_version":"1.0","event_id":"sha256:8372541c5c664e4635b92b8c1203d76cb2316e24a79f5747a5ce70da70463106"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4L2O4XQZG3FM5C6ULOGTFU6KW/bundle.json","state_url":"https://pith.science/pith/U4L2O4XQZG3FM5C6ULOGTFU6KW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4L2O4XQZG3FM5C6ULOGTFU6KW/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-05T04:54:25Z","links":{"resolver":"https://pith.science/pith/U4L2O4XQZG3FM5C6ULOGTFU6KW","bundle":"https://pith.science/pith/U4L2O4XQZG3FM5C6ULOGTFU6KW/bundle.json","state":"https://pith.science/pith/U4L2O4XQZG3FM5C6ULOGTFU6KW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4L2O4XQZG3FM5C6ULOGTFU6KW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U4L2O4XQZG3FM5C6ULOGTFU6KW","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":"e307843a4fedcd59f4b77201e0e33c4aa6e62cdc29eee918f3d7755aa0eaac9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-21T15:06:55Z","title_canon_sha256":"d32412fee43a5ba90bbc62b3fa99c6dcd1052a8bf5a44b5a2a08b508f265e79f"},"schema_version":"1.0","source":{"id":"1808.06958","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06958","created_at":"2026-05-17T23:58:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06958v3","created_at":"2026-05-17T23:58:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06958","created_at":"2026-05-17T23:58:22Z"},{"alias_kind":"pith_short_12","alias_value":"U4L2O4XQZG3F","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U4L2O4XQZG3FM5C6","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U4L2O4XQ","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:8372541c5c664e4635b92b8c1203d76cb2316e24a79f5747a5ce70da70463106","target":"graph","created_at":"2026-05-17T23:58:22Z","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":"We present a simple, robust and efficient harmony search algorithm for the Hop Constrained Connected Facility Location problem (HCConFL). The HCConFL problem is NP-hard that models the design of data-management and telecommunication networks in a manner of reliability. In this paper, we customize harmony search algorithm to solve the HCConFL problem. To arrive to quick, optimal cost of each solution, we use a new greedy approach expanding idea of Kruskal algorithm in our objective function. We also use a new greedy method combined with harmony search to obtain a good approximation in an effici","authors_text":"Bahram Sadeghi Bigham, Farzane Yahyanejad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-21T15:06:55Z","title":"Greedy Harmony Search Algorithm for the Hop Constrained Connected Facility Location"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06958","kind":"arxiv","version":3},"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:855f0c6d42125490d85e0b5bc0ed631736d2ed148a5889108890668572ee76b0","target":"record","created_at":"2026-05-17T23:58:22Z","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":"e307843a4fedcd59f4b77201e0e33c4aa6e62cdc29eee918f3d7755aa0eaac9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-21T15:06:55Z","title_canon_sha256":"d32412fee43a5ba90bbc62b3fa99c6dcd1052a8bf5a44b5a2a08b508f265e79f"},"schema_version":"1.0","source":{"id":"1808.06958","kind":"arxiv","version":3}},"canonical_sha256":"a717a772f0c9b656745ea2dc69969e558e90d9fc939b1d378507eb068b131ae0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a717a772f0c9b656745ea2dc69969e558e90d9fc939b1d378507eb068b131ae0","first_computed_at":"2026-05-17T23:58:22.834862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:22.834862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xWl015rAhmmfgieGCQJGHgTutFRJ+CNq4ka4SOHgO53qFgMYQuvfUDChMdZBm75Uo0JPh//IYc4l0clUbuCYBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:22.835600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06958","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:855f0c6d42125490d85e0b5bc0ed631736d2ed148a5889108890668572ee76b0","sha256:8372541c5c664e4635b92b8c1203d76cb2316e24a79f5747a5ce70da70463106"],"state_sha256":"a623e31c14c02ef757a44f30561c7edbd29b83c9828d145aa1aac7da078e615e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OgO8X19naek/7/iu8eZgAHnxukKBm/JTuYYUmItk9oqCLsXvhQw8nTmJHqGdUoxEtl1o3gUAmT+A7JjW6TtbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:54:25.555300Z","bundle_sha256":"7a6f9b0bdafb1f97774a0a1ae1a80c78c996e23763b2d926563e9e1014d5efcd"}}