{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:B53L6UDLDFPEPX4LP4G7QAZKX2","short_pith_number":"pith:B53L6UDL","schema_version":"1.0","canonical_sha256":"0f76bf506b195e47df8b7f0df8032abeadd21ca1d11ac2fda358f1ddcde78f1b","source":{"kind":"arxiv","id":"1901.03319","version":3},"attestation_state":"computed","paper":{"title":"Skeletonisation Algorithms with Theoretical Guarantees for Unorganised Point Clouds with High Levels of Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Philip Smith, Vitaliy Kurlin","submitted_at":"2019-01-10T18:52:02Z","abstract_excerpt":"Data Science aims to extract meaningful knowledge from unorganised data. Real datasets usually come in the form of a cloud of points with only pairwise distances. Numerous applications require to visualise an overall shape of a noisy cloud of points sampled from a non-linear object that is more complicated than a union of disjoint clusters. The skeletonisation problem in its hardest form is to find a 1-dimensional skeleton that correctly represents a shape of the cloud. This paper compares several algorithms that solve the above skeletonisation problem for any point cloud and guarantee a succe"},"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":"1901.03319","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-01-10T18:52:02Z","cross_cats_sorted":[],"title_canon_sha256":"c6b6498dbb8d36cc410b5d22f8a69e009b59594c79ec8ee526e12c21dd0e36fb","abstract_canon_sha256":"41d3fc5cfa32b2c21a83afbb99a01b51788d3b8efb771115acd5678a18c82184"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:27.267624Z","signature_b64":"cgMTJh0thU1KIL4ewt1ItVamm/qKqK3W6UijOVZdmqCW1720dnfQNrFFwaHDCQS7CyQRgqr8HZ/qjcwE2hqFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f76bf506b195e47df8b7f0df8032abeadd21ca1d11ac2fda358f1ddcde78f1b","last_reissued_at":"2026-07-05T02:18:27.267144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:27.267144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Skeletonisation Algorithms with Theoretical Guarantees for Unorganised Point Clouds with High Levels of Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Philip Smith, Vitaliy Kurlin","submitted_at":"2019-01-10T18:52:02Z","abstract_excerpt":"Data Science aims to extract meaningful knowledge from unorganised data. Real datasets usually come in the form of a cloud of points with only pairwise distances. Numerous applications require to visualise an overall shape of a noisy cloud of points sampled from a non-linear object that is more complicated than a union of disjoint clusters. The skeletonisation problem in its hardest form is to find a 1-dimensional skeleton that correctly represents a shape of the cloud. This paper compares several algorithms that solve the above skeletonisation problem for any point cloud and guarantee a succe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03319","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/1901.03319/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":"1901.03319","created_at":"2026-07-05T02:18:27.267207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03319v3","created_at":"2026-07-05T02:18:27.267207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03319","created_at":"2026-07-05T02:18:27.267207+00:00"},{"alias_kind":"pith_short_12","alias_value":"B53L6UDLDFPE","created_at":"2026-07-05T02:18:27.267207+00:00"},{"alias_kind":"pith_short_16","alias_value":"B53L6UDLDFPEPX4L","created_at":"2026-07-05T02:18:27.267207+00:00"},{"alias_kind":"pith_short_8","alias_value":"B53L6UDL","created_at":"2026-07-05T02:18:27.267207+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/B53L6UDLDFPEPX4LP4G7QAZKX2","json":"https://pith.science/pith/B53L6UDLDFPEPX4LP4G7QAZKX2.json","graph_json":"https://pith.science/api/pith-number/B53L6UDLDFPEPX4LP4G7QAZKX2/graph.json","events_json":"https://pith.science/api/pith-number/B53L6UDLDFPEPX4LP4G7QAZKX2/events.json","paper":"https://pith.science/paper/B53L6UDL"},"agent_actions":{"view_html":"https://pith.science/pith/B53L6UDLDFPEPX4LP4G7QAZKX2","download_json":"https://pith.science/pith/B53L6UDLDFPEPX4LP4G7QAZKX2.json","view_paper":"https://pith.science/paper/B53L6UDL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03319&json=true","fetch_graph":"https://pith.science/api/pith-number/B53L6UDLDFPEPX4LP4G7QAZKX2/graph.json","fetch_events":"https://pith.science/api/pith-number/B53L6UDLDFPEPX4LP4G7QAZKX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B53L6UDLDFPEPX4LP4G7QAZKX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B53L6UDLDFPEPX4LP4G7QAZKX2/action/storage_attestation","attest_author":"https://pith.science/pith/B53L6UDLDFPEPX4LP4G7QAZKX2/action/author_attestation","sign_citation":"https://pith.science/pith/B53L6UDLDFPEPX4LP4G7QAZKX2/action/citation_signature","submit_replication":"https://pith.science/pith/B53L6UDLDFPEPX4LP4G7QAZKX2/action/replication_record"}},"created_at":"2026-07-05T02:18:27.267207+00:00","updated_at":"2026-07-05T02:18:27.267207+00:00"}