{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UAR776CXBQT6SWQBJWPL2V737N","short_pith_number":"pith:UAR776CX","schema_version":"1.0","canonical_sha256":"a023fff8570c27e95a014d9ebd57fbfb4099edde6eb5f72fd81c3d5ad7173246","source":{"kind":"arxiv","id":"1609.00983","version":1},"attestation_state":"computed","paper":{"title":"Unit Hypercube Visibility Numbers of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Peterson, Paul S. Wenger","submitted_at":"2016-09-04T20:18:25Z","abstract_excerpt":"A visibility representation of a graph $G$ is an assignment of the vertices of $G$ to geometric objects such that vertices are adjacent if and only if their corresponding objects are \"visible\" each other, that is, there is an uninterrupted channel, usually axis-aligned, between them. Depending on the objects and definition of visibility used, not all graphs are visibility graphs. In such situations, one may be able to obtain a visibility representation of a graph $G$ by allowing vertices to be assigned to more than one object. The {\\it visibility number} of a graph $G$ is the minimum $t$ such "},"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":"1609.00983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-04T20:18:25Z","cross_cats_sorted":[],"title_canon_sha256":"9107d6a507c3057a669c902f92db64fc989c778f92c5303255265c6737f7e0bb","abstract_canon_sha256":"e93671faa8f873bce5602ce89204b97a94fc74dc52af006a663599cef8f2460b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:19.391729Z","signature_b64":"Dsj8IAS7xCSYO0XVE5SwusMPjyKm5gh2f4TDN9Ru6tig678H1Mm8cKTskIckSsYrmHyLx6LiG454EwTG1MmlBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a023fff8570c27e95a014d9ebd57fbfb4099edde6eb5f72fd81c3d5ad7173246","last_reissued_at":"2026-05-18T01:06:19.391044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:19.391044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unit Hypercube Visibility Numbers of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Peterson, Paul S. Wenger","submitted_at":"2016-09-04T20:18:25Z","abstract_excerpt":"A visibility representation of a graph $G$ is an assignment of the vertices of $G$ to geometric objects such that vertices are adjacent if and only if their corresponding objects are \"visible\" each other, that is, there is an uninterrupted channel, usually axis-aligned, between them. Depending on the objects and definition of visibility used, not all graphs are visibility graphs. In such situations, one may be able to obtain a visibility representation of a graph $G$ by allowing vertices to be assigned to more than one object. The {\\it visibility number} of a graph $G$ is the minimum $t$ such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00983","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":"1609.00983","created_at":"2026-05-18T01:06:19.391148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00983v1","created_at":"2026-05-18T01:06:19.391148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00983","created_at":"2026-05-18T01:06:19.391148+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAR776CXBQT6","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAR776CXBQT6SWQB","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAR776CX","created_at":"2026-05-18T12:30:46.583412+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/UAR776CXBQT6SWQBJWPL2V737N","json":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N.json","graph_json":"https://pith.science/api/pith-number/UAR776CXBQT6SWQBJWPL2V737N/graph.json","events_json":"https://pith.science/api/pith-number/UAR776CXBQT6SWQBJWPL2V737N/events.json","paper":"https://pith.science/paper/UAR776CX"},"agent_actions":{"view_html":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N","download_json":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N.json","view_paper":"https://pith.science/paper/UAR776CX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00983&json=true","fetch_graph":"https://pith.science/api/pith-number/UAR776CXBQT6SWQBJWPL2V737N/graph.json","fetch_events":"https://pith.science/api/pith-number/UAR776CXBQT6SWQBJWPL2V737N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N/action/storage_attestation","attest_author":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N/action/author_attestation","sign_citation":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N/action/citation_signature","submit_replication":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N/action/replication_record"}},"created_at":"2026-05-18T01:06:19.391148+00:00","updated_at":"2026-05-18T01:06:19.391148+00:00"}