{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SLU44N7ZMAISJEEW7VTKSMKQI3","short_pith_number":"pith:SLU44N7Z","schema_version":"1.0","canonical_sha256":"92e9ce37f96011249096fd66a9315046caa90ae9b8394c137227b983c24c512b","source":{"kind":"arxiv","id":"1312.5520","version":1},"attestation_state":"computed","paper":{"title":"Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Giuseppe Liotta, Michael Kaufmann, Stephen Wismath, Tamara Mchedlidze, William Evans, William Lenhart","submitted_at":"2013-12-19T12:52:02Z","abstract_excerpt":"A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a $\\epsilon$-thick vertical line connecting them that intersects at most one other bar.\n  We explore the relation among weak (resp. strong) bar 1-visibility graphs and other nearly planar graph classes. In particular, we study their relation to 1-planar graphs, which have a drawing with at most one crossing per edge; quasi-planar graphs, which have a drawing with no three "},"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":"1312.5520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-19T12:52:02Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"07511dbc6c4f21d9aec0f5067477973ab7f02eef30cc905618db2173f0810e6f","abstract_canon_sha256":"26a2b6a44744ea1e6eabb168dc6e3c318c4ba2e9af84c82903070606d56faaa1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:14.607606Z","signature_b64":"cgOCBGTiiet5713kUpTBguJwrV+vyrgZuIInY/8Uw/lB3BTlUUlcKB1m6Y4gnmIXpwYj8vMpTmaE7aLnX6baCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92e9ce37f96011249096fd66a9315046caa90ae9b8394c137227b983c24c512b","last_reissued_at":"2026-05-18T03:04:14.607141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:14.607141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"cs.DS","authors_text":"Giuseppe Liotta, Michael Kaufmann, Stephen Wismath, Tamara Mchedlidze, William Evans, William Lenhart","submitted_at":"2013-12-19T12:52:02Z","abstract_excerpt":"A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a $\\epsilon$-thick vertical line connecting them that intersects at most one other bar.\n  We explore the relation among weak (resp. strong) bar 1-visibility graphs and other nearly planar graph classes. In particular, we study their relation to 1-planar graphs, which have a drawing with at most one crossing per edge; quasi-planar graphs, which have a drawing with no three "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5520","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":"1312.5520","created_at":"2026-05-18T03:04:14.607209+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.5520v1","created_at":"2026-05-18T03:04:14.607209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5520","created_at":"2026-05-18T03:04:14.607209+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLU44N7ZMAIS","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLU44N7ZMAISJEEW","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLU44N7Z","created_at":"2026-05-18T12:27:59.945178+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/SLU44N7ZMAISJEEW7VTKSMKQI3","json":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3.json","graph_json":"https://pith.science/api/pith-number/SLU44N7ZMAISJEEW7VTKSMKQI3/graph.json","events_json":"https://pith.science/api/pith-number/SLU44N7ZMAISJEEW7VTKSMKQI3/events.json","paper":"https://pith.science/paper/SLU44N7Z"},"agent_actions":{"view_html":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3","download_json":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3.json","view_paper":"https://pith.science/paper/SLU44N7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.5520&json=true","fetch_graph":"https://pith.science/api/pith-number/SLU44N7ZMAISJEEW7VTKSMKQI3/graph.json","fetch_events":"https://pith.science/api/pith-number/SLU44N7ZMAISJEEW7VTKSMKQI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/action/storage_attestation","attest_author":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/action/author_attestation","sign_citation":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/action/citation_signature","submit_replication":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/action/replication_record"}},"created_at":"2026-05-18T03:04:14.607209+00:00","updated_at":"2026-05-18T03:04:14.607209+00:00"}