{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VDREIKR4UPAV7CEEYXQPULIWEZ","short_pith_number":"pith:VDREIKR4","canonical_record":{"source":{"id":"1807.01247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-03T15:46:30Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"976fb8d07efa72ba08c4cbec7b562f0595ce29fc6da0490356e2857d2253ea6d","abstract_canon_sha256":"9bda3d7bd127f7eb88ff81550ffec9e875bff2d423fdf82c76fe2281a95803a7"},"schema_version":"1.0"},"canonical_sha256":"a8e2442a3ca3c15f8884c5e0fa2d16265cefb3302a165e370285593e7afb68e5","source":{"kind":"arxiv","id":"1807.01247","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01247","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01247v2","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01247","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"VDREIKR4UPAV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VDREIKR4UPAV7CEE","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VDREIKR4","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VDREIKR4UPAV7CEEYXQPULIWEZ","target":"record","payload":{"canonical_record":{"source":{"id":"1807.01247","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-03T15:46:30Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"976fb8d07efa72ba08c4cbec7b562f0595ce29fc6da0490356e2857d2253ea6d","abstract_canon_sha256":"9bda3d7bd127f7eb88ff81550ffec9e875bff2d423fdf82c76fe2281a95803a7"},"schema_version":"1.0"},"canonical_sha256":"a8e2442a3ca3c15f8884c5e0fa2d16265cefb3302a165e370285593e7afb68e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:03.729394Z","signature_b64":"36f8mKPxu4+SKnKRXWNwgLBKJdk6r/oa2Iv0hMFtp9oOFI1axOhbMDP3r+kVxdelm6D8wmgmVFYF8QEQa1l5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8e2442a3ca3c15f8884c5e0fa2d16265cefb3302a165e370285593e7afb68e5","last_reissued_at":"2026-05-18T00:09:03.728821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:03.728821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.01247","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:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xn0eocNpF3cGxV082hwhcC/LgZFFHClU+Nku2hftVhvtbz2nOIPJ3qFRXvAja7wjKSmtIS9tDfN+cRGZTQiFBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:02:18.305914Z"},"content_sha256":"b17dcbe8899678b2aa0d637f5e6ca58cbc44decd2164d5aee0edf4112e2f26ba","schema_version":"1.0","event_id":"sha256:b17dcbe8899678b2aa0d637f5e6ca58cbc44decd2164d5aee0edf4112e2f26ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VDREIKR4UPAV7CEEYXQPULIWEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Alessandra Tappini, Fabrizio Montecchiani, Giuseppe Liotta","submitted_at":"2018-07-03T15:46:30Z","abstract_excerpt":"An ortho-polygon visibility representation $\\Gamma$ of a $1$-plane graph $G$ (OPVR of $G$) is an embedding preserving drawing that maps each vertex of $G$ to a distinct orthogonal polygon and each edge of $G$ to a vertical or horizontal visibility between its end-vertices. The representation $\\Gamma$ has vertex complexity $k$ if every polygon of $\\Gamma$ has at most $k$ reflex corners. It is known that $3$-connected $1$-plane graphs admit an OPVR with vertex complexity at most twelve, while vertex complexity at least two may be required in some cases. In this paper, we reduce this gap by showi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01247","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:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTGcdzNoMcl6vDl8jQPpCVVY/dOvnScJsv9mPOeL3r/Hp1vXK9gGondoxFV1bltsZj6l/O0nfk/D31n942q7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:02:18.306588Z"},"content_sha256":"146bd67d073ba334c5394e5de50847feae1f25f49b8c3acd2dbf81ebe46f969d","schema_version":"1.0","event_id":"sha256:146bd67d073ba334c5394e5de50847feae1f25f49b8c3acd2dbf81ebe46f969d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/bundle.json","state_url":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/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-11T20:02:18Z","links":{"resolver":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ","bundle":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/bundle.json","state":"https://pith.science/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDREIKR4UPAV7CEEYXQPULIWEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VDREIKR4UPAV7CEEYXQPULIWEZ","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":"9bda3d7bd127f7eb88ff81550ffec9e875bff2d423fdf82c76fe2281a95803a7","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-03T15:46:30Z","title_canon_sha256":"976fb8d07efa72ba08c4cbec7b562f0595ce29fc6da0490356e2857d2253ea6d"},"schema_version":"1.0","source":{"id":"1807.01247","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01247","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01247v2","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01247","created_at":"2026-05-18T00:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"VDREIKR4UPAV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VDREIKR4UPAV7CEE","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VDREIKR4","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:146bd67d073ba334c5394e5de50847feae1f25f49b8c3acd2dbf81ebe46f969d","target":"graph","created_at":"2026-05-18T00:09:03Z","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 $\\Gamma$ of a $1$-plane graph $G$ (OPVR of $G$) is an embedding preserving drawing that maps each vertex of $G$ to a distinct orthogonal polygon and each edge of $G$ to a vertical or horizontal visibility between its end-vertices. The representation $\\Gamma$ has vertex complexity $k$ if every polygon of $\\Gamma$ has at most $k$ reflex corners. It is known that $3$-connected $1$-plane graphs admit an OPVR with vertex complexity at most twelve, while vertex complexity at least two may be required in some cases. In this paper, we reduce this gap by showi","authors_text":"Alessandra Tappini, Fabrizio Montecchiani, Giuseppe Liotta","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-03T15:46:30Z","title":"Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01247","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:b17dcbe8899678b2aa0d637f5e6ca58cbc44decd2164d5aee0edf4112e2f26ba","target":"record","created_at":"2026-05-18T00:09:03Z","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":"9bda3d7bd127f7eb88ff81550ffec9e875bff2d423fdf82c76fe2281a95803a7","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-03T15:46:30Z","title_canon_sha256":"976fb8d07efa72ba08c4cbec7b562f0595ce29fc6da0490356e2857d2253ea6d"},"schema_version":"1.0","source":{"id":"1807.01247","kind":"arxiv","version":2}},"canonical_sha256":"a8e2442a3ca3c15f8884c5e0fa2d16265cefb3302a165e370285593e7afb68e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8e2442a3ca3c15f8884c5e0fa2d16265cefb3302a165e370285593e7afb68e5","first_computed_at":"2026-05-18T00:09:03.728821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:03.728821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"36f8mKPxu4+SKnKRXWNwgLBKJdk6r/oa2Iv0hMFtp9oOFI1axOhbMDP3r+kVxdelm6D8wmgmVFYF8QEQa1l5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:03.729394Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01247","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b17dcbe8899678b2aa0d637f5e6ca58cbc44decd2164d5aee0edf4112e2f26ba","sha256:146bd67d073ba334c5394e5de50847feae1f25f49b8c3acd2dbf81ebe46f969d"],"state_sha256":"ba6af5bc73e2b5279992dab5ffeec9bccacbb22f86bc55d488b51354cfb3b68d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"THIJTtutMx1/XdQkNoJMBOw0J7s7FM2LAtB26iZBhfW4i5PKi5GGdMHxcpVUw75tDzJcQTdX1R4vdY7ZT71QBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:02:18.310454Z","bundle_sha256":"ac52f9903c9eef5ab2f84eec5e0e14576df3e583e9a4f3c80701d81dd70eaa99"}}