{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BXQYR26ULZ7KQALLASLUS6QKBZ","short_pith_number":"pith:BXQYR26U","canonical_record":{"source":{"id":"1610.04741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-15T14:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"0ca6b69ac3b5724700152a12c962b67cd6af0c7b0a0053e97b8143b7b07b5d74","abstract_canon_sha256":"fca09c10910f4c424baa0b50358e0af7bb16fb9ee2c8ea3349acb34b226540d8"},"schema_version":"1.0"},"canonical_sha256":"0de188ebd45e7ea8016b0497497a0a0e685a89ec95ad1640240e3f2084c95fa7","source":{"kind":"arxiv","id":"1610.04741","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04741","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04741v2","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04741","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"pith_short_12","alias_value":"BXQYR26ULZ7K","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BXQYR26ULZ7KQALL","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BXQYR26U","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BXQYR26ULZ7KQALLASLUS6QKBZ","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04741","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-15T14:19:29Z","cross_cats_sorted":[],"title_canon_sha256":"0ca6b69ac3b5724700152a12c962b67cd6af0c7b0a0053e97b8143b7b07b5d74","abstract_canon_sha256":"fca09c10910f4c424baa0b50358e0af7bb16fb9ee2c8ea3349acb34b226540d8"},"schema_version":"1.0"},"canonical_sha256":"0de188ebd45e7ea8016b0497497a0a0e685a89ec95ad1640240e3f2084c95fa7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:13.680503Z","signature_b64":"SZeaEwaNbaCJ55Mb6c1YzMqLorZNKZdb8/jR0GYmyCCdG0NKFBUmJTSZX2BYFXHEqfr9Rmu8PXfRPHNvromnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0de188ebd45e7ea8016b0497497a0a0e685a89ec95ad1640240e3f2084c95fa7","last_reissued_at":"2026-05-18T00:40:13.679881Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:13.679881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04741","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-18T00:40:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"faesxcUPtv8WMC4Zud4fEFWSihL/efSQib1O0H6i3HOMvR85l0A7hvSDtLme/KQcXWzzU/wReZz1BT8XQVK0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:43:48.114940Z"},"content_sha256":"af8dcca61b1255508652890d34f1ffc549d10f8d71542a67991f8ead7f52a153","schema_version":"1.0","event_id":"sha256:af8dcca61b1255508652890d34f1ffc549d10f8d71542a67991f8ead7f52a153"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BXQYR26ULZ7KQALLASLUS6QKBZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Drawing graphs using a small number of obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Josef Cibulka, Martin Balko, Pavel Valtr","submitted_at":"2016-10-15T14:19:29Z","abstract_excerpt":"An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line segment between the corresponding points avoids all the obstacles. The obstacle number ${\\rm obs}(G)$ of $G$ is the minimum number of obstacles in an obstacle representation of $G$.\n  We provide the first non-trivial general upper bound on the obstacle number of graphs by showing that every $n$-vertex graph $G$ satisfies ${\\rm obs}(G) \\leq n\\lceil\\log{n}\\rceil-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04741","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-18T00:40:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgrKAU5P8RPCJtfaPf+5zb2YtdERyD+JCEnLywojRwnQRykudYaU4Hl1hPN4Ojf78XcvSPueeEbKjF1mbbSFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:43:48.115287Z"},"content_sha256":"b1aeeaf69edeb341de05e5c3a8f4e23e312bd33e80435e7e6f3dd7ab9b2e385c","schema_version":"1.0","event_id":"sha256:b1aeeaf69edeb341de05e5c3a8f4e23e312bd33e80435e7e6f3dd7ab9b2e385c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/bundle.json","state_url":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/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-28T11:43:48Z","links":{"resolver":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ","bundle":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/bundle.json","state":"https://pith.science/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXQYR26ULZ7KQALLASLUS6QKBZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BXQYR26ULZ7KQALLASLUS6QKBZ","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":"fca09c10910f4c424baa0b50358e0af7bb16fb9ee2c8ea3349acb34b226540d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-15T14:19:29Z","title_canon_sha256":"0ca6b69ac3b5724700152a12c962b67cd6af0c7b0a0053e97b8143b7b07b5d74"},"schema_version":"1.0","source":{"id":"1610.04741","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04741","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04741v2","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04741","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"pith_short_12","alias_value":"BXQYR26ULZ7K","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BXQYR26ULZ7KQALL","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BXQYR26U","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:b1aeeaf69edeb341de05e5c3a8f4e23e312bd33e80435e7e6f3dd7ab9b2e385c","target":"graph","created_at":"2026-05-18T00:40: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":"An obstacle representation of a graph $G$ is a set of points in the plane representing the vertices of $G$, together with a set of polygonal obstacles such that two vertices of $G$ are connected by an edge in $G$ if and only if the line segment between the corresponding points avoids all the obstacles. The obstacle number ${\\rm obs}(G)$ of $G$ is the minimum number of obstacles in an obstacle representation of $G$.\n  We provide the first non-trivial general upper bound on the obstacle number of graphs by showing that every $n$-vertex graph $G$ satisfies ${\\rm obs}(G) \\leq n\\lceil\\log{n}\\rceil-","authors_text":"Josef Cibulka, Martin Balko, Pavel Valtr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-15T14:19:29Z","title":"Drawing graphs using a small number of obstacles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04741","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:af8dcca61b1255508652890d34f1ffc549d10f8d71542a67991f8ead7f52a153","target":"record","created_at":"2026-05-18T00:40: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":"fca09c10910f4c424baa0b50358e0af7bb16fb9ee2c8ea3349acb34b226540d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-15T14:19:29Z","title_canon_sha256":"0ca6b69ac3b5724700152a12c962b67cd6af0c7b0a0053e97b8143b7b07b5d74"},"schema_version":"1.0","source":{"id":"1610.04741","kind":"arxiv","version":2}},"canonical_sha256":"0de188ebd45e7ea8016b0497497a0a0e685a89ec95ad1640240e3f2084c95fa7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0de188ebd45e7ea8016b0497497a0a0e685a89ec95ad1640240e3f2084c95fa7","first_computed_at":"2026-05-18T00:40:13.679881Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:13.679881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SZeaEwaNbaCJ55Mb6c1YzMqLorZNKZdb8/jR0GYmyCCdG0NKFBUmJTSZX2BYFXHEqfr9Rmu8PXfRPHNvromnDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:13.680503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04741","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af8dcca61b1255508652890d34f1ffc549d10f8d71542a67991f8ead7f52a153","sha256:b1aeeaf69edeb341de05e5c3a8f4e23e312bd33e80435e7e6f3dd7ab9b2e385c"],"state_sha256":"61aacbe2529178756c6f3ff7f0f03b6ed110c0042a8bc087ea9fa8246282d940"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GaydAC9YSNSbGMOH0i4yKgBvfqsAp5DH2yO6kl0A1x+jihh8bEikojqpkC+MiLOdcaJliB/LrtLjsTsMriWtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:43:48.117149Z","bundle_sha256":"859032a839120aa3231c035971f8863a49967e85607a2fde13d6bceea3a1b0fa"}}