{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IPDL7MJGVJPUBZPC2DWRAHSZU4","short_pith_number":"pith:IPDL7MJG","schema_version":"1.0","canonical_sha256":"43c6bfb126aa5f40e5e2d0ed101e59a7019e11e4ff1d687e2a253081923a3b36","source":{"kind":"arxiv","id":"2007.08900","version":1},"attestation_state":"computed","paper":{"title":"A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Di Liu, Vitaliy Kurlin, Yury Elkin","submitted_at":"2020-07-17T11:04:59Z","abstract_excerpt":"The tree reconstruction problem is to find an embedded straight-line tree that approximates a given cloud of unorganized points in $\\mathbb{R}^m$ up to a certain error. A practical solution to this problem will accelerate a discovery of new colloidal products with desired physical properties such as viscosity. We define the Approximate Skeleton of any finite point cloud $C$ in a Euclidean space with theoretical guarantees. The Approximate Skeleton ASk$(C)$ always belongs to a given offset of $C$, i.e. the maximum distance from $C$ to ASk$(C)$ can be a given maximum error. The number of vertice"},"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":"2007.08900","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-07-17T11:04:59Z","cross_cats_sorted":[],"title_canon_sha256":"511f1bd5320a5ef09adde0b71558c3fe55d4b2405f4ce4be0d9208d727f5608e","abstract_canon_sha256":"7c0e4621c7e4b0f3fae19d63700ae407185011efa4d8d60fa5ec48dfa9aabbcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:19:58.606327Z","signature_b64":"QA7ZicpVEU9D92LZyWF56XRs74IvRMRnxwxS5NAVcAWWyql43k+TqOULC9T4NB7+YxEP7uuWNzJOi6srcYG+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43c6bfb126aa5f40e5e2d0ed101e59a7019e11e4ff1d687e2a253081923a3b36","last_reissued_at":"2026-07-05T01:19:58.605905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:19:58.605905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Di Liu, Vitaliy Kurlin, Yury Elkin","submitted_at":"2020-07-17T11:04:59Z","abstract_excerpt":"The tree reconstruction problem is to find an embedded straight-line tree that approximates a given cloud of unorganized points in $\\mathbb{R}^m$ up to a certain error. A practical solution to this problem will accelerate a discovery of new colloidal products with desired physical properties such as viscosity. We define the Approximate Skeleton of any finite point cloud $C$ in a Euclidean space with theoretical guarantees. The Approximate Skeleton ASk$(C)$ always belongs to a given offset of $C$, i.e. the maximum distance from $C$ to ASk$(C)$ can be a given maximum error. The number of vertice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.08900","kind":"arxiv","version":1},"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/2007.08900/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":"2007.08900","created_at":"2026-07-05T01:19:58.605978+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.08900v1","created_at":"2026-07-05T01:19:58.605978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.08900","created_at":"2026-07-05T01:19:58.605978+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPDL7MJGVJPU","created_at":"2026-07-05T01:19:58.605978+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPDL7MJGVJPUBZPC","created_at":"2026-07-05T01:19:58.605978+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPDL7MJG","created_at":"2026-07-05T01:19:58.605978+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/IPDL7MJGVJPUBZPC2DWRAHSZU4","json":"https://pith.science/pith/IPDL7MJGVJPUBZPC2DWRAHSZU4.json","graph_json":"https://pith.science/api/pith-number/IPDL7MJGVJPUBZPC2DWRAHSZU4/graph.json","events_json":"https://pith.science/api/pith-number/IPDL7MJGVJPUBZPC2DWRAHSZU4/events.json","paper":"https://pith.science/paper/IPDL7MJG"},"agent_actions":{"view_html":"https://pith.science/pith/IPDL7MJGVJPUBZPC2DWRAHSZU4","download_json":"https://pith.science/pith/IPDL7MJGVJPUBZPC2DWRAHSZU4.json","view_paper":"https://pith.science/paper/IPDL7MJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.08900&json=true","fetch_graph":"https://pith.science/api/pith-number/IPDL7MJGVJPUBZPC2DWRAHSZU4/graph.json","fetch_events":"https://pith.science/api/pith-number/IPDL7MJGVJPUBZPC2DWRAHSZU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPDL7MJGVJPUBZPC2DWRAHSZU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPDL7MJGVJPUBZPC2DWRAHSZU4/action/storage_attestation","attest_author":"https://pith.science/pith/IPDL7MJGVJPUBZPC2DWRAHSZU4/action/author_attestation","sign_citation":"https://pith.science/pith/IPDL7MJGVJPUBZPC2DWRAHSZU4/action/citation_signature","submit_replication":"https://pith.science/pith/IPDL7MJGVJPUBZPC2DWRAHSZU4/action/replication_record"}},"created_at":"2026-07-05T01:19:58.605978+00:00","updated_at":"2026-07-05T01:19:58.605978+00:00"}