{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UU5FFIPYHVMMIZFO6S4SY27VNT","short_pith_number":"pith:UU5FFIPY","canonical_record":{"source":{"id":"1103.2724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-14T17:41:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d0c33094fa2594bf5a6506004844b5d1fc248d8fb4754d29e511dc51452e3128","abstract_canon_sha256":"271e6aa408f8e2296521335ef7f551c14d0825af806a0ea699c0aa43c362e81b"},"schema_version":"1.0"},"canonical_sha256":"a53a52a1f83d58c464aef4b92c6bf56cc6f80231a5bf0c83e72db61d68418e31","source":{"kind":"arxiv","id":"1103.2724","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2724","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2724v1","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2724","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"UU5FFIPYHVMM","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UU5FFIPYHVMMIZFO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UU5FFIPY","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UU5FFIPYHVMMIZFO6S4SY27VNT","target":"record","payload":{"canonical_record":{"source":{"id":"1103.2724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-14T17:41:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d0c33094fa2594bf5a6506004844b5d1fc248d8fb4754d29e511dc51452e3128","abstract_canon_sha256":"271e6aa408f8e2296521335ef7f551c14d0825af806a0ea699c0aa43c362e81b"},"schema_version":"1.0"},"canonical_sha256":"a53a52a1f83d58c464aef4b92c6bf56cc6f80231a5bf0c83e72db61d68418e31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:54.302244Z","signature_b64":"4V6khXYuofQVJXfCJDjy4TomnCl8j8eUc2zlHS4XickrlInWIkSGJRtaoZ9zZvGKFj73idHzGJubLClcIZ3tCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a53a52a1f83d58c464aef4b92c6bf56cc6f80231a5bf0c83e72db61d68418e31","last_reissued_at":"2026-05-18T04:26:54.301821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:54.301821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.2724","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:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+6GsKHoMpZC87BLpL4sInZUDWC2K+ZS8yqtnAZvpLuc+o7yW9260UVc3P7xH0ZoSCL4+GzbKS5OZZBrNB6osDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:27:23.659228Z"},"content_sha256":"cb4b13be6190af5ac5c985b5095e42634bb0acb1a78b272e7ed6d920a89fb2b7","schema_version":"1.0","event_id":"sha256:cb4b13be6190af5ac5c985b5095e42634bb0acb1a78b272e7ed6d920a89fb2b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UU5FFIPYHVMMIZFO6S4SY27VNT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds on the obstacle number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, J\\'anos Pach, Padmini Mukkamala","submitted_at":"2011-03-14T17:41:03Z","abstract_excerpt":"Given a graph $G$, an {\\em obstacle representation} of $G$ is a set of points in the plane representing the vertices of $G$, together with a set of connected obstacles such that two vertices of $G$ are joined by an edge if and only if the corresponding points can be connected by a segment which avoids all obstacles. The {\\em obstacle number} of $G$ is the minimum number of obstacles in an obstacle representation of $G$. It is shown that there are graphs on $n$ vertices with obstacle number at least $\\Omega({n}/{\\log n})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2724","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:26:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QqFCHqyjd3268LGnnpLuXSCyxSBjzyjlxZWzITZRvgKjc0yZvEKG35FtTSC4NjSjwKwoBdxKOUEbRrTl8Mn8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:27:23.659598Z"},"content_sha256":"4a82a8d7eb4f62e5ea2173a8ef265d1c88b26cceff59a1ccd0aef364704d8e0c","schema_version":"1.0","event_id":"sha256:4a82a8d7eb4f62e5ea2173a8ef265d1c88b26cceff59a1ccd0aef364704d8e0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/bundle.json","state_url":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/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-01T04:27:23Z","links":{"resolver":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT","bundle":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/bundle.json","state":"https://pith.science/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UU5FFIPYHVMMIZFO6S4SY27VNT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UU5FFIPYHVMMIZFO6S4SY27VNT","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":"271e6aa408f8e2296521335ef7f551c14d0825af806a0ea699c0aa43c362e81b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-14T17:41:03Z","title_canon_sha256":"d0c33094fa2594bf5a6506004844b5d1fc248d8fb4754d29e511dc51452e3128"},"schema_version":"1.0","source":{"id":"1103.2724","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.2724","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"arxiv_version","alias_value":"1103.2724v1","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2724","created_at":"2026-05-18T04:26:54Z"},{"alias_kind":"pith_short_12","alias_value":"UU5FFIPYHVMM","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UU5FFIPYHVMMIZFO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UU5FFIPY","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:4a82a8d7eb4f62e5ea2173a8ef265d1c88b26cceff59a1ccd0aef364704d8e0c","target":"graph","created_at":"2026-05-18T04:26:54Z","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":"Given a graph $G$, an {\\em obstacle representation} of $G$ is a set of points in the plane representing the vertices of $G$, together with a set of connected obstacles such that two vertices of $G$ are joined by an edge if and only if the corresponding points can be connected by a segment which avoids all obstacles. The {\\em obstacle number} of $G$ is the minimum number of obstacles in an obstacle representation of $G$. It is shown that there are graphs on $n$ vertices with obstacle number at least $\\Omega({n}/{\\log n})$.","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, J\\'anos Pach, Padmini Mukkamala","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-14T17:41:03Z","title":"Lower bounds on the obstacle number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2724","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:cb4b13be6190af5ac5c985b5095e42634bb0acb1a78b272e7ed6d920a89fb2b7","target":"record","created_at":"2026-05-18T04:26:54Z","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":"271e6aa408f8e2296521335ef7f551c14d0825af806a0ea699c0aa43c362e81b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-14T17:41:03Z","title_canon_sha256":"d0c33094fa2594bf5a6506004844b5d1fc248d8fb4754d29e511dc51452e3128"},"schema_version":"1.0","source":{"id":"1103.2724","kind":"arxiv","version":1}},"canonical_sha256":"a53a52a1f83d58c464aef4b92c6bf56cc6f80231a5bf0c83e72db61d68418e31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a53a52a1f83d58c464aef4b92c6bf56cc6f80231a5bf0c83e72db61d68418e31","first_computed_at":"2026-05-18T04:26:54.301821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:54.301821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4V6khXYuofQVJXfCJDjy4TomnCl8j8eUc2zlHS4XickrlInWIkSGJRtaoZ9zZvGKFj73idHzGJubLClcIZ3tCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:54.302244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.2724","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb4b13be6190af5ac5c985b5095e42634bb0acb1a78b272e7ed6d920a89fb2b7","sha256:4a82a8d7eb4f62e5ea2173a8ef265d1c88b26cceff59a1ccd0aef364704d8e0c"],"state_sha256":"97be2cd366849b9b4904e4fdf1377187153f5ee2906a444e217340cfff23d05b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkV1xHCyRGxIKkYNUTWSPjq7hx1n0Iar/F9J5cYoX4b+/PVaSh/mhf0JQb0Y4MBNMZROuAkjAvIGmmJRdapiCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:27:23.661712Z","bundle_sha256":"f0b2a5886320984e764ac4ab7228dd422359c5ee0a8265cdd75986cb7e359358"}}