{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AFZSAGVZWC5SMRPMQVEVKXSJIB","short_pith_number":"pith:AFZSAGVZ","canonical_record":{"source":{"id":"1702.02142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-07T15:33:36Z","cross_cats_sorted":[],"title_canon_sha256":"3a1e06d886fda75841cc1daf9720f5c3fc2b6a506b5bacb5c5f2d121ea34faae","abstract_canon_sha256":"fd1a88a386d256f5086569def84b870fb333f4447ff5ef58877f405bf2089ca4"},"schema_version":"1.0"},"canonical_sha256":"0173201ab9b0bb2645ec8549555e49406196398c45e0926e39f2cca1cb93c75a","source":{"kind":"arxiv","id":"1702.02142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02142","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02142v1","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02142","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"AFZSAGVZWC5S","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AFZSAGVZWC5SMRPM","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AFZSAGVZ","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AFZSAGVZWC5SMRPMQVEVKXSJIB","target":"record","payload":{"canonical_record":{"source":{"id":"1702.02142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-07T15:33:36Z","cross_cats_sorted":[],"title_canon_sha256":"3a1e06d886fda75841cc1daf9720f5c3fc2b6a506b5bacb5c5f2d121ea34faae","abstract_canon_sha256":"fd1a88a386d256f5086569def84b870fb333f4447ff5ef58877f405bf2089ca4"},"schema_version":"1.0"},"canonical_sha256":"0173201ab9b0bb2645ec8549555e49406196398c45e0926e39f2cca1cb93c75a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:06.654430Z","signature_b64":"Wyh4py78ynLscMWweqpR9tf70nuC1DJ2DEpRNBNwjM34OSfgpm1cxSr7C+UdQeXJ1dmB78HRUN0R387ycd2aBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0173201ab9b0bb2645ec8549555e49406196398c45e0926e39f2cca1cb93c75a","last_reissued_at":"2026-05-18T00:51:06.654034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:06.654034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.02142","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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FqVse+9KKQSNXbq4zK+8Yjml5AoZd9ezeyvmxFP4RcYWqC43MNOFD/TUEjDTpZhAhkJzav8ywvr+HJC1kaO0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:01:34.903531Z"},"content_sha256":"18fd691c3edbdd9e99f78fd9b4dcfdcdd89792a68b63aa996125d8da0037fd23","schema_version":"1.0","event_id":"sha256:18fd691c3edbdd9e99f78fd9b4dcfdcdd89792a68b63aa996125d8da0037fd23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AFZSAGVZWC5SMRPMQVEVKXSJIB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extrema Property of the $k$-Ranking of Directed Paths and Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Breeanne Baker Swart, Darren A. Narayan, George L. Rudolph, Rigoberto Fl\\'orez","submitted_at":"2017-02-07T15:33:36Z","abstract_excerpt":"A $k$-ranking of a directed graph $G$ is a labeling of the vertex set of $G$ with $k$ positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank number of $G$ is defined to be the smallest $k$ such that $G$ has a $k$-ranking. We find the largest possible directed graph that can be obtained from a directed path or a directed cycle by attaching new edges to the vertices such that the new graphs have the same rank number as the original graphs. The adjacency matrix of the resulting graph is embedded in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02142","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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZ80hITaZlh3ycHMkhSQKoHtf9wiAd+AWwVtMahUYm+NGCcC9YXmbdL5DPKoq3I7WSqZXk9g7SSGOM5xOkQfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:01:34.903885Z"},"content_sha256":"d71d0ee9c31776e677d661c6373e05609bbe763f55e729fb288f623e8571392e","schema_version":"1.0","event_id":"sha256:d71d0ee9c31776e677d661c6373e05609bbe763f55e729fb288f623e8571392e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFZSAGVZWC5SMRPMQVEVKXSJIB/bundle.json","state_url":"https://pith.science/pith/AFZSAGVZWC5SMRPMQVEVKXSJIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFZSAGVZWC5SMRPMQVEVKXSJIB/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-25T05:01:34Z","links":{"resolver":"https://pith.science/pith/AFZSAGVZWC5SMRPMQVEVKXSJIB","bundle":"https://pith.science/pith/AFZSAGVZWC5SMRPMQVEVKXSJIB/bundle.json","state":"https://pith.science/pith/AFZSAGVZWC5SMRPMQVEVKXSJIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFZSAGVZWC5SMRPMQVEVKXSJIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AFZSAGVZWC5SMRPMQVEVKXSJIB","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":"fd1a88a386d256f5086569def84b870fb333f4447ff5ef58877f405bf2089ca4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-07T15:33:36Z","title_canon_sha256":"3a1e06d886fda75841cc1daf9720f5c3fc2b6a506b5bacb5c5f2d121ea34faae"},"schema_version":"1.0","source":{"id":"1702.02142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02142","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02142v1","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02142","created_at":"2026-05-18T00:51:06Z"},{"alias_kind":"pith_short_12","alias_value":"AFZSAGVZWC5S","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AFZSAGVZWC5SMRPM","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AFZSAGVZ","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:d71d0ee9c31776e677d661c6373e05609bbe763f55e729fb288f623e8571392e","target":"graph","created_at":"2026-05-18T00:51:06Z","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 of a directed graph $G$ is a labeling of the vertex set of $G$ with $k$ positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank number of $G$ is defined to be the smallest $k$ such that $G$ has a $k$-ranking. We find the largest possible directed graph that can be obtained from a directed path or a directed cycle by attaching new edges to the vertices such that the new graphs have the same rank number as the original graphs. The adjacency matrix of the resulting graph is embedded in the","authors_text":"Breeanne Baker Swart, Darren A. Narayan, George L. Rudolph, Rigoberto Fl\\'orez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-07T15:33:36Z","title":"Extrema Property of the $k$-Ranking of Directed Paths and Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02142","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:18fd691c3edbdd9e99f78fd9b4dcfdcdd89792a68b63aa996125d8da0037fd23","target":"record","created_at":"2026-05-18T00:51:06Z","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":"fd1a88a386d256f5086569def84b870fb333f4447ff5ef58877f405bf2089ca4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-07T15:33:36Z","title_canon_sha256":"3a1e06d886fda75841cc1daf9720f5c3fc2b6a506b5bacb5c5f2d121ea34faae"},"schema_version":"1.0","source":{"id":"1702.02142","kind":"arxiv","version":1}},"canonical_sha256":"0173201ab9b0bb2645ec8549555e49406196398c45e0926e39f2cca1cb93c75a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0173201ab9b0bb2645ec8549555e49406196398c45e0926e39f2cca1cb93c75a","first_computed_at":"2026-05-18T00:51:06.654034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:06.654034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wyh4py78ynLscMWweqpR9tf70nuC1DJ2DEpRNBNwjM34OSfgpm1cxSr7C+UdQeXJ1dmB78HRUN0R387ycd2aBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:06.654430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18fd691c3edbdd9e99f78fd9b4dcfdcdd89792a68b63aa996125d8da0037fd23","sha256:d71d0ee9c31776e677d661c6373e05609bbe763f55e729fb288f623e8571392e"],"state_sha256":"2ff5ba92ab9a168f501a251e683174fa7e5c54e9196d9f0a343965b27296de45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5iXXoB2JGEyKVqwBjp3i9lujjFmIKImrnwlHG+GaytaLS4wPyBKJ/1MTlzM/4omZ4deVCX5sc3OKu81ibGYDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:01:34.905979Z","bundle_sha256":"8a69d6fb29622674ea4318c9298f6798d1a0c7d9f28c5b3022a8f5a58e87c4f8"}}