{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HMK34HVRTBIVDEIDPLRYFRXHZS","short_pith_number":"pith:HMK34HVR","schema_version":"1.0","canonical_sha256":"3b15be1eb198515191037ae382c6e7ccb5293f32d1113ccf570f42e2db388b4a","source":{"kind":"arxiv","id":"1706.02083","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.02083","created_at":"2026-05-18T00:42:50.135873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02083v1","created_at":"2026-05-18T00:42:50.135873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02083","created_at":"2026-05-18T00:42:50.135873+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMK34HVRTBIV","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMK34HVRTBIVDEID","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMK34HVR","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS","json":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS.json","graph_json":"https://pith.science/api/pith-number/HMK34HVRTBIVDEIDPLRYFRXHZS/graph.json","events_json":"https://pith.science/api/pith-number/HMK34HVRTBIVDEIDPLRYFRXHZS/events.json","paper":"https://pith.science/paper/HMK34HVR"},"agent_actions":{"view_html":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS","download_json":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS.json","view_paper":"https://pith.science/paper/HMK34HVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02083&json=true","fetch_graph":"https://pith.science/api/pith-number/HMK34HVRTBIVDEIDPLRYFRXHZS/graph.json","fetch_events":"https://pith.science/api/pith-number/HMK34HVRTBIVDEIDPLRYFRXHZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/action/storage_attestation","attest_author":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/action/author_attestation","sign_citation":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/action/citation_signature","submit_replication":"https://pith.science/pith/HMK34HVRTBIVDEIDPLRYFRXHZS/action/replication_record"}},"created_at":"2026-05-18T00:42:50.135873+00:00","updated_at":"2026-05-18T00:42:50.135873+00:00"}