{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WAHVBEIS7JZ6BIACHGDGI35D3T","short_pith_number":"pith:WAHVBEIS","canonical_record":{"source":{"id":"1011.0126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-31T04:27:30Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"470635dc0cbd3635c43b9796eabe8e5bd565e1a7835370cc82b9f576b0fdb049","abstract_canon_sha256":"fd3fef7f35201a7fade7e22d13c8597e6235ebbb059ab3cee6bc033c5e1f1b99"},"schema_version":"1.0"},"canonical_sha256":"b00f509112fa73e0a0023986646fa3dcf6d1ca5958eccf3af75eb2a8de4d05ff","source":{"kind":"arxiv","id":"1011.0126","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0126","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0126v1","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0126","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"WAHVBEIS7JZ6","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WAHVBEIS7JZ6BIAC","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WAHVBEIS","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WAHVBEIS7JZ6BIACHGDGI35D3T","target":"record","payload":{"canonical_record":{"source":{"id":"1011.0126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-31T04:27:30Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"470635dc0cbd3635c43b9796eabe8e5bd565e1a7835370cc82b9f576b0fdb049","abstract_canon_sha256":"fd3fef7f35201a7fade7e22d13c8597e6235ebbb059ab3cee6bc033c5e1f1b99"},"schema_version":"1.0"},"canonical_sha256":"b00f509112fa73e0a0023986646fa3dcf6d1ca5958eccf3af75eb2a8de4d05ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:38.045117Z","signature_b64":"TGnv8yhd2egsfA5FcLGofVhpVDQEqVeugtN9IXoagzgdExVBlrKbfcBfvrz/qaVZdfkbP5KBlk0EIoaMLzMmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b00f509112fa73e0a0023986646fa3dcf6d1ca5958eccf3af75eb2a8de4d05ff","last_reissued_at":"2026-05-18T02:23:38.044573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:38.044573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.0126","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:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUr1go8run8EtRD6Q0MSCjpOURHyb/UGcWg2KmsqUxnEpN5lK8Y84O46S07oJMYoZ1/HlNj2H7rvDHPoUAE2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:19.500346Z"},"content_sha256":"81de75a0ec90fc2794c02083c67a66dd0bf52ad260660e301ded53bcd8e4d0f3","schema_version":"1.0","event_id":"sha256:81de75a0ec90fc2794c02083c67a66dd0bf52ad260660e301ded53bcd8e4d0f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WAHVBEIS7JZ6BIACHGDGI35D3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using topological characteristics to evaluate complex network models can be misleading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.NI","authors_text":"Guanrong Chen, Yunong Zhang, Zhengping Fan","submitted_at":"2010-10-31T04:27:30Z","abstract_excerpt":"Graphical models are frequently used to represent topological structures of various complex networks. Current criteria to assess different models of a network mainly rely on how close a model matches the network in terms of topological characteristics. Typical topological metrics are clustering coefficient, distance distribution, the largest eigenvalue of the adjacency matrix, and the gap between the first and the second largest eigenvalues, which are widely used to evaluate and compare different models of a network. In this paper, we show that evaluating complex network models based on the cu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0126","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:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u53NMfmkYCcIuD7vLey+EaYHE0pQVhdCRRdp29C4YUuPXBZDUYdJvrx8MV2X5uxQqRT2WUzq0JJPs2E6gjwBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T19:38:19.500696Z"},"content_sha256":"aecd701072912698dc95b0646063fed2b42ebcbe78e6599f019cac19fb1cb9c8","schema_version":"1.0","event_id":"sha256:aecd701072912698dc95b0646063fed2b42ebcbe78e6599f019cac19fb1cb9c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAHVBEIS7JZ6BIACHGDGI35D3T/bundle.json","state_url":"https://pith.science/pith/WAHVBEIS7JZ6BIACHGDGI35D3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAHVBEIS7JZ6BIACHGDGI35D3T/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-01T19:38:19Z","links":{"resolver":"https://pith.science/pith/WAHVBEIS7JZ6BIACHGDGI35D3T","bundle":"https://pith.science/pith/WAHVBEIS7JZ6BIACHGDGI35D3T/bundle.json","state":"https://pith.science/pith/WAHVBEIS7JZ6BIACHGDGI35D3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAHVBEIS7JZ6BIACHGDGI35D3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WAHVBEIS7JZ6BIACHGDGI35D3T","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":"fd3fef7f35201a7fade7e22d13c8597e6235ebbb059ab3cee6bc033c5e1f1b99","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-31T04:27:30Z","title_canon_sha256":"470635dc0cbd3635c43b9796eabe8e5bd565e1a7835370cc82b9f576b0fdb049"},"schema_version":"1.0","source":{"id":"1011.0126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.0126","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1011.0126v1","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0126","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"WAHVBEIS7JZ6","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"WAHVBEIS7JZ6BIAC","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"WAHVBEIS","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:aecd701072912698dc95b0646063fed2b42ebcbe78e6599f019cac19fb1cb9c8","target":"graph","created_at":"2026-05-18T02:23:38Z","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":"Graphical models are frequently used to represent topological structures of various complex networks. Current criteria to assess different models of a network mainly rely on how close a model matches the network in terms of topological characteristics. Typical topological metrics are clustering coefficient, distance distribution, the largest eigenvalue of the adjacency matrix, and the gap between the first and the second largest eigenvalues, which are widely used to evaluate and compare different models of a network. In this paper, we show that evaluating complex network models based on the cu","authors_text":"Guanrong Chen, Yunong Zhang, Zhengping Fan","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-31T04:27:30Z","title":"Using topological characteristics to evaluate complex network models can be misleading"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0126","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:81de75a0ec90fc2794c02083c67a66dd0bf52ad260660e301ded53bcd8e4d0f3","target":"record","created_at":"2026-05-18T02:23:38Z","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":"fd3fef7f35201a7fade7e22d13c8597e6235ebbb059ab3cee6bc033c5e1f1b99","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-10-31T04:27:30Z","title_canon_sha256":"470635dc0cbd3635c43b9796eabe8e5bd565e1a7835370cc82b9f576b0fdb049"},"schema_version":"1.0","source":{"id":"1011.0126","kind":"arxiv","version":1}},"canonical_sha256":"b00f509112fa73e0a0023986646fa3dcf6d1ca5958eccf3af75eb2a8de4d05ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b00f509112fa73e0a0023986646fa3dcf6d1ca5958eccf3af75eb2a8de4d05ff","first_computed_at":"2026-05-18T02:23:38.044573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:38.044573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TGnv8yhd2egsfA5FcLGofVhpVDQEqVeugtN9IXoagzgdExVBlrKbfcBfvrz/qaVZdfkbP5KBlk0EIoaMLzMmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:38.045117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.0126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81de75a0ec90fc2794c02083c67a66dd0bf52ad260660e301ded53bcd8e4d0f3","sha256:aecd701072912698dc95b0646063fed2b42ebcbe78e6599f019cac19fb1cb9c8"],"state_sha256":"034445ce95a47d72f6a2c1527a64fff42d333e0f55375998bf2c60c53f2043e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBeZuKvqsRRpwV9VGD2aj8wkCmdIlZuj2t2arvk3YhESqPC4rNlbSchkKvwbwHXctPMyYRQRkkHPGqDYfkM5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T19:38:19.502646Z","bundle_sha256":"4c5b961d6f90a0548253bc17bef94953e2f4408b40a67eb7e26daebd318b1b0d"}}