{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KE3OXSRLHP2FUKFVLZEITGS7TK","short_pith_number":"pith:KE3OXSRL","schema_version":"1.0","canonical_sha256":"5136ebca2b3bf45a28b55e48899a5f9ab0dc23461e73f11a7edda7726ab6d135","source":{"kind":"arxiv","id":"1702.02060","version":1},"attestation_state":"computed","paper":{"title":"Maximizing the number of edges in optimal $k$-rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Darren A. Narayan, Rigoberto Florez","submitted_at":"2017-02-07T15:30:52Z","abstract_excerpt":"A $k$-ranking is a vertex $k$-coloring such that if two vertices have the same color any path connecting them contains a vertex of larger color. The rank number of a graph is smallest $k$ such that $G$ has a $k$-ranking. For certain graphs $G$ we consider the maximum number of edges that may be added to $G$ without changing the rank number. Here we investigate the problem for $G=P_{2^{k-1}}$, $C_{2^{k}}$, $K_{m_{1},m_{2},\\dots,m_{t}}$, and the union of two copies of $K_{n}$ joined by a single edge. In addition to determining the maximum number of edges that may be added to $G$ without changing"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.02060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-07T15:30:52Z","cross_cats_sorted":[],"title_canon_sha256":"9f11e96b29540a06d4f1fc913f87cdfc8e2ac3ccf5243f0eaad919ddf29da4a7","abstract_canon_sha256":"83b8d3f6920856eceed1265e487650d72f5ca486ffdc93d780cb31c107ae2681"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:10.445809Z","signature_b64":"q35W+Vb7Tr4XOVLDoKOO3OY44Dp10XvB6us7tF9vjt6saZ9OoanavoufrKmaYWgi3Pvt5EWaCaGmatn9LgmsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5136ebca2b3bf45a28b55e48899a5f9ab0dc23461e73f11a7edda7726ab6d135","last_reissued_at":"2026-05-18T00:51:10.445142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:10.445142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing the number of edges in optimal $k$-rankings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Darren A. Narayan, Rigoberto Florez","submitted_at":"2017-02-07T15:30:52Z","abstract_excerpt":"A $k$-ranking is a vertex $k$-coloring such that if two vertices have the same color any path connecting them contains a vertex of larger color. The rank number of a graph is smallest $k$ such that $G$ has a $k$-ranking. For certain graphs $G$ we consider the maximum number of edges that may be added to $G$ without changing the rank number. Here we investigate the problem for $G=P_{2^{k-1}}$, $C_{2^{k}}$, $K_{m_{1},m_{2},\\dots,m_{t}}$, and the union of two copies of $K_{n}$ joined by a single edge. In addition to determining the maximum number of edges that may be added to $G$ without changing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02060","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.02060","created_at":"2026-05-18T00:51:10.445251+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02060v1","created_at":"2026-05-18T00:51:10.445251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02060","created_at":"2026-05-18T00:51:10.445251+00:00"},{"alias_kind":"pith_short_12","alias_value":"KE3OXSRLHP2F","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KE3OXSRLHP2FUKFV","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KE3OXSRL","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK","json":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK.json","graph_json":"https://pith.science/api/pith-number/KE3OXSRLHP2FUKFVLZEITGS7TK/graph.json","events_json":"https://pith.science/api/pith-number/KE3OXSRLHP2FUKFVLZEITGS7TK/events.json","paper":"https://pith.science/paper/KE3OXSRL"},"agent_actions":{"view_html":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK","download_json":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK.json","view_paper":"https://pith.science/paper/KE3OXSRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02060&json=true","fetch_graph":"https://pith.science/api/pith-number/KE3OXSRLHP2FUKFVLZEITGS7TK/graph.json","fetch_events":"https://pith.science/api/pith-number/KE3OXSRLHP2FUKFVLZEITGS7TK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/action/storage_attestation","attest_author":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/action/author_attestation","sign_citation":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/action/citation_signature","submit_replication":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/action/replication_record"}},"created_at":"2026-05-18T00:51:10.445251+00:00","updated_at":"2026-05-18T00:51:10.445251+00:00"}