{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:STPUEJGTEDXNYELLNGDJBRTYL4","short_pith_number":"pith:STPUEJGT","canonical_record":{"source":{"id":"0705.3748","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2007-05-25T11:19:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b992ac3f871ddc1141ac6446b9238980707f24100dff4a59fd3ff4d69b3c9460","abstract_canon_sha256":"4d6396d2135f8f336a7b7676245668ca8ff2556a50c36e74b503004688e88397"},"schema_version":"1.0"},"canonical_sha256":"94df4224d320eedc116b698690c6785f384e535a28f9ce61d0a1c342f82886de","source":{"kind":"arxiv","id":"0705.3748","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.3748","created_at":"2026-05-18T04:09:16Z"},{"alias_kind":"arxiv_version","alias_value":"0705.3748v3","created_at":"2026-05-18T04:09:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.3748","created_at":"2026-05-18T04:09:16Z"},{"alias_kind":"pith_short_12","alias_value":"STPUEJGTEDXN","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"STPUEJGTEDXNYELL","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"STPUEJGT","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:STPUEJGTEDXNYELLNGDJBRTYL4","target":"record","payload":{"canonical_record":{"source":{"id":"0705.3748","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2007-05-25T11:19:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b992ac3f871ddc1141ac6446b9238980707f24100dff4a59fd3ff4d69b3c9460","abstract_canon_sha256":"4d6396d2135f8f336a7b7676245668ca8ff2556a50c36e74b503004688e88397"},"schema_version":"1.0"},"canonical_sha256":"94df4224d320eedc116b698690c6785f384e535a28f9ce61d0a1c342f82886de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:16.478075Z","signature_b64":"OohPxlWeRN1GBov30n1qIY9bieGmkftyClaAZZ0QfIR7j6h51in+ZaK/qJGFvXSnVXcuR57y7e33TthTptUGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94df4224d320eedc116b698690c6785f384e535a28f9ce61d0a1c342f82886de","last_reissued_at":"2026-05-18T04:09:16.477677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:16.477677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0705.3748","source_version":3,"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:09:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5b0P3hIa8YSxFkfVD0ep5cFn38oWo0k9rGMPBkVQ1ForqC1cJ/UHM9COGd5ExK0LK0DdTx7odNolfYhYLSqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:35:01.833213Z"},"content_sha256":"0308aa3275049e5f70361cabbd31c700042d816c0f65265c755f1a57adc23391","schema_version":"1.0","event_id":"sha256:0308aa3275049e5f70361cabbd31c700042d816c0f65265c755f1a57adc23391"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:STPUEJGTEDXNYELLNGDJBRTYL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Obfuscation Complexity of Planar Graphs","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Oleg Verbitsky","submitted_at":"2007-05-25T11:19:03Z","abstract_excerpt":"Being motivated by John Tantalo's Planarity Game, we consider straight line plane drawings of a planar graph $G$ with edge crossings and wonder how obfuscated such drawings can be. We define $obf(G)$, the obfuscation complexity of $G$, to be the maximum number of edge crossings in a drawing of $G$. Relating $obf(G)$ to the distribution of vertex degrees in $G$, we show an efficient way of constructing a drawing of $G$ with at least $obf(G)/3$ edge crossings. We prove bounds $(\\delta(G)^2/24-o(1))n^2 < \\obf G <3 n^2$ for an $n$-vertex planar graph $G$ with minimum vertex degree $\\delta(G)\\ge 2$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.3748","kind":"arxiv","version":3},"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:09:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gcno6TvKj5ZOW9eOKHWqgXPOxJD2mrEL9ADs/ES5XuTh409Cs2kWM8iQ5qvpjDbiK1ZXlzt/m+HQFOlXl130CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:35:01.833820Z"},"content_sha256":"6f569f13837ec05c06ee92078acca092ae00a3f219e226a2c86c296cbc948c80","schema_version":"1.0","event_id":"sha256:6f569f13837ec05c06ee92078acca092ae00a3f219e226a2c86c296cbc948c80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/STPUEJGTEDXNYELLNGDJBRTYL4/bundle.json","state_url":"https://pith.science/pith/STPUEJGTEDXNYELLNGDJBRTYL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/STPUEJGTEDXNYELLNGDJBRTYL4/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-26T23:35:01Z","links":{"resolver":"https://pith.science/pith/STPUEJGTEDXNYELLNGDJBRTYL4","bundle":"https://pith.science/pith/STPUEJGTEDXNYELLNGDJBRTYL4/bundle.json","state":"https://pith.science/pith/STPUEJGTEDXNYELLNGDJBRTYL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/STPUEJGTEDXNYELLNGDJBRTYL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:STPUEJGTEDXNYELLNGDJBRTYL4","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":"4d6396d2135f8f336a7b7676245668ca8ff2556a50c36e74b503004688e88397","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"cs.DM","submitted_at":"2007-05-25T11:19:03Z","title_canon_sha256":"b992ac3f871ddc1141ac6446b9238980707f24100dff4a59fd3ff4d69b3c9460"},"schema_version":"1.0","source":{"id":"0705.3748","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.3748","created_at":"2026-05-18T04:09:16Z"},{"alias_kind":"arxiv_version","alias_value":"0705.3748v3","created_at":"2026-05-18T04:09:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.3748","created_at":"2026-05-18T04:09:16Z"},{"alias_kind":"pith_short_12","alias_value":"STPUEJGTEDXN","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"STPUEJGTEDXNYELL","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"STPUEJGT","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:6f569f13837ec05c06ee92078acca092ae00a3f219e226a2c86c296cbc948c80","target":"graph","created_at":"2026-05-18T04:09:16Z","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":"Being motivated by John Tantalo's Planarity Game, we consider straight line plane drawings of a planar graph $G$ with edge crossings and wonder how obfuscated such drawings can be. We define $obf(G)$, the obfuscation complexity of $G$, to be the maximum number of edge crossings in a drawing of $G$. Relating $obf(G)$ to the distribution of vertex degrees in $G$, we show an efficient way of constructing a drawing of $G$ with at least $obf(G)/3$ edge crossings. We prove bounds $(\\delta(G)^2/24-o(1))n^2 < \\obf G <3 n^2$ for an $n$-vertex planar graph $G$ with minimum vertex degree $\\delta(G)\\ge 2$","authors_text":"Oleg Verbitsky","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"cs.DM","submitted_at":"2007-05-25T11:19:03Z","title":"On the Obfuscation Complexity of Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.3748","kind":"arxiv","version":3},"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:0308aa3275049e5f70361cabbd31c700042d816c0f65265c755f1a57adc23391","target":"record","created_at":"2026-05-18T04:09:16Z","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":"4d6396d2135f8f336a7b7676245668ca8ff2556a50c36e74b503004688e88397","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"cs.DM","submitted_at":"2007-05-25T11:19:03Z","title_canon_sha256":"b992ac3f871ddc1141ac6446b9238980707f24100dff4a59fd3ff4d69b3c9460"},"schema_version":"1.0","source":{"id":"0705.3748","kind":"arxiv","version":3}},"canonical_sha256":"94df4224d320eedc116b698690c6785f384e535a28f9ce61d0a1c342f82886de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94df4224d320eedc116b698690c6785f384e535a28f9ce61d0a1c342f82886de","first_computed_at":"2026-05-18T04:09:16.477677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:16.477677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OohPxlWeRN1GBov30n1qIY9bieGmkftyClaAZZ0QfIR7j6h51in+ZaK/qJGFvXSnVXcuR57y7e33TthTptUGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:16.478075Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.3748","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0308aa3275049e5f70361cabbd31c700042d816c0f65265c755f1a57adc23391","sha256:6f569f13837ec05c06ee92078acca092ae00a3f219e226a2c86c296cbc948c80"],"state_sha256":"22a22b854bf82f55932735e5f0ce86a6cf93f6fc0ee2f399c97af43bf428ab25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4j2O2GaLmyAlAlO2lmw7ma6DqDYX85gFbeQHYPUl62i4B+Ru9cQ9asXWRJYv06j4UcrREVs+RaN8qAf39xuaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:35:01.836296Z","bundle_sha256":"6539a6167a209a9ea067d246add89c03bc71d8d596b012e06bba66c886776973"}}