{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NB76SOGX4SI2FD6EAAI7IJ33YK","short_pith_number":"pith:NB76SOGX","schema_version":"1.0","canonical_sha256":"687fe938d7e491a28fc40011f4277bc29014a7c17471e22ed950a5f5e6ecf116","source":{"kind":"arxiv","id":"2105.13055","version":1},"attestation_state":"computed","paper":{"title":"Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Hendrik Molter, Maciej Rymar, Rolf Niedermeier","submitted_at":"2021-05-27T10:50:41Z","abstract_excerpt":"In static graphs, the betweenness centrality of a graph vertex measures how many times this vertex is part of a shortest path between any two graph vertices. Betweenness centrality is efficiently computable and it is a fundamental tool in network science. Continuing and extending previous work, we study the efficient computability of betweenness centrality in temporal graphs (graphs with fixed vertex set but time-varying arc sets). Unlike in the static case, there are numerous natural notions of being a \"shortest\" temporal path (walk). Depending on which notion is used, it was already observed"},"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":"2105.13055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-27T10:50:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"430e710053e4a4bc388401b977674978fab8e0d7e247136974eaaea85948b6b8","abstract_canon_sha256":"123f283d1da4ee9f8657c6df44ecee9f149b8d790bd4f46d69cbfbd0a0990502"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:43:57.001020Z","signature_b64":"zKOK6VGXeJ8QSJUWazd/mcrKq7mU0JE4Xh1tCZum5aJrU99HsK/BoU6xTi+hLFKfg875SYonmY58kywXAEbqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"687fe938d7e491a28fc40011f4277bc29014a7c17471e22ed950a5f5e6ecf116","last_reissued_at":"2026-07-05T02:43:57.000643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:43:57.000643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Hendrik Molter, Maciej Rymar, Rolf Niedermeier","submitted_at":"2021-05-27T10:50:41Z","abstract_excerpt":"In static graphs, the betweenness centrality of a graph vertex measures how many times this vertex is part of a shortest path between any two graph vertices. Betweenness centrality is efficiently computable and it is a fundamental tool in network science. Continuing and extending previous work, we study the efficient computability of betweenness centrality in temporal graphs (graphs with fixed vertex set but time-varying arc sets). Unlike in the static case, there are numerous natural notions of being a \"shortest\" temporal path (walk). Depending on which notion is used, it was already observed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.13055","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.13055/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.13055","created_at":"2026-07-05T02:43:57.000705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.13055v1","created_at":"2026-07-05T02:43:57.000705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13055","created_at":"2026-07-05T02:43:57.000705+00:00"},{"alias_kind":"pith_short_12","alias_value":"NB76SOGX4SI2","created_at":"2026-07-05T02:43:57.000705+00:00"},{"alias_kind":"pith_short_16","alias_value":"NB76SOGX4SI2FD6E","created_at":"2026-07-05T02:43:57.000705+00:00"},{"alias_kind":"pith_short_8","alias_value":"NB76SOGX","created_at":"2026-07-05T02:43:57.000705+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/NB76SOGX4SI2FD6EAAI7IJ33YK","json":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK.json","graph_json":"https://pith.science/api/pith-number/NB76SOGX4SI2FD6EAAI7IJ33YK/graph.json","events_json":"https://pith.science/api/pith-number/NB76SOGX4SI2FD6EAAI7IJ33YK/events.json","paper":"https://pith.science/paper/NB76SOGX"},"agent_actions":{"view_html":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK","download_json":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK.json","view_paper":"https://pith.science/paper/NB76SOGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.13055&json=true","fetch_graph":"https://pith.science/api/pith-number/NB76SOGX4SI2FD6EAAI7IJ33YK/graph.json","fetch_events":"https://pith.science/api/pith-number/NB76SOGX4SI2FD6EAAI7IJ33YK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/action/storage_attestation","attest_author":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/action/author_attestation","sign_citation":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/action/citation_signature","submit_replication":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/action/replication_record"}},"created_at":"2026-07-05T02:43:57.000705+00:00","updated_at":"2026-07-05T02:43:57.000705+00:00"}