{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5IGILJESGUMDE6HLRIJO4LWSR2","short_pith_number":"pith:5IGILJES","schema_version":"1.0","canonical_sha256":"ea0c85a49235183278eb8a12ee2ed28e922c9a3f35e61dd713f107a59e99f22c","source":{"kind":"arxiv","id":"1602.03734","version":2},"attestation_state":"computed","paper":{"title":"Strongly Near Voronoi Nucleus Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"E. Inan, J.F. Peters","submitted_at":"2016-01-29T14:01:08Z","abstract_excerpt":"This paper introduces nucleus clustering in Voronoi tessellations of plane surfaces with applications in the geometry of digital images. A \\emph{nucleus cluster} is a collection of Voronoi regions that are adjacent to a Voronoi region called the cluster nucleus. Nucleus clustering is a carried out in a strong proximity space. Of particular interest is the presence of maximal nucleus clusters in a tessellation. Among all of the possible nucleus clusters in a Voronoi tessellation, clusters with the highest number of adjacent polygons are called \\emph{maximal nucleus clusters}. The main results i"},"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":"1602.03734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-01-29T14:01:08Z","cross_cats_sorted":[],"title_canon_sha256":"a59fd1d38b5a594854d8a383ef9a099b3402f3ec1b603f277c16df422f6da80a","abstract_canon_sha256":"3b329db05f8d8def1efcff371e92ef4755ad7345eef9cb864b4da7f558c10e94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:55.257168Z","signature_b64":"6zsy4DulGHiMpU5NzZj/EyIS/fZlxcvA80a//DpDOo9fKiZKOFa9T0LRMKegyaLaI2jbUx5y5jfPL3qnZRcuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea0c85a49235183278eb8a12ee2ed28e922c9a3f35e61dd713f107a59e99f22c","last_reissued_at":"2026-05-18T01:20:55.256489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:55.256489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strongly Near Voronoi Nucleus Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"E. Inan, J.F. Peters","submitted_at":"2016-01-29T14:01:08Z","abstract_excerpt":"This paper introduces nucleus clustering in Voronoi tessellations of plane surfaces with applications in the geometry of digital images. A \\emph{nucleus cluster} is a collection of Voronoi regions that are adjacent to a Voronoi region called the cluster nucleus. Nucleus clustering is a carried out in a strong proximity space. Of particular interest is the presence of maximal nucleus clusters in a tessellation. Among all of the possible nucleus clusters in a Voronoi tessellation, clusters with the highest number of adjacent polygons are called \\emph{maximal nucleus clusters}. The main results i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03734","kind":"arxiv","version":2},"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":"1602.03734","created_at":"2026-05-18T01:20:55.256570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03734v2","created_at":"2026-05-18T01:20:55.256570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03734","created_at":"2026-05-18T01:20:55.256570+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IGILJESGUMD","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IGILJESGUMDE6HL","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IGILJES","created_at":"2026-05-18T12:30:01.593930+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/5IGILJESGUMDE6HLRIJO4LWSR2","json":"https://pith.science/pith/5IGILJESGUMDE6HLRIJO4LWSR2.json","graph_json":"https://pith.science/api/pith-number/5IGILJESGUMDE6HLRIJO4LWSR2/graph.json","events_json":"https://pith.science/api/pith-number/5IGILJESGUMDE6HLRIJO4LWSR2/events.json","paper":"https://pith.science/paper/5IGILJES"},"agent_actions":{"view_html":"https://pith.science/pith/5IGILJESGUMDE6HLRIJO4LWSR2","download_json":"https://pith.science/pith/5IGILJESGUMDE6HLRIJO4LWSR2.json","view_paper":"https://pith.science/paper/5IGILJES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03734&json=true","fetch_graph":"https://pith.science/api/pith-number/5IGILJESGUMDE6HLRIJO4LWSR2/graph.json","fetch_events":"https://pith.science/api/pith-number/5IGILJESGUMDE6HLRIJO4LWSR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IGILJESGUMDE6HLRIJO4LWSR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IGILJESGUMDE6HLRIJO4LWSR2/action/storage_attestation","attest_author":"https://pith.science/pith/5IGILJESGUMDE6HLRIJO4LWSR2/action/author_attestation","sign_citation":"https://pith.science/pith/5IGILJESGUMDE6HLRIJO4LWSR2/action/citation_signature","submit_replication":"https://pith.science/pith/5IGILJESGUMDE6HLRIJO4LWSR2/action/replication_record"}},"created_at":"2026-05-18T01:20:55.256570+00:00","updated_at":"2026-05-18T01:20:55.256570+00:00"}