{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G5X7OMQRNM46OMUYV6N2L63MB5","short_pith_number":"pith:G5X7OMQR","canonical_record":{"source":{"id":"1704.03664","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-12T09:06:06Z","cross_cats_sorted":["cs.NE","cs.SI"],"title_canon_sha256":"a86a6b41cd088147c7c0ce06453adc3412b31c1486a65715ff756f31c1e9a87d","abstract_canon_sha256":"7ff258b8059193f01c620048aba82d227484115b901a2472f5fe2a5d04677d48"},"schema_version":"1.0"},"canonical_sha256":"376ff732116b39e73298af9ba5fb6c0f5160ed41891a4c3b776c2e75bd658618","source":{"kind":"arxiv","id":"1704.03664","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03664","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03664v3","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03664","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"G5X7OMQRNM46","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G5X7OMQRNM46OMUY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G5X7OMQR","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G5X7OMQRNM46OMUYV6N2L63MB5","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03664","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-12T09:06:06Z","cross_cats_sorted":["cs.NE","cs.SI"],"title_canon_sha256":"a86a6b41cd088147c7c0ce06453adc3412b31c1486a65715ff756f31c1e9a87d","abstract_canon_sha256":"7ff258b8059193f01c620048aba82d227484115b901a2472f5fe2a5d04677d48"},"schema_version":"1.0"},"canonical_sha256":"376ff732116b39e73298af9ba5fb6c0f5160ed41891a4c3b776c2e75bd658618","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:58.290899Z","signature_b64":"4yDvkllEcp4S7aLM+b44riNLDzmlsFkIgHmeqQ9o2KhjvIFFTK3Td101TbK5UuU15DJ58ZOk4TqZKSsVupXNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"376ff732116b39e73298af9ba5fb6c0f5160ed41891a4c3b776c2e75bd658618","last_reissued_at":"2026-05-17T23:59:58.290447Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:58.290447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03664","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:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Td7Bbv0tiu9BJlxCvK7XLHBWGKD+Q3rMICH9Ri37DK9fAoxXzxepA0NGwvtXMHdAc3TJ20E9RacCXi/4Sdf3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:02:47.366829Z"},"content_sha256":"4d73016133de5cdbee2492d90a1dff26e93b6bb1c41e343539e88d6a7ee6b302","schema_version":"1.0","event_id":"sha256:4d73016133de5cdbee2492d90a1dff26e93b6bb1c41e343539e88d6a7ee6b302"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G5X7OMQRNM46OMUYV6N2L63MB5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating Optimization Problems using EAs on Scale-Free Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","cs.SI"],"primary_cat":"cs.DS","authors_text":"Ankit Chauhan, Francesco Quinzan, Tobias Friedrich","submitted_at":"2017-04-12T09:06:06Z","abstract_excerpt":"It has been observed that many complex real-world networks have certain properties, such as a high clustering coefficient, a low diameter, and a power-law degree distribution. A network with a power-law degree distribution is known as scale-free network. In order to study these networks, various random graph models have been proposed, e.g. Preferential Attachment, Chung-Lu, or Hyperbolic.\n  We look at the interplay between the power-law degree distribution and the run time of optimization techniques for well known combinatorial problems. We observe that on scale-free networks, simple evolution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03664","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:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ilRdZ5EtHhPdRzg+EQqtpKHFRgjATkoRgyWOHCmdEW/2938pJAwMinCSSJsp4qMHTTqX2R+Tumyiw+oS9yNFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:02:47.367538Z"},"content_sha256":"2b465da1bcef72dbd88ec3c93d55354d1e5cdef63be0ace420abd386d5228226","schema_version":"1.0","event_id":"sha256:2b465da1bcef72dbd88ec3c93d55354d1e5cdef63be0ace420abd386d5228226"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5X7OMQRNM46OMUYV6N2L63MB5/bundle.json","state_url":"https://pith.science/pith/G5X7OMQRNM46OMUYV6N2L63MB5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5X7OMQRNM46OMUYV6N2L63MB5/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-09T05:02:47Z","links":{"resolver":"https://pith.science/pith/G5X7OMQRNM46OMUYV6N2L63MB5","bundle":"https://pith.science/pith/G5X7OMQRNM46OMUYV6N2L63MB5/bundle.json","state":"https://pith.science/pith/G5X7OMQRNM46OMUYV6N2L63MB5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5X7OMQRNM46OMUYV6N2L63MB5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G5X7OMQRNM46OMUYV6N2L63MB5","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":"7ff258b8059193f01c620048aba82d227484115b901a2472f5fe2a5d04677d48","cross_cats_sorted":["cs.NE","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-12T09:06:06Z","title_canon_sha256":"a86a6b41cd088147c7c0ce06453adc3412b31c1486a65715ff756f31c1e9a87d"},"schema_version":"1.0","source":{"id":"1704.03664","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03664","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03664v3","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03664","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"G5X7OMQRNM46","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G5X7OMQRNM46OMUY","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G5X7OMQR","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:2b465da1bcef72dbd88ec3c93d55354d1e5cdef63be0ace420abd386d5228226","target":"graph","created_at":"2026-05-17T23:59: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":"It has been observed that many complex real-world networks have certain properties, such as a high clustering coefficient, a low diameter, and a power-law degree distribution. A network with a power-law degree distribution is known as scale-free network. In order to study these networks, various random graph models have been proposed, e.g. Preferential Attachment, Chung-Lu, or Hyperbolic.\n  We look at the interplay between the power-law degree distribution and the run time of optimization techniques for well known combinatorial problems. We observe that on scale-free networks, simple evolution","authors_text":"Ankit Chauhan, Francesco Quinzan, Tobias Friedrich","cross_cats":["cs.NE","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-12T09:06:06Z","title":"Approximating Optimization Problems using EAs on Scale-Free Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03664","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:4d73016133de5cdbee2492d90a1dff26e93b6bb1c41e343539e88d6a7ee6b302","target":"record","created_at":"2026-05-17T23:59: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":"7ff258b8059193f01c620048aba82d227484115b901a2472f5fe2a5d04677d48","cross_cats_sorted":["cs.NE","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-12T09:06:06Z","title_canon_sha256":"a86a6b41cd088147c7c0ce06453adc3412b31c1486a65715ff756f31c1e9a87d"},"schema_version":"1.0","source":{"id":"1704.03664","kind":"arxiv","version":3}},"canonical_sha256":"376ff732116b39e73298af9ba5fb6c0f5160ed41891a4c3b776c2e75bd658618","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"376ff732116b39e73298af9ba5fb6c0f5160ed41891a4c3b776c2e75bd658618","first_computed_at":"2026-05-17T23:59:58.290447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:58.290447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4yDvkllEcp4S7aLM+b44riNLDzmlsFkIgHmeqQ9o2KhjvIFFTK3Td101TbK5UuU15DJ58ZOk4TqZKSsVupXNDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:58.290899Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03664","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d73016133de5cdbee2492d90a1dff26e93b6bb1c41e343539e88d6a7ee6b302","sha256:2b465da1bcef72dbd88ec3c93d55354d1e5cdef63be0ace420abd386d5228226"],"state_sha256":"c9329cf9fc044d5974068d940f2ccf7ea7c59ccb3e68f02f2702660f15ddc3c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAqcpyU47LD2iVCkRFGPmdXqsDRTTtmk0EONTyzSv3UqhXwETUUWv3Zxiq8uRvEF4zb1MvjRTWIvs1qOOkfvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:02:47.371963Z","bundle_sha256":"f7d641fc198825f217d9c7468b86460a6010a40aec350bafea57a79e589dd9cb"}}