{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HMK34HVRTBIVDEIDPLRYFRXHZS","short_pith_number":"pith:HMK34HVR","canonical_record":{"source":{"id":"1706.02083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-07T08:12:42Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"3622839e64bef460d0d785a76b1035e6954aace4738706a78ae41dfb1bc1b886","abstract_canon_sha256":"a2abf49ea8e55e1b94f7bf7324befc1a55858110c02e47727d6271445fe726ed"},"schema_version":"1.0"},"canonical_sha256":"3b15be1eb198515191037ae382c6e7ccb5293f32d1113ccf570f42e2db388b4a","source":{"kind":"arxiv","id":"1706.02083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02083","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02083v1","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02083","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"pith_short_12","alias_value":"HMK34HVRTBIV","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HMK34HVRTBIVDEID","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HMK34HVR","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HMK34HVRTBIVDEIDPLRYFRXHZS","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-07T08:12:42Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"3622839e64bef460d0d785a76b1035e6954aace4738706a78ae41dfb1bc1b886","abstract_canon_sha256":"a2abf49ea8e55e1b94f7bf7324befc1a55858110c02e47727d6271445fe726ed"},"schema_version":"1.0"},"canonical_sha256":"3b15be1eb198515191037ae382c6e7ccb5293f32d1113ccf570f42e2db388b4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:50.136540Z","signature_b64":"ZLS0137giAFwDEIZslBgRXJd7mTRYEmdYwK8eletk7gxg/GqDJRmVIhCKDtHNqz/9Mi0JnLbg7FSXQmMltyoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b15be1eb198515191037ae382c6e7ccb5293f32d1113ccf570f42e2db388b4a","last_reissued_at":"2026-05-18T00:42:50.135734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:50.135734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02083","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-18T00:42:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FdvytamisKcYcsAOG7VFo+sDQY/Rk8J+XLGBAY+yY7TVhBT0yaJzRmhbdXMyvRFVXxz5bsYTDeCwj3MMNwd6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:20:25.310841Z"},"content_sha256":"40e1dd68cdf9677c8ab76dc9995efb557de26cd6387d04e84c9ae484868cf2b2","schema_version":"1.0","event_id":"sha256:40e1dd68cdf9677c8ab76dc9995efb557de26cd6387d04e84c9ae484868cf2b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HMK34HVRTBIVDEIDPLRYFRXHZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster Method to Estimate Closeness Centrality Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Akrati Saxena, Ralucca Gera, S. R. S. Iyengar","submitted_at":"2017-06-07T08:12:42Z","abstract_excerpt":"Closeness centrality is one way of measuring how central a node is in the given network. The closeness centrality measure assigns a centrality value to each node based on its accessibility to the whole network. In real life applications, we are mainly interested in ranking nodes based on their centrality values. The classical method to compute the rank of a node first computes the closeness centrality of all nodes and then compares them to get its rank. Its time complexity is $O(n \\cdot m + n)$, where $n$ represents total number of nodes, and $m$ represents total number of edges in the network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02083","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-18T00:42:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLr9BPr05E+RtF+Kc5qpbEAp34o1qzWxyFHjjb5QtK1VXGyHCQEOaeAk8tE43YGjhbRyoza15v1TP1Zwh2xfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:20:25.311575Z"},"content_sha256":"d034b5419aee5ce57b5afb1abf78e4c49f13f14a49cda4511e85793594402bb8","schema_version":"1.0","event_id":"sha256:d034b5419aee5ce57b5afb1abf78e4c49f13f14a49cda4511e85793594402bb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/bundle.json","state_url":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/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-07T00:20:25Z","links":{"resolver":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS","bundle":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/bundle.json","state":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HMK34HVRTBIVDEIDPLRYFRXHZS","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":"a2abf49ea8e55e1b94f7bf7324befc1a55858110c02e47727d6271445fe726ed","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-07T08:12:42Z","title_canon_sha256":"3622839e64bef460d0d785a76b1035e6954aace4738706a78ae41dfb1bc1b886"},"schema_version":"1.0","source":{"id":"1706.02083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02083","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02083v1","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02083","created_at":"2026-05-18T00:42:50Z"},{"alias_kind":"pith_short_12","alias_value":"HMK34HVRTBIV","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HMK34HVRTBIVDEID","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HMK34HVR","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:d034b5419aee5ce57b5afb1abf78e4c49f13f14a49cda4511e85793594402bb8","target":"graph","created_at":"2026-05-18T00:42:50Z","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":"Closeness centrality is one way of measuring how central a node is in the given network. The closeness centrality measure assigns a centrality value to each node based on its accessibility to the whole network. In real life applications, we are mainly interested in ranking nodes based on their centrality values. The classical method to compute the rank of a node first computes the closeness centrality of all nodes and then compares them to get its rank. Its time complexity is $O(n \\cdot m + n)$, where $n$ represents total number of nodes, and $m$ represents total number of edges in the network","authors_text":"Akrati Saxena, Ralucca Gera, S. R. S. Iyengar","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-07T08:12:42Z","title":"A Faster Method to Estimate Closeness Centrality Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02083","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:40e1dd68cdf9677c8ab76dc9995efb557de26cd6387d04e84c9ae484868cf2b2","target":"record","created_at":"2026-05-18T00:42:50Z","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":"a2abf49ea8e55e1b94f7bf7324befc1a55858110c02e47727d6271445fe726ed","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-07T08:12:42Z","title_canon_sha256":"3622839e64bef460d0d785a76b1035e6954aace4738706a78ae41dfb1bc1b886"},"schema_version":"1.0","source":{"id":"1706.02083","kind":"arxiv","version":1}},"canonical_sha256":"3b15be1eb198515191037ae382c6e7ccb5293f32d1113ccf570f42e2db388b4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b15be1eb198515191037ae382c6e7ccb5293f32d1113ccf570f42e2db388b4a","first_computed_at":"2026-05-18T00:42:50.135734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:50.135734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZLS0137giAFwDEIZslBgRXJd7mTRYEmdYwK8eletk7gxg/GqDJRmVIhCKDtHNqz/9Mi0JnLbg7FSXQmMltyoAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:50.136540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40e1dd68cdf9677c8ab76dc9995efb557de26cd6387d04e84c9ae484868cf2b2","sha256:d034b5419aee5ce57b5afb1abf78e4c49f13f14a49cda4511e85793594402bb8"],"state_sha256":"91353309802510b16d1915d64e26b0c6a513c48ef904ebd0b60d72a49a5337b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heGdh9SDctU/msv93kfw02vI26vORcWWV1Kq77K2pEdfTfwQj8ALalcgQGoysR/cqZ5Kd2U08RZdN2tHxbRYAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T00:20:25.315356Z","bundle_sha256":"d7e75033af268f61ffda1e7cfa094c1a0f024721f19b5650064ef8f1e9707853"}}