{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:A2K5I7VHCY4QDWGU2HVFPUD5VR","short_pith_number":"pith:A2K5I7VH","canonical_record":{"source":{"id":"2604.12211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-04-14T02:40:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d1330164dad2863671d971b72d491d5d3f212c49b2b799a78f324d091072fd65","abstract_canon_sha256":"a84065899f9fd84267edcdf57756cfa292629e8933da1644499f8753025d79af"},"schema_version":"1.0"},"canonical_sha256":"0695d47ea7163901d8d4d1ea57d07dac45ec275549c0cfa331a6d67e8c9e7792","source":{"kind":"arxiv","id":"2604.12211","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.12211","created_at":"2026-06-30T01:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"2604.12211v2","created_at":"2026-06-30T01:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.12211","created_at":"2026-06-30T01:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"A2K5I7VHCY4Q","created_at":"2026-06-30T01:18:18Z"},{"alias_kind":"pith_short_16","alias_value":"A2K5I7VHCY4QDWGU","created_at":"2026-06-30T01:18:18Z"},{"alias_kind":"pith_short_8","alias_value":"A2K5I7VH","created_at":"2026-06-30T01:18:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:A2K5I7VHCY4QDWGU2HVFPUD5VR","target":"record","payload":{"canonical_record":{"source":{"id":"2604.12211","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-04-14T02:40:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d1330164dad2863671d971b72d491d5d3f212c49b2b799a78f324d091072fd65","abstract_canon_sha256":"a84065899f9fd84267edcdf57756cfa292629e8933da1644499f8753025d79af"},"schema_version":"1.0"},"canonical_sha256":"0695d47ea7163901d8d4d1ea57d07dac45ec275549c0cfa331a6d67e8c9e7792","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:18:18.495088Z","signature_b64":"RVd1bznjZjKsxD23aITUyKHrzpDsRHGkiaX/baR6qJpJ8+BGl6yTpWV91/jlu3KdNvJj/FkWF4E7n0dV5LHXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0695d47ea7163901d8d4d1ea57d07dac45ec275549c0cfa331a6d67e8c9e7792","last_reissued_at":"2026-06-30T01:18:18.494092Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:18:18.494092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.12211","source_version":2,"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-06-30T01:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+askACSC3X3WpuhC0D1Fi/Xy+XVv3Gx22vJDJ6s646ge58NFu6Htk9U5AyFlgaEaCewOsG4cvcYsbb2JISMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:44:37.097601Z"},"content_sha256":"d596c7808fe6a57b06d77d84bff11070df75c2e1a09a37b6038d58265d27413d","schema_version":"1.0","event_id":"sha256:d596c7808fe6a57b06d77d84bff11070df75c2e1a09a37b6038d58265d27413d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:A2K5I7VHCY4QDWGU2HVFPUD5VR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Residual-Shell-Based Lower Bound for Ollivier-Ricci Curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A residual-shell lower bound tightens estimates of Ollivier-Ricci curvature while remaining fast to compute.","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Huichun Zhang, Jian Sun, Xiang Gu","submitted_at":"2026-04-14T02:40:15Z","abstract_excerpt":"Ollivier-Ricci curvature (ORC), defined via the Wasserstein distance that captures rich geometric information, has received growing attention in both theory and applications. However, the high computational cost of Wasserstein distance evaluation has significantly limited the broader practical use of ORC. To alleviate this issue, previous work introduced a computationally efficient lower bound as a proxy for ORC based on 1-hop random walks, but this approach empirically exhibits large gaps from the exact ORC. In this paper, we establish a substantially tighter lower bound for ORC than the exis"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We establish a substantially tighter lower bound for ORC than the existing lower bound, while retaining much lower computational cost than exact ORC computation, with practical speedups of tens of times. Moreover, our bound is not restricted to 1-hop random walks, but also applies to k-hop random walks (k > 1).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The residual-shell correction term is assumed to preserve the lower-bound property for the Wasserstein distance without introducing additional looseness that would negate the claimed tightness gain; this is asserted but not derived in the abstract.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A residual-shell construction yields a tighter, computationally cheap lower bound for Ollivier-Ricci curvature that works for both 1-hop and k-hop random walks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A residual-shell lower bound tightens estimates of Ollivier-Ricci curvature while remaining fast to compute.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2c8521bfd793622c630c95184f1e3e2ce9afb96eebc197072f46fe5befdde432"},"source":{"id":"2604.12211","kind":"arxiv","version":2},"verdict":{"id":"91826a1b-de6c-452c-93d1-e09776bc7302","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T15:41:17.069923Z","strongest_claim":"We establish a substantially tighter lower bound for ORC than the existing lower bound, while retaining much lower computational cost than exact ORC computation, with practical speedups of tens of times. Moreover, our bound is not restricted to 1-hop random walks, but also applies to k-hop random walks (k > 1).","one_line_summary":"A residual-shell construction yields a tighter, computationally cheap lower bound for Ollivier-Ricci curvature that works for both 1-hop and k-hop random walks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The residual-shell correction term is assumed to preserve the lower-bound property for the Wasserstein distance without introducing additional looseness that would negate the claimed tightness gain; this is asserted but not derived in the abstract.","pith_extraction_headline":"A residual-shell lower bound tightens estimates of Ollivier-Ricci curvature while remaining fast to compute."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.12211/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":"91826a1b-de6c-452c-93d1-e09776bc7302"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-30T01:18:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gE8rIz1El8uRSYH7e3xKFVf9kqea7/jWDmFtClP7/k+dTGqqCSpVCu3slEitGKipGO7ZzoYogYd0N9PBkCfZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T19:44:37.099019Z"},"content_sha256":"ab097d6e35785a961294565650b07d4d1a76bc35dbd538c620b8be983e9b57dc","schema_version":"1.0","event_id":"sha256:ab097d6e35785a961294565650b07d4d1a76bc35dbd538c620b8be983e9b57dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2K5I7VHCY4QDWGU2HVFPUD5VR/bundle.json","state_url":"https://pith.science/pith/A2K5I7VHCY4QDWGU2HVFPUD5VR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2K5I7VHCY4QDWGU2HVFPUD5VR/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-08-08T19:44:37Z","links":{"resolver":"https://pith.science/pith/A2K5I7VHCY4QDWGU2HVFPUD5VR","bundle":"https://pith.science/pith/A2K5I7VHCY4QDWGU2HVFPUD5VR/bundle.json","state":"https://pith.science/pith/A2K5I7VHCY4QDWGU2HVFPUD5VR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2K5I7VHCY4QDWGU2HVFPUD5VR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A2K5I7VHCY4QDWGU2HVFPUD5VR","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":"a84065899f9fd84267edcdf57756cfa292629e8933da1644499f8753025d79af","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-04-14T02:40:15Z","title_canon_sha256":"d1330164dad2863671d971b72d491d5d3f212c49b2b799a78f324d091072fd65"},"schema_version":"1.0","source":{"id":"2604.12211","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.12211","created_at":"2026-06-30T01:18:18Z"},{"alias_kind":"arxiv_version","alias_value":"2604.12211v2","created_at":"2026-06-30T01:18:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.12211","created_at":"2026-06-30T01:18:18Z"},{"alias_kind":"pith_short_12","alias_value":"A2K5I7VHCY4Q","created_at":"2026-06-30T01:18:18Z"},{"alias_kind":"pith_short_16","alias_value":"A2K5I7VHCY4QDWGU","created_at":"2026-06-30T01:18:18Z"},{"alias_kind":"pith_short_8","alias_value":"A2K5I7VH","created_at":"2026-06-30T01:18:18Z"}],"graph_snapshots":[{"event_id":"sha256:ab097d6e35785a961294565650b07d4d1a76bc35dbd538c620b8be983e9b57dc","target":"graph","created_at":"2026-06-30T01:18:18Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We establish a substantially tighter lower bound for ORC than the existing lower bound, while retaining much lower computational cost than exact ORC computation, with practical speedups of tens of times. Moreover, our bound is not restricted to 1-hop random walks, but also applies to k-hop random walks (k > 1)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The residual-shell correction term is assumed to preserve the lower-bound property for the Wasserstein distance without introducing additional looseness that would negate the claimed tightness gain; this is asserted but not derived in the abstract."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A residual-shell construction yields a tighter, computationally cheap lower bound for Ollivier-Ricci curvature that works for both 1-hop and k-hop random walks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A residual-shell lower bound tightens estimates of Ollivier-Ricci curvature while remaining fast to compute."}],"snapshot_sha256":"2c8521bfd793622c630c95184f1e3e2ce9afb96eebc197072f46fe5befdde432"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.12211/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ollivier-Ricci curvature (ORC), defined via the Wasserstein distance that captures rich geometric information, has received growing attention in both theory and applications. However, the high computational cost of Wasserstein distance evaluation has significantly limited the broader practical use of ORC. To alleviate this issue, previous work introduced a computationally efficient lower bound as a proxy for ORC based on 1-hop random walks, but this approach empirically exhibits large gaps from the exact ORC. In this paper, we establish a substantially tighter lower bound for ORC than the exis","authors_text":"Huichun Zhang, Jian Sun, Xiang Gu","cross_cats":["cs.DS"],"headline":"A residual-shell lower bound tightens estimates of Ollivier-Ricci curvature while remaining fast to compute.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-04-14T02:40:15Z","title":"A Residual-Shell-Based Lower Bound for Ollivier-Ricci Curvature"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.12211","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T15:41:17.069923Z","id":"91826a1b-de6c-452c-93d1-e09776bc7302","model_set":{"reader":"grok-4.3"},"one_line_summary":"A residual-shell construction yields a tighter, computationally cheap lower bound for Ollivier-Ricci curvature that works for both 1-hop and k-hop random walks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A residual-shell lower bound tightens estimates of Ollivier-Ricci curvature while remaining fast to compute.","strongest_claim":"We establish a substantially tighter lower bound for ORC than the existing lower bound, while retaining much lower computational cost than exact ORC computation, with practical speedups of tens of times. Moreover, our bound is not restricted to 1-hop random walks, but also applies to k-hop random walks (k > 1).","weakest_assumption":"The residual-shell correction term is assumed to preserve the lower-bound property for the Wasserstein distance without introducing additional looseness that would negate the claimed tightness gain; this is asserted but not derived in the abstract."}},"verdict_id":"91826a1b-de6c-452c-93d1-e09776bc7302"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d596c7808fe6a57b06d77d84bff11070df75c2e1a09a37b6038d58265d27413d","target":"record","created_at":"2026-06-30T01:18:18Z","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":"a84065899f9fd84267edcdf57756cfa292629e8933da1644499f8753025d79af","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-04-14T02:40:15Z","title_canon_sha256":"d1330164dad2863671d971b72d491d5d3f212c49b2b799a78f324d091072fd65"},"schema_version":"1.0","source":{"id":"2604.12211","kind":"arxiv","version":2}},"canonical_sha256":"0695d47ea7163901d8d4d1ea57d07dac45ec275549c0cfa331a6d67e8c9e7792","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0695d47ea7163901d8d4d1ea57d07dac45ec275549c0cfa331a6d67e8c9e7792","first_computed_at":"2026-06-30T01:18:18.494092Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:18:18.494092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RVd1bznjZjKsxD23aITUyKHrzpDsRHGkiaX/baR6qJpJ8+BGl6yTpWV91/jlu3KdNvJj/FkWF4E7n0dV5LHXCA==","signature_status":"signed_v1","signed_at":"2026-06-30T01:18:18.495088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.12211","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d596c7808fe6a57b06d77d84bff11070df75c2e1a09a37b6038d58265d27413d","sha256:ab097d6e35785a961294565650b07d4d1a76bc35dbd538c620b8be983e9b57dc"],"state_sha256":"5006e4eb99c5bedf63c3491eeeea04b48329eed6400cf33be536d27735748b93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZSTvjoUUJfeBCprn64tA0YPSK10JPzRQt3GZuT1RlFVQeFlIGsA2Ki2eWC+NhLhr+4zy3+Lgax8QKTz0bjjsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T19:44:37.104349Z","bundle_sha256":"8c575adf284bb14571b4175c932a768495f4c4560bf84b641b81e5f158afb67f"}}