{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:INR53ZSTFBJCA7BFCMRLLUJEVG","short_pith_number":"pith:INR53ZST","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"},"canonical_sha256":"4363dde6532852207c251322b5d124a9b6aece622b88ddf251d0b21c86bb4c07","source":{"kind":"arxiv","id":"1305.0505","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0505","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0505v2","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0505","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"INR53ZSTFBJC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"INR53ZSTFBJCA7BF","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"INR53ZST","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:INR53ZSTFBJCA7BFCMRLLUJEVG","target":"record","payload":{"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"},"canonical_sha256":"4363dde6532852207c251322b5d124a9b6aece622b88ddf251d0b21c86bb4c07","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"},"source_kind":"arxiv","source_id":"1305.0505","source_version":2,"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-18T02:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l68T0lzJ7FyXOxDVDnTU2VrOEQCTnjtxUw83qK8UiR/yNYChgOMHv8JLjN/JBOWKUlIkPLBZDeMxmtDT4h+zDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:06:19.258010Z"},"content_sha256":"9730e6df7411ba5676a332a75ed1f17909ee5363a26195bec92ef931f0f0294b","schema_version":"1.0","event_id":"sha256:9730e6df7411ba5676a332a75ed1f17909ee5363a26195bec92ef931f0f0294b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:INR53ZSTFBJCA7BFCMRLLUJEVG","target":"graph","payload":{"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"},"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-18T02:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zg9fAhqIh7TLouA4XrpM3QsmPzf+qExBB3rip8B1e/4YtmqKq5LZUYen+d+XwEue9ULITtwER3BBPrbOTVIYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T23:06:19.258382Z"},"content_sha256":"515c68ec2214c4cf83cb661fa34c0193de53e26ce7e41576e7aaa962ea0aedaa","schema_version":"1.0","event_id":"sha256:515c68ec2214c4cf83cb661fa34c0193de53e26ce7e41576e7aaa962ea0aedaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/bundle.json","state_url":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/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-22T23:06:19Z","links":{"resolver":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG","bundle":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/bundle.json","state":"https://pith.science/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INR53ZSTFBJCA7BFCMRLLUJEVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:INR53ZSTFBJCA7BFCMRLLUJEVG","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":"61ac2bafdff6713d850cb8b0339d8e7f4f5f7d21370dc0b97c2d19decb1a36c8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-02T16:43:35Z","title_canon_sha256":"d06d07093d865bcc62d9cc74c88d9efe1019d631dd6968dc60ffcd42c0e2e1ae"},"schema_version":"1.0","source":{"id":"1305.0505","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0505","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0505v2","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0505","created_at":"2026-05-18T02:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"INR53ZSTFBJC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"INR53ZSTFBJCA7BF","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"INR53ZST","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:515c68ec2214c4cf83cb661fa34c0193de53e26ce7e41576e7aaa962ea0aedaa","target":"graph","created_at":"2026-05-18T02:37:44Z","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":"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+","authors_text":"J.T. Geneson, Matthew Babbitt, Tanya Khovanova","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-02T16:43:35Z","title":"On k-visibility graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0505","kind":"arxiv","version":2},"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:9730e6df7411ba5676a332a75ed1f17909ee5363a26195bec92ef931f0f0294b","target":"record","created_at":"2026-05-18T02:37:44Z","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":"61ac2bafdff6713d850cb8b0339d8e7f4f5f7d21370dc0b97c2d19decb1a36c8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-02T16:43:35Z","title_canon_sha256":"d06d07093d865bcc62d9cc74c88d9efe1019d631dd6968dc60ffcd42c0e2e1ae"},"schema_version":"1.0","source":{"id":"1305.0505","kind":"arxiv","version":2}},"canonical_sha256":"4363dde6532852207c251322b5d124a9b6aece622b88ddf251d0b21c86bb4c07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4363dde6532852207c251322b5d124a9b6aece622b88ddf251d0b21c86bb4c07","first_computed_at":"2026-05-18T02:37:44.867255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:44.867255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8dOuUzPpifhPiSu0ujZa1gvY1tSfO+dyhi4msiYMuCphWebw6c7sFYJBjHZG/0Gd0ToE8sEfkHkdQGLmKcpkDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:44.867811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0505","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9730e6df7411ba5676a332a75ed1f17909ee5363a26195bec92ef931f0f0294b","sha256:515c68ec2214c4cf83cb661fa34c0193de53e26ce7e41576e7aaa962ea0aedaa"],"state_sha256":"5590c78bb48577ac322482205fc0c8fff453269d69fcbbff46ea70ec57b096a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tckjz5io+1NfUDztFKQZCbkLQmKzM+6cmPYOX/EzCi5s3iKbIXZJvg30Q/6UADTv+MDeRj0UEB9ZU/+BiNIpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T23:06:19.260304Z","bundle_sha256":"47b2bc274d27a899ffb14a4c1ce09da0ff66c1c370b8954b521a479029f9a074"}}