{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3N6XOBBJJV2QO5FL63HQJEMP3J","short_pith_number":"pith:3N6XOBBJ","canonical_record":{"source":{"id":"1705.04119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-11T11:43:30Z","cross_cats_sorted":[],"title_canon_sha256":"a3a692eda3e6a943f5a501ae14729fb83891605b33f65bc3185b7b20d36edb02","abstract_canon_sha256":"b822312a6160625d3691bf5144472436d49c6f105d3776de3019bc2262086acd"},"schema_version":"1.0"},"canonical_sha256":"db7d7704294d750774abf6cf04918fda5c25addba0997d6ccdd31945c2f8ac9c","source":{"kind":"arxiv","id":"1705.04119","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04119","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04119v2","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04119","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"3N6XOBBJJV2Q","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3N6XOBBJJV2QO5FL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3N6XOBBJ","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3N6XOBBJJV2QO5FL63HQJEMP3J","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-11T11:43:30Z","cross_cats_sorted":[],"title_canon_sha256":"a3a692eda3e6a943f5a501ae14729fb83891605b33f65bc3185b7b20d36edb02","abstract_canon_sha256":"b822312a6160625d3691bf5144472436d49c6f105d3776de3019bc2262086acd"},"schema_version":"1.0"},"canonical_sha256":"db7d7704294d750774abf6cf04918fda5c25addba0997d6ccdd31945c2f8ac9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:32.068481Z","signature_b64":"pR3z5VUtP/x2qRinunpTtAAT+9nYtu0wVuo8N5t/8cSKeYJHNcYK31EjxcWs4zJGG5GTSZdPpAK2LPV6WBl4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db7d7704294d750774abf6cf04918fda5c25addba0997d6ccdd31945c2f8ac9c","last_reissued_at":"2026-05-18T00:33:32.067906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:32.067906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04119","source_version":2,"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-18T00:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KsNLlakCZAGUlIy5UonuRBjbZZyo4XcFRfhbYU7C/7bUUS99tDumtR/CS2+H5asJTnZHx5knHhqiqW92Ugg/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:05:27.408497Z"},"content_sha256":"ef6580ff1dc90ef797cbdcfc44231137c545e469d41cedf3c333fa516e744d0d","schema_version":"1.0","event_id":"sha256:ef6580ff1dc90ef797cbdcfc44231137c545e469d41cedf3c333fa516e744d0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3N6XOBBJJV2QO5FL63HQJEMP3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memetic search for identifying critical nodes in sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fred Glover, Jin-Kao Hao, Yangming Zhou","submitted_at":"2017-05-11T11:43:30Z","abstract_excerpt":"Critical node problems involve identifying a subset of critical nodes from an undirected graph whose removal results in optimizing a pre-defined measure over the residual graph. As useful models for a variety of practical applications, these problems are computational challenging. In this paper, we study the classic critical node problem (CNP) and introduce an effective memetic algorithm for solving CNP. The proposed algorithm combines a double backbone-based crossover operator (to generate promising offspring solutions), a component-based neighborhood search procedure (to find high-quality lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04119","kind":"arxiv","version":2},"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-18T00:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkBQkfmKRUbhq9ub6g2warcM0C/sD3fMMJPEl+CK6wnkjcCFb8wJMtLUrzve/Gvsr7IGsAAIewKqwzNmuI4bAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T07:05:27.408835Z"},"content_sha256":"99b9bbb94d9055bc7edb3fdefb469d8e8f14180119e5c5d389119654533bb217","schema_version":"1.0","event_id":"sha256:99b9bbb94d9055bc7edb3fdefb469d8e8f14180119e5c5d389119654533bb217"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3N6XOBBJJV2QO5FL63HQJEMP3J/bundle.json","state_url":"https://pith.science/pith/3N6XOBBJJV2QO5FL63HQJEMP3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3N6XOBBJJV2QO5FL63HQJEMP3J/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-29T07:05:27Z","links":{"resolver":"https://pith.science/pith/3N6XOBBJJV2QO5FL63HQJEMP3J","bundle":"https://pith.science/pith/3N6XOBBJJV2QO5FL63HQJEMP3J/bundle.json","state":"https://pith.science/pith/3N6XOBBJJV2QO5FL63HQJEMP3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3N6XOBBJJV2QO5FL63HQJEMP3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3N6XOBBJJV2QO5FL63HQJEMP3J","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":"b822312a6160625d3691bf5144472436d49c6f105d3776de3019bc2262086acd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-11T11:43:30Z","title_canon_sha256":"a3a692eda3e6a943f5a501ae14729fb83891605b33f65bc3185b7b20d36edb02"},"schema_version":"1.0","source":{"id":"1705.04119","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04119","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04119v2","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04119","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"3N6XOBBJJV2Q","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3N6XOBBJJV2QO5FL","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3N6XOBBJ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:99b9bbb94d9055bc7edb3fdefb469d8e8f14180119e5c5d389119654533bb217","target":"graph","created_at":"2026-05-18T00:33:32Z","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":"Critical node problems involve identifying a subset of critical nodes from an undirected graph whose removal results in optimizing a pre-defined measure over the residual graph. As useful models for a variety of practical applications, these problems are computational challenging. In this paper, we study the classic critical node problem (CNP) and introduce an effective memetic algorithm for solving CNP. The proposed algorithm combines a double backbone-based crossover operator (to generate promising offspring solutions), a component-based neighborhood search procedure (to find high-quality lo","authors_text":"Fred Glover, Jin-Kao Hao, Yangming Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-11T11:43:30Z","title":"Memetic search for identifying critical nodes in sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04119","kind":"arxiv","version":2},"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:ef6580ff1dc90ef797cbdcfc44231137c545e469d41cedf3c333fa516e744d0d","target":"record","created_at":"2026-05-18T00:33:32Z","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":"b822312a6160625d3691bf5144472436d49c6f105d3776de3019bc2262086acd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-11T11:43:30Z","title_canon_sha256":"a3a692eda3e6a943f5a501ae14729fb83891605b33f65bc3185b7b20d36edb02"},"schema_version":"1.0","source":{"id":"1705.04119","kind":"arxiv","version":2}},"canonical_sha256":"db7d7704294d750774abf6cf04918fda5c25addba0997d6ccdd31945c2f8ac9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db7d7704294d750774abf6cf04918fda5c25addba0997d6ccdd31945c2f8ac9c","first_computed_at":"2026-05-18T00:33:32.067906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:32.067906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pR3z5VUtP/x2qRinunpTtAAT+9nYtu0wVuo8N5t/8cSKeYJHNcYK31EjxcWs4zJGG5GTSZdPpAK2LPV6WBl4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:32.068481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04119","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef6580ff1dc90ef797cbdcfc44231137c545e469d41cedf3c333fa516e744d0d","sha256:99b9bbb94d9055bc7edb3fdefb469d8e8f14180119e5c5d389119654533bb217"],"state_sha256":"2f29d89f730478c20e8333aa5b1ea5ef3f745b791a108a9203ef203d72eebad6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xs5sTmnnDIcmyuVnm7e8LsVQVjG6h/Tp16XYjDtJC+3Px10ejGZ2a9G0DCwhXFCNuNA5M4gmFWsdjbu+6CeECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T07:05:27.411344Z","bundle_sha256":"006c865cffcdb4259f67916f1291990fa997e1a69a3b0a34bf9d40eb0f0ee185"}}