{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KO6PEYZD4JPGH3IIBZRBQIB3UA","short_pith_number":"pith:KO6PEYZD","schema_version":"1.0","canonical_sha256":"53bcf26323e25e63ed080e6218203ba037ac2e79d36e3ea7747d17214e3e8758","source":{"kind":"arxiv","id":"1905.13196","version":3},"attestation_state":"computed","paper":{"title":"Persistent homology detects curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.AT","stat.ML"],"primary_cat":"cs.CG","authors_text":"Benjamin Whittle, Dhruv Patel, Michael Hull, Peter Bubenik","submitted_at":"2019-05-30T17:36:58Z","abstract_excerpt":"In topological data analysis, persistent homology is used to study the \"shape of data\". Persistent homology computations are completely characterized by a set of intervals called a bar code. It is often said that the long intervals represent the \"topological signal\" and the short intervals represent \"noise\". We give evidence to dispute this thesis, showing that the short intervals encode geometric information. Specifically, we prove that persistent homology detects the curvature of disks from which points have been sampled. We describe a general computational framework for solving inverse prob"},"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":"1905.13196","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-30T17:36:58Z","cross_cats_sorted":["cs.LG","math.AT","stat.ML"],"title_canon_sha256":"ed0b5432c412844f82694674248d41cfdf8d6657b83a5793bf17c642d75df4e5","abstract_canon_sha256":"feefbcfb1f113fe6bc5a661c4509dc34be818e35fecfaf615bcd5d0fa8ec3ddd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:39.950869Z","signature_b64":"qJ/YaMNTMdu1BKSuPy+lWUzf6CpGBNofCgDsSMIdkqtoZUEFPoIbiDx/QArOgDoAO7whG+TxUWZIP8+1snOhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53bcf26323e25e63ed080e6218203ba037ac2e79d36e3ea7747d17214e3e8758","last_reissued_at":"2026-07-05T10:15:39.950325Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:39.950325Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Persistent homology detects curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.AT","stat.ML"],"primary_cat":"cs.CG","authors_text":"Benjamin Whittle, Dhruv Patel, Michael Hull, Peter Bubenik","submitted_at":"2019-05-30T17:36:58Z","abstract_excerpt":"In topological data analysis, persistent homology is used to study the \"shape of data\". Persistent homology computations are completely characterized by a set of intervals called a bar code. It is often said that the long intervals represent the \"topological signal\" and the short intervals represent \"noise\". We give evidence to dispute this thesis, showing that the short intervals encode geometric information. Specifically, we prove that persistent homology detects the curvature of disks from which points have been sampled. We describe a general computational framework for solving inverse prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13196","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/1905.13196/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":"1905.13196","created_at":"2026-07-05T10:15:39.950394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13196v3","created_at":"2026-07-05T10:15:39.950394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13196","created_at":"2026-07-05T10:15:39.950394+00:00"},{"alias_kind":"pith_short_12","alias_value":"KO6PEYZD4JPG","created_at":"2026-07-05T10:15:39.950394+00:00"},{"alias_kind":"pith_short_16","alias_value":"KO6PEYZD4JPGH3II","created_at":"2026-07-05T10:15:39.950394+00:00"},{"alias_kind":"pith_short_8","alias_value":"KO6PEYZD","created_at":"2026-07-05T10:15:39.950394+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06779","citing_title":"How many points in a point cloud is sufficient for accurate estimation of the curvature","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KO6PEYZD4JPGH3IIBZRBQIB3UA","json":"https://pith.science/pith/KO6PEYZD4JPGH3IIBZRBQIB3UA.json","graph_json":"https://pith.science/api/pith-number/KO6PEYZD4JPGH3IIBZRBQIB3UA/graph.json","events_json":"https://pith.science/api/pith-number/KO6PEYZD4JPGH3IIBZRBQIB3UA/events.json","paper":"https://pith.science/paper/KO6PEYZD"},"agent_actions":{"view_html":"https://pith.science/pith/KO6PEYZD4JPGH3IIBZRBQIB3UA","download_json":"https://pith.science/pith/KO6PEYZD4JPGH3IIBZRBQIB3UA.json","view_paper":"https://pith.science/paper/KO6PEYZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13196&json=true","fetch_graph":"https://pith.science/api/pith-number/KO6PEYZD4JPGH3IIBZRBQIB3UA/graph.json","fetch_events":"https://pith.science/api/pith-number/KO6PEYZD4JPGH3IIBZRBQIB3UA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KO6PEYZD4JPGH3IIBZRBQIB3UA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KO6PEYZD4JPGH3IIBZRBQIB3UA/action/storage_attestation","attest_author":"https://pith.science/pith/KO6PEYZD4JPGH3IIBZRBQIB3UA/action/author_attestation","sign_citation":"https://pith.science/pith/KO6PEYZD4JPGH3IIBZRBQIB3UA/action/citation_signature","submit_replication":"https://pith.science/pith/KO6PEYZD4JPGH3IIBZRBQIB3UA/action/replication_record"}},"created_at":"2026-07-05T10:15:39.950394+00:00","updated_at":"2026-07-05T10:15:39.950394+00:00"}