{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:INIII3SS3BBGAB77TXGGZQVRQS","short_pith_number":"pith:INIII3SS","schema_version":"1.0","canonical_sha256":"4350846e52d8426007ff9dcc6cc2b1848360ac01ba8cae0c5a8e2b29da4160df","source":{"kind":"arxiv","id":"2203.00653","version":1},"attestation_state":"computed","paper":{"title":"ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in Temporal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.SI","authors_text":"Diego Santoro, Ilie Sarpe","submitted_at":"2022-03-01T17:54:10Z","abstract_excerpt":"In network analysis, the betweenness centrality of a node informally captures the fraction of shortest paths visiting that node. The computation of the betweenness centrality measure is a fundamental task in the analysis of modern networks, enabling the identification of the most central nodes in such networks. Additionally to being massive, modern networks also contain information about the time at which their events occur. Such networks are often called temporal networks. The temporal information makes the study of the betweenness centrality in temporal networks (i.e., temporal betweenness c"},"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":"2203.00653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2022-03-01T17:54:10Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"c9623d8e722693f0912de71dea454df493cc44330c108d77efcf6d8b33e7cf20","abstract_canon_sha256":"e71dd39cc6ade7af1c065f09eb0c13d51bc0244ba593293be37803b83068d58a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:01:19.613350Z","signature_b64":"2uJERmNvIULx5FdkliBZYG4u4vd3H2gV4LFRwU8f+9qOA0qHGgRaNb93fccj8tS+RYJJ5guJVXJDST/ZgUusDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4350846e52d8426007ff9dcc6cc2b1848360ac01ba8cae0c5a8e2b29da4160df","last_reissued_at":"2026-07-05T04:01:19.612953Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:01:19.612953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in Temporal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.SI","authors_text":"Diego Santoro, Ilie Sarpe","submitted_at":"2022-03-01T17:54:10Z","abstract_excerpt":"In network analysis, the betweenness centrality of a node informally captures the fraction of shortest paths visiting that node. The computation of the betweenness centrality measure is a fundamental task in the analysis of modern networks, enabling the identification of the most central nodes in such networks. Additionally to being massive, modern networks also contain information about the time at which their events occur. Such networks are often called temporal networks. The temporal information makes the study of the betweenness centrality in temporal networks (i.e., temporal betweenness c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00653","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/2203.00653/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":"2203.00653","created_at":"2026-07-05T04:01:19.613014+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.00653v1","created_at":"2026-07-05T04:01:19.613014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00653","created_at":"2026-07-05T04:01:19.613014+00:00"},{"alias_kind":"pith_short_12","alias_value":"INIII3SS3BBG","created_at":"2026-07-05T04:01:19.613014+00:00"},{"alias_kind":"pith_short_16","alias_value":"INIII3SS3BBGAB77","created_at":"2026-07-05T04:01:19.613014+00:00"},{"alias_kind":"pith_short_8","alias_value":"INIII3SS","created_at":"2026-07-05T04:01:19.613014+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/INIII3SS3BBGAB77TXGGZQVRQS","json":"https://pith.science/pith/INIII3SS3BBGAB77TXGGZQVRQS.json","graph_json":"https://pith.science/api/pith-number/INIII3SS3BBGAB77TXGGZQVRQS/graph.json","events_json":"https://pith.science/api/pith-number/INIII3SS3BBGAB77TXGGZQVRQS/events.json","paper":"https://pith.science/paper/INIII3SS"},"agent_actions":{"view_html":"https://pith.science/pith/INIII3SS3BBGAB77TXGGZQVRQS","download_json":"https://pith.science/pith/INIII3SS3BBGAB77TXGGZQVRQS.json","view_paper":"https://pith.science/paper/INIII3SS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.00653&json=true","fetch_graph":"https://pith.science/api/pith-number/INIII3SS3BBGAB77TXGGZQVRQS/graph.json","fetch_events":"https://pith.science/api/pith-number/INIII3SS3BBGAB77TXGGZQVRQS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INIII3SS3BBGAB77TXGGZQVRQS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INIII3SS3BBGAB77TXGGZQVRQS/action/storage_attestation","attest_author":"https://pith.science/pith/INIII3SS3BBGAB77TXGGZQVRQS/action/author_attestation","sign_citation":"https://pith.science/pith/INIII3SS3BBGAB77TXGGZQVRQS/action/citation_signature","submit_replication":"https://pith.science/pith/INIII3SS3BBGAB77TXGGZQVRQS/action/replication_record"}},"created_at":"2026-07-05T04:01:19.613014+00:00","updated_at":"2026-07-05T04:01:19.613014+00:00"}