{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GVC4KVQRLGAPGNW74FIQVHMLUV","short_pith_number":"pith:GVC4KVQR","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"},"canonical_sha256":"3545c556115980f336dfe1510a9d8ba56abe530482a35d60bc9a29187ea00942","source":{"kind":"arxiv","id":"1808.03053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03053","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03053v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03053","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"GVC4KVQRLGAP","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GVC4KVQRLGAPGNW7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GVC4KVQR","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GVC4KVQRLGAPGNW74FIQVHMLUV","target":"record","payload":{"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"},"canonical_sha256":"3545c556115980f336dfe1510a9d8ba56abe530482a35d60bc9a29187ea00942","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"},"source_kind":"arxiv","source_id":"1808.03053","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5F5dnoJILCPLEa0kfHWzvErzBQbDajflJatTBWT68mHR3J6KFMKUeImlOs9Dd6WVoBc/dghI09TziQtXUbsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:57:05.370671Z"},"content_sha256":"aaada7e9e57e7cdb3cb69e780b4689bf44efa17f58f960f985cedd630781831d","schema_version":"1.0","event_id":"sha256:aaada7e9e57e7cdb3cb69e780b4689bf44efa17f58f960f985cedd630781831d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GVC4KVQRLGAPGNW74FIQVHMLUV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:08:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a1Dk+dJAL1KCIsawPzOtAeFgZ1SaykTUuaYecbhpGzkiVy4ajm2dSsl7u3/AJBqww8nNssMVa8joZHwrHpwqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:57:05.371250Z"},"content_sha256":"3e85af72f485d8916598d73c50e3ce3f618d21b459b040ec3c9e27edbc54f45c","schema_version":"1.0","event_id":"sha256:3e85af72f485d8916598d73c50e3ce3f618d21b459b040ec3c9e27edbc54f45c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/bundle.json","state_url":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T10:57:05Z","links":{"resolver":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV","bundle":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/bundle.json","state":"https://pith.science/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVC4KVQRLGAPGNW74FIQVHMLUV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GVC4KVQRLGAPGNW74FIQVHMLUV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"846bbe4e2c5d7172252fac58c38c02da3f662b3addd82aee042b4148b28ad915","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-09T08:17:46Z","title_canon_sha256":"1c925e8cd7c364a36f4a179dd1d3df91ab85c2721516d0c8a9a4e03e98e49083"},"schema_version":"1.0","source":{"id":"1808.03053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03053","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03053v1","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03053","created_at":"2026-05-18T00:08:30Z"},{"alias_kind":"pith_short_12","alias_value":"GVC4KVQRLGAP","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GVC4KVQRLGAPGNW7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GVC4KVQR","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:3e85af72f485d8916598d73c50e3ce3f618d21b459b040ec3c9e27edbc54f45c","target":"graph","created_at":"2026-05-18T00:08:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Boris Brimkov, Valentin E. Brimkov","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-09T08:17:46Z","title":"Optimal conditions for connectedness of discretized sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03053","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:aaada7e9e57e7cdb3cb69e780b4689bf44efa17f58f960f985cedd630781831d","target":"record","created_at":"2026-05-18T00:08:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"846bbe4e2c5d7172252fac58c38c02da3f662b3addd82aee042b4148b28ad915","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-08-09T08:17:46Z","title_canon_sha256":"1c925e8cd7c364a36f4a179dd1d3df91ab85c2721516d0c8a9a4e03e98e49083"},"schema_version":"1.0","source":{"id":"1808.03053","kind":"arxiv","version":1}},"canonical_sha256":"3545c556115980f336dfe1510a9d8ba56abe530482a35d60bc9a29187ea00942","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3545c556115980f336dfe1510a9d8ba56abe530482a35d60bc9a29187ea00942","first_computed_at":"2026-05-18T00:08:30.312613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:30.312613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fzJEzJMR4jrP48qn1V5dwnBe/1rrS4dV2BFy/EGoHoO4M/lM9jsKg/QIDlv5BCcqhORdMPdnYU13m8QYTMGUBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:30.313115Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaada7e9e57e7cdb3cb69e780b4689bf44efa17f58f960f985cedd630781831d","sha256:3e85af72f485d8916598d73c50e3ce3f618d21b459b040ec3c9e27edbc54f45c"],"state_sha256":"cdbe0641a9746eb1cbaec0dddb7f51bb2abdacbeead3b5fb736a6e15fb425594"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gY0a5k7F/y10TtScXZzu6cZIJ6SlQN+VVeWRdKp2ew+0vIvXlhNpKtdDL8I+Igm2xWdk1fnoZtq2is4ehnERCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:57:05.374306Z","bundle_sha256":"8aa7045f9ea579ad88cea8fdf7dd82d80a818fe500b7782f49edf58f03296d42"}}