{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GVC4KVQRLGAPGNW74FIQVHMLUV","short_pith_number":"pith:GVC4KVQR","schema_version":"1.0","canonical_sha256":"3545c556115980f336dfe1510a9d8ba56abe530482a35d60bc9a29187ea00942","source":{"kind":"arxiv","id":"1808.03053","version":1},"attestation_state":"computed","paper":{"title":"Optimal conditions for connectedness of discretized sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DM","authors_text":"Boris Brimkov, Valentin E. Brimkov","submitted_at":"2018-08-09T08:17:46Z","abstract_excerpt":"Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set $X$ is obtained by taking the integer points inside a closed neighborhood of $X$ of a certain radius. In this note we determine a minimum threshold for the offset radius, beyond which the discretization of a disconnected set is always connected. The results hold for a broad class of disconnected and unbounded subsets of $R^n$, and generalize several previous results. Algorithmic aspects and possible applications are briefly discussed."},"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":"1808.03053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-09T08:17:46Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"1c925e8cd7c364a36f4a179dd1d3df91ab85c2721516d0c8a9a4e03e98e49083","abstract_canon_sha256":"846bbe4e2c5d7172252fac58c38c02da3f662b3addd82aee042b4148b28ad915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:30.313115Z","signature_b64":"fzJEzJMR4jrP48qn1V5dwnBe/1rrS4dV2BFy/EGoHoO4M/lM9jsKg/QIDlv5BCcqhORdMPdnYU13m8QYTMGUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3545c556115980f336dfe1510a9d8ba56abe530482a35d60bc9a29187ea00942","last_reissued_at":"2026-05-18T00:08:30.312613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:30.312613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal conditions for connectedness of discretized sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DM","authors_text":"Boris Brimkov, Valentin E. Brimkov","submitted_at":"2018-08-09T08:17:46Z","abstract_excerpt":"Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set $X$ is obtained by taking the integer points inside a closed neighborhood of $X$ of a certain radius. In this note we determine a minimum threshold for the offset radius, beyond which the discretization of a disconnected set is always connected. The results hold for a broad class of disconnected and unbounded subsets of $R^n$, and generalize several previous results. Algorithmic aspects and possible applications are briefly discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03053","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":"1808.03053","created_at":"2026-05-18T00:08:30.312683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03053v1","created_at":"2026-05-18T00:08:30.312683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03053","created_at":"2026-05-18T00:08:30.312683+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVC4KVQRLGAP","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVC4KVQRLGAPGNW7","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVC4KVQR","created_at":"2026-05-18T12:32:25.280505+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/GVC4KVQRLGAPGNW74FIQVHMLUV","json":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV.json","graph_json":"https://pith.science/api/pith-number/GVC4KVQRLGAPGNW74FIQVHMLUV/graph.json","events_json":"https://pith.science/api/pith-number/GVC4KVQRLGAPGNW74FIQVHMLUV/events.json","paper":"https://pith.science/paper/GVC4KVQR"},"agent_actions":{"view_html":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV","download_json":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV.json","view_paper":"https://pith.science/paper/GVC4KVQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03053&json=true","fetch_graph":"https://pith.science/api/pith-number/GVC4KVQRLGAPGNW74FIQVHMLUV/graph.json","fetch_events":"https://pith.science/api/pith-number/GVC4KVQRLGAPGNW74FIQVHMLUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/action/storage_attestation","attest_author":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/action/author_attestation","sign_citation":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/action/citation_signature","submit_replication":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/action/replication_record"}},"created_at":"2026-05-18T00:08:30.312683+00:00","updated_at":"2026-05-18T00:08:30.312683+00:00"}