{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UAR776CXBQT6SWQBJWPL2V737N","short_pith_number":"pith:UAR776CX","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"},"canonical_sha256":"a023fff8570c27e95a014d9ebd57fbfb4099edde6eb5f72fd81c3d5ad7173246","source":{"kind":"arxiv","id":"1609.00983","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00983","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00983v1","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00983","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"UAR776CXBQT6","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAR776CXBQT6SWQB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAR776CX","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UAR776CXBQT6SWQBJWPL2V737N","target":"record","payload":{"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"},"canonical_sha256":"a023fff8570c27e95a014d9ebd57fbfb4099edde6eb5f72fd81c3d5ad7173246","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"},"source_kind":"arxiv","source_id":"1609.00983","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BgyCyykFoB7MbZhSDdso3Q42JsJ2Nipt+NqxPR+rC0LrPult2nWJPW4sREap+V4sj9pCCispvz5FQOojyKfgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:26:48.615040Z"},"content_sha256":"ad80b61ed2f0d4112df07bbc2e72bd2bd3baba6840a63907dbf0df5714a92cda","schema_version":"1.0","event_id":"sha256:ad80b61ed2f0d4112df07bbc2e72bd2bd3baba6840a63907dbf0df5714a92cda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UAR776CXBQT6SWQBJWPL2V737N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z815F/F1PWLU8Mi5GkSBnJW0jThvXhQJb/+TzxdKgmNquoVaqsF6fN+ROZx51puCNKxmtHvdyD8bagwgbis8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:26:48.615671Z"},"content_sha256":"d56ad9aad30bbf9f497dbf0aa0076a3b3e3a52d8dd5086556bf61701aa79a2e3","schema_version":"1.0","event_id":"sha256:d56ad9aad30bbf9f497dbf0aa0076a3b3e3a52d8dd5086556bf61701aa79a2e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N/bundle.json","state_url":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAR776CXBQT6SWQBJWPL2V737N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T13:26:48Z","links":{"resolver":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N","bundle":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N/bundle.json","state":"https://pith.science/pith/UAR776CXBQT6SWQBJWPL2V737N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAR776CXBQT6SWQBJWPL2V737N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UAR776CXBQT6SWQBJWPL2V737N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e93671faa8f873bce5602ce89204b97a94fc74dc52af006a663599cef8f2460b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-04T20:18:25Z","title_canon_sha256":"9107d6a507c3057a669c902f92db64fc989c778f92c5303255265c6737f7e0bb"},"schema_version":"1.0","source":{"id":"1609.00983","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00983","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00983v1","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00983","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"UAR776CXBQT6","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAR776CXBQT6SWQB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAR776CX","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:d56ad9aad30bbf9f497dbf0aa0076a3b3e3a52d8dd5086556bf61701aa79a2e3","target":"graph","created_at":"2026-05-18T01:06:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Eric Peterson, Paul S. Wenger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-04T20:18:25Z","title":"Unit Hypercube Visibility Numbers of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00983","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ad80b61ed2f0d4112df07bbc2e72bd2bd3baba6840a63907dbf0df5714a92cda","target":"record","created_at":"2026-05-18T01:06:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e93671faa8f873bce5602ce89204b97a94fc74dc52af006a663599cef8f2460b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-04T20:18:25Z","title_canon_sha256":"9107d6a507c3057a669c902f92db64fc989c778f92c5303255265c6737f7e0bb"},"schema_version":"1.0","source":{"id":"1609.00983","kind":"arxiv","version":1}},"canonical_sha256":"a023fff8570c27e95a014d9ebd57fbfb4099edde6eb5f72fd81c3d5ad7173246","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a023fff8570c27e95a014d9ebd57fbfb4099edde6eb5f72fd81c3d5ad7173246","first_computed_at":"2026-05-18T01:06:19.391044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:19.391044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dsj8IAS7xCSYO0XVE5SwusMPjyKm5gh2f4TDN9Ru6tig678H1Mm8cKTskIckSsYrmHyLx6LiG454EwTG1MmlBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:19.391729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00983","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad80b61ed2f0d4112df07bbc2e72bd2bd3baba6840a63907dbf0df5714a92cda","sha256:d56ad9aad30bbf9f497dbf0aa0076a3b3e3a52d8dd5086556bf61701aa79a2e3"],"state_sha256":"5d2c39de0a4f4ee61559293bcd9d606d883564b1bd43b2ec4c1c4f41f0d934c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdFLe+SV9FpVWAhanHbeOsyHPXOENhEBSK6S5xZopUihdZou3NyryNQM38R4Vq7OhttsXyy20nmkNOzfC8XODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:26:48.618796Z","bundle_sha256":"10a0823bf18cb178f1b96bb0ef0e1289edae63a4a9ff69c3fc2b404beb0aac3b"}}