{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CD5S5QLZNFCA22VP5HKKHCHFQY","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":"f59c0a71ab5a10ff90efc05eb226e869a9903340625adff2079090e3415596f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T03:15:28Z","title_canon_sha256":"b888d14132b93a620ea7f4a0e40367d35ea4e98ae50e98244374955afaf9bd46"},"schema_version":"1.0","source":{"id":"1607.07132","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07132","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07132v1","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07132","created_at":"2026-05-18T01:10:34Z"},{"alias_kind":"pith_short_12","alias_value":"CD5S5QLZNFCA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CD5S5QLZNFCA22VP","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CD5S5QLZ","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:98b213518973841472f498a501c91d7dfdbfe1a3fccf2d94a14be4657bfb2f77","target":"graph","created_at":"2026-05-18T01:10:34Z","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":"In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths are well-ranked. A $k$-ranking is a relaxation in which all nontrivial paths of length at most $k$ are well-ranked. The $k$-ranking number of a graph $G$ is the minimum $t$ such that there is a $k$-ranking of $G$ using ranks in $\\{1,\\ldots,t\\}$.\n  We prove that the $2$-ranking number of the $n$-dimensional hypercube $Q_n$ is $n+1$. As a corollary, we improv","authors_text":"Andrew Kallmeyer, Jordan Almeter, Kevin G. Milans, Robert Winslow, Samet Demircan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T03:15:28Z","title":"The 2-Ranking Numbers of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07132","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:c635aad43f943cd84a9dba7cd9ee467e401149e08bde55d338fd02870e21c2ae","target":"record","created_at":"2026-05-18T01:10:34Z","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":"f59c0a71ab5a10ff90efc05eb226e869a9903340625adff2079090e3415596f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-25T03:15:28Z","title_canon_sha256":"b888d14132b93a620ea7f4a0e40367d35ea4e98ae50e98244374955afaf9bd46"},"schema_version":"1.0","source":{"id":"1607.07132","kind":"arxiv","version":1}},"canonical_sha256":"10fb2ec17969440d6aafe9d4a388e586300094e0dd259602554140e5dae6430f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10fb2ec17969440d6aafe9d4a388e586300094e0dd259602554140e5dae6430f","first_computed_at":"2026-05-18T01:10:34.669345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:34.669345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Hoz7XNWGogE4XameqEBGheigFPf6sxAeVmtlK5CawpC1YmZKIWG4WdVuzcNKjXMuqEaA6jyK5PQNj5llR5zXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:34.670066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07132","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c635aad43f943cd84a9dba7cd9ee467e401149e08bde55d338fd02870e21c2ae","sha256:98b213518973841472f498a501c91d7dfdbfe1a3fccf2d94a14be4657bfb2f77"],"state_sha256":"48fa831127d74fd8cd4b9ea27ed4a61612bb4124cf539eed33da2262051df143"}