{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7BKDJQEKWOTMDZQONJXUXRVM33","short_pith_number":"pith:7BKDJQEK","canonical_record":{"source":{"id":"1604.08797","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-29T12:35:54Z","cross_cats_sorted":[],"title_canon_sha256":"d71707cb3881cb1eb197b3ceeb6192dac172bf01b065b29a77b1fe3bb234e2f2","abstract_canon_sha256":"7f941d37644cf199f1e0e499a54090a40d23ca58feb5aa42e93bf05cb4cf092f"},"schema_version":"1.0"},"canonical_sha256":"f85434c08ab3a6c1e60e6a6f4bc6acdedb2db00ecda0b3a7bba7596d474eae7a","source":{"kind":"arxiv","id":"1604.08797","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08797","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08797v3","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08797","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"7BKDJQEKWOTM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7BKDJQEKWOTMDZQO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7BKDJQEK","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7BKDJQEKWOTMDZQONJXUXRVM33","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08797","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-29T12:35:54Z","cross_cats_sorted":[],"title_canon_sha256":"d71707cb3881cb1eb197b3ceeb6192dac172bf01b065b29a77b1fe3bb234e2f2","abstract_canon_sha256":"7f941d37644cf199f1e0e499a54090a40d23ca58feb5aa42e93bf05cb4cf092f"},"schema_version":"1.0"},"canonical_sha256":"f85434c08ab3a6c1e60e6a6f4bc6acdedb2db00ecda0b3a7bba7596d474eae7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:24.757311Z","signature_b64":"DOqpWvqn8dIa8zHtfKxHq4cOzAzkZgzRefQbGkBekhDVVSAkRlTLYoIKo7c60a9uNoVLUmL+RR/xVv2XQKwKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f85434c08ab3a6c1e60e6a6f4bc6acdedb2db00ecda0b3a7bba7596d474eae7a","last_reissued_at":"2026-05-18T00:44:24.756598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:24.756598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08797","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-18T00:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrLSWv5xGDVRT7KTokm9xhyar6sQMYDPCJQITJ9o59Q2bIA7aIvM/YiRwwDVYrHvGD+MrbZnIlrqcwE1n5IUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:57:08.115156Z"},"content_sha256":"f90d3330d2ad6b247733732367a5297647bfa7415b6c8d8db2ece156e7ec17f9","schema_version":"1.0","event_id":"sha256:f90d3330d2ad6b247733732367a5297647bfa7415b6c8d8db2ece156e7ec17f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7BKDJQEKWOTMDZQONJXUXRVM33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ortho-polygon Visibility Representations of Embedded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath, Walter Didimo, William S. Evans","submitted_at":"2016-04-29T12:35:54Z","abstract_excerpt":"An ortho-polygon visibility representation of an $n$-vertex embedded graph $G$ (OPVR of $G$) is an embedding-preserving drawing of $G$ that maps every vertex to a distinct orthogonal polygon and each edge to a vertical or horizontal visibility between its end-vertices. The vertex complexity of an OPVR of $G$ is the minimum $k$ such that every polygon has at most $k$ reflex corners. We present polynomial time algorithms that test whether $G$ has an OPVR and, if so, compute one of minimum vertex complexity. We argue that the existence and the vertex complexity of an OPVR of $G$ are related to it"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08797","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-18T00:44:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOVBYN/hqX60oZxjwOgb21vQU1fAVnBJf/TWUvcxNR2+sXeUhZbvodem+56cE9nyOPNILuDen1T5gZMIiei8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:57:08.115606Z"},"content_sha256":"7e57b3720b24c64588abf768b9e490e0f1ec3504eefa5eecd03e5d254f94a562","schema_version":"1.0","event_id":"sha256:7e57b3720b24c64588abf768b9e490e0f1ec3504eefa5eecd03e5d254f94a562"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33/bundle.json","state_url":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BKDJQEKWOTMDZQONJXUXRVM33/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-21T23:57:08Z","links":{"resolver":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33","bundle":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33/bundle.json","state":"https://pith.science/pith/7BKDJQEKWOTMDZQONJXUXRVM33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BKDJQEKWOTMDZQONJXUXRVM33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7BKDJQEKWOTMDZQONJXUXRVM33","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":"7f941d37644cf199f1e0e499a54090a40d23ca58feb5aa42e93bf05cb4cf092f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-29T12:35:54Z","title_canon_sha256":"d71707cb3881cb1eb197b3ceeb6192dac172bf01b065b29a77b1fe3bb234e2f2"},"schema_version":"1.0","source":{"id":"1604.08797","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08797","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08797v3","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08797","created_at":"2026-05-18T00:44:24Z"},{"alias_kind":"pith_short_12","alias_value":"7BKDJQEKWOTM","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7BKDJQEKWOTMDZQO","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7BKDJQEK","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:7e57b3720b24c64588abf768b9e490e0f1ec3504eefa5eecd03e5d254f94a562","target":"graph","created_at":"2026-05-18T00:44:24Z","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 ortho-polygon visibility representation of an $n$-vertex embedded graph $G$ (OPVR of $G$) is an embedding-preserving drawing of $G$ that maps every vertex to a distinct orthogonal polygon and each edge to a vertical or horizontal visibility between its end-vertices. The vertex complexity of an OPVR of $G$ is the minimum $k$ such that every polygon has at most $k$ reflex corners. We present polynomial time algorithms that test whether $G$ has an OPVR and, if so, compute one of minimum vertex complexity. We argue that the existence and the vertex complexity of an OPVR of $G$ are related to it","authors_text":"Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath, Walter Didimo, William S. Evans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-29T12:35:54Z","title":"Ortho-polygon Visibility Representations of Embedded Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08797","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:f90d3330d2ad6b247733732367a5297647bfa7415b6c8d8db2ece156e7ec17f9","target":"record","created_at":"2026-05-18T00:44:24Z","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":"7f941d37644cf199f1e0e499a54090a40d23ca58feb5aa42e93bf05cb4cf092f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-04-29T12:35:54Z","title_canon_sha256":"d71707cb3881cb1eb197b3ceeb6192dac172bf01b065b29a77b1fe3bb234e2f2"},"schema_version":"1.0","source":{"id":"1604.08797","kind":"arxiv","version":3}},"canonical_sha256":"f85434c08ab3a6c1e60e6a6f4bc6acdedb2db00ecda0b3a7bba7596d474eae7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f85434c08ab3a6c1e60e6a6f4bc6acdedb2db00ecda0b3a7bba7596d474eae7a","first_computed_at":"2026-05-18T00:44:24.756598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:24.756598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DOqpWvqn8dIa8zHtfKxHq4cOzAzkZgzRefQbGkBekhDVVSAkRlTLYoIKo7c60a9uNoVLUmL+RR/xVv2XQKwKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:24.757311Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08797","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f90d3330d2ad6b247733732367a5297647bfa7415b6c8d8db2ece156e7ec17f9","sha256:7e57b3720b24c64588abf768b9e490e0f1ec3504eefa5eecd03e5d254f94a562"],"state_sha256":"9ae846cd83043cee463f0f251be141d23eee6fbb5de467795a52032417729f21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dyKdmcEn0kk7+UE8G3/rfdGO73/AjARJOQzmkYwkPU2WpKQH7TjojfaEdg1MpVHvvvpOAKQcbs12AdsnFemfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T23:57:08.118827Z","bundle_sha256":"333d2e20aefc9e26fcf29d48a323e2d1a34a358903fae40cdd072f30419f6483"}}