{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PACWIXME7EO6H5R5ATVBUZELBY","short_pith_number":"pith:PACWIXME","schema_version":"1.0","canonical_sha256":"7805645d84f91de3f63d04ea1a648b0e027c89627557b179a634498e83fd97d1","source":{"kind":"arxiv","id":"1607.02334","version":1},"attestation_state":"computed","paper":{"title":"Betweenness centrality profiles in trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Benjamin Fish, Gyorgy Turan, Rahul Kushwaha","submitted_at":"2016-07-08T12:18:03Z","abstract_excerpt":"Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in a network. The k-betweenness centrality of a vertex is defined similarly, but only considers shortest paths of length at most k. The sequence of k-betweenness centralities for all possible values of k forms the betweenness centrality profile of a vertex. We study properties of betweenness centrality profiles in trees.\n  We show that for scale-free random trees, for fixed k, the expectation of k-betweenness centralit"},"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":"1607.02334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-08T12:18:03Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"e3cd7cb21fbba18ba60fdd5b5eb468d92491cab62a9b9020e41d063d8a3547c5","abstract_canon_sha256":"6bfbf87822735c748ce6c2165045d484e3816fe846d8339f79555ef937be3ee0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:20.654795Z","signature_b64":"oYGWYRv5pKu1wL/tJp4Fl3tDp9m11YWGdswp5kZmzv8s2p7VNUfWR1A/9AP9icry5rLdyFe6pUhzn6jgYs0SDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7805645d84f91de3f63d04ea1a648b0e027c89627557b179a634498e83fd97d1","last_reissued_at":"2026-05-18T01:11:20.654207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:20.654207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Betweenness centrality profiles in trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Benjamin Fish, Gyorgy Turan, Rahul Kushwaha","submitted_at":"2016-07-08T12:18:03Z","abstract_excerpt":"Betweenness centrality of a vertex in a graph measures the fraction of shortest paths going through the vertex. This is a basic notion for determining the importance of a vertex in a network. The k-betweenness centrality of a vertex is defined similarly, but only considers shortest paths of length at most k. The sequence of k-betweenness centralities for all possible values of k forms the betweenness centrality profile of a vertex. We study properties of betweenness centrality profiles in trees.\n  We show that for scale-free random trees, for fixed k, the expectation of k-betweenness centralit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02334","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":"1607.02334","created_at":"2026-05-18T01:11:20.654293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02334v1","created_at":"2026-05-18T01:11:20.654293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02334","created_at":"2026-05-18T01:11:20.654293+00:00"},{"alias_kind":"pith_short_12","alias_value":"PACWIXME7EO6","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PACWIXME7EO6H5R5","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PACWIXME","created_at":"2026-05-18T12:30:39.010887+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/PACWIXME7EO6H5R5ATVBUZELBY","json":"https://pith.science/pith/PACWIXME7EO6H5R5ATVBUZELBY.json","graph_json":"https://pith.science/api/pith-number/PACWIXME7EO6H5R5ATVBUZELBY/graph.json","events_json":"https://pith.science/api/pith-number/PACWIXME7EO6H5R5ATVBUZELBY/events.json","paper":"https://pith.science/paper/PACWIXME"},"agent_actions":{"view_html":"https://pith.science/pith/PACWIXME7EO6H5R5ATVBUZELBY","download_json":"https://pith.science/pith/PACWIXME7EO6H5R5ATVBUZELBY.json","view_paper":"https://pith.science/paper/PACWIXME","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02334&json=true","fetch_graph":"https://pith.science/api/pith-number/PACWIXME7EO6H5R5ATVBUZELBY/graph.json","fetch_events":"https://pith.science/api/pith-number/PACWIXME7EO6H5R5ATVBUZELBY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PACWIXME7EO6H5R5ATVBUZELBY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PACWIXME7EO6H5R5ATVBUZELBY/action/storage_attestation","attest_author":"https://pith.science/pith/PACWIXME7EO6H5R5ATVBUZELBY/action/author_attestation","sign_citation":"https://pith.science/pith/PACWIXME7EO6H5R5ATVBUZELBY/action/citation_signature","submit_replication":"https://pith.science/pith/PACWIXME7EO6H5R5ATVBUZELBY/action/replication_record"}},"created_at":"2026-05-18T01:11:20.654293+00:00","updated_at":"2026-05-18T01:11:20.654293+00:00"}