{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SLU44N7ZMAISJEEW7VTKSMKQI3","short_pith_number":"pith:SLU44N7Z","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"},"canonical_sha256":"92e9ce37f96011249096fd66a9315046caa90ae9b8394c137227b983c24c512b","source":{"kind":"arxiv","id":"1312.5520","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5520","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5520v1","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5520","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"SLU44N7ZMAIS","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SLU44N7ZMAISJEEW","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SLU44N7Z","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SLU44N7ZMAISJEEW7VTKSMKQI3","target":"record","payload":{"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"},"canonical_sha256":"92e9ce37f96011249096fd66a9315046caa90ae9b8394c137227b983c24c512b","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"},"source_kind":"arxiv","source_id":"1312.5520","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-18T03:04:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5DIHn4JRHWRw5V8pydSuuPu23xu2GYxOtkngpgu3YKvjZ1oHa+jZSFafMyxAjNk/FuRAcOqvNpl6RKU8UZ+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:22:06.278683Z"},"content_sha256":"ad9a71152b9bbdbe4814c24f4385484d6266838606f2545b5a08b5c5a8fb70c6","schema_version":"1.0","event_id":"sha256:ad9a71152b9bbdbe4814c24f4385484d6266838606f2545b5a08b5c5a8fb70c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SLU44N7ZMAISJEEW7VTKSMKQI3","target":"graph","payload":{"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"},"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-18T03:04:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wx8LTQgEUFWbUmgL8Bda1SN1ZxDWXFZXu31724fgZa5+qx4/E6sluFa0npcoePmyJmihNhMk4Klum/rX58LqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:22:06.279064Z"},"content_sha256":"a36e13f7e1dc5df2cc4d812402b59ccf8d33212c34923234ebd735840bae982e","schema_version":"1.0","event_id":"sha256:a36e13f7e1dc5df2cc4d812402b59ccf8d33212c34923234ebd735840bae982e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/bundle.json","state_url":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/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-27T23:22:06Z","links":{"resolver":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3","bundle":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/bundle.json","state":"https://pith.science/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLU44N7ZMAISJEEW7VTKSMKQI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SLU44N7ZMAISJEEW7VTKSMKQI3","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":"26a2b6a44744ea1e6eabb168dc6e3c318c4ba2e9af84c82903070606d56faaa1","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-19T12:52:02Z","title_canon_sha256":"07511dbc6c4f21d9aec0f5067477973ab7f02eef30cc905618db2173f0810e6f"},"schema_version":"1.0","source":{"id":"1312.5520","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5520","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5520v1","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5520","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"SLU44N7ZMAIS","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SLU44N7ZMAISJEEW","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SLU44N7Z","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:a36e13f7e1dc5df2cc4d812402b59ccf8d33212c34923234ebd735840bae982e","target":"graph","created_at":"2026-05-18T03:04:14Z","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 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 ","authors_text":"Giuseppe Liotta, Michael Kaufmann, Stephen Wismath, Tamara Mchedlidze, William Evans, William Lenhart","cross_cats":["cs.CG","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-19T12:52:02Z","title":"Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5520","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:ad9a71152b9bbdbe4814c24f4385484d6266838606f2545b5a08b5c5a8fb70c6","target":"record","created_at":"2026-05-18T03:04:14Z","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":"26a2b6a44744ea1e6eabb168dc6e3c318c4ba2e9af84c82903070606d56faaa1","cross_cats_sorted":["cs.CG","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-19T12:52:02Z","title_canon_sha256":"07511dbc6c4f21d9aec0f5067477973ab7f02eef30cc905618db2173f0810e6f"},"schema_version":"1.0","source":{"id":"1312.5520","kind":"arxiv","version":1}},"canonical_sha256":"92e9ce37f96011249096fd66a9315046caa90ae9b8394c137227b983c24c512b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92e9ce37f96011249096fd66a9315046caa90ae9b8394c137227b983c24c512b","first_computed_at":"2026-05-18T03:04:14.607141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:14.607141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cgOCBGTiiet5713kUpTBguJwrV+vyrgZuIInY/8Uw/lB3BTlUUlcKB1m6Y4gnmIXpwYj8vMpTmaE7aLnX6baCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:14.607606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5520","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad9a71152b9bbdbe4814c24f4385484d6266838606f2545b5a08b5c5a8fb70c6","sha256:a36e13f7e1dc5df2cc4d812402b59ccf8d33212c34923234ebd735840bae982e"],"state_sha256":"b0f9b4e6e4bca5c577dc3ada1483ae17a36ae4f1ec8b513b5ecbb3af615ac95f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EV3nQWB/T82qBfONeBJW2VXEno4wVrG/Fvn5jowdQiK3LU13Szbl6DD0s3U2CpiK3PW2SrWOVJlDRmhBZaE8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:22:06.281514Z","bundle_sha256":"c3895754ef76b2ff6ac55a85f1b6c721ecbd579bddb0b8fe3524f46894e79458"}}