{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YDVE7MOITU6ILCGIGW4JUJRIE7","short_pith_number":"pith:YDVE7MOI","schema_version":"1.0","canonical_sha256":"c0ea4fb1c89d3c8588c835b89a262827fc30276e2f449e1f0226cbcef87e6a1e","source":{"kind":"arxiv","id":"1302.4870","version":1},"attestation_state":"computed","paper":{"title":"Bar 1-Visibility Drawings of 1-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Arpita Roy, Md. Saidur Rahman, Shaheena Sultana, Suraiya Tairin","submitted_at":"2013-02-20T11:00:29Z","abstract_excerpt":"A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the horizontal line segments representing the end vertices and a vertical line segment corresponding to an edge intersects at most one bar which is not an end point of the edge. A graph $G$ is bar 1-visible if $G$ has a bar 1-visibility drawing. A graph $G$ is 1-planar if $G$ has a drawing in a 2-dimensional plane such that an edge crosses at most one ot"},"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":"1302.4870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-02-20T11:00:29Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"2f9a5088277e724a317e665c1f38d4ee78eb15ed9f08b8386576bad995442d7e","abstract_canon_sha256":"d6746a61a7d1c9745e25fd6ac798cf2344cfaecf4351933ff7c2da237bf6d379"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:10.751890Z","signature_b64":"1rlAw7UBtCFhp70iwkSpMoQp98Rh+0uYl5K60NOCN2k8gPEgKeCZmVlbR0b93h+BnQb0fbxtPykjSxBUF7bICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0ea4fb1c89d3c8588c835b89a262827fc30276e2f449e1f0226cbcef87e6a1e","last_reissued_at":"2026-05-18T03:33:10.751080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:10.751080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bar 1-Visibility Drawings of 1-Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Arpita Roy, Md. Saidur Rahman, Shaheena Sultana, Suraiya Tairin","submitted_at":"2013-02-20T11:00:29Z","abstract_excerpt":"A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the horizontal line segments representing the end vertices and a vertical line segment corresponding to an edge intersects at most one bar which is not an end point of the edge. A graph $G$ is bar 1-visible if $G$ has a bar 1-visibility drawing. A graph $G$ is 1-planar if $G$ has a drawing in a 2-dimensional plane such that an edge crosses at most one ot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4870","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":"1302.4870","created_at":"2026-05-18T03:33:10.751223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4870v1","created_at":"2026-05-18T03:33:10.751223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4870","created_at":"2026-05-18T03:33:10.751223+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDVE7MOITU6I","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDVE7MOITU6ILCGI","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDVE7MOI","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/YDVE7MOITU6ILCGIGW4JUJRIE7","json":"https://pith.science/pith/YDVE7MOITU6ILCGIGW4JUJRIE7.json","graph_json":"https://pith.science/api/pith-number/YDVE7MOITU6ILCGIGW4JUJRIE7/graph.json","events_json":"https://pith.science/api/pith-number/YDVE7MOITU6ILCGIGW4JUJRIE7/events.json","paper":"https://pith.science/paper/YDVE7MOI"},"agent_actions":{"view_html":"https://pith.science/pith/YDVE7MOITU6ILCGIGW4JUJRIE7","download_json":"https://pith.science/pith/YDVE7MOITU6ILCGIGW4JUJRIE7.json","view_paper":"https://pith.science/paper/YDVE7MOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4870&json=true","fetch_graph":"https://pith.science/api/pith-number/YDVE7MOITU6ILCGIGW4JUJRIE7/graph.json","fetch_events":"https://pith.science/api/pith-number/YDVE7MOITU6ILCGIGW4JUJRIE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDVE7MOITU6ILCGIGW4JUJRIE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDVE7MOITU6ILCGIGW4JUJRIE7/action/storage_attestation","attest_author":"https://pith.science/pith/YDVE7MOITU6ILCGIGW4JUJRIE7/action/author_attestation","sign_citation":"https://pith.science/pith/YDVE7MOITU6ILCGIGW4JUJRIE7/action/citation_signature","submit_replication":"https://pith.science/pith/YDVE7MOITU6ILCGIGW4JUJRIE7/action/replication_record"}},"created_at":"2026-05-18T03:33:10.751223+00:00","updated_at":"2026-05-18T03:33:10.751223+00:00"}