{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KE3OXSRLHP2FUKFVLZEITGS7TK","short_pith_number":"pith:KE3OXSRL","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"},"canonical_sha256":"5136ebca2b3bf45a28b55e48899a5f9ab0dc23461e73f11a7edda7726ab6d135","source":{"kind":"arxiv","id":"1702.02060","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02060","created_at":"2026-05-18T00:51:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02060v1","created_at":"2026-05-18T00:51:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02060","created_at":"2026-05-18T00:51:10Z"},{"alias_kind":"pith_short_12","alias_value":"KE3OXSRLHP2F","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KE3OXSRLHP2FUKFV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KE3OXSRL","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KE3OXSRLHP2FUKFVLZEITGS7TK","target":"record","payload":{"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"},"canonical_sha256":"5136ebca2b3bf45a28b55e48899a5f9ab0dc23461e73f11a7edda7726ab6d135","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"},"source_kind":"arxiv","source_id":"1702.02060","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:51:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a+cdEGHNtDgZFb62xlAGyhRHY5hYii2NECtDaJ4GVxxsPx2+pqZ0Aj2GaT04YNAdMfLqOuuK84Q2GZMqDy1eDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:14:15.719866Z"},"content_sha256":"790c1738af9c9cd525044e01c0b2d86b38508729b42237bbe7cc52a3f44a4501","schema_version":"1.0","event_id":"sha256:790c1738af9c9cd525044e01c0b2d86b38508729b42237bbe7cc52a3f44a4501"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KE3OXSRLHP2FUKFVLZEITGS7TK","target":"graph","payload":{"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"},"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:51:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BpObDGZEnova7wayGce2FKPgUi8MqRayz4Lmx0IHpg+7uwGFPVjBehGmOQfKtHnLoHSeprvfZcjbNYyf6xliDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T17:14:15.720205Z"},"content_sha256":"edfe10141b00f98b5b5bbb95991def03eadf3b6762a78fdeb5781a8cae01f10c","schema_version":"1.0","event_id":"sha256:edfe10141b00f98b5b5bbb95991def03eadf3b6762a78fdeb5781a8cae01f10c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/bundle.json","state_url":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/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-27T17:14:15Z","links":{"resolver":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK","bundle":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/bundle.json","state":"https://pith.science/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KE3OXSRLHP2FUKFVLZEITGS7TK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KE3OXSRLHP2FUKFVLZEITGS7TK","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":"83b8d3f6920856eceed1265e487650d72f5ca486ffdc93d780cb31c107ae2681","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-07T15:30:52Z","title_canon_sha256":"9f11e96b29540a06d4f1fc913f87cdfc8e2ac3ccf5243f0eaad919ddf29da4a7"},"schema_version":"1.0","source":{"id":"1702.02060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02060","created_at":"2026-05-18T00:51:10Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02060v1","created_at":"2026-05-18T00:51:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02060","created_at":"2026-05-18T00:51:10Z"},{"alias_kind":"pith_short_12","alias_value":"KE3OXSRLHP2F","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KE3OXSRLHP2FUKFV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KE3OXSRL","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:edfe10141b00f98b5b5bbb95991def03eadf3b6762a78fdeb5781a8cae01f10c","target":"graph","created_at":"2026-05-18T00:51:10Z","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 $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","authors_text":"Darren A. Narayan, Rigoberto Florez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-07T15:30:52Z","title":"Maximizing the number of edges in optimal $k$-rankings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02060","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:790c1738af9c9cd525044e01c0b2d86b38508729b42237bbe7cc52a3f44a4501","target":"record","created_at":"2026-05-18T00:51:10Z","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":"83b8d3f6920856eceed1265e487650d72f5ca486ffdc93d780cb31c107ae2681","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-07T15:30:52Z","title_canon_sha256":"9f11e96b29540a06d4f1fc913f87cdfc8e2ac3ccf5243f0eaad919ddf29da4a7"},"schema_version":"1.0","source":{"id":"1702.02060","kind":"arxiv","version":1}},"canonical_sha256":"5136ebca2b3bf45a28b55e48899a5f9ab0dc23461e73f11a7edda7726ab6d135","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5136ebca2b3bf45a28b55e48899a5f9ab0dc23461e73f11a7edda7726ab6d135","first_computed_at":"2026-05-18T00:51:10.445142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:10.445142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q35W+Vb7Tr4XOVLDoKOO3OY44Dp10XvB6us7tF9vjt6saZ9OoanavoufrKmaYWgi3Pvt5EWaCaGmatn9LgmsDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:10.445809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:790c1738af9c9cd525044e01c0b2d86b38508729b42237bbe7cc52a3f44a4501","sha256:edfe10141b00f98b5b5bbb95991def03eadf3b6762a78fdeb5781a8cae01f10c"],"state_sha256":"78554fa03bf0e574ddc0a576fdd089fd3f9c54798bdc78c16eb584ad92a2c215"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyO2jL0vhIbpMV2FSt3LaiD4szFNLtTazS0/an5FoRwWMsFveUjnH4eQTsel7nnDU55peDZQeXj8uLIVLHwrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T17:14:15.722008Z","bundle_sha256":"15d0419d106b5aa6fb7f9379f7b5e04b4d92655baeae8c330462848fce6dc501"}}