{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X5NNGAHI2JKFHX4PO4MT7KZZDG","short_pith_number":"pith:X5NNGAHI","schema_version":"1.0","canonical_sha256":"bf5ad300e8d25453df8f77193fab3919bbdbb490957edaeb1764a9b0337314bf","source":{"kind":"arxiv","id":"1911.13144","version":4},"attestation_state":"computed","paper":{"title":"Shortest Path Centrality and the APSP problem via VC-dimension and Rademacher Averages","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-11-29T15:12:27Z","abstract_excerpt":"In this paper we are interested in a version of the All-pairs Shortest Paths problem (APSP) that fits neither in the exact nor in the approximate case. We define a measure of centrality of a shortest path, related to the ``importance'' of such shortest path in the graph, and propose an algorithm based on the idea of progressive sampling that, for {\\it any fixed constants} $0 < \\epsilon$, $ \\delta < 1$, given an undirected graph $G$ with non-negative edge weights, outputs with probability $1 - \\delta$ a data structure of size $n \\cdot \\textrm{Diam}_V(G)$, where $\\textrm{Diam}_V(G)$ is the verte"},"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":"1911.13144","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-29T15:12:27Z","cross_cats_sorted":[],"title_canon_sha256":"e57e84a526d7f030df9213bedb2eac550de9564a27e0abf1b9f9dcfef488ee3a","abstract_canon_sha256":"4299866ff23f6c3d9094ddfc3e6bbe7a173da082ab0005c12095ae8f3f4050df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:00:14.805082Z","signature_b64":"fRYCLfPq6zZNQLNJ5RDB7jZclsdm4jJpfivrxorr6BYepJpG+F/TMoyGaNlPh17yBGzCtLrv0B6rDO9qLpkMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf5ad300e8d25453df8f77193fab3919bbdbb490957edaeb1764a9b0337314bf","last_reissued_at":"2026-07-05T01:00:14.804665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:00:14.804665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest Path Centrality and the APSP problem via VC-dimension and Rademacher Averages","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-11-29T15:12:27Z","abstract_excerpt":"In this paper we are interested in a version of the All-pairs Shortest Paths problem (APSP) that fits neither in the exact nor in the approximate case. We define a measure of centrality of a shortest path, related to the ``importance'' of such shortest path in the graph, and propose an algorithm based on the idea of progressive sampling that, for {\\it any fixed constants} $0 < \\epsilon$, $ \\delta < 1$, given an undirected graph $G$ with non-negative edge weights, outputs with probability $1 - \\delta$ a data structure of size $n \\cdot \\textrm{Diam}_V(G)$, where $\\textrm{Diam}_V(G)$ is the verte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.13144","kind":"arxiv","version":4},"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/1911.13144/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":"1911.13144","created_at":"2026-07-05T01:00:14.804728+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.13144v4","created_at":"2026-07-05T01:00:14.804728+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.13144","created_at":"2026-07-05T01:00:14.804728+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5NNGAHI2JKF","created_at":"2026-07-05T01:00:14.804728+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5NNGAHI2JKFHX4P","created_at":"2026-07-05T01:00:14.804728+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5NNGAHI","created_at":"2026-07-05T01:00:14.804728+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/X5NNGAHI2JKFHX4PO4MT7KZZDG","json":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG.json","graph_json":"https://pith.science/api/pith-number/X5NNGAHI2JKFHX4PO4MT7KZZDG/graph.json","events_json":"https://pith.science/api/pith-number/X5NNGAHI2JKFHX4PO4MT7KZZDG/events.json","paper":"https://pith.science/paper/X5NNGAHI"},"agent_actions":{"view_html":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG","download_json":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG.json","view_paper":"https://pith.science/paper/X5NNGAHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.13144&json=true","fetch_graph":"https://pith.science/api/pith-number/X5NNGAHI2JKFHX4PO4MT7KZZDG/graph.json","fetch_events":"https://pith.science/api/pith-number/X5NNGAHI2JKFHX4PO4MT7KZZDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/action/storage_attestation","attest_author":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/action/author_attestation","sign_citation":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/action/citation_signature","submit_replication":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/action/replication_record"}},"created_at":"2026-07-05T01:00:14.804728+00:00","updated_at":"2026-07-05T01:00:14.804728+00:00"}