{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DOBPKG6B7MO4CTXHI36QW6N24H","short_pith_number":"pith:DOBPKG6B","canonical_record":{"source":{"id":"1202.3455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-15T21:47:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a63a02c701e9fcc385e9f08250e44b2ec23d9ed8cad443b52bad2cdd7acf8474","abstract_canon_sha256":"85aea6ae2a49cda6f968a58917631444257f7f170d5a606c2067df9d95c358c4"},"schema_version":"1.0"},"canonical_sha256":"1b82f51bc1fb1dc14ee746fd0b79bae1e518cf6418721d3772dfd18d8f56da97","source":{"kind":"arxiv","id":"1202.3455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3455","created_at":"2026-05-18T04:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3455v1","created_at":"2026-05-18T04:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3455","created_at":"2026-05-18T04:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"DOBPKG6B7MO4","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DOBPKG6B7MO4CTXH","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DOBPKG6B","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DOBPKG6B7MO4CTXHI36QW6N24H","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-15T21:47:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a63a02c701e9fcc385e9f08250e44b2ec23d9ed8cad443b52bad2cdd7acf8474","abstract_canon_sha256":"85aea6ae2a49cda6f968a58917631444257f7f170d5a606c2067df9d95c358c4"},"schema_version":"1.0"},"canonical_sha256":"1b82f51bc1fb1dc14ee746fd0b79bae1e518cf6418721d3772dfd18d8f56da97","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:13.105247Z","signature_b64":"BOqJXUbxXyT0SnDMVGlZgvBHdiyugMaJEm6lK3JjkjOvPT9xU9n3JU+jAjLk4PEdnxPemQW41l0aYzgq/zidBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b82f51bc1fb1dc14ee746fd0b79bae1e518cf6418721d3772dfd18d8f56da97","last_reissued_at":"2026-05-18T04:02:13.104594Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:13.104594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3455","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-18T04:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7FqbZUGVgDlT1A0RgXqcE6dlFO4Ytelvj1w3DlFDsDnQSJyC/RKYWEWRWkttc4/GqxjX2S8nms/J+yc4YP8gBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:41:19.951628Z"},"content_sha256":"9e0ce5eea306f1843b9ead6ad23137244933fc8f86976a952405ca2e0608c060","schema_version":"1.0","event_id":"sha256:9e0ce5eea306f1843b9ead6ad23137244933fc8f86976a952405ca2e0608c060"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DOBPKG6B7MO4CTXHI36QW6N24H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Connectedness and Diameter of a Geometric Johnson Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Crevel Bautista-Santiago, David Flores-Pe\\~naloza, Dolores Lara, Eliseo Sarmiento, Hern\\'an Gonz\\'alez-Aguilar, Javier Cano, Jorge Urrutia, Ruy Fabila-Monroy","submitted_at":"2012-02-15T21:47:59Z","abstract_excerpt":"Let $P$ be a set of $n$ points in general position in the plane. A subset $I$ of $P$ is called an \\emph{island} if there exists a convex set $C$ such that $I = P \\cap C$. In this paper we define the \\emph{generalized island Johnson graph} of $P$ as the graph whose vertex consists of all islands of $P$ of cardinality $k$, two of which are adjacent if their intersection consists of exactly $l$ elements. We show that for large enough values of $n$, this graph is connected, and give upper and lower bounds on its diameter."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3455","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-18T04:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hM+i4I2QBZK67YOIsJW0kdzvYJV6VE3SEF+/0+qEQo9rErNRV5lLBu0yUi0kCGY3wvnT50wdjGJBFeVbEZ7iCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:41:19.951971Z"},"content_sha256":"c22bcc19103e65d7078c83a4f7227e0fad9faa6e26cf04ba8905110b333816c2","schema_version":"1.0","event_id":"sha256:c22bcc19103e65d7078c83a4f7227e0fad9faa6e26cf04ba8905110b333816c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H/bundle.json","state_url":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOBPKG6B7MO4CTXHI36QW6N24H/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-06-08T21:41:19Z","links":{"resolver":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H","bundle":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H/bundle.json","state":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOBPKG6B7MO4CTXHI36QW6N24H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DOBPKG6B7MO4CTXHI36QW6N24H","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":"85aea6ae2a49cda6f968a58917631444257f7f170d5a606c2067df9d95c358c4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-15T21:47:59Z","title_canon_sha256":"a63a02c701e9fcc385e9f08250e44b2ec23d9ed8cad443b52bad2cdd7acf8474"},"schema_version":"1.0","source":{"id":"1202.3455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3455","created_at":"2026-05-18T04:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3455v1","created_at":"2026-05-18T04:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3455","created_at":"2026-05-18T04:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"DOBPKG6B7MO4","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DOBPKG6B7MO4CTXH","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DOBPKG6B","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:c22bcc19103e65d7078c83a4f7227e0fad9faa6e26cf04ba8905110b333816c2","target":"graph","created_at":"2026-05-18T04:02:13Z","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":"Let $P$ be a set of $n$ points in general position in the plane. A subset $I$ of $P$ is called an \\emph{island} if there exists a convex set $C$ such that $I = P \\cap C$. In this paper we define the \\emph{generalized island Johnson graph} of $P$ as the graph whose vertex consists of all islands of $P$ of cardinality $k$, two of which are adjacent if their intersection consists of exactly $l$ elements. We show that for large enough values of $n$, this graph is connected, and give upper and lower bounds on its diameter.","authors_text":"Crevel Bautista-Santiago, David Flores-Pe\\~naloza, Dolores Lara, Eliseo Sarmiento, Hern\\'an Gonz\\'alez-Aguilar, Javier Cano, Jorge Urrutia, Ruy Fabila-Monroy","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-15T21:47:59Z","title":"On the Connectedness and Diameter of a Geometric Johnson Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3455","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:9e0ce5eea306f1843b9ead6ad23137244933fc8f86976a952405ca2e0608c060","target":"record","created_at":"2026-05-18T04:02:13Z","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":"85aea6ae2a49cda6f968a58917631444257f7f170d5a606c2067df9d95c358c4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-15T21:47:59Z","title_canon_sha256":"a63a02c701e9fcc385e9f08250e44b2ec23d9ed8cad443b52bad2cdd7acf8474"},"schema_version":"1.0","source":{"id":"1202.3455","kind":"arxiv","version":1}},"canonical_sha256":"1b82f51bc1fb1dc14ee746fd0b79bae1e518cf6418721d3772dfd18d8f56da97","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b82f51bc1fb1dc14ee746fd0b79bae1e518cf6418721d3772dfd18d8f56da97","first_computed_at":"2026-05-18T04:02:13.104594Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:13.104594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BOqJXUbxXyT0SnDMVGlZgvBHdiyugMaJEm6lK3JjkjOvPT9xU9n3JU+jAjLk4PEdnxPemQW41l0aYzgq/zidBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:13.105247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e0ce5eea306f1843b9ead6ad23137244933fc8f86976a952405ca2e0608c060","sha256:c22bcc19103e65d7078c83a4f7227e0fad9faa6e26cf04ba8905110b333816c2"],"state_sha256":"458982d896e8196d03e8a442c9631b611a9dd0516829fc01cb0a4d5654d3addf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6tQvSXn4bqrdG6ZLjmkbuC+2xQvWUiINxIIN0OX02akwP+fFTj+QyKfcdd2GFY8i0JW12JRGhzML0l21tr7ZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:41:19.953893Z","bundle_sha256":"a5223086a3a5d80086e46b522dbe96d7bb1e7c7443b8c761bc793696fcd89d0c"}}