{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DOBPKG6B7MO4CTXHI36QW6N24H","short_pith_number":"pith:DOBPKG6B","schema_version":"1.0","canonical_sha256":"1b82f51bc1fb1dc14ee746fd0b79bae1e518cf6418721d3772dfd18d8f56da97","source":{"kind":"arxiv","id":"1202.3455","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.3455","created_at":"2026-05-18T04:02:13.104695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3455v1","created_at":"2026-05-18T04:02:13.104695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3455","created_at":"2026-05-18T04:02:13.104695+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOBPKG6B7MO4","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOBPKG6B7MO4CTXH","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOBPKG6B","created_at":"2026-05-18T12:27:04.183437+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/DOBPKG6B7MO4CTXHI36QW6N24H","json":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H.json","graph_json":"https://pith.science/api/pith-number/DOBPKG6B7MO4CTXHI36QW6N24H/graph.json","events_json":"https://pith.science/api/pith-number/DOBPKG6B7MO4CTXHI36QW6N24H/events.json","paper":"https://pith.science/paper/DOBPKG6B"},"agent_actions":{"view_html":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H","download_json":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H.json","view_paper":"https://pith.science/paper/DOBPKG6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3455&json=true","fetch_graph":"https://pith.science/api/pith-number/DOBPKG6B7MO4CTXHI36QW6N24H/graph.json","fetch_events":"https://pith.science/api/pith-number/DOBPKG6B7MO4CTXHI36QW6N24H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H/action/storage_attestation","attest_author":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H/action/author_attestation","sign_citation":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H/action/citation_signature","submit_replication":"https://pith.science/pith/DOBPKG6B7MO4CTXHI36QW6N24H/action/replication_record"}},"created_at":"2026-05-18T04:02:13.104695+00:00","updated_at":"2026-05-18T04:02:13.104695+00:00"}