{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:D47GEHU4UEAHUTMARPMZRKARMX","short_pith_number":"pith:D47GEHU4","schema_version":"1.0","canonical_sha256":"1f3e621e9ca1007a4d808bd998a81165da8e7d1cb94de356c8ea4ef0da2fc8a7","source":{"kind":"arxiv","id":"1009.3898","version":2},"attestation_state":"computed","paper":{"title":"On Some fundamental aspects of Polyominoes on Random Voronoi Tilings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Leandro P. R. Pimentel","submitted_at":"2010-09-20T17:40:42Z","abstract_excerpt":"Consider a Voronoi tiling of the Euclidean space based on a realization of a inhomogeneous Poisson random set. A Voronoi polyomino is a finite and connected union of Voronoi tiles. In this paper we provide tail bounds for the number of boxes that are intersected by a Voronoi polyomino, and vice-versa. These results will be crucial to analyze self-avoiding paths, greedy polyominoes and first-passage percolation models on Voronoi tilings and on the dual graph, named the Delaunay triangulation."},"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":"1009.3898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2010-09-20T17:40:42Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"9e1a14790d00c794c5b8420188cee1b25830e20ba6e0ab41a28212d126c278e2","abstract_canon_sha256":"bcd4af3fd9d9005cc305176e8ae9125c19bd15c8627f61286e333c5f26afb8fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:36.863094Z","signature_b64":"9/kaX3MZOXgXLgAIwXaQuT2rVj3Qkr+/AMuk3lDTpcbTQre6xT1tqsiewUKYH6VO/ZxwLsR1+HcHuwnqVRJtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f3e621e9ca1007a4d808bd998a81165da8e7d1cb94de356c8ea4ef0da2fc8a7","last_reissued_at":"2026-05-18T04:15:36.862657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:36.862657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Some fundamental aspects of Polyominoes on Random Voronoi Tilings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Leandro P. R. Pimentel","submitted_at":"2010-09-20T17:40:42Z","abstract_excerpt":"Consider a Voronoi tiling of the Euclidean space based on a realization of a inhomogeneous Poisson random set. A Voronoi polyomino is a finite and connected union of Voronoi tiles. In this paper we provide tail bounds for the number of boxes that are intersected by a Voronoi polyomino, and vice-versa. These results will be crucial to analyze self-avoiding paths, greedy polyominoes and first-passage percolation models on Voronoi tilings and on the dual graph, named the Delaunay triangulation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3898","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":"1009.3898","created_at":"2026-05-18T04:15:36.862734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3898v2","created_at":"2026-05-18T04:15:36.862734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3898","created_at":"2026-05-18T04:15:36.862734+00:00"},{"alias_kind":"pith_short_12","alias_value":"D47GEHU4UEAH","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"D47GEHU4UEAHUTMA","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"D47GEHU4","created_at":"2026-05-18T12:26:06.534383+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/D47GEHU4UEAHUTMARPMZRKARMX","json":"https://pith.science/pith/D47GEHU4UEAHUTMARPMZRKARMX.json","graph_json":"https://pith.science/api/pith-number/D47GEHU4UEAHUTMARPMZRKARMX/graph.json","events_json":"https://pith.science/api/pith-number/D47GEHU4UEAHUTMARPMZRKARMX/events.json","paper":"https://pith.science/paper/D47GEHU4"},"agent_actions":{"view_html":"https://pith.science/pith/D47GEHU4UEAHUTMARPMZRKARMX","download_json":"https://pith.science/pith/D47GEHU4UEAHUTMARPMZRKARMX.json","view_paper":"https://pith.science/paper/D47GEHU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3898&json=true","fetch_graph":"https://pith.science/api/pith-number/D47GEHU4UEAHUTMARPMZRKARMX/graph.json","fetch_events":"https://pith.science/api/pith-number/D47GEHU4UEAHUTMARPMZRKARMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D47GEHU4UEAHUTMARPMZRKARMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D47GEHU4UEAHUTMARPMZRKARMX/action/storage_attestation","attest_author":"https://pith.science/pith/D47GEHU4UEAHUTMARPMZRKARMX/action/author_attestation","sign_citation":"https://pith.science/pith/D47GEHU4UEAHUTMARPMZRKARMX/action/citation_signature","submit_replication":"https://pith.science/pith/D47GEHU4UEAHUTMARPMZRKARMX/action/replication_record"}},"created_at":"2026-05-18T04:15:36.862734+00:00","updated_at":"2026-05-18T04:15:36.862734+00:00"}