{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:I3CHMK7IE4QPR4VGNM5MV54BLV","short_pith_number":"pith:I3CHMK7I","canonical_record":{"source":{"id":"2007.06455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-13T15:40:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"077466d5e30560c7776038ac917b271c6db161ed4cf5a126c09f6163bfa4e59d","abstract_canon_sha256":"895088c67f3e872f854683f0374dd3ba4545843790b1631ad5b4be3237a8f079"},"schema_version":"1.0"},"canonical_sha256":"46c4762be82720f8f2a66b3acaf7815d480b06c5d7a3c2af71f0dd4c91355947","source":{"kind":"arxiv","id":"2007.06455","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.06455","created_at":"2026-07-05T04:49:28Z"},{"alias_kind":"arxiv_version","alias_value":"2007.06455v3","created_at":"2026-07-05T04:49:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.06455","created_at":"2026-07-05T04:49:28Z"},{"alias_kind":"pith_short_12","alias_value":"I3CHMK7IE4QP","created_at":"2026-07-05T04:49:28Z"},{"alias_kind":"pith_short_16","alias_value":"I3CHMK7IE4QPR4VG","created_at":"2026-07-05T04:49:28Z"},{"alias_kind":"pith_short_8","alias_value":"I3CHMK7I","created_at":"2026-07-05T04:49:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:I3CHMK7IE4QPR4VGNM5MV54BLV","target":"record","payload":{"canonical_record":{"source":{"id":"2007.06455","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-13T15:40:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"077466d5e30560c7776038ac917b271c6db161ed4cf5a126c09f6163bfa4e59d","abstract_canon_sha256":"895088c67f3e872f854683f0374dd3ba4545843790b1631ad5b4be3237a8f079"},"schema_version":"1.0"},"canonical_sha256":"46c4762be82720f8f2a66b3acaf7815d480b06c5d7a3c2af71f0dd4c91355947","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:49:28.329745Z","signature_b64":"bwcPFEBkgFTtQ38bsquN4ElxphPwS17dRyxO2TWZ0s534oBt/GVzpze5Si18WrXO+/jq+3lXLT9vBhFRTDFYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46c4762be82720f8f2a66b3acaf7815d480b06c5d7a3c2af71f0dd4c91355947","last_reissued_at":"2026-07-05T04:49:28.329183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:49:28.329183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.06455","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-07-05T04:49:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Co3kzMrL3+h3DHZacBhbPIDuv/qSRozNLDkXmo185RbLUIKhTVKpaECaK1PIhjG+vCzWSm/c8WjxEwruxVOJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:43:14.315795Z"},"content_sha256":"6c750eaa90ce7edda771317dc0f6ecef0de858dea3c3631b5c6434931eec0ea2","schema_version":"1.0","event_id":"sha256:6c750eaa90ce7edda771317dc0f6ecef0de858dea3c3631b5c6434931eec0ea2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:I3CHMK7IE4QPR4VGNM5MV54BLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Vertex Ranking of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Mehrnoosh Javarsineh, Pat Morin, Prosenjit Bose, Vida Dujmovi\\'c","submitted_at":"2020-07-13T15:40:57Z","abstract_excerpt":"A (vertex) $\\ell$-ranking is a colouring $\\varphi:V(G)\\to\\mathbb{N}$ of the vertices of a graph $G$ with integer colours so that for any path $u_0,\\ldots,u_p$ of length at most $\\ell$, $\\varphi(u_0)\\neq\\varphi(u_p)$ or $\\varphi(u_0)<\\max\\{\\varphi(u_0),\\ldots,\\varphi(u_p)\\}$. We show that, for any fixed integer $\\ell\\ge 2$, every $n$-vertex planar graph has an $\\ell$-ranking using $O(\\log n/\\log\\log\\log n)$ colours and this is tight even when $\\ell=2$; for infinitely many values of $n$, there are $n$-vertex planar graphs, for which any 2-ranking requires $\\Omega(\\log n/\\log\\log\\log n)$ colours."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.06455","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.06455/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:49:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwAjIPNFMNNzh1BOSxYGdbIpyYhRYvaIh0K+xHIbvbpkK48FXmQ8W/1CyNMe9eubZMGzeaTOK2XPWy28jrFoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T11:43:14.316690Z"},"content_sha256":"0afffc8c12a888f3aecdf75e8b190722ef30c19a98ffcb258c34ca746e7132b8","schema_version":"1.0","event_id":"sha256:0afffc8c12a888f3aecdf75e8b190722ef30c19a98ffcb258c34ca746e7132b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3CHMK7IE4QPR4VGNM5MV54BLV/bundle.json","state_url":"https://pith.science/pith/I3CHMK7IE4QPR4VGNM5MV54BLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3CHMK7IE4QPR4VGNM5MV54BLV/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-08-13T11:43:14Z","links":{"resolver":"https://pith.science/pith/I3CHMK7IE4QPR4VGNM5MV54BLV","bundle":"https://pith.science/pith/I3CHMK7IE4QPR4VGNM5MV54BLV/bundle.json","state":"https://pith.science/pith/I3CHMK7IE4QPR4VGNM5MV54BLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3CHMK7IE4QPR4VGNM5MV54BLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:I3CHMK7IE4QPR4VGNM5MV54BLV","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":"895088c67f3e872f854683f0374dd3ba4545843790b1631ad5b4be3237a8f079","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-13T15:40:57Z","title_canon_sha256":"077466d5e30560c7776038ac917b271c6db161ed4cf5a126c09f6163bfa4e59d"},"schema_version":"1.0","source":{"id":"2007.06455","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.06455","created_at":"2026-07-05T04:49:28Z"},{"alias_kind":"arxiv_version","alias_value":"2007.06455v3","created_at":"2026-07-05T04:49:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.06455","created_at":"2026-07-05T04:49:28Z"},{"alias_kind":"pith_short_12","alias_value":"I3CHMK7IE4QP","created_at":"2026-07-05T04:49:28Z"},{"alias_kind":"pith_short_16","alias_value":"I3CHMK7IE4QPR4VG","created_at":"2026-07-05T04:49:28Z"},{"alias_kind":"pith_short_8","alias_value":"I3CHMK7I","created_at":"2026-07-05T04:49:28Z"}],"graph_snapshots":[{"event_id":"sha256:0afffc8c12a888f3aecdf75e8b190722ef30c19a98ffcb258c34ca746e7132b8","target":"graph","created_at":"2026-07-05T04:49:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.06455/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A (vertex) $\\ell$-ranking is a colouring $\\varphi:V(G)\\to\\mathbb{N}$ of the vertices of a graph $G$ with integer colours so that for any path $u_0,\\ldots,u_p$ of length at most $\\ell$, $\\varphi(u_0)\\neq\\varphi(u_p)$ or $\\varphi(u_0)<\\max\\{\\varphi(u_0),\\ldots,\\varphi(u_p)\\}$. We show that, for any fixed integer $\\ell\\ge 2$, every $n$-vertex planar graph has an $\\ell$-ranking using $O(\\log n/\\log\\log\\log n)$ colours and this is tight even when $\\ell=2$; for infinitely many values of $n$, there are $n$-vertex planar graphs, for which any 2-ranking requires $\\Omega(\\log n/\\log\\log\\log n)$ colours.","authors_text":"Mehrnoosh Javarsineh, Pat Morin, Prosenjit Bose, Vida Dujmovi\\'c","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-13T15:40:57Z","title":"Asymptotically Optimal Vertex Ranking of Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.06455","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:6c750eaa90ce7edda771317dc0f6ecef0de858dea3c3631b5c6434931eec0ea2","target":"record","created_at":"2026-07-05T04:49:28Z","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":"895088c67f3e872f854683f0374dd3ba4545843790b1631ad5b4be3237a8f079","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-13T15:40:57Z","title_canon_sha256":"077466d5e30560c7776038ac917b271c6db161ed4cf5a126c09f6163bfa4e59d"},"schema_version":"1.0","source":{"id":"2007.06455","kind":"arxiv","version":3}},"canonical_sha256":"46c4762be82720f8f2a66b3acaf7815d480b06c5d7a3c2af71f0dd4c91355947","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46c4762be82720f8f2a66b3acaf7815d480b06c5d7a3c2af71f0dd4c91355947","first_computed_at":"2026-07-05T04:49:28.329183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:49:28.329183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bwcPFEBkgFTtQ38bsquN4ElxphPwS17dRyxO2TWZ0s534oBt/GVzpze5Si18WrXO+/jq+3lXLT9vBhFRTDFYDw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:49:28.329745Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.06455","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c750eaa90ce7edda771317dc0f6ecef0de858dea3c3631b5c6434931eec0ea2","sha256:0afffc8c12a888f3aecdf75e8b190722ef30c19a98ffcb258c34ca746e7132b8"],"state_sha256":"1fd0b49d8d7c5ab274fecdc480a6d7eec18c0575e59e2f42cf01fb6ffd690e35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOt+81yY1Ekt4eGd6gWpcT1uw6W49bvrspreIiwtwH7WISN4dyWo723NCaGbtkpgyv1G3EVM4xF7PuBTDD8+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T11:43:14.335702Z","bundle_sha256":"69f00aa942e3aaf97f1acea9a6d2098df4f8f04b210c5d6b3393b86076344158"}}