{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:25F6L6IEVSSFWP3RUNS7BKYJOZ","short_pith_number":"pith:25F6L6IE","canonical_record":{"source":{"id":"1609.06111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T11:32:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"31bd5074a0cf9167216a3912e27adfe764fb58a9a364e8b8f26334717b6e4b0a","abstract_canon_sha256":"e603e11ff119e08e9011394050117922a366c359c0479a8995c22f01663e792a"},"schema_version":"1.0"},"canonical_sha256":"d74be5f904aca45b3f71a365f0ab097660e8c1970b84a1ce89f7b4572c1ff4f3","source":{"kind":"arxiv","id":"1609.06111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06111","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06111v1","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06111","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"25F6L6IEVSSF","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"25F6L6IEVSSFWP3R","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"25F6L6IE","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:25F6L6IEVSSFWP3RUNS7BKYJOZ","target":"record","payload":{"canonical_record":{"source":{"id":"1609.06111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T11:32:14Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"31bd5074a0cf9167216a3912e27adfe764fb58a9a364e8b8f26334717b6e4b0a","abstract_canon_sha256":"e603e11ff119e08e9011394050117922a366c359c0479a8995c22f01663e792a"},"schema_version":"1.0"},"canonical_sha256":"d74be5f904aca45b3f71a365f0ab097660e8c1970b84a1ce89f7b4572c1ff4f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:16.637911Z","signature_b64":"fZGGaCD7vKC40iKhBO3S+DGdpI+lIC7hJmGqphoXJazUHHeHzNEYjD/Hpm8+DOuouMOyHEt25pDkKTPO2YahDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d74be5f904aca45b3f71a365f0ab097660e8c1970b84a1ce89f7b4572c1ff4f3","last_reissued_at":"2026-05-18T01:04:16.637478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:16.637478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.06111","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:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4zey8pFP3E/ieKZS3AyzYaO1Pkv4trZXewskeUtaz7RYZx3aj0E/vkgUFTMnMyZ/jlKk7Ha3enZ7GQYskTPOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:29:26.719413Z"},"content_sha256":"2b091b774eea6079a338d1b9077a11d5a31cc4606afebc45d6ef23dd4b4c2927","schema_version":"1.0","event_id":"sha256:2b091b774eea6079a338d1b9077a11d5a31cc4606afebc45d6ef23dd4b4c2927"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:25F6L6IEVSSFWP3RUNS7BKYJOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Vertex Rankings of Graphs and its Relatives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky","submitted_at":"2016-09-20T11:32:14Z","abstract_excerpt":"A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must contain a vertex of a higher rank. In this paper we study a relaxation of this notion, in which the requirement above should only hold for paths of some bounded length $l$ for some fixed $l$. For instance, already the case $l=2$ exhibit quite a different behavior than proper coloring. We prove upper and lower bounds on the minimum number of ranks required for several graph families, such as trees, planar graphs, graphs ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06111","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:04:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jXyo74ZA3CM6CDOTB3K3pwtchjo/blvWW9X5J5VbZ7alf0SvfOPCVWA5tXp+MXkVAN7zSLHIDpss8tKFUOyYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:29:26.719764Z"},"content_sha256":"3fba16cfd9ee116a988e0810bd7b19437f26f6a388001e8a033794428da3f115","schema_version":"1.0","event_id":"sha256:3fba16cfd9ee116a988e0810bd7b19437f26f6a388001e8a033794428da3f115"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25F6L6IEVSSFWP3RUNS7BKYJOZ/bundle.json","state_url":"https://pith.science/pith/25F6L6IEVSSFWP3RUNS7BKYJOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25F6L6IEVSSFWP3RUNS7BKYJOZ/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-25T08:29:26Z","links":{"resolver":"https://pith.science/pith/25F6L6IEVSSFWP3RUNS7BKYJOZ","bundle":"https://pith.science/pith/25F6L6IEVSSFWP3RUNS7BKYJOZ/bundle.json","state":"https://pith.science/pith/25F6L6IEVSSFWP3RUNS7BKYJOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25F6L6IEVSSFWP3RUNS7BKYJOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:25F6L6IEVSSFWP3RUNS7BKYJOZ","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":"e603e11ff119e08e9011394050117922a366c359c0479a8995c22f01663e792a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T11:32:14Z","title_canon_sha256":"31bd5074a0cf9167216a3912e27adfe764fb58a9a364e8b8f26334717b6e4b0a"},"schema_version":"1.0","source":{"id":"1609.06111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06111","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06111v1","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06111","created_at":"2026-05-18T01:04:16Z"},{"alias_kind":"pith_short_12","alias_value":"25F6L6IEVSSF","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"25F6L6IEVSSFWP3R","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"25F6L6IE","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:3fba16cfd9ee116a988e0810bd7b19437f26f6a388001e8a033794428da3f115","target":"graph","created_at":"2026-05-18T01:04:16Z","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 vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must contain a vertex of a higher rank. In this paper we study a relaxation of this notion, in which the requirement above should only hold for paths of some bounded length $l$ for some fixed $l$. For instance, already the case $l=2$ exhibit quite a different behavior than proper coloring. We prove upper and lower bounds on the minimum number of ranks required for several graph families, such as trees, planar graphs, graphs ex","authors_text":"Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T11:32:14Z","title":"On Vertex Rankings of Graphs and its Relatives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06111","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:2b091b774eea6079a338d1b9077a11d5a31cc4606afebc45d6ef23dd4b4c2927","target":"record","created_at":"2026-05-18T01:04:16Z","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":"e603e11ff119e08e9011394050117922a366c359c0479a8995c22f01663e792a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-20T11:32:14Z","title_canon_sha256":"31bd5074a0cf9167216a3912e27adfe764fb58a9a364e8b8f26334717b6e4b0a"},"schema_version":"1.0","source":{"id":"1609.06111","kind":"arxiv","version":1}},"canonical_sha256":"d74be5f904aca45b3f71a365f0ab097660e8c1970b84a1ce89f7b4572c1ff4f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d74be5f904aca45b3f71a365f0ab097660e8c1970b84a1ce89f7b4572c1ff4f3","first_computed_at":"2026-05-18T01:04:16.637478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:16.637478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fZGGaCD7vKC40iKhBO3S+DGdpI+lIC7hJmGqphoXJazUHHeHzNEYjD/Hpm8+DOuouMOyHEt25pDkKTPO2YahDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:16.637911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b091b774eea6079a338d1b9077a11d5a31cc4606afebc45d6ef23dd4b4c2927","sha256:3fba16cfd9ee116a988e0810bd7b19437f26f6a388001e8a033794428da3f115"],"state_sha256":"96c9c1dc15900cc96a8c5fe0b078e966772d282250b4f01f5fd3c82f09e9b709"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mRVHdjYRFiGMOW/6VERtnZ+KiVICV3Tf4K26RraIxECnNyMjxbxq9+aU8I262otke9Wv/DtKaBdK6LrJPJNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:29:26.721732Z","bundle_sha256":"bf61eabd34854b42699d740de4369454fb4e1c13dab220611ea2835737d381b2"}}