{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FTOQ7R2CBMBLLBQU3WJRAXOVG7","short_pith_number":"pith:FTOQ7R2C","schema_version":"1.0","canonical_sha256":"2cdd0fc7420b02b58614dd93105dd537c01b58c827bc0d3df0d56fa087831b3f","source":{"kind":"arxiv","id":"1910.00494","version":3},"attestation_state":"computed","paper":{"title":"Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alane M. de Lima, Andr\\'e L. Vignatti, Murilo V. G. da Silva","submitted_at":"2019-10-01T15:50:51Z","abstract_excerpt":"In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance of each vertex in a graph going through a contagious process. It is an open problem whether the percolation centrality can be computed in $\\mathcal{O}(n^{3-c})$ time, for any constant $c>0$. In this paper we present a $\\mathcal{O}(m \\log^2 n)$ randomized approximation algorithm for the percolation centrality for every vertex of $G$, generalizing techniques developed by Riondato, Upfal e Kornaropoulos (this complexity is reduced to $\\math"},"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":"1910.00494","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-10-01T15:50:51Z","cross_cats_sorted":[],"title_canon_sha256":"c31bf0c6d68d7141239a12a7ab3ef141d984accf4be7cbe1f6d83af1439689a4","abstract_canon_sha256":"592179b22f93527943ff1352647bb23a0a42a18432a091cb76e6bf4731589d4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:40:58.965367Z","signature_b64":"JcaiWLq2QM2EPmikJkaRYZt1akYF9griGjs/TpovM83WdFK1XjInVF+ljPfogzaVkKiIqAzihwP18RSzZ95SDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cdd0fc7420b02b58614dd93105dd537c01b58c827bc0d3df0d56fa087831b3f","last_reissued_at":"2026-07-05T00:40:58.964936Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:40:58.964936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alane M. de Lima, Andr\\'e L. Vignatti, Murilo V. G. da Silva","submitted_at":"2019-10-01T15:50:51Z","abstract_excerpt":"In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance of each vertex in a graph going through a contagious process. It is an open problem whether the percolation centrality can be computed in $\\mathcal{O}(n^{3-c})$ time, for any constant $c>0$. In this paper we present a $\\mathcal{O}(m \\log^2 n)$ randomized approximation algorithm for the percolation centrality for every vertex of $G$, generalizing techniques developed by Riondato, Upfal e Kornaropoulos (this complexity is reduced to $\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00494","kind":"arxiv","version":3},"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/1910.00494/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":"1910.00494","created_at":"2026-07-05T00:40:58.964995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.00494v3","created_at":"2026-07-05T00:40:58.964995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00494","created_at":"2026-07-05T00:40:58.964995+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTOQ7R2CBMBL","created_at":"2026-07-05T00:40:58.964995+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTOQ7R2CBMBLLBQU","created_at":"2026-07-05T00:40:58.964995+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTOQ7R2C","created_at":"2026-07-05T00:40:58.964995+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/FTOQ7R2CBMBLLBQU3WJRAXOVG7","json":"https://pith.science/pith/FTOQ7R2CBMBLLBQU3WJRAXOVG7.json","graph_json":"https://pith.science/api/pith-number/FTOQ7R2CBMBLLBQU3WJRAXOVG7/graph.json","events_json":"https://pith.science/api/pith-number/FTOQ7R2CBMBLLBQU3WJRAXOVG7/events.json","paper":"https://pith.science/paper/FTOQ7R2C"},"agent_actions":{"view_html":"https://pith.science/pith/FTOQ7R2CBMBLLBQU3WJRAXOVG7","download_json":"https://pith.science/pith/FTOQ7R2CBMBLLBQU3WJRAXOVG7.json","view_paper":"https://pith.science/paper/FTOQ7R2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.00494&json=true","fetch_graph":"https://pith.science/api/pith-number/FTOQ7R2CBMBLLBQU3WJRAXOVG7/graph.json","fetch_events":"https://pith.science/api/pith-number/FTOQ7R2CBMBLLBQU3WJRAXOVG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTOQ7R2CBMBLLBQU3WJRAXOVG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTOQ7R2CBMBLLBQU3WJRAXOVG7/action/storage_attestation","attest_author":"https://pith.science/pith/FTOQ7R2CBMBLLBQU3WJRAXOVG7/action/author_attestation","sign_citation":"https://pith.science/pith/FTOQ7R2CBMBLLBQU3WJRAXOVG7/action/citation_signature","submit_replication":"https://pith.science/pith/FTOQ7R2CBMBLLBQU3WJRAXOVG7/action/replication_record"}},"created_at":"2026-07-05T00:40:58.964995+00:00","updated_at":"2026-07-05T00:40:58.964995+00:00"}