{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HCI4QI7PFFGBJXOS6KUU65FNTY","short_pith_number":"pith:HCI4QI7P","canonical_record":{"source":{"id":"1709.06965","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-20T16:58:01Z","cross_cats_sorted":[],"title_canon_sha256":"a968152ff5260b831647cbac4ef4a052a64d73b2f6f62eb5c304d6a0c228ffc8","abstract_canon_sha256":"859a61b5b91327d86167fb480d7c2c5456c938cf26239b7db26eb95caf14ca9f"},"schema_version":"1.0"},"canonical_sha256":"3891c823ef294c14ddd2f2a94f74ad9e3eabd1588cbf6f7a6c28f6bf19840cb3","source":{"kind":"arxiv","id":"1709.06965","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06965","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06965v3","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06965","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"HCI4QI7PFFGB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HCI4QI7PFFGBJXOS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HCI4QI7P","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HCI4QI7PFFGBJXOS6KUU65FNTY","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06965","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-20T16:58:01Z","cross_cats_sorted":[],"title_canon_sha256":"a968152ff5260b831647cbac4ef4a052a64d73b2f6f62eb5c304d6a0c228ffc8","abstract_canon_sha256":"859a61b5b91327d86167fb480d7c2c5456c938cf26239b7db26eb95caf14ca9f"},"schema_version":"1.0"},"canonical_sha256":"3891c823ef294c14ddd2f2a94f74ad9e3eabd1588cbf6f7a6c28f6bf19840cb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:53.161563Z","signature_b64":"fxeySuH+R33jwGJOkwklCy68mghDaph3F8nU6GHMZioibwgrKKKlNnqvu4dEQVWtwzWCFV0+9smKzopkuZrABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3891c823ef294c14ddd2f2a94f74ad9e3eabd1588cbf6f7a6c28f6bf19840cb3","last_reissued_at":"2026-05-17T23:49:53.161141Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:53.161141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06965","source_version":3,"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-17T23:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLvFbXwvOkGEK/FkwkI94baTi6akYKg70lXlGZ5Iu/eWu3PDgQg2ibJhqB1x7bAw9Hc3vziQpBJotujzSb+wDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:38:49.956831Z"},"content_sha256":"9e36ad6fa643c07f4b54b1826ef1e16840a51969bbaf990cfa0d552cd656d18b","schema_version":"1.0","event_id":"sha256:9e36ad6fa643c07f4b54b1826ef1e16840a51969bbaf990cfa0d552cd656d18b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HCI4QI7PFFGBJXOS6KUU65FNTY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Drawing Graphs on Few Circles and Few Spheres","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Ravsky, Alexander Wolff, Myroslav Kryven","submitted_at":"2017-09-20T16:58:01Z","abstract_excerpt":"Given a drawing of a graph, its \\emph{visual complexity} is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in 2D). Recently, Chaplick et al. [GD 2016] introduced a different measure for the visual complexity, the \\emph{affine cover number}, which is the minimum number of lines (or planes) that together cover a crossing-free straight-line drawing of a graph $G$ in 2D (3D). In this paper, we introduce the \\emph{spherical cover number}, which is the minimum number of circ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06965","kind":"arxiv","version":3},"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-17T23:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFZjgYkx/Mp88KL1M0H8p6pqaLHVimLd1L0YvYyNBgiyc6aD52r1h64g/1cVMPsNpThTzmMEu9mBQvnsqvxuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:38:49.957443Z"},"content_sha256":"a454922147195fbefc02493fb31534b2cfb19b1428fa744a4905a9c93fe664f1","schema_version":"1.0","event_id":"sha256:a454922147195fbefc02493fb31534b2cfb19b1428fa744a4905a9c93fe664f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCI4QI7PFFGBJXOS6KUU65FNTY/bundle.json","state_url":"https://pith.science/pith/HCI4QI7PFFGBJXOS6KUU65FNTY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCI4QI7PFFGBJXOS6KUU65FNTY/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-31T08:38:49Z","links":{"resolver":"https://pith.science/pith/HCI4QI7PFFGBJXOS6KUU65FNTY","bundle":"https://pith.science/pith/HCI4QI7PFFGBJXOS6KUU65FNTY/bundle.json","state":"https://pith.science/pith/HCI4QI7PFFGBJXOS6KUU65FNTY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCI4QI7PFFGBJXOS6KUU65FNTY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HCI4QI7PFFGBJXOS6KUU65FNTY","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":"859a61b5b91327d86167fb480d7c2c5456c938cf26239b7db26eb95caf14ca9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-20T16:58:01Z","title_canon_sha256":"a968152ff5260b831647cbac4ef4a052a64d73b2f6f62eb5c304d6a0c228ffc8"},"schema_version":"1.0","source":{"id":"1709.06965","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06965","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06965v3","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06965","created_at":"2026-05-17T23:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"HCI4QI7PFFGB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HCI4QI7PFFGBJXOS","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HCI4QI7P","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:a454922147195fbefc02493fb31534b2cfb19b1428fa744a4905a9c93fe664f1","target":"graph","created_at":"2026-05-17T23:49:53Z","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":"Given a drawing of a graph, its \\emph{visual complexity} is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in 2D). Recently, Chaplick et al. [GD 2016] introduced a different measure for the visual complexity, the \\emph{affine cover number}, which is the minimum number of lines (or planes) that together cover a crossing-free straight-line drawing of a graph $G$ in 2D (3D). In this paper, we introduce the \\emph{spherical cover number}, which is the minimum number of circ","authors_text":"Alexander Ravsky, Alexander Wolff, Myroslav Kryven","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-20T16:58:01Z","title":"Drawing Graphs on Few Circles and Few Spheres"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06965","kind":"arxiv","version":3},"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:9e36ad6fa643c07f4b54b1826ef1e16840a51969bbaf990cfa0d552cd656d18b","target":"record","created_at":"2026-05-17T23:49:53Z","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":"859a61b5b91327d86167fb480d7c2c5456c938cf26239b7db26eb95caf14ca9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-09-20T16:58:01Z","title_canon_sha256":"a968152ff5260b831647cbac4ef4a052a64d73b2f6f62eb5c304d6a0c228ffc8"},"schema_version":"1.0","source":{"id":"1709.06965","kind":"arxiv","version":3}},"canonical_sha256":"3891c823ef294c14ddd2f2a94f74ad9e3eabd1588cbf6f7a6c28f6bf19840cb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3891c823ef294c14ddd2f2a94f74ad9e3eabd1588cbf6f7a6c28f6bf19840cb3","first_computed_at":"2026-05-17T23:49:53.161141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:53.161141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fxeySuH+R33jwGJOkwklCy68mghDaph3F8nU6GHMZioibwgrKKKlNnqvu4dEQVWtwzWCFV0+9smKzopkuZrABw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:53.161563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06965","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e36ad6fa643c07f4b54b1826ef1e16840a51969bbaf990cfa0d552cd656d18b","sha256:a454922147195fbefc02493fb31534b2cfb19b1428fa744a4905a9c93fe664f1"],"state_sha256":"71031f323171a04fccb9dae9e67e0c271dc0097015e2a2e91a9dff53bce1211d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfWNXsh1hC77ZkSZYHNzmN51yF7P94LMdDY0AoIVr49TTMtHs8OyDw3bnuwEIUxb1LdmwXK1dx0xe+RdFjSFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:38:49.960929Z","bundle_sha256":"690b71d15224441e506b3957fa741abee45a6f502f224d0b1a08338f2699dc6c"}}