{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:INR53ZSTFBJCA7BFCMRLLUJEVG","short_pith_number":"pith:INR53ZST","schema_version":"1.0","canonical_sha256":"4363dde6532852207c251322b5d124a9b6aece622b88ddf251d0b21c86bb4c07","source":{"kind":"arxiv","id":"1305.0505","version":2},"attestation_state":"computed","paper":{"title":"On k-visibility graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"J.T. Geneson, Matthew Babbitt, Tanya Khovanova","submitted_at":"2013-05-02T16:43:35Z","abstract_excerpt":"We examine several types of visibility graphs in which sightlines can pass through $k$ objects. For $k \\geq 1$ we bound the maximum thickness of semi-bar $k$-visibility graphs between $\\lceil \\frac{2}{3} (k + 1) \\rceil$ and $2k$. In addition we show that the maximum number of edges in arc and circle $k$-visibility graphs on $n$ vertices is at most $(k+1)(3n-k-2)$ for $n > 4k+4$ and ${n \\choose 2}$ for $n \\leq 4k+4$, while the maximum chromatic number is at most $6k+6$. In semi-arc $k$-visibility graphs on $n$ vertices, we show that the maximum number of edges is ${n \\choose 2}$ for $n \\leq 3k+"},"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":"1305.0505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-02T16:43:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d06d07093d865bcc62d9cc74c88d9efe1019d631dd6968dc60ffcd42c0e2e1ae","abstract_canon_sha256":"61ac2bafdff6713d850cb8b0339d8e7f4f5f7d21370dc0b97c2d19decb1a36c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:44.867811Z","signature_b64":"8dOuUzPpifhPiSu0ujZa1gvY1tSfO+dyhi4msiYMuCphWebw6c7sFYJBjHZG/0Gd0ToE8sEfkHkdQGLmKcpkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4363dde6532852207c251322b5d124a9b6aece622b88ddf251d0b21c86bb4c07","last_reissued_at":"2026-05-18T02:37:44.867255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:44.867255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On k-visibility graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"J.T. Geneson, Matthew Babbitt, Tanya Khovanova","submitted_at":"2013-05-02T16:43:35Z","abstract_excerpt":"We examine several types of visibility graphs in which sightlines can pass through $k$ objects. For $k \\geq 1$ we bound the maximum thickness of semi-bar $k$-visibility graphs between $\\lceil \\frac{2}{3} (k + 1) \\rceil$ and $2k$. In addition we show that the maximum number of edges in arc and circle $k$-visibility graphs on $n$ vertices is at most $(k+1)(3n-k-2)$ for $n > 4k+4$ and ${n \\choose 2}$ for $n \\leq 4k+4$, while the maximum chromatic number is at most $6k+6$. In semi-arc $k$-visibility graphs on $n$ vertices, we show that the maximum number of edges is ${n \\choose 2}$ for $n \\leq 3k+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0505","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":"1305.0505","created_at":"2026-05-18T02:37:44.867371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0505v2","created_at":"2026-05-18T02:37:44.867371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0505","created_at":"2026-05-18T02:37:44.867371+00:00"},{"alias_kind":"pith_short_12","alias_value":"INR53ZSTFBJC","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"INR53ZSTFBJCA7BF","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"INR53ZST","created_at":"2026-05-18T12:27:46.883200+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/INR53ZSTFBJCA7BFCMRLLUJEVG","json":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG.json","graph_json":"https://pith.science/api/pith-number/INR53ZSTFBJCA7BFCMRLLUJEVG/graph.json","events_json":"https://pith.science/api/pith-number/INR53ZSTFBJCA7BFCMRLLUJEVG/events.json","paper":"https://pith.science/paper/INR53ZST"},"agent_actions":{"view_html":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG","download_json":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG.json","view_paper":"https://pith.science/paper/INR53ZST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0505&json=true","fetch_graph":"https://pith.science/api/pith-number/INR53ZSTFBJCA7BFCMRLLUJEVG/graph.json","fetch_events":"https://pith.science/api/pith-number/INR53ZSTFBJCA7BFCMRLLUJEVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/action/storage_attestation","attest_author":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/action/author_attestation","sign_citation":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/action/citation_signature","submit_replication":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/action/replication_record"}},"created_at":"2026-05-18T02:37:44.867371+00:00","updated_at":"2026-05-18T02:37:44.867371+00:00"}