{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1994:QJ7IFXEFWPK3LBLGAGARPCCF2F","short_pith_number":"pith:QJ7IFXEF","schema_version":"1.0","canonical_sha256":"827e82dc85b3d5b585660181178845d14a2ed3e35df1b046c95a0247d8f02dc1","source":{"kind":"arxiv","id":"math/9410208","version":1},"attestation_state":"computed","paper":{"title":"Three-dimensional alpha shapes","license":"","headline":"","cross_cats":["cs.CC","math.MG"],"primary_cat":"math.CO","authors_text":"Ernst M\\\"ucke, Herbert Edelsbrunner","submitted_at":"1994-10-12T00:00:00Z","abstract_excerpt":"Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal notion of the family of $\\alpha$-shapes of a finite point set in $\\Real^3$. Each shape is a well-defined polytope, derived from the Delaunay triangulation of the point set, with a parameter $\\alpha \\in \\Real$ controlling the desired level of detail. An algorithm is presented that constructs the entire family of shapes for a given set of size $n$ in time $O("},"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":"math/9410208","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-10-12T00:00:00Z","cross_cats_sorted":["cs.CC","math.MG"],"title_canon_sha256":"579bbb57035d748a09b1a8ee8a5af80a8937fca4f0a817d9b7da156df79d7f0a","abstract_canon_sha256":"59ba51f998d0f3b52f10b160878b20b001d8cdbd524398928fa2e14e6120626e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:50.995446Z","signature_b64":"jJrTtXAXztoKwq26S3m09rONtoB0lozihcDG6fPtmGECK5JJEiT+lvizM67qlIRPVmidXEfML+ISrYhMAHImAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"827e82dc85b3d5b585660181178845d14a2ed3e35df1b046c95a0247d8f02dc1","last_reissued_at":"2026-05-18T01:05:50.994935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:50.994935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three-dimensional alpha shapes","license":"","headline":"","cross_cats":["cs.CC","math.MG"],"primary_cat":"math.CO","authors_text":"Ernst M\\\"ucke, Herbert Edelsbrunner","submitted_at":"1994-10-12T00:00:00Z","abstract_excerpt":"Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal notion of the family of $\\alpha$-shapes of a finite point set in $\\Real^3$. Each shape is a well-defined polytope, derived from the Delaunay triangulation of the point set, with a parameter $\\alpha \\in \\Real$ controlling the desired level of detail. An algorithm is presented that constructs the entire family of shapes for a given set of size $n$ in time $O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9410208","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":""},"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":"math/9410208","created_at":"2026-05-18T01:05:50.995028+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9410208v1","created_at":"2026-05-18T01:05:50.995028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9410208","created_at":"2026-05-18T01:05:50.995028+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJ7IFXEFWPK3","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJ7IFXEFWPK3LBLG","created_at":"2026-05-18T12:25:47.102015+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJ7IFXEF","created_at":"2026-05-18T12:25:47.102015+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01619","citing_title":"Stochastic Homology of Gaussian vs. non-Gaussian Random Fields: Graphs towards Betti Numbers and Persistence Diagrams","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QJ7IFXEFWPK3LBLGAGARPCCF2F","json":"https://pith.science/pith/QJ7IFXEFWPK3LBLGAGARPCCF2F.json","graph_json":"https://pith.science/api/pith-number/QJ7IFXEFWPK3LBLGAGARPCCF2F/graph.json","events_json":"https://pith.science/api/pith-number/QJ7IFXEFWPK3LBLGAGARPCCF2F/events.json","paper":"https://pith.science/paper/QJ7IFXEF"},"agent_actions":{"view_html":"https://pith.science/pith/QJ7IFXEFWPK3LBLGAGARPCCF2F","download_json":"https://pith.science/pith/QJ7IFXEFWPK3LBLGAGARPCCF2F.json","view_paper":"https://pith.science/paper/QJ7IFXEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9410208&json=true","fetch_graph":"https://pith.science/api/pith-number/QJ7IFXEFWPK3LBLGAGARPCCF2F/graph.json","fetch_events":"https://pith.science/api/pith-number/QJ7IFXEFWPK3LBLGAGARPCCF2F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJ7IFXEFWPK3LBLGAGARPCCF2F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJ7IFXEFWPK3LBLGAGARPCCF2F/action/storage_attestation","attest_author":"https://pith.science/pith/QJ7IFXEFWPK3LBLGAGARPCCF2F/action/author_attestation","sign_citation":"https://pith.science/pith/QJ7IFXEFWPK3LBLGAGARPCCF2F/action/citation_signature","submit_replication":"https://pith.science/pith/QJ7IFXEFWPK3LBLGAGARPCCF2F/action/replication_record"}},"created_at":"2026-05-18T01:05:50.995028+00:00","updated_at":"2026-05-18T01:05:50.995028+00:00"}