{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NNP4O5INXXAXTWXZ3IMMLN5QKO","short_pith_number":"pith:NNP4O5IN","schema_version":"1.0","canonical_sha256":"6b5fc7750dbdc179daf9da18c5b7b0539c0ef9aa6e7d1412d0ff6f26c1436d2b","source":{"kind":"arxiv","id":"1508.02616","version":2},"attestation_state":"computed","paper":{"title":"The Unit Bar Visibility Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emily Gaub, Michelle Rose, Paul S. Wenger","submitted_at":"2015-08-11T14:52:06Z","abstract_excerpt":"A \\textit{$t$-unit-bar representation} of a graph $G$ is an assignment of sets of at most $t$ horizontal unit-length segments in the plane to the vertices of $G$ so that (1) all of the segments are pairwise nonintersecting, and (2) two vertices $x$ and $y$ are adjacent if and only if there is a vertical channel of positive width connecting a segment assigned to $x$ and a segment assigned to $y$ that intersects no other segment. The \\textit{unit bar visibility number} of a graph $G$, denoted $ub(G)$, is the minimum $t$ such that $G$ has a $t$-unit-bar visibility representation. Our results incl"},"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":"1508.02616","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T14:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"99c13814eb716bea4330743363a85e0af117035e3553bd8bfa600dd1c8d97fbe","abstract_canon_sha256":"5f39e800da4a2296243abb70be0caa673ed097847dcbd041c0c033208ce0e232"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:00.452492Z","signature_b64":"46fqguW7n0jKfKuEfO/MWYK85Z/tISxN58N3/VRt+8gdFjxtCpTnOS6bLTG3UedjomDZKWC0fAq+DegQ4AZdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b5fc7750dbdc179daf9da18c5b7b0539c0ef9aa6e7d1412d0ff6f26c1436d2b","last_reissued_at":"2026-05-18T01:35:00.451755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:00.451755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Unit Bar Visibility Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emily Gaub, Michelle Rose, Paul S. Wenger","submitted_at":"2015-08-11T14:52:06Z","abstract_excerpt":"A \\textit{$t$-unit-bar representation} of a graph $G$ is an assignment of sets of at most $t$ horizontal unit-length segments in the plane to the vertices of $G$ so that (1) all of the segments are pairwise nonintersecting, and (2) two vertices $x$ and $y$ are adjacent if and only if there is a vertical channel of positive width connecting a segment assigned to $x$ and a segment assigned to $y$ that intersects no other segment. The \\textit{unit bar visibility number} of a graph $G$, denoted $ub(G)$, is the minimum $t$ such that $G$ has a $t$-unit-bar visibility representation. Our results incl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02616","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.02616","created_at":"2026-05-18T01:35:00.451864+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02616v2","created_at":"2026-05-18T01:35:00.451864+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02616","created_at":"2026-05-18T01:35:00.451864+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNP4O5INXXAX","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNP4O5INXXAXTWXZ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNP4O5IN","created_at":"2026-05-18T12:29:32.376354+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/NNP4O5INXXAXTWXZ3IMMLN5QKO","json":"https://pith.science/pith/NNP4O5INXXAXTWXZ3IMMLN5QKO.json","graph_json":"https://pith.science/api/pith-number/NNP4O5INXXAXTWXZ3IMMLN5QKO/graph.json","events_json":"https://pith.science/api/pith-number/NNP4O5INXXAXTWXZ3IMMLN5QKO/events.json","paper":"https://pith.science/paper/NNP4O5IN"},"agent_actions":{"view_html":"https://pith.science/pith/NNP4O5INXXAXTWXZ3IMMLN5QKO","download_json":"https://pith.science/pith/NNP4O5INXXAXTWXZ3IMMLN5QKO.json","view_paper":"https://pith.science/paper/NNP4O5IN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02616&json=true","fetch_graph":"https://pith.science/api/pith-number/NNP4O5INXXAXTWXZ3IMMLN5QKO/graph.json","fetch_events":"https://pith.science/api/pith-number/NNP4O5INXXAXTWXZ3IMMLN5QKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNP4O5INXXAXTWXZ3IMMLN5QKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNP4O5INXXAXTWXZ3IMMLN5QKO/action/storage_attestation","attest_author":"https://pith.science/pith/NNP4O5INXXAXTWXZ3IMMLN5QKO/action/author_attestation","sign_citation":"https://pith.science/pith/NNP4O5INXXAXTWXZ3IMMLN5QKO/action/citation_signature","submit_replication":"https://pith.science/pith/NNP4O5INXXAXTWXZ3IMMLN5QKO/action/replication_record"}},"created_at":"2026-05-18T01:35:00.451864+00:00","updated_at":"2026-05-18T01:35:00.451864+00:00"}