{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YLWHEIGRZAPK7VP22A3VC764TH","short_pith_number":"pith:YLWHEIGR","schema_version":"1.0","canonical_sha256":"c2ec7220d1c81eafd5fad037517fdc99c3d29965155efbd85a810c8c1ff6e5bd","source":{"kind":"arxiv","id":"1308.5079","version":1},"attestation_state":"computed","paper":{"title":"1-Visibility Representations of 1-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Franz J. Brandenburg","submitted_at":"2013-08-23T09:30:51Z","abstract_excerpt":"A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertex-segments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices; beyond that segments do not intersect. We generalize visibility to 1-visibility, where each edge- (vertex-) segment crosses at most one vertex- (edge-) segment. In other words, a vertex is crossed by at most one edge, and vice-versa. We show that 1-visibility properly extends 1-planarity and develop a linear time algorithm to compute a 1-visibility represen"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1308.5079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-23T09:30:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2d027d05fe1e2ea85d3ffdb3f8089fa9b572fe690a59acc9bfe83c196ec62c5e","abstract_canon_sha256":"bad33a3ac68e1b6dd088026ce80f540467b979a7ded1526d099cbc7f3c71f9df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:17.378002Z","signature_b64":"0mC5WCq3WBE/+YTTUKh3i93nP+JCTSt7o4Wp+eJuqfyLVZdNsUw78Jgu2MuSs0pQVxNRwIYIjQrUoG+kbcA2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2ec7220d1c81eafd5fad037517fdc99c3d29965155efbd85a810c8c1ff6e5bd","last_reissued_at":"2026-05-18T03:15:17.377249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:17.377249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"1-Visibility Representations of 1-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Franz J. Brandenburg","submitted_at":"2013-08-23T09:30:51Z","abstract_excerpt":"A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertex-segments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices; beyond that segments do not intersect. We generalize visibility to 1-visibility, where each edge- (vertex-) segment crosses at most one vertex- (edge-) segment. In other words, a vertex is crossed by at most one edge, and vice-versa. We show that 1-visibility properly extends 1-planarity and develop a linear time algorithm to compute a 1-visibility represen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5079","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.5079","created_at":"2026-05-18T03:15:17.377376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5079v1","created_at":"2026-05-18T03:15:17.377376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5079","created_at":"2026-05-18T03:15:17.377376+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLWHEIGRZAPK","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLWHEIGRZAPK7VP2","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLWHEIGR","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YLWHEIGRZAPK7VP22A3VC764TH","json":"https://pith.science/pith/YLWHEIGRZAPK7VP22A3VC764TH.json","graph_json":"https://pith.science/api/pith-number/YLWHEIGRZAPK7VP22A3VC764TH/graph.json","events_json":"https://pith.science/api/pith-number/YLWHEIGRZAPK7VP22A3VC764TH/events.json","paper":"https://pith.science/paper/YLWHEIGR"},"agent_actions":{"view_html":"https://pith.science/pith/YLWHEIGRZAPK7VP22A3VC764TH","download_json":"https://pith.science/pith/YLWHEIGRZAPK7VP22A3VC764TH.json","view_paper":"https://pith.science/paper/YLWHEIGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5079&json=true","fetch_graph":"https://pith.science/api/pith-number/YLWHEIGRZAPK7VP22A3VC764TH/graph.json","fetch_events":"https://pith.science/api/pith-number/YLWHEIGRZAPK7VP22A3VC764TH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLWHEIGRZAPK7VP22A3VC764TH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLWHEIGRZAPK7VP22A3VC764TH/action/storage_attestation","attest_author":"https://pith.science/pith/YLWHEIGRZAPK7VP22A3VC764TH/action/author_attestation","sign_citation":"https://pith.science/pith/YLWHEIGRZAPK7VP22A3VC764TH/action/citation_signature","submit_replication":"https://pith.science/pith/YLWHEIGRZAPK7VP22A3VC764TH/action/replication_record"}},"created_at":"2026-05-18T03:15:17.377376+00:00","updated_at":"2026-05-18T03:15:17.377376+00:00"}