{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZI6DGCTLRNGZCKMFGNJPDVSAVW","short_pith_number":"pith:ZI6DGCTL","canonical_record":{"source":{"id":"1606.05468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-17T10:25:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d6c1a68c83cca3dbbf53346a0bdf37b50a7d6f214d53b57e8a17f8a6edee131a","abstract_canon_sha256":"2a58fbb5ea7d7cdd7aa26cae718c631e184f0f9d60572effbcaf391acf76bb24"},"schema_version":"1.0"},"canonical_sha256":"ca3c330a6b8b4d9129853352f1d640ad86104f135629d347086c64c1c62002ab","source":{"kind":"arxiv","id":"1606.05468","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05468","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05468v1","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05468","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZI6DGCTLRNGZ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZI6DGCTLRNGZCKMF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZI6DGCTL","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZI6DGCTLRNGZCKMFGNJPDVSAVW","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-17T10:25:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d6c1a68c83cca3dbbf53346a0bdf37b50a7d6f214d53b57e8a17f8a6edee131a","abstract_canon_sha256":"2a58fbb5ea7d7cdd7aa26cae718c631e184f0f9d60572effbcaf391acf76bb24"},"schema_version":"1.0"},"canonical_sha256":"ca3c330a6b8b4d9129853352f1d640ad86104f135629d347086c64c1c62002ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:19.514986Z","signature_b64":"BpoB7eSP6gXRtYBm01i/O4DpCp8i6myoIoGizqY0JXpwZMVwGFwjs2F5P7hOHgsztwT7JULU6OXOBMttWir/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca3c330a6b8b4d9129853352f1d640ad86104f135629d347086c64c1c62002ab","last_reissued_at":"2026-05-18T01:12:19.514617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:19.514617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05468","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-18T01:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gh8nlP2rfsPF5+mgJ1QPdO7FCxsbBeeqztLWM24Kc9XHHvnLvG+wPwuyGf8V0r8rzyQ0laDJyw00DuP3yXR5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T04:24:43.066358Z"},"content_sha256":"d7bf866b0d086fd280bb6c7662efe4658a491d8db7ea26a469d30393b9c772da","schema_version":"1.0","event_id":"sha256:d7bf866b0d086fd280bb6c7662efe4658a491d8db7ea26a469d30393b9c772da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZI6DGCTLRNGZCKMFGNJPDVSAVW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Most central or least central? How much modeling decisions influence a node's centrality ranking in multiplex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Katharina Anna Zweig, Sude Tavassoli","submitted_at":"2016-06-17T10:25:24Z","abstract_excerpt":"To understand a node's centrality in a multiplex network, its centrality values in all the layers of the network can be aggregated. This requires a normalization of the values, to allow their meaningful comparison and aggregation over networks with different sizes and orders. The concrete choices of such preprocessing steps like normalization and aggregation are almost never discussed in network analytic papers. In this paper, we show that even sticking to the most simple centrality index (the degree) but using different, classic choices of normalization and aggregation strategies, can turn a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05468","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-18T01:12:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+8aYd8KSKkPOOPpc3+0sNKjBPxVQjER2snsr94dGe1W4NI7/KdvdgZfJY8uIwo3buiHGoXoMevYARvEyUVlAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T04:24:43.066705Z"},"content_sha256":"c74a45f07c0a29a8350429a11c4804d33537fb3bb231658eef0453ba48e902ab","schema_version":"1.0","event_id":"sha256:c74a45f07c0a29a8350429a11c4804d33537fb3bb231658eef0453ba48e902ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZI6DGCTLRNGZCKMFGNJPDVSAVW/bundle.json","state_url":"https://pith.science/pith/ZI6DGCTLRNGZCKMFGNJPDVSAVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZI6DGCTLRNGZCKMFGNJPDVSAVW/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-07-03T04:24:43Z","links":{"resolver":"https://pith.science/pith/ZI6DGCTLRNGZCKMFGNJPDVSAVW","bundle":"https://pith.science/pith/ZI6DGCTLRNGZCKMFGNJPDVSAVW/bundle.json","state":"https://pith.science/pith/ZI6DGCTLRNGZCKMFGNJPDVSAVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZI6DGCTLRNGZCKMFGNJPDVSAVW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZI6DGCTLRNGZCKMFGNJPDVSAVW","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":"2a58fbb5ea7d7cdd7aa26cae718c631e184f0f9d60572effbcaf391acf76bb24","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-17T10:25:24Z","title_canon_sha256":"d6c1a68c83cca3dbbf53346a0bdf37b50a7d6f214d53b57e8a17f8a6edee131a"},"schema_version":"1.0","source":{"id":"1606.05468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05468","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05468v1","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05468","created_at":"2026-05-18T01:12:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZI6DGCTLRNGZ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZI6DGCTLRNGZCKMF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZI6DGCTL","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:c74a45f07c0a29a8350429a11c4804d33537fb3bb231658eef0453ba48e902ab","target":"graph","created_at":"2026-05-18T01:12:19Z","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":"To understand a node's centrality in a multiplex network, its centrality values in all the layers of the network can be aggregated. This requires a normalization of the values, to allow their meaningful comparison and aggregation over networks with different sizes and orders. The concrete choices of such preprocessing steps like normalization and aggregation are almost never discussed in network analytic papers. In this paper, we show that even sticking to the most simple centrality index (the degree) but using different, classic choices of normalization and aggregation strategies, can turn a ","authors_text":"Katharina Anna Zweig, Sude Tavassoli","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-17T10:25:24Z","title":"Most central or least central? How much modeling decisions influence a node's centrality ranking in multiplex networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05468","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:d7bf866b0d086fd280bb6c7662efe4658a491d8db7ea26a469d30393b9c772da","target":"record","created_at":"2026-05-18T01:12:19Z","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":"2a58fbb5ea7d7cdd7aa26cae718c631e184f0f9d60572effbcaf391acf76bb24","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-06-17T10:25:24Z","title_canon_sha256":"d6c1a68c83cca3dbbf53346a0bdf37b50a7d6f214d53b57e8a17f8a6edee131a"},"schema_version":"1.0","source":{"id":"1606.05468","kind":"arxiv","version":1}},"canonical_sha256":"ca3c330a6b8b4d9129853352f1d640ad86104f135629d347086c64c1c62002ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca3c330a6b8b4d9129853352f1d640ad86104f135629d347086c64c1c62002ab","first_computed_at":"2026-05-18T01:12:19.514617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:19.514617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BpoB7eSP6gXRtYBm01i/O4DpCp8i6myoIoGizqY0JXpwZMVwGFwjs2F5P7hOHgsztwT7JULU6OXOBMttWir/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:19.514986Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7bf866b0d086fd280bb6c7662efe4658a491d8db7ea26a469d30393b9c772da","sha256:c74a45f07c0a29a8350429a11c4804d33537fb3bb231658eef0453ba48e902ab"],"state_sha256":"bc9ac610ecde93d94894c4f6b82cec8c8d859c57d6fb6295f6d4209f942fdc1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7DsMPqf9X2g3ImEDOmuU/YgIWmlKk/XrOXgVzSl5iN29lb795Gl5Z1EIVceKKC6u8RCbcJ8xVvQ+4qIwT+mCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T04:24:43.068629Z","bundle_sha256":"6eea3f7dfbe27056c2f5dc0d3bda4486cb6f0686784f271f994cd05a9d97a907"}}