{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NB76SOGX4SI2FD6EAAI7IJ33YK","short_pith_number":"pith:NB76SOGX","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"},"canonical_sha256":"687fe938d7e491a28fc40011f4277bc29014a7c17471e22ed950a5f5e6ecf116","source":{"kind":"arxiv","id":"2105.13055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.13055","created_at":"2026-07-05T02:43:57Z"},{"alias_kind":"arxiv_version","alias_value":"2105.13055v1","created_at":"2026-07-05T02:43:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13055","created_at":"2026-07-05T02:43:57Z"},{"alias_kind":"pith_short_12","alias_value":"NB76SOGX4SI2","created_at":"2026-07-05T02:43:57Z"},{"alias_kind":"pith_short_16","alias_value":"NB76SOGX4SI2FD6E","created_at":"2026-07-05T02:43:57Z"},{"alias_kind":"pith_short_8","alias_value":"NB76SOGX","created_at":"2026-07-05T02:43:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NB76SOGX4SI2FD6EAAI7IJ33YK","target":"record","payload":{"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"},"canonical_sha256":"687fe938d7e491a28fc40011f4277bc29014a7c17471e22ed950a5f5e6ecf116","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"},"source_kind":"arxiv","source_id":"2105.13055","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-07-05T02:43:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bV7GPvj2at1dxvwe7V+585L9rj1LEMvHY3vtuJ3q5fXSAxb8if9SbvMR0Rg+X1vlR/VxkPc/oObaKifRke68DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:57:04.265623Z"},"content_sha256":"2cc3972fdd0d57d19f6b7340ec0accf0861e84ef660702fea56c9dda5cb3c7af","schema_version":"1.0","event_id":"sha256:2cc3972fdd0d57d19f6b7340ec0accf0861e84ef660702fea56c9dda5cb3c7af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NB76SOGX4SI2FD6EAAI7IJ33YK","target":"graph","payload":{"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"},"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-07-05T02:43:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EdTw7/20B/OfKUPG1gXRWIJYyMk6zF0OecwGHaMheYFeeCfZdWJ+GnCHmvXde45s0IIluV9SQbNoAJKOUukBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:57:04.266013Z"},"content_sha256":"693d41aa99bec2bbb142c4859ef60a340a75661e64a59da0a6859a48cbba1eee","schema_version":"1.0","event_id":"sha256:693d41aa99bec2bbb142c4859ef60a340a75661e64a59da0a6859a48cbba1eee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/bundle.json","state_url":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/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-07T07:57:04Z","links":{"resolver":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK","bundle":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/bundle.json","state":"https://pith.science/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NB76SOGX4SI2FD6EAAI7IJ33YK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NB76SOGX4SI2FD6EAAI7IJ33YK","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":"123f283d1da4ee9f8657c6df44ecee9f149b8d790bd4f46d69cbfbd0a0990502","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-27T10:50:41Z","title_canon_sha256":"430e710053e4a4bc388401b977674978fab8e0d7e247136974eaaea85948b6b8"},"schema_version":"1.0","source":{"id":"2105.13055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.13055","created_at":"2026-07-05T02:43:57Z"},{"alias_kind":"arxiv_version","alias_value":"2105.13055v1","created_at":"2026-07-05T02:43:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13055","created_at":"2026-07-05T02:43:57Z"},{"alias_kind":"pith_short_12","alias_value":"NB76SOGX4SI2","created_at":"2026-07-05T02:43:57Z"},{"alias_kind":"pith_short_16","alias_value":"NB76SOGX4SI2FD6E","created_at":"2026-07-05T02:43:57Z"},{"alias_kind":"pith_short_8","alias_value":"NB76SOGX","created_at":"2026-07-05T02:43:57Z"}],"graph_snapshots":[{"event_id":"sha256:693d41aa99bec2bbb142c4859ef60a340a75661e64a59da0a6859a48cbba1eee","target":"graph","created_at":"2026-07-05T02:43:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.13055/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andr\\'e Nichterlein, Hendrik Molter, Maciej Rymar, Rolf Niedermeier","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-27T10:50:41Z","title":"Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.13055","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:2cc3972fdd0d57d19f6b7340ec0accf0861e84ef660702fea56c9dda5cb3c7af","target":"record","created_at":"2026-07-05T02:43:57Z","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":"123f283d1da4ee9f8657c6df44ecee9f149b8d790bd4f46d69cbfbd0a0990502","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-27T10:50:41Z","title_canon_sha256":"430e710053e4a4bc388401b977674978fab8e0d7e247136974eaaea85948b6b8"},"schema_version":"1.0","source":{"id":"2105.13055","kind":"arxiv","version":1}},"canonical_sha256":"687fe938d7e491a28fc40011f4277bc29014a7c17471e22ed950a5f5e6ecf116","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"687fe938d7e491a28fc40011f4277bc29014a7c17471e22ed950a5f5e6ecf116","first_computed_at":"2026-07-05T02:43:57.000643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:43:57.000643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zKOK6VGXeJ8QSJUWazd/mcrKq7mU0JE4Xh1tCZum5aJrU99HsK/BoU6xTi+hLFKfg875SYonmY58kywXAEbqDA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:43:57.001020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.13055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cc3972fdd0d57d19f6b7340ec0accf0861e84ef660702fea56c9dda5cb3c7af","sha256:693d41aa99bec2bbb142c4859ef60a340a75661e64a59da0a6859a48cbba1eee"],"state_sha256":"1374131268eabc00eacd7d45cc0fc6b9b381fb43929e3394508676fd8f20a6a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzmrWz7tCZ/yOuUw7sn4K7i235tZ3QDybvXegve0k5/Vn3tfz5VgpGkk0YJzIMUPnQOTmhnKs6szgzScsIYsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:57:04.268169Z","bundle_sha256":"c2afd4dcade1433e271936476f72940c0a2d71715a68a76b7f742979a864a50b"}}