{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C7XKF7EJ56O442BJEWEWW7KJ65","short_pith_number":"pith:C7XKF7EJ","canonical_record":{"source":{"id":"1611.06529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T15:32:27Z","cross_cats_sorted":[],"title_canon_sha256":"c1a6f4a6ee12a571ddf5dbd8970d816680acc08ad7b91f1523412845b1921d6d","abstract_canon_sha256":"779a74d8d0dac6c46fe941db8222b5719d807874828ee9c960ba0c92e9a1cf22"},"schema_version":"1.0"},"canonical_sha256":"17eea2fc89ef9dce682925896b7d49f74e2506bc1a0fff5f01f3616395070091","source":{"kind":"arxiv","id":"1611.06529","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06529","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06529v1","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06529","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"C7XKF7EJ56O4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C7XKF7EJ56O442BJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C7XKF7EJ","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C7XKF7EJ56O442BJEWEWW7KJ65","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T15:32:27Z","cross_cats_sorted":[],"title_canon_sha256":"c1a6f4a6ee12a571ddf5dbd8970d816680acc08ad7b91f1523412845b1921d6d","abstract_canon_sha256":"779a74d8d0dac6c46fe941db8222b5719d807874828ee9c960ba0c92e9a1cf22"},"schema_version":"1.0"},"canonical_sha256":"17eea2fc89ef9dce682925896b7d49f74e2506bc1a0fff5f01f3616395070091","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:36.510635Z","signature_b64":"G9rwFZlPrz8pYI1OR6E0jIoPN4De6tyM3Vfjm8EhHF7sIgpr+CPJbh8nzoqUVQA5ycA8EVWsKYTKYv1xPBoTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17eea2fc89ef9dce682925896b7d49f74e2506bc1a0fff5f01f3616395070091","last_reissued_at":"2026-05-18T00:57:36.509943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:36.509943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06529","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-18T00:57:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3b4kLhXOl5+2nU/7ZrmT4FeXpVv7aGjvjhGO17hzgq3lgJ8eBrVg5kBVNdZ+rn2pVPK5AIX7iuSpxk/l5j4xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:51:13.557781Z"},"content_sha256":"03339d91f67a1373d4506564de10c59f31949fcd704a8e6d34b2932fc9799801","schema_version":"1.0","event_id":"sha256:03339d91f67a1373d4506564de10c59f31949fcd704a8e6d34b2932fc9799801"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C7XKF7EJ56O442BJEWEWW7KJ65","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on distance labeling in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2016-11-20T15:32:27Z","abstract_excerpt":"A distance labeling scheme is an assignments of labels, that is binary strings, to all nodes of a graph, so that the distance between any two nodes can be computed from their labels and the labels are as short as possible. A major open problem is to determine the complexity of distance labeling in unweighted and undirected planar graphs. It is known that, in such a graph on $n$ nodes, some labels must consist of $\\Omega(n^{1/3})$ bits, but the best known labeling scheme uses labels of length $O(\\sqrt{n}\\log n)$ [Gavoille, Peleg, P\\'erennes, and Raz, J. Algorithms, 2004]. We show that, in fact,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06529","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-18T00:57:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yrqnHTlIfHYfQBcYn2RIjnPtcBHJGFf/2nKiNnnSvg8fOylx0IiK9AU4hUdSjf3CzqM1V+O+SkPnWQprTYnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:51:13.558502Z"},"content_sha256":"318bdbf9975f9bf4824532b9c6931d980bff3aec3fcb4d9290825cb1c321b8a6","schema_version":"1.0","event_id":"sha256:318bdbf9975f9bf4824532b9c6931d980bff3aec3fcb4d9290825cb1c321b8a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7XKF7EJ56O442BJEWEWW7KJ65/bundle.json","state_url":"https://pith.science/pith/C7XKF7EJ56O442BJEWEWW7KJ65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7XKF7EJ56O442BJEWEWW7KJ65/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-06-09T07:51:13Z","links":{"resolver":"https://pith.science/pith/C7XKF7EJ56O442BJEWEWW7KJ65","bundle":"https://pith.science/pith/C7XKF7EJ56O442BJEWEWW7KJ65/bundle.json","state":"https://pith.science/pith/C7XKF7EJ56O442BJEWEWW7KJ65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7XKF7EJ56O442BJEWEWW7KJ65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C7XKF7EJ56O442BJEWEWW7KJ65","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":"779a74d8d0dac6c46fe941db8222b5719d807874828ee9c960ba0c92e9a1cf22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T15:32:27Z","title_canon_sha256":"c1a6f4a6ee12a571ddf5dbd8970d816680acc08ad7b91f1523412845b1921d6d"},"schema_version":"1.0","source":{"id":"1611.06529","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06529","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06529v1","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06529","created_at":"2026-05-18T00:57:36Z"},{"alias_kind":"pith_short_12","alias_value":"C7XKF7EJ56O4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C7XKF7EJ56O442BJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C7XKF7EJ","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:318bdbf9975f9bf4824532b9c6931d980bff3aec3fcb4d9290825cb1c321b8a6","target":"graph","created_at":"2026-05-18T00:57:36Z","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 distance labeling scheme is an assignments of labels, that is binary strings, to all nodes of a graph, so that the distance between any two nodes can be computed from their labels and the labels are as short as possible. A major open problem is to determine the complexity of distance labeling in unweighted and undirected planar graphs. It is known that, in such a graph on $n$ nodes, some labels must consist of $\\Omega(n^{1/3})$ bits, but the best known labeling scheme uses labels of length $O(\\sqrt{n}\\log n)$ [Gavoille, Peleg, P\\'erennes, and Raz, J. Algorithms, 2004]. We show that, in fact,","authors_text":"Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T15:32:27Z","title":"A note on distance labeling in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06529","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:03339d91f67a1373d4506564de10c59f31949fcd704a8e6d34b2932fc9799801","target":"record","created_at":"2026-05-18T00:57:36Z","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":"779a74d8d0dac6c46fe941db8222b5719d807874828ee9c960ba0c92e9a1cf22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T15:32:27Z","title_canon_sha256":"c1a6f4a6ee12a571ddf5dbd8970d816680acc08ad7b91f1523412845b1921d6d"},"schema_version":"1.0","source":{"id":"1611.06529","kind":"arxiv","version":1}},"canonical_sha256":"17eea2fc89ef9dce682925896b7d49f74e2506bc1a0fff5f01f3616395070091","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17eea2fc89ef9dce682925896b7d49f74e2506bc1a0fff5f01f3616395070091","first_computed_at":"2026-05-18T00:57:36.509943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:36.509943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G9rwFZlPrz8pYI1OR6E0jIoPN4De6tyM3Vfjm8EhHF7sIgpr+CPJbh8nzoqUVQA5ycA8EVWsKYTKYv1xPBoTCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:36.510635Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06529","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03339d91f67a1373d4506564de10c59f31949fcd704a8e6d34b2932fc9799801","sha256:318bdbf9975f9bf4824532b9c6931d980bff3aec3fcb4d9290825cb1c321b8a6"],"state_sha256":"0bf1e05834ba390e46ea11804aca5f28c8943a26b570f3f7b4684c4e4b5572c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohkUw1nKJftb4uSqVDJ49u5d2zzqYIoMeF/a9V0d3AxWXpXWw59PVm1+cna2AmHScBDPePAWejDnhVAPXz3LAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:51:13.562566Z","bundle_sha256":"830798cfa3daf437457a9b7b853b3a1e30245caa1451c9b999b8c4be7ef92942"}}