{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X5NNGAHI2JKFHX4PO4MT7KZZDG","short_pith_number":"pith:X5NNGAHI","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"},"canonical_sha256":"bf5ad300e8d25453df8f77193fab3919bbdbb490957edaeb1764a9b0337314bf","source":{"kind":"arxiv","id":"1911.13144","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.13144","created_at":"2026-07-05T01:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1911.13144v4","created_at":"2026-07-05T01:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.13144","created_at":"2026-07-05T01:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"X5NNGAHI2JKF","created_at":"2026-07-05T01:00:14Z"},{"alias_kind":"pith_short_16","alias_value":"X5NNGAHI2JKFHX4P","created_at":"2026-07-05T01:00:14Z"},{"alias_kind":"pith_short_8","alias_value":"X5NNGAHI","created_at":"2026-07-05T01:00:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X5NNGAHI2JKFHX4PO4MT7KZZDG","target":"record","payload":{"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"},"canonical_sha256":"bf5ad300e8d25453df8f77193fab3919bbdbb490957edaeb1764a9b0337314bf","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"},"source_kind":"arxiv","source_id":"1911.13144","source_version":4,"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-05T01:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3+Qy1KiE8Wsnw/JLLPRpVc0Cr+rKBdDCaBIRxWwYoEor6n4VcVyhUPtmXJJ6Ikuas+41hPNo7Hk7n4mzYAcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:28:45.572191Z"},"content_sha256":"691c0611a8883c31763d68af227c20fa17d9fd3a2d71661660637e36e9ed72d2","schema_version":"1.0","event_id":"sha256:691c0611a8883c31763d68af227c20fa17d9fd3a2d71661660637e36e9ed72d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X5NNGAHI2JKFHX4PO4MT7KZZDG","target":"graph","payload":{"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"},"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-05T01:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KxHcTlBDRVv8IQbT3i4YHYTu5MexwGgVGfMmKl7++RbNHoYC7vy3cXgAtuafHbqZ7XtjBiPQxl27j8Rgvo0RAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:28:45.572589Z"},"content_sha256":"6a9e30827622750372da6d11036eec98960b2c997d248645e47ef4dee0f3bf85","schema_version":"1.0","event_id":"sha256:6a9e30827622750372da6d11036eec98960b2c997d248645e47ef4dee0f3bf85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/bundle.json","state_url":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/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-05T09:28:45Z","links":{"resolver":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG","bundle":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/bundle.json","state":"https://pith.science/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5NNGAHI2JKFHX4PO4MT7KZZDG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X5NNGAHI2JKFHX4PO4MT7KZZDG","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":"4299866ff23f6c3d9094ddfc3e6bbe7a173da082ab0005c12095ae8f3f4050df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-29T15:12:27Z","title_canon_sha256":"e57e84a526d7f030df9213bedb2eac550de9564a27e0abf1b9f9dcfef488ee3a"},"schema_version":"1.0","source":{"id":"1911.13144","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.13144","created_at":"2026-07-05T01:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1911.13144v4","created_at":"2026-07-05T01:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.13144","created_at":"2026-07-05T01:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"X5NNGAHI2JKF","created_at":"2026-07-05T01:00:14Z"},{"alias_kind":"pith_short_16","alias_value":"X5NNGAHI2JKFHX4P","created_at":"2026-07-05T01:00:14Z"},{"alias_kind":"pith_short_8","alias_value":"X5NNGAHI","created_at":"2026-07-05T01:00:14Z"}],"graph_snapshots":[{"event_id":"sha256:6a9e30827622750372da6d11036eec98960b2c997d248645e47ef4dee0f3bf85","target":"graph","created_at":"2026-07-05T01:00:14Z","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/1911.13144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alane M. de Lima, Andr\\'e L. Vignatti, Murilo V. G. da Silva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-29T15:12:27Z","title":"Shortest Path Centrality and the APSP problem via VC-dimension and Rademacher Averages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.13144","kind":"arxiv","version":4},"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:691c0611a8883c31763d68af227c20fa17d9fd3a2d71661660637e36e9ed72d2","target":"record","created_at":"2026-07-05T01:00:14Z","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":"4299866ff23f6c3d9094ddfc3e6bbe7a173da082ab0005c12095ae8f3f4050df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-29T15:12:27Z","title_canon_sha256":"e57e84a526d7f030df9213bedb2eac550de9564a27e0abf1b9f9dcfef488ee3a"},"schema_version":"1.0","source":{"id":"1911.13144","kind":"arxiv","version":4}},"canonical_sha256":"bf5ad300e8d25453df8f77193fab3919bbdbb490957edaeb1764a9b0337314bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf5ad300e8d25453df8f77193fab3919bbdbb490957edaeb1764a9b0337314bf","first_computed_at":"2026-07-05T01:00:14.804665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:00:14.804665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fRYCLfPq6zZNQLNJ5RDB7jZclsdm4jJpfivrxorr6BYepJpG+F/TMoyGaNlPh17yBGzCtLrv0B6rDO9qLpkMDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:00:14.805082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.13144","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:691c0611a8883c31763d68af227c20fa17d9fd3a2d71661660637e36e9ed72d2","sha256:6a9e30827622750372da6d11036eec98960b2c997d248645e47ef4dee0f3bf85"],"state_sha256":"f9fd110c883e9562899a648bea5d45267385defeb8c9c315a265819c460adcab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ooLK+/Graa2pkRGAJ30pWSTq6aWKc5LJ6UV6V333tV9CJ3IASXBTvSrNpKnJfpI9/Uewpg+q6Up1N/npHiJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:28:45.574620Z","bundle_sha256":"eafcd4454cf94ac293039c3bc734b48f6b769de18cc6601dd46f8518209b7123"}}